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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

311 篇 会议
19 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

280 篇 工学
- 240 篇 软件工程
- 227 篇 计算机科学与技术...
- 13 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 5 篇 控制科学与工程
- 4 篇 机械工程
- 4 篇 生物工程
- 3 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 核科学与技术
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 网络空间安全
53 篇 理学
- 49 篇 数学
- 4 篇 生物学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 2 篇 化学
15 篇 管理学
- 11 篇 管理科学与工程(可...
- 8 篇 工商管理
- 4 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 农学
- 1 篇 作物学

主题

54 篇 performance
48 篇 parallel process...
33 篇 algorithms
32 篇 parallel program...
27 篇 languages
25 篇 design
20 篇 parallel algorit...
20 篇 gpu
9 篇 experimentation
9 篇 measurement
7 篇 graphics process...
7 篇 theory
7 篇 parallel
6 篇 mpi
6 篇 parallel computi...
6 篇 concurrency
5 篇 scalability
5 篇 parallelism
5 篇 graph algorithms
4 篇 gpgpu

机构

7 篇 carnegie mellon ...
5 篇 univ of tokyo
4 篇 indiana univ blo...
3 篇 univ chinese aca...
3 篇 massachusetts in...
3 篇 univ illinois ur...
3 篇 swiss fed inst t...
3 篇 mit csail united...
3 篇 shanghai jiao to...
3 篇 tsinghua univ pe...
3 篇 univ calif berke...
2 篇 ist austria klos...
2 篇 georgetown univ ...
2 篇 univ wisconsin d...
2 篇 shanghai key lab...
2 篇 univ of wisconsi...
2 篇 tsinghua univers...
2 篇 tsinghua univ de...
2 篇 shanghai jiao to...
2 篇 nvidia corporati...

作者

8 篇 blelloch guy e.
6 篇 hoefler torsten
6 篇 garland michael
6 篇 chen haibo
6 篇 shun julian
5 篇 sun yihan
5 篇 zhai jidong
4 篇 dhulipala laxman
4 篇 tsigas philippas
4 篇 tan guangming
4 篇 wang haojie
4 篇 mellor-crummey j...
4 篇 gu yan
4 篇 kennedy ken
3 篇 taura kenjiro
3 篇 li jiajia
3 篇 yonezawa akinori
3 篇 pingali keshav
3 篇 kim jungwon
3 篇 chen wenguang

语言

327 篇 英文
3 篇 其他

检索条件"任意字段=Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"

共 330 条记录，以下是291-300 订阅

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

详细简洁

排序：

Dynamic pointer alignment: tiling and communication optimizations for parallel pointer-based computations

Dynamic pointer alignment: tiling and communication optimiza...

引用

proceedings of the 1997 6th acm sigplan symposium on principles and practice of parallel programming

作者： Zhang, Xingbin Chien, Andrew A. Univ of Illinois at Urbana-Champaign

Loop tiling and communication optimizations, such as message pipelining and aggregation, can achieve optimized and robust memory performance by proactively managing storage and data movement. In this paper, we generalize these techniques to pointer-based data structures (PBDSs). Our approach, dynamic pointer alignment (DPA), has two components. the compiler decomposes a program into non-blocking threads that operate on specific pointers and labels thread creation sites with their corresponding pointers. At runtime, an explicit mapping from pointers to dependent threads is updated at thread creation and is used to dynamically schedule both threads and communication, such that threads using the same objects execute together, communication overlaps with local work, and messages are aggregated. We have implemented DPA to optimize remote reads to global PBDSs on parallel machines. Our empirical results on the force computation phases of two applications that use sophisticated PBDSs, Barnes-Hut and FMM, show that DPA achieves good absolute performance and speedups by enabling tiling and communication optimizations on the CRAY T3D.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Interaction of parallel programming constructs and coherence protocols

Interaction of parallel programming constructs and coherence...

引用

proceedings of the 1997 6th acm sigplan symposium on principles and practice of parallel programming

作者： Bianchini, Ricardo Carrera, Enrique V. Kontothanassis, Leonidas Federal Univ of Rio de Janeiro Rio de Janeiro Brazil

Some of the most common parallel programming idioms include locks, barriers, and reduction operations. the interaction of these programming idioms with the multiprocessor's coherence protocol has a significant impact on performance. In addition, the advent of machines that support multiple coherence protocols prompts the question of how to best implement such parallel constructs, i.e. what combination of implementation and coherence protocol yields the best performance. In this paper we study the running time and communication behavior of (1) centralized (ticket) and MCS spin locks, (2) centralized, dissemination, and tree-based barriers, and (3) parallel and sequential reductions, under pure and competitive update coherence protocols;results for write-invalidate protocol are presented mostly for comparison purposes. Our experiments indicate that parallel programming techniques that are well-established for write invalidate protocols, such as MCS locks and parallel reductions, are often inappropriate for update-based protocols. In contrast, techniques such as dissemination and tree barriers achieve superior performance under update-based protocols. Our results also show that the implementation of parallel programming idioms must take the coherence protocol into account, since update-based protocols often lead to different design decisions than write invalidate protocols. Our main conclusion is that protocol-conscious implementation of parallel programming structures can significantly improve application performance;for multiprocessors that can support more than one coherence protocol both the protocol and implementation should be taken into account when exploiting parallel constructs.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Performance implications of communication mechanisms in all-software global address spaces systems

Performance implications of communication mechanisms in all-...

引用

proceedings of the 1997 6th acm sigplan symposium on principles and practice of parallel programming

作者： Lim, Beng-Hong Chang, Chi-Chao Czajkowski, Grzegorz von Eicken, thorsten IBM Corp Yorktown Heights United States

Global addressing of shared data simplifies parallel programming and complements message passing models commonly found in distributed memory machines. A number of programming systems have been designed that synthesize global addressing purely in software on such machines. these systems provide a number of communication mechanisms to mitigate the effect of high communication latencies and overheads. this study compares the mechanisms in two representative all-software systems: CRL and Split-C. CRL uses region-based caching while Split-C uses split-phase and push-based data transfers for optimizing communication performance. Both systems take advantage of bulk data transfers. By implementing a set of parallel applications in both CRL and Split-C, and running them on the IBM SP2, Meiko CS-2 and two simulated architectures, we find that split-phase and push-based bulk data transfers are essential for good performance. Region-based caching benefits applications with irregular structure and with sufficient temporal locality, especially under high communication latencies. However, caching also hurts performance when there is insufficient data reuse or when the size of caching granularity is mismatched with the communication granularity. We find the programming complexity of the communication mechanisms in both languages to be comparable. Based on our results, we recommend that an ideal system intended to support diverse applications on parallel platforms should incorporate the communication mechanisms in CRL and Split-C.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Effective garbage collection strategy for parallel programming languages on large scale distributed-memory machines

Effective garbage collection strategy for parallel programmi...

引用

proceedings of the 1997 6th acm sigplan symposium on principles and practice of parallel programming

作者： Taura, Kenjiro Yonezawa, Akinori Univ of Tokyo Tokyo Japan

this paper describes the design and implementation of a garbage collection scheme on large-scale distributed-memory computers and reports various experimental results. the collector is based on the conservative GC library by Boehm & Weiser. Each processor traces local pointers using the GC library while traversing remote pointers by exchanging 'mark messages' between processors. It exhibits a promising performance - in the most space-intensive settings we tested, the total collection overhead ranges from 5% up to 15% of the application running time (excluding idle time). We not only examine basic performance figures such as the total overhead or latency of a global collection, but also demonstrate how local collection scheduling strategies affect application performance. In our collector, a local collection is scheduled either independently or synchronously. Experimental results show that the benefit of independent local collections has been overstated in the literature. Independent local collections slowed down application performance to 40%, by increasing the average communication latency. Synchronized local collections exhibit much more robust performance characteristics than independent local collections and the overhead for global synchronization is not significant. Furthermore, we show that an adaptive collection scheduler can select the appropriate local collection strategy based on the application's behavior. the collector has been used in a concurrent object-oriented language ABCL/f and the performance is measured on a large-scale parallel computer (256 processors) using four non-trivial applications written in ABCL/f.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

Proceedings of the 5th ACM SIGPLAN Symposium on Principles a...

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

the proceedings contains 21 papers from the Fifth acm sigplan symposium on principles & practice of parallel programming PPOPP. Topics discussed include data parallel programs;data libraries;data caches;data acces... 详细信息

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

AUTOMATIC ALIGNMENT OF ARRAY DATA AND PROCESSES TO REDUCE COMMUNICATION TIME ON DMPPS 95

AUTOMATIC ALIGNMENT OF ARRAY DATA AND PROCESSES TO REDUCE CO...

引用

5th acm sigplan symposium on principles and practice of parallel programming

作者： PHILIPPSEN, M ICSI International Computer Science Institute Berkeley CA and Dept. of Informatics University of Karlsruhe

ISBN: (纸本)9780897917001

this paper investigates the problem of aligning array data and processes in a distributed-memory implementation. We present complete algorithms for compile-time analysis, the necessary program restructuring, and subsequent code-generation, and discuss their complexity. We finally evaluate the practical usefulness by quantitative experiments. the technique presented analyzes complete programs, including branches, loops, and nested parallelism. Alignment is determined with respect to offset, stride, and general ass's relations. Pplacement of both data and processes are computed in a unifying framework based on an extended preference graph and its analysis. Dynamic redistributions are derived. the experimental results are very encouraging. the optimization algorithms implemented in our Modula-2* compiler improved the execution times of the programs by an average over 40% on a MasPar MP-1 with 16384 processors.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Model and compilation strategy for out-of-core data parallel programs

Model and compilation strategy for out-of-core data parallel...

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Bordawekar, Rajesh Choudhary, Alok Kennedy, Ken Koelbel, Charles Paleczny, Michael Syracuse Univ Syracuse United States

It is widely acknowledged in high-performance computing circles that parallel input/output needs substantial improvement in order to make scalable computers truly usable. We present a data storage model that allows processors independent access to their own data and a corresponding compilation strategy that integrates data-parallel computation with data distribution for out-of-core problems. Our results compare several communication methods and I/O optimizations using two out-of-core problems, Jacobi iteration and LU factorization.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel skeletons for structured composition

Parallel skeletons for structured composition

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Darlington, John Guo, Yi-ke To, Hing Wing Yang, Jin Imperial Coll London United Kingdom

In this paper, we propose a straightforward solution to the problems of compositional parallel programming by using skeletons as the uniform mechanism for structured composition. In our approach parallel programs are constructed by composing procedures in a conventional base language using a set of high-level, predefined, functional, parallel computational forms known as skeletons. the ability to compose skeletons provides us with the essential tools for building further and more complex application-oriented skeletons specifying important aspects of parallel computation. Compared with the process network based composition approach, such as PCN, the skeleton approach abstracts away the fine details of connecting communication ports to the higher level mechanism of making data distributions conform, thus avoiding the complexity of using lower level ports as the means of interaction. thus, the framework provides a natural integration of the compositional programming approach with the data parallel programming paradigm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Linear-time algorithm for computing the memory access sequence in data-parallel programs

Linear-time algorithm for computing the memory access sequen...

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Kennedy, Ken Nedeljkovic, Nenad Sethi, Ajay Rice Univ Houston United States

Data-parallel languages, such as High Performance Fortran, are widely regarded as a promising means for writing portable programs for distributed-memory machines. Novel features of these languages call for the development of new techniques in both compilers and run-time systems. In this paper, we present an improved algorithm for finding the local memory access sequence in computations involving regular sections of arrays with cyclic(k) distributions. After establishing the fact that regular section indices correspond to elements of an integer lattice, we show how to find a lattice basis that allows for simple and fast enumeration of memory accesses. the complexity of our algorithm is shown to be lower than that of the previous solution for the same problem. In addition, the experimental results demonstrate the efficiency of our method in practice.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

High performance synchronization algorithms for multiprogrammed multiprocessors

High performance synchronization algorithms for multiprogram...

引用

proceedings of the 5th acm sigplan symposium on principles and practice of parallel programming

作者： Wisniewski, Robert W. Kontothanassis, Leonidas I. Scott, Michael L. Univ of Rochester Rochester United States

Scalable busy-wait synchronization algorithms are essential for achieving good parallel program performance on large scale multiprocessors. Such algorithms include mutual exclusion locks, reader-writer locks, and barrier synchronization. Unfortunately, scalable synchronization algorithms are particularly sensitive to the effects of multiprogramming: their performance degrades sharply when processors are shared among different applications, or even among processes of the same application. In this paper we describe the design and evaluation of scalable scheduler-conscious mutual exclusion locks, reader-writer locks, and barriers, and show that by sharing information across the kernel/application interface we can improve the performance of scheduler-oblivious implementations by more than an order of magnitude.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共33页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：