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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

5,038 篇 会议
1,418 篇 期刊文献
130 册 图书
45 篇 学位论文

馆藏范围

6,631 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,943 篇 工学
- 3,363 篇 计算机科学与技术...
- 1,987 篇 软件工程
- 973 篇 电气工程
- 238 篇 信息与通信工程
- 179 篇 电子科学与技术（可...
- 138 篇 控制科学与工程
- 67 篇 机械工程
- 52 篇 生物医学工程（可授...
- 52 篇 生物工程
- 44 篇 仪器科学与技术
- 33 篇 材料科学与工程（可...
- 29 篇 力学（可授工学、理...
- 28 篇 动力工程及工程热...
- 27 篇 土木工程
- 21 篇 光学工程
- 20 篇 石油与天然气工程
684 篇 理学
- 401 篇 数学
- 117 篇 物理学
- 87 篇 生物学
- 78 篇 系统科学
- 33 篇 化学
- 28 篇 统计学（可授理学、...
- 26 篇 地球物理学
352 篇 管理学
- 260 篇 管理科学与工程(可...
- 98 篇 图书情报与档案管...
- 62 篇 工商管理
68 篇 教育学
- 62 篇 教育学
58 篇 医学
- 43 篇 临床医学
- 22 篇 基础医学(可授医学...
28 篇 法学
- 27 篇 社会学
15 篇 经济学
15 篇 农学
12 篇 文学
6 篇 艺术学
4 篇 军事学

主题

6,631 篇 parallel program...
1,094 篇 concurrent compu...
1,030 篇 parallel process...
585 篇 programming prof...
497 篇 application soft...
482 篇 computer archite...
466 篇 computer science
437 篇 hardware
338 篇 distributed comp...
335 篇 message passing
318 篇 computational mo...
317 篇 libraries
253 篇 computer languag...
241 篇 program processo...
237 篇 high performance...
229 篇 runtime
197 篇 yarn
191 篇 parallel archite...
189 篇 parallel algorit...
185 篇 costs

机构

15 篇 carnegie mellon ...
14 篇 barcelona superc...
13 篇 school of comput...
11 篇 stanford univ st...
11 篇 intel corporatio...
10 篇 univ pisa dept c...
10 篇 univ illinois de...
9 篇 school of applie...
9 篇 department of co...
9 篇 carnegie mellon ...
9 篇 mathematics and ...
9 篇 department of co...
9 篇 univ texas austi...
8 篇 department of co...
8 篇 ibm thomas j. wa...
8 篇 univ alberta dep...
8 篇 barcelona superc...
8 篇 department of co...
8 篇 irisa rennes
8 篇 tech univ berlin

作者

31 篇 griebler dalvan
25 篇 sarkar vivek
21 篇 danelutto marco
20 篇 fernandes luiz g...
18 篇 badia rosa m.
18 篇 loulergue freder...
16 篇 torquati massimo
15 篇 mencagli gabriel...
15 篇 olukotun kunle
14 篇 wolf felix
14 篇 ayguade eduard
13 篇 m. sato
12 篇 g. runger
12 篇 gonzalez-escriba...
12 篇 valero mateo
11 篇 hoefler torsten
11 篇 dinavahi venkata
11 篇 pingali keshav
11 篇 benini luca
11 篇 sato mitsuhisa

语言

6,411 篇 英文
167 篇 其他
22 篇 中文
17 篇 俄文
6 篇 土耳其文
2 篇 德文
2 篇 朝鲜文
1 篇 西班牙文
1 篇 日文
1 篇 葡萄牙文

检索条件"主题词=Parallel Programming"

共 6631 条记录，以下是1181-1190 订阅

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

详细简洁

排序：

Evaluation of Dynamic Task Scheduling Algorithms in a Runtime System for Heterogeneous Architectures 31

Evaluation of Dynamic Task Scheduling Algorithms in a Runtim...

引用

31st GI/ITG International Conference on Architecture of Computing Systems, ARCS 2018

作者： Becker, Thomas Busse, Pablo Schuele, Tobias Karlsruhe Institute of Technology Karlsruhe76131 Germany Siemens AG Corporate Technology Munich81739 Germany

ISBN: (纸本)9783800745593

Heterogeneous parallel architectures present many challenges to application developers. One of the most important ones is the decision where to execute a specific task. As today's systems are often dynamic in nature, this cannot be solved at design time. A solution is offered by runtime systems that employ dynamic scheduling algorithms. Still, the question which algorithm to use remains. In this paper, we describe the integration of dynamic task scheduling algorithms well-known in the literature into EMB2, a library for parallel programming of embedded heterogeneous systems. Moreover, we evaluate these algorithms on a real system using different benchmarks. The evaluation covers different modes: In immediate mode, tasks are scheduled in the order they arrive in the system, whereas in batch mode, all ready-to-execute tasks are considered during the scheduling decision. Our experimental results show that batch mode heuristics generally obtain better results. An exception is the Minimum Completion Time heuristic, which achieves similar results at less overhead and algorithm complexity. © ARCS 2018.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Contextual graphical environment for spatial visualisation of numerical experiments in continuum mechanics 8

Contextual graphical environment for spatial visualisation o...

引用

Selected Papers of the 8th International Conference "Distributed Computing and Grid-Technologies in Science and Education", GRID 2018

作者： Khramushin, V.N. Saint Petersburg State University Russia

The usage of open-source and easy-to-modify programme code for spatial visualisation of fast-evolving physical phenomena directly in the course of supercomputer calculations becomes relevant in design, research, construction and subsequent analysis of the validity of the simulated processes in resource-intensive numerical experiments, which is especially important in the study of non-stationary processes in continuum mechanics. Such visualisation has to have minimal impact on computational processes and allow for setting rheological parameters of simulated physical environment and criteria for dynamic and hybrid restructuring of computational processes. Almost any computational platform have embedded graphical means for visualisation of spatial geometrical objects using multi-core processors, which may provide solution to the formulated problem in full measure for parallel visualisation of the current results without substantial impact on the core computational processes. In the present research work we study one possible version of software suite which is based on graphical programming environment OpenGL, surrounded by tools for working with time and interval timers, input devices and text data views at the lowest possible level of direct input/output and interrupt processing in Windows OS. © 2018 Vasily N. Khramushin.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

parallelization of software packages. Problems and prospects 20

Parallelization of software packages. Problems and prospects

引用

20th Conference Scientific Services and Internet, SSI 2018

作者： Bakhtin, V.A. Zhukova, O.F. Kataev, N.A. Kolganov, A.S. Krukov, V.A. Kuznetsov, M.U. Podderyugina, N.V. Pritula, M.N. Savitskaya, O.A. Smirnov, A.A. Keldysh Institute of Applied Mathematics Moscow State University Russia Faculty of Computational Mathematics and Cybernetics of Lomonosov Moscow State University Russia

parallelization of large-scale computational applications leads to the following challenges a programmer will face: the growing amount of modularity, dynamic application functionality and multi-lingual source code. In general program transformation is essential for program parallelization. However, manual program transformation is not straightforward in the case of a large amount of code. The growing size of code drastically complicates the main stages of the parallel programming: distribution of data on the processors and mapping of computations on the processors. Therefore, the incremental or step-by-step parallelization mode was introduced in SAPFOR system [1,2] to map sequential large-scale applications to parallel architectures with distributed memory. In addition, special attention was directed to the automatic finding the required transformations of the sequential program. SAPFOR also relies on the automatic execution of the found transformations. However, the three main challenges mentioned above also require their solution. This paper discusses possible ways to overcome these problems. © 2018 CEUR-WS. All rights reserved.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Active objects for coordinating BSP computations (short paper) 1

引用

20th IFIP WG 6.1 International Conference on Coordination Models and Languages, COORDINATION 2018 Held as Part of the 13th International Federated Conference on Distributed Computing Techniques, DisCoTec 2018

作者： Hains, Gaétan Henrio, Ludovic Leca, Pierre Suijlen, Wijnand Huawei Technologies Paris Research Center Paris France Université Côte d’Azur CNRS I3S Sophia-Antipolis France

ISBN: (数字)9783319924083

ISBN: (纸本)9783319924076

Among the programming models for parallel and distributed computing, one can identify two important families. The programming models adapted to data-parallelism, where a set of coordinated processes perform a computation by splitting the input data;and coordination languages able to express complex coordination patterns and rich interactions between processing entities. This article takes two successful programming models belonging to the two categories and puts them together into an effective programming model. More precisely, we investigate the use of active objects to coordinate BSP processes. We choose two paradigms that both enforce the absence of data-races, one of the major sources of error in parallel programming. This article explains why we believe such a model is interesting and provides a formal semantics integrating the notions of the two programming paradigms in a coherent and effective manner. © IFIP International Federation for Information Processing 2018.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Dataflow management, dynamic load balancing, and concurrent processing for real-time embedded vision applications using Quasar

Dataflow management, dynamic load balancing, and concurrent ...

引用

作者： Goossens, Bart Sint-Pietersnieuwstraat 41 Gent9000 Belgium

programming modern embedded vision systems brings various challenges, due to the steep learning curve for programmers and the different characteristics of the devices. Quasar, a new high-level programming language and development environment, considerably simplifies the development. Quasar has a compiler that detects and optimizes parallel programming patterns and a heterogeneous runtime that distributes the computational load over the available compute devices (CPUs and Graphical Processing Unit [GPUs]). In this paper, we focus on runtime aspects of Quasar. We show that with good approximation, the execution time of a GPU kernel function can be factorized in a compile-time-specific component and a runtime-specific component. We show that this approximation leads to a computationally simple runtime load balancing rule. Moreover, the load balancing rule permits efficient implicit concurrency of kernel functions and automatic scaling to multiple compute devices (eg, multi-CPU/GPU systems). Based on an appropriate mathematical scheduling model, we investigate the command queue size trade-off between memory usage and device utilization. The result is a programming environment for embedded vision systems for which automatic parallelization and implicit concurrency detection allow scaling the program efficiently to multi-CPU/GPU systems. Finally, benchmark results are provided to demonstrate the performance of our approach compared with OpenACC and CUDA (Compute Unified Device Architecture). © 2018 John Wiley & Sons, Ltd.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Hybrid MPI+OpenMP Reactive Work Stealing in Distributed Memory in the PDE Framework sam(oa)-2

Hybrid MPI+OpenMP Reactive Work Stealing in Distributed Memo...

引用

2018 IEEE International Conference on Cluster Computing, CLUSTER 2018

作者： Samfass, Philipp Klinkenberg, Jannis Bader, Michael Department of Informatics Technical University of Munich Garching Germany IT Center RWTH Aachen University Aachen Germany

ISBN: (纸本)9781538683194

'Equal work results in equal execution time' is an assumption that has fundamentally driven design and implementation of parallel applications for decades. However, increasing hardware variability on current architectures (e.g., through Turbo Boost, dynamic voltage and frequency scaling or thermal effects) necessitate a revision of this assumption. Expecting an increase of these effects on future (exascale-)systems, in this paper, we present reactive work stealing across nodes on distributed memory machines using only MPI and OpenMP. We develop a novel distributed work stealing concept that - based on on-line performance monitoring - selectively steals and remotely executes tasks across MPI boundaries. This concept has been implemented in the parallel adaptive mesh refinement (AMR) framework sam(oa)-2 for OpenMP tasks of traversing a grid section. Corresponding performance measurements in the presence of enforced CPU clock frequency imbalances demonstrate that a state-of-the-art cost-based (chains-on-chains partitioning) load balancing mechanism is insufficient and can even degrade performance while distributed work stealing successfully mitigates the frequency-induced imbalances. Furthermore, our results indicate that our approach is also suitable for load balancing work-induced imbalances in a realistic AMR test case. © 2018 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Computational load balancing methods for algorithms parallel implementations on shared memory 20

Computational load balancing methods for algorithms parallel...

引用

20th Conference Scientific Services and Internet, SSI 2018

作者： Baranova, T.P. Bugerya, A.B. Gladkova, E.N. Efimkin, K.N. Solovev, M.A. Keldysh Institute of Applied Mathematics Russian Academy of Sciences Russia Ivannikov Institute for System Programming Russian Academy of Sciences Russia

The work is dedicated to the topic of various (both static and dynamic) methods of balancing the computational load with parallel implementation of algorithms on shared memory. Attention is also paid to the topic of parallelizing programs in especially difficult cases - when the used algorithm is purely sequential, there are no parallel alternatives to the algorithm used, and the execution time is unacceptably high. Various parallelization methods for software implementations of such algorithms and resulting computational load balancing are considered, allowing to obtain significant performance acceleration for application programs using purely sequential algorithms. The proposed methods of parallelizing implementations of such algorithms and balancing the resulting computational load on shared memory can help to develop efficient parallel program that fully utilize the hardware capabilities of modern computing systems with shared memory. © 2018 CEUR-WS. All rights reserved.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

SVE-Enabling Lattice QCD Codes

SVE-Enabling Lattice QCD Codes

引用

2018 IEEE International Conference on Cluster Computing, CLUSTER 2018

作者： Meyer, Nils Georg, Peter Pleiter, Dirk Solbrig, Stefan Wettig, Tilo University of Regensburg Regensburg93040 Germany Forschungszentrum Jülich Jülich52425 Germany

ISBN: (纸本)9781538683194

Optimization of applications for supercomputers of the highest performance class requires parallelization at multiple levels using different techniques. In this contribution we focus on parallelization of particle physics simulations through vector instructions. With the advent of the Scalable Vector Extension (SVE) ISA, future ARM-based processors are expected to provide a significant level of parallelism at this level. © 2018 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

2k: Scalable community detection in massive networks via small-diameter k-plexes 24

2k: Scalable community detection in massive networks via sma...

引用

24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2018

作者： Conte, Alessio Grossi, Roberto De Matteis, Tiziano Marino, Andrea De Sensi, Daniele Versari, Luca National Institute of Informatics Japan University of Pisa Italy

ISBN: (纸本)9781450355520

This paper studies k-plexes, a well known pseudo-clique model for network communities. In a k-plex, each node can miss at most k - 1 links. Our goal is to detect large communities in today's real-world graphs which can have hundreds of millions of edges. While many have tried, this task has been elusive so far due to its computationally challenging nature: k-plexes and other pseudo-cliques are harder to find and more numerous than cliques, a well known hard problem. We present d2k, which is the first algorithm able to find large k-plexes of very large graphs in just a few minutes. The good performance of our algorithm follows from a combination of graph-theoretical concepts, careful algorithm engineering and a high-performance implementation. In particular, we exploit the low degeneracy of real-world graphs, and the fact that large enough k-plexes have diameter 2. We validate a sequential and a parallel/distributed implementation of d2k on real graphs with up to half a billion edges. © 2018 Association for Computing Machinery.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

parallel simulation of the N-body problem using quad-tree HLPC 30

Parallel simulation of the N-body problem using quad-tree HL...

引用

30th European Modeling and Simulation Symposium, EMSS 2018

作者： Rossainz-López, M. Capel, Manuel I. Álvarez Martínez, E. Pineda Torres, I. Faculty of Computer Science Autonomous University of Puebla San Claudio Avenue and South 14th Street San Manuel Puebla Puebla72000 Mexico Software Engineering Department College of Informatics and Telecommunications ETSIIT University of Granada Daniel Saucedo Aranda s/n Granada18071 Spain

ISBN: (纸本)9788885741065

This work proposes the use of parallel Objects using the model of High Level parallel Compositions (HLPC) to implement a proposal for parallel simulation of the N-body Problem using the communication pattern between processes N-Tree under the HLPC Model. Particularly the implementation of the partitioning strategy divide and conquer as part of HLPC using the object orientation paradigm is shown. A HLPC comes from the composition of a set three object types: An object manager that represents the HLPC itself and makes an encapsulated abstraction out of it that hides the internal structure. The object manager controls a set of objects references, which address the object Collector and several Stage objects and represent the HLPC components whose parallel execution is coordinated by the object manager. With the strategy divide and conquer as HLPC the parallel processing technique N-Tree is used to parallelize sequential code that solve problems that can be partitioned by divide and conquer a N-ary Tree such the N-body problem that concerns with determining the effects of forces between "bodies". A case study of the N-body problem in terms of particles charged according to Coloumb's electrostatic law is shown, which is solved with the implementation of a new HLPC: the Quad-Tree HLPC. Finally the performance analysis of this implementation is shown comparing them with its corresponding sequential implementations to demonstrate their usefulness: programmability and performance. © Institute of Information Science. All rights reserved.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 115 116 117 118 119 120 121 122 123 124 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：