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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

692 篇 会议
64 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

630 篇 工学
- 567 篇 软件工程
- 506 篇 计算机科学与技术...
- 29 篇 控制科学与工程
- 23 篇 电子科学与技术（可...
- 11 篇 信息与通信工程
- 8 篇 电气工程
- 5 篇 机械工程
- 5 篇 生物医学工程（可授...
- 4 篇 生物工程
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 土木工程
- 2 篇 力学（可授工学、理...
- 2 篇 冶金工程
- 2 篇 农业工程
139 篇 理学
- 125 篇 数学
- 18 篇 系统科学
- 8 篇 统计学（可授理学、...
- 5 篇 生物学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 地质学
46 篇 管理学
- 29 篇 管理科学与工程(可...
- 19 篇 工商管理
- 16 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 教育学
- 5 篇 教育学
3 篇 法学
- 3 篇 社会学
2 篇 农学
- 2 篇 作物学
1 篇 医学

主题

78 篇 parallel process...
74 篇 performance
72 篇 parallel program...
49 篇 languages
48 篇 algorithms
35 篇 design
28 篇 logic programmin...
26 篇 parallel algorit...
25 篇 gpu
23 篇 computer program...
16 篇 computer program...
16 篇 functional progr...
15 篇 semantics
14 篇 parallel computi...
14 篇 concurrency
13 篇 theory
13 篇 parallel
12 篇 experimentation
12 篇 mpi
12 篇 verification

机构

14 篇 carnegie mellon ...
8 篇 indiana univ blo...
6 篇 univ of tokyo
5 篇 imdea software i...
4 篇 univ wisconsin d...
4 篇 univ chinese aca...
4 篇 univ illinois ur...
4 篇 swiss fed inst t...
4 篇 mit csail united...
4 篇 carnegie mellon ...
4 篇 shanghai jiao to...
4 篇 mit comp sci & a...
4 篇 rice university
4 篇 univ rochester r...
4 篇 purdue univ w la...
3 篇 tsinghua univ de...
3 篇 massachusetts in...
3 篇 ohio state univ ...
3 篇 carnegie mellon ...
3 篇 carnegie mellon ...

作者

10 篇 blelloch guy e.
9 篇 chen haibo
8 篇 hoefler torsten
8 篇 agrawal kunal
7 篇 garland michael
7 篇 leiserson charle...
6 篇 sun yihan
6 篇 zhai jidong
6 篇 shun julian
6 篇 mellor-crummey j...
5 篇 pingali keshav
5 篇 rainey mike
5 篇 miller barton p.
5 篇 krishnamoorthy s...
5 篇 tsigas philippas
5 篇 padua david
5 篇 nikolopoulos dim...
5 篇 lam monica s.
5 篇 sarkar vivek
5 篇 valero mateo

语言

728 篇 英文
29 篇 其他
1 篇 葡萄牙文

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

共 758 条记录，以下是731-740 订阅

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

详细简洁

排序：

Performance portable C++ programming with RAJA 19

Performance portable C++ programming with RAJA

引用

Proceedings of the 24th symposium on principles and practice of parallel programming

作者： David Beckingsale Richard Hornung Tom Scogland Arturo Vargas Lawrence Livermore National Laboratory

ISBN: (纸本)9781450362252

With the rapid change of computing architectures, and variety of programming models; the ability to develop performance portable applications has become of great importance. This is particularly true in large production codes where developing and maintaining hardware specific versions is *** simplify the development of performance portable code, we introduce RAJA, our C++ library that allows developers to write single-source applications that can target multiple hardware and programming model back-ends. We provide a thorough introduction to all of RAJA features, and walk through some hands-on examples that will allow attendees to understand how RAJA might benefit their own applications. Attendees should bring a laptop computer to participate in the hands-on *** tutorial will introduce attendees to RAJA, a C++ library for developing performance portable applications. Attendees will learn how to write performance portable code that can execute on a range of programming models (OpenMP, CUDA, Intel TBB, and HCC) and hardware (CPU, GPU, Xeon Phi).Specifically, attendees will learn how to convert existing C++ applications to use RAJA, and how to use RAJA's programming abstractions to expose existing parallelism in their applications without complex algorithm rewrites. We will also cover specific guidelines for using RAJA in a large application, including some common "gotchas" and how to handle memory management. Finally, attendees will learn how to categorize loops to allow for simple and systematic performance tuning on any architecture.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Pizza into Java: translating theory into practice 97

Pizza into Java: translating theory into practice

引用

Proceedings of the 24th acm sigplan-SIGACT symposium on principles of programming languages

作者： Martin Odersky Philip Wadler University of Karlsruhe University of Glasgow

ISBN: (纸本)9780897918534

Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types. Pizza is defined by translation into Java and compiles into the Java Virtual Machine, requirements which strongly constrain the design space. Nonetheless, Pizza fits smoothly to Java, with only a few rough edges.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Code motion for explicitly parallel programs 99

Code motion for explicitly parallel programs

引用

Proceedings of the seventh acm sigplan symposium on principles and practice of parallel programming

作者： Jens Knoop Bernhard Steffen Fachbereich Informatik Universität Dortmund Baroper Straβe 301 D-44227 Dortmund Germany

ISBN: (纸本)9781581131000

In comparison to automatic parallelization, which is thoroughly studied in the literature [31, 33], classical analyses and optimizations of explicitly parallel programs were more or less neglected. This may be due to the fact that naive adaptations of the sequential techniques fail [24], and their straightforward correct ones have unacceptable costs caused by the interleavings, which manifest the possible executions of a parallel program. Recently, however, we showed that unidirectional bitvector analyses can be performed for parallel programs as easily and as efficiently as for sequential ones [17], a necessary condition for the successful transfer of the classical optimizations to the parallel *** this article we focus on possible subsequent code motion transformations, which turn out to require much more care than originally conjectured [17]. Essentially, this is due to the fact that interleaving semantics, although being adequate for correctness considerations, fails when it comes to reasoning about efficiency of parallel programs. This deficiency, however, can be overcome by strengthening the specific treatment of synchronization points.

关键词： code motion (partial redundancy elimination) interleaving semantics shared memory bitvector problems synchronization code optimization data-flow analysis

来源：评论

学校读者我要写书评

暂无评论

POSTER: HythTM: Extending the Applicability of Intel TSX Hardware Transactional Support 17

POSTER: HythTM: Extending the Applicability of Intel TSX Har...

引用

Proceedings of the 22nd acm sigplan symposium on principles and practice of parallel programming

作者： Arnamoy Bhattacharyya Mike Dai Wang Mihai Burcea Yi Ding Allen Deng Sai Varikooty Shafaaf Hossain Cristiana Amza University of Toronto Toronto ON Canada

ISBN: (纸本)9781450344937

In this work, we introduce and experimentally evaluate a new hybrid software-hardware Transactional Memory prototype based on Intel's Haswell TSX architecture. Our prototype extends the applicability of the existing hardware support for TM by interposing a hybrid fall-back layer before the sequential, big-lock fall-back path, used by standard TSX-supported solutions in order to guarantee progress. In our experimental evaluation we use SynQuake, a realistic game benchmark modeled after Quake. Our results show that our hybrid transactional system,which we call HythTM, is able to reduce the number of transactions that go to the sequential software layer, hence avoiding hardware transaction aborts and loss of parallelism. HythTM optimizes application throughput and scalability up to 5.05x, when compared to the hardware TM with sequential fall-back path.

关键词： commutativity cache-coherence shared memory parallel programming

来源：评论

学校读者我要写书评

暂无评论

Performance prediction of large parallel applications using parallel simulations 99

Performance prediction of large parallel applications using ...

引用

Proceedings of the seventh acm sigplan symposium on principles and practice of parallel programming

作者： Rajive Bagrodia Ewa Deeljman Steven Docy Thomas Phan Computer Science Department University of California Los Angeles CA

ISBN: (纸本)9781581131000

Accurate simulation of large parallel applications can be facilitated with the use of direct execution and parallel discrete event simulation. This paper describes the use of COMPASS, a direct execution-driven, parallel simulator for performance prediction of programs that include both communication and I/O intensive applications. The simulator has been used to predict the performance of such applications on both distributed memory machines like the IBM SP and shared-memory machines like the SGI Origin 2000. The paper illustrates the usefulness of COMPASS as a versatile performance prediction tool. We use both real-world applications and synthetic benchmarks to study application scalability, sensitivity to communication latency, and the interplay between factors like communication pattern and parallel file system caching on application performance. We also show that the simulator is accurate in its predictions and that it is also efficient in its ability to use parallel simulation to reduce its own execution time which, in some cases, has yielded a nearlinear speedup.

关键词： parallel discrete event simulation MPI-IO application scalability parallel program simulation direct execution MPI

来源：评论

学校读者我要写书评

暂无评论

LoPC: modeling contention in parallel algorithms 97

LoPC: modeling contention in parallel algorithms

引用

Proceedings of the sixth acm sigplan symposium on principles and practice of parallel programming

作者： Matthew I. Frank Anant Agarwal Mary K. Vernon Laboratory for Computer Science Massachusetts Institute of Technology Computer Sciences Department University of Wisconsin-Madison

ISBN: (纸本)9780897919067

parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the LoPC model, which is inspired by the LogP model but accounts for contention for message processing resources in parallel algorithms on a multiprocessor or network of workstations. LoPC takes the L, o and P parameters directly from the LogP model and uses them to predict the cost of contention, *** paper defines the LoPC model and derives the general form of the model for parallel applications that communicate via active messages. Model modifications for systems that implement coherent shared memory abstractions are also discussed. We carry out the analysis for two important classes of applications that have irregular communication. In the case of parallel applications with homogeneous all-to-any communication, such as sparse matrix computations, the analysis yields a simple rule of thumb and insight into contention costs. In the case of parallel client-server algorithms, the LoPC analysis provides a simple and accurate calculation of the optimal allocation of nodes between clients and servers. The LoPC estimates for these applications are shown to be accurate when compared against event driven simulation and against a sparse matrix computation on the MIT Alewife multiprocessor.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Basic compiler algorithms for parallel programs 99

Basic compiler algorithms for parallel programs

引用

Proceedings of the seventh acm sigplan symposium on principles and practice of parallel programming

作者： Jaejin Lee David A. Padua Samuel P. Midkiff Department of Computer Science University of Illinois Urbana IL IBM T. J. Watson Research Center P.O.Box 218 Yorktown Heights NY

ISBN: (纸本)9781581131000

Traditional compiler techniques developed for sequential programs do not guarantee the correctness (sequential consistency) of compiler transformations when applied to parallel programs. This is because traditional compilers for sequential programs do not account for the updates to a shared variable by different threads. We present a concurrent static single assignment (CSSA) form for parallel programs containing cobegin/coend and parallel do constructs and post/wait synchronization primitives. Based on the CSSA form, we present copy propagation and dead code elimination techniques. Also, a global value numbering technique that detects equivalent variables in parallel programs is presented. By using global value numbering and the CSSA form, we extend classical common subexpression elimination, redundant load/store elimination, and loop invariant detection to parallel programs without violating sequential consistency. These optimization techniques are the most commonly used techniques for sequential programs. By extending these techniques to parallel programs, we can guarantee the correctness of the optimized program and maintain single processor performance in a multiprocessor environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

Dynamic pointer alignment: tiling and communication optimiza...

引用

Proceedings of the sixth acm sigplan symposium on principles and practice of parallel programming

作者： Xingbin Zhang Andrew A. Chien Department of Computer Science University of Illinois at Urbana-Champaign Department of Computer Science University of Illinois at Urbana-Champaign and Hewlett Packard Laboratories

ISBN: (纸本)9780897919067

Loop tiling and communication optimization, 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 optimization on the CRAY T3D.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Space and time efficient execution of parallel irregular computations 97

Space and time efficient execution of parallel irregular com...

引用

Proceedings of the sixth acm sigplan symposium on principles and practice of parallel programming

作者： Cong Fu Tao Yang Department of Computer Science University of California Santa Barbara CA

ISBN: (纸本)9780897919067

Solving problems of large sizes is an important goal for parallel machines with multiple CPU and memory resources. In this paper, issues of efficient execution of overhead-sensitive parallel irregular computation under memory constraints are addressed. The irregular parallelism is modeled by task dependence graphs with mixed granularities. The trade-off in achieving both time and space efficiency is investigated. The main difficulty of designing efficient run-time system support is caused by the use of fast communication primitives available on modern parallel architectures. A run-time active memory management scheme and new scheduling techniques are proposed to improve memory utilization while retaining good time efficiency, and a theoretical analysis on correctness and performance is provided. This work is implemented in the context of RAPID system [5] which provides run-time support for parallelizing irregular code on distributed memory machines and the effectiveness of the proposed techniques is verified on sparse Cholesky and LU factorization with partial pivoting. The experimental results on Cray-T3D show that solvable problem sizes can be increased substantially under limited memory capacities and the loss of execution efficiency caused by the extra memory managing overhead is reasonable.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Z-polyhedral model 07

The Z-polyhedral model

引用

Proceedings of the 12th acm sigplan symposium on principles and practice of parallel programming

作者： Gautam Gupta Sanjay Rajopadhye Colorado State University Fort Collins CO and INRIA-Rennes France Colorado State University Fort Collins CO

ISBN: (纸本)9781595936028

The polyhedral model is a well developed formalism and has been extensively used in a variety of contexts viz. the automatic parallelization of loop programs, program verification, locality, hardware generationand more recently, in the automatic reduction of asymptotic program complexity. Such analyses and transformations rely on certain closure properties. However, the model is limited in expressivity and the need for a more general class of programs is widely *** provide the extension to ⁰-polyhedra which are the intersection of polyhedra and lattices. We prove the required closure properties using a novel representation and interpretation of ⁰-polyhedra. In addition, we also prove closure in the ⁰-polyhedral model under images by dependence functions---thereby proving that unions of LBLs, widely assumedto be a richer class of sets, is equal to unions of ⁰-polyhedra. Another corollary of this result is the equivalence of the unions of ⁰-polyhedraand Presburger sets. Our representation and closure properties constitute the foundations of the ⁰-polyhedral model. As an example, we presentthe transformation for automatic reduction of complexity in the ⁰-polyhedral model.

关键词： program transformation models of computations loop optimization equational programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共76页 << < 67 68 69 70 71 72 73 74 75 76 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：