Space-efficient scheduling of parallelism with synchronization variables

Blelloch, Guy E.; Gibbons, Phillip B.; Matias, Yossi; Narlikar, Girija

doi:10.1145/258492.258494

Cited by 37 publications

(34 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the other hand, threading that is too fine-grained increases scheduling and synchronization overheads, as well as any instruction overheads for running parallel code versus sequential code. 7 Thus judiciously choosing task granularity is an important yet challenging problem.…”

Section: Automatic Selection Of Thread Granularitymentioning

confidence: 99%

Scheduling threads for constructive cache sharing on CMPs

Chen

Gibbons

Kozuch

et al. 2007

Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures

Self Cite

120

View full text Add to dashboard Cite

In chip multiprocessors (CMPs), limiting the number of offchip cache misses is crucial for good performance. Many multithreaded programs provide opportunities for constructive cache sharing, in which concurrently scheduled threads share a largely overlapping working set. In this paper, we compare the performance of two state-of-the-art schedulers proposed for fine-grained multithreaded programs: Parallel Depth First (PDF), which is specifically designed for constructive cache sharing, and Work Stealing (WS), which is a more traditional design. Our experimental results indicate that PDF scheduling yields a 1.3-1.6X performance improvement relative to WS for several fine-grain parallel benchmarks on projected future CMP configurations; we also report several issues that may limit the advantage of PDF in certain applications. These results also indicate that PDF more effectively utilizes off-chip bandwidth, making it possible to trade-off on-chip cache for a larger number of cores. Moreover, we find that task granularity plays a key role in cache performance. Therefore, we present an automatic approach for selecting effective grain sizes, based on a new working set profiling algorithm that is an order of magnitude faster than previous approaches. This is the first paper demonstrating the effectiveness of PDF on real benchmarks, providing a direct comparison between PDF and WS, revealing the limiting factors for PDF in practice, and presenting an approach for overcoming these factors.

show abstract

Section: Automatic Selection Of Thread Granularitymentioning

confidence: 99%

Scheduling threads for constructive cache sharing on CMPs

Chen

Gibbons

Kozuch

et al. 2007

Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures

Self Cite

120

View full text Add to dashboard Cite

show abstract

“…Blelloch et al [7] propose to use futures to generate "non-linear pipelines," another form of parallelism that creates deterministic dependence structure and study scheduling bound for such programs. Their use of future falls under the structured use of futures.…”

Section: Related Workmentioning

confidence: 99%

Race Detection and Reachability in Nearly Series-Parallel DAGs

Agrawal

Devietti

Fineman

et al. 2018

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

View full text Add to dashboard Cite

A program is said to have a determinacy race if logically parallel parts of a program access the same memory location and one of the accesses is a write. These races are generally bugs in the program since they lead to non-deterministic program behavior -different schedules of the program can lead to different results. Most prior work on detecting these races focuses on a subclass of programs with series-parallel or nested parallelism.This paper presents a race-detection algorithm for detecting races in a more general class of programs, namely programs that include arbitrary ordering constraints in additional to the series-parallel constructs. The algorithm performs a serial execution of the program, augmented to detect races, in O(T 1 + k 2 ) time, where T 1 is the sequential running time of the original program and k is the number of non series-parallel constraints.The main technical novelty of this paper is a new data structure, R-Sketch, for answering reachability queries in nearly series-parallel (SP) directed acyclic graphs (DAGs). Given as input a graph comprising an n-node series parallel graph and k additional non-SP edges, the total construction time of the data structure is O(n + k 2 ), and each reachability query can be answered in O(1) time. The data structure is traversally incremental, meaning that it supports the insertion of nodes/edges, but only as they are discovered through a graph traversal.

show abstract

“…Despite some optimization work they have done, their static scheduling methods still cannot achieve a better load balance especially for irregular DP applications compared with the dynamic scheduling as the EasyPDP runtime has adopted. In contrast, some other schedulers such as work-stealing (WS) scheduler [45] and parallel depth-first search (PDF) scheduler [47], [48], [49], which take data locality into account, can have a good performance for DP algorithms as well due to the reduced cache and TLB misses. We explained in Section 4.2.2 that the fault tolerance is crucial and necessary for parallel DP algorithms, whereas there are no fault-tolerance and recovery mechanisms which have been considered and supported in previous work except our EasyPDP.…”

Section: Related Workmentioning

confidence: 99%

EasyPDP: An Efficient Parallel Dynamic Programming Runtime System for Computational Biology

Tang

Sun

et al. 2012

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Dynamic programming (DP) is a popular and efficient technique in many scientific applications such as computational biology. Nevertheless, its performance is limited due to the burgeoning volume of scientific data, and parallelism is necessary and crucial to keep the computation time at acceptable levels. The intrinsically strong data dependency of dynamic programming makes it difficult and error-prone for the programmer to write a correct and efficient parallel program. Therefore, this paper builds a runtime system named EasyPDP aiming at parallelizing dynamic programming algorithms on multicore and multiprocessor platforms. Under the concept of software reusability and complexity reduction of parallel programming, a DAG Data Driven Model is proposed, which supports those applications with a strong data interdependence relationship. Based on the model, EasyPDP runtime system is designed and implemented. It automatically handles thread creation, dynamic data task allocation and scheduling, data partitioning, and fault tolerance. Five frequently used DAG patterns from biological dynamic programming algorithms have been put into the DAG pattern library of EasyPDP, so that the programmer can choose to use any of them according to his/her specific application. Besides, an ideal computing distribution model is proposed to discuss the optimal values for the performance tuning arguments of EasyPDP. We evaluate the performance potential and fault tolerance feature of EasyPDP in multicore system. We also compare EasyPDP with other methods such as Block-Cycle Wavefront (BCW). The experimental results illustrate that EasyPDP system is fine and provides an efficient infrastructure for dynamic programming algorithms.

show abstract

Space-efficient scheduling of parallelism with synchronization variables

Cited by 37 publications

References 37 publications

Scheduling threads for constructive cache sharing on CMPs

Scheduling threads for constructive cache sharing on CMPs

Race Detection and Reachability in Nearly Series-Parallel DAGs

EasyPDP: An Efficient Parallel Dynamic Programming Runtime System for Computational Biology

Contact Info

Product

Resources

About