检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

486 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

511 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

209 篇 工学
- 195 篇 计算机科学与技术...
- 97 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
54 篇 理学
- 34 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

508 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=Seventh International Symposium on Parallel Architectures, Algorithms and Programming"

共 511 条记录，以下是311-320 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Efficient Algorithm for Home Care Scheduling with Budget Constraint

Efficient Algorithm for Home Care Scheduling with Budget Con...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Xinxuan Huang Jigang Wu Tonglai Liu Jinyao Huang School of Computer Science and Technology Guangdong University of Technology Guangzhou China College of Information Science and Technology Zhongkai University of Agriculture and Engineering Guangzhou China

ISBN: (纸本)9781665496407

Effective caregiver routing and scheduling methods can improve the service quality of home care and reduce operating costs. How to enable patients to obtain cost-effective home care services within a certain budget is a key issue. Few existing works take into account the patient's budget in home health care issues. Therefore, we propose a new home care problem to minimize the route cost, which includes the weighted sum of total economic benefits, the dissatisfaction of patients and the travel time of caregivers, so as to ensure that caregivers can have satisfactory income and patients can obtain cost-effective services. A genetic algorithm (ARGA) customized with one crossover operation and six mutation operations is designed to solve this problem. Experimental results show that the algorithm ARGA can effectively reduce the route cost by 59.3%, 14.3% and 10.7% respectively, compared with the baselines BA, GA and TS.

关键词： Costs Medical services programming Search problems Routing Scheduling parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A parallel PCG Solver for Large-Scale Groundwater Flow Simulation Based on OpenMP

A Parallel PCG Solver for Large-Scale Groundwater Flow Simul...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Dandan Li Xiaohui Ji Qun Wang School of Information Engineering China University of Geoscience Beijing China

Groundwater flow simulation has become one of the top international issues in new generation of environmental applications. When managing large-scale groundwater flow problems, the intensive computational ability and large amounts of memory space required for modeling are the main bottlenecks for researchers. In order to solve three-dimensional large-scale groundwater flow problems more rapidly, the Open MP was adopted to parallelize the preconditioned conjugate gradient (PCG) algorithm in this paper. And this paper carried out a numerical experiment of the three-dimensional groundwater flow model on a computer with four cores. Based on the numerical experiment, it is found that the execution time of the original serial PCG program is about 1.74 to 2.86 times of the parallel PCG program executed with different number of threads. The experimental results also demonstrate that the PCG solver based on Open MP is an effective way for solving large-scale three-dimensional groundwater flow problem.

关键词： Mathematical model Instruction sets Vectors Equations Computational modeling Computers Educational institutions

来源：评论

学校读者我要写书评

暂无评论

parallel Optimization of Queries in XML Dataset Using GPU

Parallel Optimization of Queries in XML Dataset Using GPU

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Xujie Si Airu Yin Xiaocheng Huang Xiaojie Yuan Xiaoguang Liu Gang Wang College of Software Nankai University Tianjin China College of I.T. Nankai University Tianjin China

As XML is playing a crucial role in web services, databases, and document processing, efficient processing of XML queries has become an important issue. On the other hand, due to the increasing number of users, high throughput of XML queries is also required to execute tens of thousands of queries in a short time. Given the great success of GPGPU (General-Purpose computations on the Graphics Processors), we propose a parallel XML query model based on GPU, which mainly consists of two efficient task distribution strategies, to improve the efficiency and throughput of XML queries. We have developed a parallel simplified XPath language using Compute Unified Device Architecture (CUDA) on GPU, and evaluate our model on a recent NVIDIA GPU in comparison with its counterpart on eight-core CPU. The experiment results show that our model achieves both higher throughput and efficiency than CPU-based XML query.

关键词： XML Graphics processing unit Throughput Load modeling Databases Context

来源：评论

学校读者我要写书评

暂无评论

Research on programming languages for massively parallel processing

Research on programming languages for massively parallel pro...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： M. Amamiya M. Satoh A. Makinouchi K. Hagiwara T. Yuasa H. Aida K. Ueda K. Araki T. Ida T. Baba Ministry of Education Science and Culture Kyushu University Japan Ministry of Education Science and Culture University of Tohoku Japan Ministry of Education Science and Culture Osaka University Japan Ministry of Education Science and Culture Toyohashi University of Technology Japan Ministry of Education Science and Culture University of Tokyo Japan Ministry of Education Science and Culture Waseda University Japan Ministry of Education Science and Culture Nara Institute of Science and Technology Japan Ministry of Education Science and Culture University of Tsukuba Japan Ministry of Education Science and Culture Utsunomiya University Japan

We are pursuing research on programming languages for massively parallel processing. The objective of the research is the following two points according to the top level research objective of our Massively parallel Processing Principle Research Project: firstly to develop a prototype of a massively parallel programming language and compiler system, which is competitive to commercial language systems like data parallel C, Fortran D or HPF; and secondly to explore a massively parallel computation model, and design an experimental language as an implementation of the newly explored massively parallel computation model.< >

关键词： Computer languages parallel processing Concurrent computing Computational modeling Object oriented modeling parallel programming parallel languages Information processing Educational programs Prototypes

来源：评论

学校读者我要写书评

暂无评论

Optimizations of a Linear Matrix Solver in a Composite Simulation for a Vector Computer

Optimizations of a Linear Matrix Solver in a Composite Simul...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Zhilin He Kazuhiko Komatsu Masayuki Sato Hiroaki Kobayashi Graduate School of Information Sciences Tohoku University Sendai Japan Cyberscience Center Tohoku University Sendai Japan

ISBN: (纸本)9781665496407

A fiber-reinforced composite simulation based on a spring-element model can capture the stress field of composites. Since the simulation can calculate the maximum stress to composites, it is essential to discover a more reliable composite structure, and the acceleration of the simulation is required. However, a linear matrix solver in the simulation needs a long execution time and a vast memory bandwidth to solve element displacements of the structure, especially for large-scale composites. To accelerate the simulation, this paper proposes a vectorization method of a linear matrix solver on a vector computer. By applying loop optimizations such as splitting, unrolling, distribution, and interchange, efficient vector computing is realized. From the performance evaluation, it is shown that the optimizations achieve more than 15.5× speedups on the vector computer. Furthermore, the optimized simulation on a vector computer achieves a 2.4× to 3.7× speedup compared with the original version on the Intel Xeon.

关键词： Performance evaluation Computational modeling Bandwidth programming parallel architectures Reliability Optimization

来源：评论

学校读者我要写书评

暂无评论

Restricted Duplication Based MILP Formulation for Scheduling Task Graphs on Unrelated parallel Machines

Restricted Duplication Based MILP Formulation for Scheduling...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Jagpreet Singh Bhargav Mangipudi Sandeep Betha Nitin Auluck Department of Computer Science & Engineering Indian Institute of Technology Ropar Rupnagar India

ISBN: (纸本)9781467345668

Duplication has proved to be a vital technique for scheduling task graphs on a network of unrelated parallel machines. Few attempts have been made to model duplication in a Mixed Integer Linear Program (MILP) to reduce schedule length. Other known optimal MILPs duplicate a job on all the available processing elements and this increases their complexities. This paper proposes a new REStricted Duplication (RESDMILP) approach to model duplication in a MILP. The complexity of this model increases with the increase in the amount of duplication. Experiments conducted have revealed that RESDMILP achieves better runtimes when the problem instance is solved optimally and provides better lower bound and percentage gap if it is run for a fixed amount of time. The percentage gap is defined as (U B - LB)/U B where U B and LB are the upper and lower bounds achieved by the MILPs respectively.

关键词： Processor scheduling Schedules Computational modeling Computer architecture Approximation methods Scheduling parallel machines

来源：评论

学校读者我要写书评

暂无评论

Boosting Performance in parallel Computing Models with a New Experimental Architecture 11th

Boosting Performance in Parallel Computing Models with a New...

引用

11th international symposium on parallel architectures, algorithms and programming, PAAP 2020

作者： Albert, Alberto Arteta Harshakumar, Akshay de Mingo López, Luis Fernando Blas, Nuria Gómez TroyAL36082 United States Departamento de Sistemas Informáticos Escuela Técnica Superior de Ingeniería de Sistemas Informáticos Universidad Politécnica de Madrid Calle Alan Turing Madrid28031 Spain

ISBN: (纸本)9789811600098

The von Neumann architecture, often called the Traditional architecture, describes the design for an electronic digital computer as having five main components: processing unit, control unit, memory, external storage, input/output mechanisms. The processing unit interacts with the rest of the components through the system bus. That helps in carrying the data as well as the addresses. Over the years, that architecture has evolved with the advancement in technology. Today we find that we face many constraints regarding the deployment of some hardware and software features developed in recent years due to the inherent nature of the traditional architecture. This paper shows how to use this architecture to boost performance by introducing a variation in signal processing by placing a different memory type that reduces stall operations when processing different parallel threads. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Signal processing

来源：评论

学校读者我要写书评

暂无评论

parallel Computing

引用

丛书名： Advances in parallel Computing

2014年

作者： Bader, M Bode, A. IOS Press, Incorporated

ISBN: (数字)9781614993810

ISBN: (纸本)9781614993803

parallel computing has been the enabling technology of high-end machines for many years. Now, it has finally become the ubiquitous key to the efficient use of any kind of multi-processor computer architecture, from smart phones, tablets, embedded systems and cloud computing up to exascale computers. _x000D_ This book presents the proceedings of ParCo2013 – the latest edition of the biennial international Conference on parallel Computing – held from 10 to 13 September 2013, in Garching, Germany. The conference focused on several key parallel computing areas. Themes included parallel programming models for multi- and manycore CPUs, GPUs, FPGAs and heterogeneous platforms, the performance engineering processes that must be adapted to efficiently use these new and innovative platforms, novel numerical algorithms and approaches to large-scale simulations of problems in science and engineering._x000D_ The conference programme also included twelve mini-symposia (including an industry session and a special PhD symposium), which comprehensively represented and intensified the discussion of current hot topics in high performance and parallel computing. These special sessions covered large-scale supercomputing, novel challenges arising from parallel architectures (multi-/manycore, heterogeneous platforms, FPGAs), multi-level algorithms as well as multi-scale, multi-physics and multi-dimensional problems._x000D_ It is clear that parallel computing – including the processing of large data sets (“Big Data”) – will remain a persistent driver of research in all fields of innovative computing, which makes this book relevant to all those with an interest in this field.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A parallel Algorithm to Construct Node-Independent Spanning Trees on the Line Graph of Locally Twisted Cube

A Parallel Algorithm to Construct Node-Independent Spanning ...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Zhiyong Pan Baolei Cheng Jianxi Fan Huanwen Zhang School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9781665496407

An interconnection network can be abstracted into a graph, and the basic mathematical research in the graph can provide a good reference for the research in the practical application. The study of node-independent spanning trees (node-ISTs) in a graph has received extensive attention because of their application in reliable communication, fault-tolerant broadcasting and secure message distribution, and has achieved remarkable results on many special networks. But there are few results in the line graph of them. As one of the typical variations of hypercube, locally twisted cube has many excellent properties, whose line graph has all the advantages of locally twisted cube. So it makes sense to do some research on the line graph of locally twisted cube. In this paper, we propose a parallel algorithm to construct $2n-2$ node-ISTs rooted at node $[u,\ N(u, 2)]$ , where $u$ is an arbitrary node on locally twisted cube and $n\geq 1$ . And the correctness of our algorithm is proved.

关键词： Fault tolerance Fault tolerant systems programming NIST Broadcasting Hypercubes parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Accelerating a Lossy Compression Method with Fine-Grained parallelism on a GPU

Accelerating a Lossy Compression Method with Fine-Grained Pa...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Yifan Wu Jingcheng Shen Masao Okita Fumihiko Ino Graduate School of Information Science and Technology Osaka University Osaka Japan

ISBN: (纸本)9781665496407

With the rapid increase of data size processed by nowadays applications, high-performance compression methods become important to reduce both the memory consumption and the amount of data transfer. However, unlike the studies on CPU-based compression methods, those on GPU-based compression methods are insufficient. In this work, we target a lossy compression method that reported a high performance on a CPU-centric supercomputer. We propose schemes with fine-grained parallelism to accelerate the CPU-based method on the GPU, solving data dependency and write conflict issues in compression and decompression processes. Experimental results show that the proposed method achieved both higher performance, i.e., 42.0x and 1.9x speedups at best compared to the original method and a state-of-the-art GPU-based lossy compression method, respectively. Moreover, the proposed method achieved at best 1.2x and 1.8x as large as the compression ratio achieved by the original method and the state-of-the-art GPU-based lossy compression method, respectively.

关键词： Memory management Graphics processing units parallel processing programming Data transfer Supercomputers parallel architectures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共52页 << < 28 29 30 31 32 33 34 35 36 37 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：