Scaling Data Race Detection for Partitioned Global Address Space Programs Chang-
نویسندگان
چکیده
i. Low overhead automated and precise detection of concurrency bugs at scale. ii. Using low overhead bug detection tools to guide speculative program transformations for performance. iii. Techniques to reduce the concurrency required to reproduce a bug using partial program restart/replay. iv. Techniques to provide reproducible execution of floating point programs. v. Techniques for tuning the floating point precision used in codes.
منابع مشابه
Scaling Data Race Detection for Partitioned Global Address Space Programs
Contemporary and future programming languages for HPC promote hybrid parallelism and shared memory abstractions using a global address space. In this programming style, data races occur easily and are notoriously hard to find. Existing state-of-the-art data race detectors exhibit 10×−100× performance degradation and do not handle hybrid parallelism. In this paper we present the first complete i...
متن کاملAnalysis of Partitioned Global Address Space Programs
The introduction of multi-core processors by the major microprocessor vendors has brought parallel programming into the mainstream. Analysis of parallel languages is critical both for safety and optimization purposes. In this report, we consider the specific case of languages with barrier synchronization and global address space abstractions. Two of the fundamental problems in the analysis of p...
متن کاملHierarchical Pointer Analysis for Distributed Programs
We present a new pointer analysis for use in shared memory programs running on hierarchical parallel machines. The analysis is motivated by the partitioned global address space languages, in which programmers have control over data layout and threads and can directly read and write to memory associated with other threads. Titanium, UPC, Co-Array Fortran, X10, Chapel, and Fortress are all exampl...
متن کاملA Theory of Partitioned Global Address Spaces
Partitioned global address space (PGAS) is a parallel programming model for the development of high-performance applications on clusters. It provides a global address space partitioned among the cluster nodes, and is supported in programming languages like C, C++, and Fortran by means of APIs. Our first contribution is a formal model for the semantics of single program, multiple data programs t...
متن کاملA scalable deadlock detection algorithm for UPC collective operations
Unified Parallel C (UPC) is a language used to write parallel programs for shared and distributed memory parallel computers. Deadlock detection in UPC programs requires detecting deadlocks that involve either locks, collective operations, or both. In this paper, a distributed deadlock detection algorithm for UPC programs that uses run-time analysis is presented. The algorithm detects deadlocks ...
متن کامل