A New GCC Plugin-Based Compiler Pass to Add Support for Thread-Level Speculation into OpenMP

Aldea, Sergio; Estebanez, Alvaro; Llanos, Diego R.; González-Escribano, Arturo

doi:10.1007/978-3-319-09873-9_20

Cited by 3 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the benchmarks considered, the auto versions are faster than the manual versions, although it is not guaranteed that this will be the case for any other application. See [6] for additional details on the behavior of the ATLaS GCC plugin.…”

Section: Discussionmentioning

confidence: 99%

“…As we will see, like most of the approaches described above, BFCA+ follows a source-to-source approach, leveraging its XML-based representation of the source code to analyze and augment the code with OpenMP parallel constructs, including our speculative clause [6]. This differs from other approaches: BFCA+ is able to synthesize the code needed to handle the speculative execution of a certain program, creating an OpenMP-based parallel version from the sequential source code.…”

Section: Related Workmentioning

confidence: 95%

“…-ATLaS is a TLS compile [6] and runtime system [7] that extends OpenMP functionalities with a new speculative clause, to allow the parallelization of for loops that are not guaranteed at compile time to be dependency free. 1 During parallel execution, variables that were labeled as speculative are monitored at runtime.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

BFCA+: automatic synthesis of parallel code with TLS capabilities

2016

Self Cite

View full text Add to dashboard Cite

Parallelization of sequential applications requires extracting information about the loops and how their variables are accessed, and afterwards, augmenting the source code with extra code depending on such information. In this paper we propose a framework that avoids such an error-prone, time-consuming task. Our solution leverages the compile-time information extracted from the source code to classify all variables used inside each loop according to their accesses. Then, our system, called BFCA+, automatically instruments the source code with the necessary OpenMP directives and clauses to allow its parallel execution, using the standard shared and private clauses for variable classification. The framework is also capable of instrumenting loops for speculative parallelization, with the help of the ATLaS runtime system, that defines a new speculative clause to point out those variables that may lead to a dependency violation. As a result, the target loop is guaranteed to correctly run in parallel, ensuring that its execution follows sequential semantics even in the presence of dependency violations. Our experimental evaluation shows that the framework not only saves development time, but also leads to a faster code than the one manually parallelized.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 95%

See 1 more Smart Citation

BFCA+: automatic synthesis of parallel code with TLS capabilities

2016

Self Cite

View full text Add to dashboard Cite

show abstract

“…ATLaS. [Aldea et al 2014; developed a GCC plugin so as to add loop-based TLS support to OpenMP. Their proposal include the development of a new OpenMP speculative clause to be used in for loops [Aldea et al 2012], which allowed programmers to declare all variables whose reads or writes may lead to dependence violations.…”

Section: 22mentioning

confidence: 99%

A Survey on Thread-Level Speculation Techniques

2016

Self Cite

View full text Add to dashboard Cite

show abstract

GbA: A graph‐based thread partition approach in speculative multithreading

Zhao

2017

Concurrency and Computation

View full text Add to dashboard Cite

SummarySpeculative multithreading is an effective technique to automatically parallelize sequential programs. Conventional thread partition approaches primarily include heuristic rule–based (HR‐based) and machine learning–based. Heuristic rule–based approaches are effective to parallelize one type of programs and can seldom obtain the respective optimal partitions for different programs, and existing machine learning–based approaches usually use vector‐based characterization to represent a program, but easily ignore control information among basic blocks and partitions along other paths except the critical path. This paper proposes a novel graph‐based thread partition approach to overcome these 2 bottlenecks. Our approach characterizes programs with graphs, integrating feature and control informations, extracting good partition scheme successfully, and also applies a machine‐learning algorithm to predict partition for unseen programs. Prophet, which consists of an automatic parallelization compiler and a multicore simulator, evaluates the performance of multithreaded programs. Experiment results reveal that our approach delivers a maximum performance improvement of about 55.49% on an 8 core than HR‐based approach and a maximum 97.67% performance improvement over HR‐based partition for SPEC2000 benchmarks. This result suggests that graph‐based thread partition approach is effective for thread partition in speculative multithreading.

show abstract

A New GCC Plugin-Based Compiler Pass to Add Support for Thread-Level Speculation into OpenMP

Cited by 3 publications

References 21 publications

BFCA+: automatic synthesis of parallel code with TLS capabilities

BFCA+: automatic synthesis of parallel code with TLS capabilities

A Survey on Thread-Level Speculation Techniques

GbA: A graph‐based thread partition approach in speculative multithreading

Contact Info

Product

Resources

About