Automatic Thread Extraction with Decoupled Software Pipelining

Ottoni, Guilherme; Rangan, Ram; Stoler, Adam; August, David I.

doi:10.1109/micro.2005.13

Cited by 215 publications

(198 citation statements)

References 24 publications

Supporting

Mentioning

191

Contrasting

Unclassified

Order By: Relevance

“…Decoupled Software Pipelining (DSWP) [29] proposes to divide a loop into critical path and off-critical path threads that run concurrently but communicate in a pipelined manner. First, this technique builds the Program Dependence Graph (PDG) of a loop and searches for strongly connected components (SCCs) on it.…”

Section: Related Workmentioning

confidence: 99%

A novel compiler support for automatic parallelization on multicore systems

et al. 2013

View full text Add to dashboard Cite

The widespread use of multicore processors is not a consequence of significant advances in parallel programming.In contrast, multicore processors arise due to the complexity of building power-efficient, high-clock-rate, single-core chips. Automatic parallelization of sequential applications is the ideal solution for making parallel programming as easy as writing programs for sequential computers. However, automatic parallelization remains a grand challenge due to its need for complex program analysis and the existence of unknowns during compilation. This paper proposes a new method for converting a sequential application into a parallel counterpart that can be executed on current multicore processors. It hinges on an intermediate representation based on the concept of domain-independent kernel (e.g., assignment, reduction, recurrence). Such kernel-centric view hides the complexity of the implementation details, enabling the construction of the parallel version even when the source code of the sequential application contains different syntactic variations of the computations (e.g., pointers, arrays, complex control flows). Experiments that evaluate the effectiveness and performance of our approach with respect to state-of-the-art compilers are also presented. The benchmark suite consists of synthetic codes that represent common domain-independent kernels, dense/sparse linear algebra and image processing routines, and full-scale applications from SPEC CPU2000.

show abstract

Section: Related Workmentioning

confidence: 99%

A novel compiler support for automatic parallelization on multicore systems

et al. 2013

View full text Add to dashboard Cite

show abstract

“…Another approach is hardware queues [15,19,26] that provide instructions for enqueue and dequeue operations to reduce the overhead of software queues. However, hardware queues require to modify processors, and also impose challenges to the operating system as the queue state must be preserved across context switch.…”

Section: Related Workmentioning

confidence: 99%

B-Queue: Efficient and Practical Queuing for Fast Core-to-Core Communication

Wang

Zhang

Tang

et al. 2012

Int J Parallel Prog

View full text Add to dashboard Cite

Core-to-core communication is critical to the effective use of multi-core processors. A number of software based concurrent lock-free queues have been proposed to address this problem. Existing solutions, however, suffer from performance degradation in real testbeds, or rely on auxiliary hardware or software timers to handle the deadlock problem when batching is used, making those solutions good in theory but difficult to use in practice. This paper describes the pros and cons of existing concurrent lock-free queues in both dummy and real testbeds and proposes BQueue, an efficient and practical single-producer-single-consumer concurrent lockfree queue that solves the deadlock problem gracefully by introducing a self-adaptive backtracking mechanism. Experiments show that in real massively-parallel applications, B-Queue is faster than FastForward and MCRingBuffer, the two state-of-the-art concurrent lock-free queues, by up to 10x and 5x, respectively. Moreover, B-Queue outperforms FastForward and MCRingBuffer in terms of stability and scalability, making it a good candidate for fast core-to-core communication on multi-core architectures.

show abstract

“…Ottoni et al [13] proposed a technique called Decoupled Software Pipelining (DSWP) to extract the fine-grained parallelism hidden in most applications. The process is automatic, and general, since it considers non-scientific applications in which the loop iterations have heavy data dependencies.…”

Section: Related Workmentioning

confidence: 99%

Program Parallelization Using Synchronized Pipelining

Scandolo

Kunz

Hermenegildo

2010

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. While there are well-understood methods for detecting loops whose iterations are independent and parallelizing them, there are comparatively fewer proposals that support parallel execution of a sequence of loops or nested loops in the case where such loops have dependencies among them. This paper introduces a refined notion of independence, called eventual independence, that in its simplest form considers two loops, say loop 1 and loop 2 , and captures the idea that for every i there exists k such that the i + 1-th iteration of loop 2 is independent from the j-th iteration of loop 1 , for all j ≥ k. Eventual independence provides the foundation of a semantics-preserving program transformation, called synchronized pipelining, that makes execution of consecutive or nested loops parallel, relying on a minimal number of synchronization events to ensure semantics preservation. The practical benefits of synchronized pipelining are demonstrated through experimental results on common algorithms such as sorting and Fourier transforms.

show abstract

Automatic Thread Extraction with Decoupled Software Pipelining

Cited by 215 publications

References 24 publications

A novel compiler support for automatic parallelization on multicore systems

A novel compiler support for automatic parallelization on multicore systems

B-Queue: Efficient and Practical Queuing for Fast Core-to-Core Communication

Program Parallelization Using Synchronized Pipelining

Contact Info

Product

Resources

About