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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是221-230 订阅

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

详细简洁

排序：

On the Feasibility of a Distributed Runtime for the Chemical programming Model

On the Feasibility of a Distributed Runtime for the Chemical...

引用

IEEE international symposium on parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Marko Obrovac Cédric Tedeschi IRISA INRIA Université de Rennes 1 France

Chemical computing was initially proposed as an intuitive paradigm to capture the essence of parallel computing. Within such a model, a program is a solution of information-carrying molecules, that, at run time, collide non-deterministically to produce new data. Such a paradigm allowed the programmers to focus on the logic of the problem to be solved in parallel, without having to worry about implementation's considerations. Throughout the years, the model has been enriched with various features related to program structure, control and practicability. More importantly, the model was raised to the higher order, increasing again its expressiveness. With the rise of service-oriented computing, such models have recently regained a lot of interest. They have been shown to provide adequate abstractions to enhance service-oriented architectures with autonomic properties such as self-adaptation, self-healing, or self-organisation. However, the deployment of chemical programs over large scale distributed platforms is still a widely open problem, hindering the model to be leveraged in practice. This paper studies the possibility of building a distributed execution environment for chemical programs. A generic peer-to-peer-based runtime model and distributed algorithms for large scale chemical computing are discussed. To complete this study, a software prototype was developed and experimented over the Grid'5000 test-bed. Experimental performance results are detailed, allowing for a discussion of the feasibility and performance of such a runtime, thus lifting a barrier towards the enactment of the chemical programming model.

关键词： Chemicals Computational modeling parallel processing Routing Runtime Prototypes Program processors

来源：评论

学校读者我要写书评

暂无评论

Dynamic Load Balancing for Unstructured Meshes on Space-Filling Curves

Dynamic Load Balancing for Unstructured Meshes on Space-Fill...

引用

IEEE international symposium on parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Daniel F. Harlacher Harald Klimach Sabine Roller Christian Siebert Felix Wolf Applied Supercomputing in Engineering German Research School for Simulation Sciences GmbH RWTH University Aachen Germany Parallel Programming RWTH University Aachen Germany

ISBN: (纸本)9781467309745

Load imbalance is an important impediment on the path towards higher degrees of parallelism - especially for engineering codes with their highly unstructured problem domains. In particular, when load conditions change dynamically, efficient mesh partitioning becomes an indispensable ingredient of scalable design. However, popular graph-based methods such as those used by ParMetis require global knowledge, which effectively limits the problem size on distributed-memory machines. On such architectures, space-filling curves (SFCs) offer a memory-efficient alternative and many sophisticated schemes have already been proposed. In this paper, we present a simple strategy based on SFCs that is custom-tailored to the needs of static meshes with dynamically changing computational load. Exploiting the properties of this class of problems, it is not only easy to implement but also reduces memory requirements substantially. Moreover, exclusively relying on MPI collective operations, our load-balancing scheme also offers portable performance across a broad range of HPC systems. Experimental evaluation shows excellent scaling behavior for up to 16,384 cores on a Nehalem-Infiniband system and up to 294,912 processes on a Blue Gene/P system.

关键词： Memory management Partitioning algorithms Load modeling Load management Scalability Computational modeling Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

An implementation of GPU-based parallel optimization for an extended uncertain data query algorithm

An implementation of GPU-based parallel optimization for an ...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Chen, Ningjiang Yu, Minmin Hu, Dandan College of Computer Electronic and Information Guangxi University Nanning China

ISBN: (纸本)9780769545752

To deal with users' diversified query requirements on uncertain data, an uncertain data query semantic for requirement extension named RU-Topk is introduced. In the high-load application environment, the top-k query algorithm's response time may be long. In order to satisfy performance requirements, with the consideration of the algorithm's features, the design and implementation of GPU-based RU-Topk algorithm as well as a batch scheduling strategy are presented. Finally, the experimental results on GPU platform show that they can obtain optimized performance. © 2011 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A parallel subspace iteration method for generalized eigenvalue problems based on multi-core platform

A parallel subspace iteration method for generalized eigenva...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Wang, Shunxu School of Science Huaihai Institute of Technology Lianyungang Jiangsu 222005 China

ISBN: (纸本)9780769545752

A parallel subspace iteration method for solving eigenvalue problem of based on multi-core platform is presented, which can solve several extreme eigenpair in parallel. Compared with Jacobi-Davidson method, the dimension number of the subspace in the method keeps unchanged, which makes it easier for the programming implementation. Numerical experiments are performed with a quad-core computer under the joint programming environment of Intel Fortran and OpenMp. The computation of the plane wing frequency and aircraft pylon for a real model airplane is taken as an example. As a result, the first 10 frequencies of a plane wing and an aircraft pylon are provided which shown the efficiency and applicability of our parallel computation algorithm. © 2011 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Thread-level parallel algorithm for sorting integer sequence on multi-core computers

Thread-level parallel algorithm for sorting integer sequence...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Cheng, Zhong Qi, Ke Liu, Jun Huang, Yi-Ran School of Computer and Electronics and Information Guangxi University Nanning Guangxi 530004 China School of Information and Statistics Guangxi University for Finance and Economics Nanning Guangxi 530004 China

ISBN: (纸本)9780769545752

According to the characteristics of multi-core architectures and binary storage property of integer sequence, this paper proposes an efficient thread-level parallel algorithm for sorting integer sequence on multi-core computers. The algorithm divides the input integer sequence to several data blocks in main memory and distributes these blocks into the shared L2 cache and private L1 cache respectively, implements dynamically load balance among the processing cores, and utilizes data-level parallel SIMD instructions and thread-binding technique to speed up the sorting procedure. Experiment results show that the algorithm can obtain high speedup and good scalability, and its execution efficiency will not be affected by the data distribution of input integer sequence. © 2011 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Data parallel programming model for many-core architectures

Data parallel programming model for many-core architectures

引用

25th IEEE international parallel and Distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Zhang, Yongpeng North Carolina State University United States

ISBN: (纸本)9780769543857

Emerging accelerating architectures, such as GPUs, have proved successful in providing significant performance gains to various application domains. This is done by exploiting data parallelism in existing algorithms. However, programming in a data-parallel fashion imposes extra burdens to programmers, who are used to writing sequential programs. New programming models and frameworks are needed to reach a balance between programmability, portability and performance. We start from stream processing domain and propose GStream, a general-purpose, scalable data streaming framework on GPUs. The contributions of GStream are as follows: (1) We provide powerful, yet concise language abstractions suitable to describe conventional algorithms as streaming problems. (2) We project these abstractions onto GPUs to fully exploit their inherent massive data-parallelism. (3) We demonstrate the viability of streaming on accelerators. Experiments show that the proposed framework provides flexibility, programmability and performance gains for various benchmarks from a collection of domains, including but not limited to data streaming, data parallel problems, numerical codes and text search. This work lays a foundation to our future work to develop more general data parallel programming models for many-core architectures. © 2011 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Research on disk array parallel test

Research on disk array parallel test

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： He, Qinlu Li, Zhanhuai Le, Xiaowang Hui, Fengwang Sun, Jian Department of Computer Science Northwestern Polytechnic University Xi'an China

ISBN: (纸本)9780769545752

Researches on technologies about testing IOPS and data transfer speed of disk arrays in mass storage systems. We propose a parallel testing technology towards the high performance disk array and realize the testing work on the newest developed disk array. By taking researches on many factors which effect disk performance seriously and quantifying them through experiments, so we realize evaluations on the whole disk array. Finally, we take researches on bottlenecks of the disk arrays and prove the results to be correct. © 2011 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

parallel efficiency and parametric optimization in CASTEP

Parallel efficiency and parametric optimization in CASTEP

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Chen, Jun Fu, Liangjie Yang, Huaming High Performance Computing Center Central South University Changsha 410083 China School of Resources Processing and Bioengineering Central South University Changsha 410083 China

ISBN: (纸本)9780769545752

parallel efficiency is always a fundamental research field in high performance computing. This paper focuses on parallel computing at high performance computing cluster with CASTEP program, discusses multi-core parallel efficiency in CASTEP, and analyses the influence of the main calculation parameters upon total CPU time and memory usage in case study, such as CPU cores(CPUs), cutoff energy, k-point, and supercell size. The paper also rationalizes and optimizes in detail the better use of limited computing resources under special circumstances. © 2011 IEEE.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

parallel algorithm of visualization of reservoir numerical simulation based on PEBI grids

Parallel algorithm of visualization of reservoir numerical s...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Dong, Lanfang Lu, Detang Li, Meng Vision Computing and Visualization Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei China Department of Modern Mechanics University of Science and Technology of China Hefei China

ISBN: (纸本)9780769545752

The speed of calculating, tracking and filling the isolines has a direct impact on the performance of user interaction. In this paper, we begin with the serial algorithm of visualization and implement its parallel algorithm. First, we divide the Delaunay grids generated from the PEBI grids into several regions. Calculation, tracking of isolines and calculation of saturation are implemented in each region respectively. Then the tracking results of each region are integrated for the entire work area. The parallel examples using OpenMP on computers with dual-core/quad-core are given at the end of this paper. The experimental results show that the parallel processing can greatly reduce the time required for data processing in visualization. © 2011 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Constructing limited Voronoi mesh in parallel based on multi-core environment and its implementation

Constructing limited Voronoi mesh in parallel based on multi...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Dong, Lanfang Wu, Yuan Li, Meng Vision Computing and Visualization Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9780769545752

Voronoi mesh as the basic primitive in the field of computational geometry has been widely applied on solving fluid-related problem by finite volume method. By analyzing various limited conditions for reasonable point distributions and modifying parallel data structure (doubly-connected list) for complex boundaries features in Voronoi mesh generation, considering the rapid development of multi-core processors and high performance computing, we present an efficient and feasible parallel algorithm of limited Voronoi mesh generation in standalone multi-core CPU environment. The algorithm solves the practical application of Voronoi mesh generation of large-scale points set;the experiment results show that this method improved the efficiency of the algorithm and could be widely used in various applications. © 2011 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：