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

20th acm sigplan symposium on principles and practice of parallel programming, ppopp 2015

ISBN: (纸本)9781450332057

the proceedings contain 44 papers. the topics discussed include: predicate RCU: an RCU for scalable concurrent updates;automatic scalable atomicity via semantic locking;a framework for practical parallel fast matrix multiplication;PLUTO+: near-complete modeling of affine transformations for parallelism and locality;distributed memory code generation for mixed irregular/regular computations;performance implications of dynamic memory allocators on transactional memory systems;low-overhead software transactional memory with progress guarantees and strong semantics∗;barrier elision for production parallel programs;scalable and efficient implementation of 3D unstructured meshes computation: a case study on matrix assembly;and diagnosing the causes and severity of one-sided message contention.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tiles: A new language mechanism for heterogeneous parallelism 2015

Tiles: A new language mechanism for heterogeneous parallelis...

引用

20th acm sigplan symposium on principles and practice of parallel programming, ppopp 2015

作者： Chen, Yifeng Cui, Xiang Mei, Hong HCST Key Lab. School of EECS Peking University Beijing100871 China

ISBN: (纸本)9781450332057

this paper studies the essence of heterogeneity from the perspective of language mechanism design. the proposed mechanism, called tiles, is a program construct that bridges two relative levels of computation: an outer level of source data in larger, slower or more distributed memory and an inner level of data blocks in smaller, faster or more localized memory.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

the lock-free k-LSM relaxed priority queue 2015

The lock-free k-LSM relaxed priority queue

引用

20th acm sigplan symposium on principles and practice of parallel programming, ppopp 2015

作者： Wimmer, Martin Gruber, Jakob Träff, Jesper Larsson Tsigas, Philippas Faculty of Informatics Parallel Computing Vienna University of Technology Vienna/Wien1040 Austria Computer Science and Engineering Chalmers University of Technology Göteborg412 96 Sweden

ISBN: (纸本)9781450332057

We present a new, concurrent, lock-free priority queue that relaxes the delete-min operation to allow deletion of any of the ρ+1 smallest keys instead of only a minimal one, where ρ is a parameter that can be configured at runtime. It is built from a logarithmic number of sorted arrays, similar to log-structured merge-trees (LSM). For keys added and removed by the same thread the behavior is identical to a non-relaxed priority queue. We compare to state-of-the-art lock-free priority queues with both relaxed and non-relaxed semantics, showing high performance and good scalability of our approach.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

A collection-oriented programming model for performance portability 2015

A collection-oriented programming model for performance port...

引用

20th acm sigplan symposium on principles and practice of parallel programming, ppopp 2015

作者： Muralidharan, Saurav Garland, Michael Catanzaro, Bryan Sidelnik, Albert Hall, Mary University of Utah Salt Lake CityUT United States NVIDIA Corporation Santa ClaraCA United States Baidu Inc. SunnyvaleCA United States

ISBN: (纸本)9781450332057

this paper describes Surge, a collection-oriented programming model that enables programmers to compose parallel computations using nested high-level data collections and operators. Surge exposes a code generation interface, decoupled from the core computation, that enables programmers and autotuners to easily generate multiple implementations of the same computation on various parallel architectures such as multi-core CPUs and GPUs. By decoupling computations from architecture-specific implementation, programmers can target multiple architectures more easily, and generate a search space that facilitates optimization and customization for specific architectures. We express in Surge four real-world benchmarks from domains such as sparse linear-algebra and machine learning and from the same performance-portable specification, generate OpenMP and CUDA C++ implementations. Surge generates efficient, scalable code which achieves up to 1.32x speedup over handcrafted, well-optimized CUDA code.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

parallel and Distributed Bounded Model Checking of Multi-threaded Programs 20

Parallel and Distributed Bounded Model Checking of Multi-thr...

引用

25th acm sigplan symposium on principles and practice of parallel programming (ppopp)

作者： Inverso, Omar Trubiani, Catia Gran Sasso Sci Inst Laquila Italy

ISBN: (纸本)9781450368186

We introduce a structure-aware parallel technique for context-bounded analysis of concurrent programs. the key intuition consists in decomposing the set of concurrent traces into symbolic subsets that are separately explored by multiple instances of the same decision procedure running in parallel. the decision procedures work on different partitions of the search space without cooperating, whence distribution follows effortlessly. Our experiments on a selection of complex multi-threaded programs show significant analysis speedups and scalability, and greater performance gains than with general-purpose parallel solvers.

关键词： Concurrency Multithreading Sequentialization Software Verification parallel Analysis Bounded Model Checking SAT

来源：评论

学校读者我要写书评

暂无评论

PLUM: Static parallel Program Locality Analysis under Uniform Multiplexing 20

PLUM: Static Parallel Program Locality Analysis under Unifor...

引用

25th acm sigplan symposium on principles and practice of parallel programming (ppopp)

作者： Liu, Fangzhou Chen, Dong Smith, Wesley Ding, Chen Univ Rochester Rochester NY 14627 USA Natl Univ Def Technol Changsha Peoples R China

ISBN: (纸本)9781450368186

Data movement has a significant impact on program performance. For multithread programs, this impact is amplified, since different threads often interfere with each other by competing for shared cache space. However, recent de facto locality metrics consider either sequential execution only, or derive locality for multithread programs in an inefficient way, i.e. exhaustive simulation. this paper presents PLUM, a compiler solution for timescale locality analysis for parallel programs. Experiments demonstrate that the prediction accuracy is 93.97% on average. PLUM is the first tool that analyzes data locality for parallel programs during compile time;in addition, it provides an approach for efficiently studying the representative interleaving pattern for parallel executions.

关键词： Static analysis Locality Multithread

来源：评论

学校读者我要写书评

暂无评论

A framework for practical parallel fast matrix multiplication 2015

A framework for practical parallel fast matrix multiplicatio...

引用

20th acm sigplan symposium on principles and practice of parallel programming, ppopp 2015

作者： Benson, Austin R. Ballard, Grey Institute for Computational and Mathematical Engineering Stanford University StanfordCA United States Sandia National Laboratories LivermoreCA United States

ISBN: (纸本)9781450332057

Matrix multiplication is a fundamental computation in many scientific disciplines. In this paper, we show that novel fast matrix multiplication algorithms can significantly outperform vendor implementations of the classical algorithm and Strassen's fast algorithm on modest problem sizes and shapes. Furthermore, we show that the best choice of fast algorithm depends not only on the size of the matrices but also the shape. We develop a code generation tool to automatically implement multiple sequential and shared-memory parallel variants of each fast algorithm, including our novel parallelization scheme. this allows us to rapidly benchmark over 20 fast algorithms on several problem sizes. Furthermore, we discuss a number of practical implementation issues for these algorithms on shared-memory machines that can direct further research on making fast algorithms practical. Copyright 2015 acm.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

A library for portable and composable data locality optimizations for NUMA systems 2015

A library for portable and composable data locality optimiza...

引用

20th acm sigplan symposium on principles and practice of parallel programming, ppopp 2015

作者： Majo, Zoltan Gross, thomas R. Department of Computer Science ETH Zurich Switzerland

ISBN: (纸本)9781450332057

Many recent multiprocessor systems are realized with a nonuniform memory architecture (NUMA) and accesses to remote memory locations take more time than local memory accesses. Optimizing NUMA memory system performance is difficult and costly for three principal reasons: (1) today's programming languages/libraries have no explicit support for NUMA systems, (2) NUMA optimizations are not portable, and (3) optimizations are not composable (i.e., they can become ineffective or worsen performance in environments that support composable parallel software). this paper presents TBB-NUMA, a parallel programming library based on Intel threading Building Blocks (TBB) that supports portable and composable NUMA-aware programming. TBB-NUMA provides a model of task affinity that captures a programmer's insights on mapping tasks to resources. NUMA-awareness affects all layers of the library (i.e., resource management, task scheduling, and high-level parallel algorithm templates) and requires close coupling between all these layers. Optimizations implemented with TBB-NUMA (for a set of standard benchmark programs) result in up to 44% performance improvement over standard TBB, but more important, optimized programs are portable across different NUMA architectures and preserve data locality also when composed with other parallel computations. Copyright 2015 acm.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Deadlock-free buffer configuration for stream computing

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2017年第5期31卷 441-450页

作者： Li, Peng Beard, Jonathan C. Buhler, Jeremy D. Washington Univ Dept Comp Sci & Engn St Louis MO 63130 USA

Stream computing is a popular paradigm for parallel and distributed computing, where compute nodes are connected by first-in first-out data channels. Each channel can be considered as a concatenation of several data buffers, including an output buffer for the sender and an input buffer for the receiver. the configuration of buffer sizes impacts the performance as well as the correctness of the application. In this article, we focus on application deadlocks that are caused by incorrect configuration of buffer sizes. We describe three types of deadlock in streaming applications, categorized by how they can be created. To avoid them, we first prove necessary and sufficient conditions for deadlock-free computations;then based on the theorems, we propose both compile-time and runtime solutions for deadlock avoidance.

关键词： Buffer configuration deadlock avoidance feedback channels parallel and distributed computing streaming computing

来源：评论

学校读者我要写书评

暂无评论

Combining phase identification and statistic modeling for automated parallel benchmark generation 2015

Combining phase identification and statistic modeling for au...

引用

20th acm sigplan symposium on principles and practice of parallel programming, ppopp 2015

作者： Jin, Ye Liu, Mingliang Ma, Xiaosong Liu, Qing Logan, Jeremy Podhorszki, Norbert Choi, Jong Youl Klasky, Scott NCSU United States QCRI Qatar Oak Ridge National Lab. United States

ISBN: (纸本)9781450332057

parallel application benchmarks are indispensable for evaluating/optimizing HPC software and hardware. However, it is very challenging and costly to obtain high-fidelity benchmarks reflecting the scale and complexity of state-of-the-art parallel applications. Hand-extracted synthetic benchmarks are time- and labor-intensive to create. Real applications themselves, while offering most accurate performance evaluation, are expensive to compile, port, reconfigure, and often plainly inaccessible due to security or ownership concerns. this work contributes APPRIME, a novel tool for trace-based automatic parallel benchmark generation. Taking as input standard communication-I/O traces of an application's execution, it couples accurate automatic phase identification with statistical regeneration of event parameters to create compact, portable, and to some degree reconfigurable parallel application benchmarks. Experiments with four NAS parallel Benchmarks (NPB) and three real scientific simulation codes confirm the fidelity of APPRIME benchmarks. they retain the original applications' performance characteristics, in particular the relative performance across platforms.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：