Exclusive squashing for thread-level speculation

García-Yágüez, Álvaro; Llanos, Diego R.; González-Escribano, Arturo

doi:10.1145/1996130.1996172

Cited by 3 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…also proposed a solution that does not discard all the produced values, only a small part of them. Also, [García-Yágüez et al 2011;Garcia-Yaguez et al 2014] developed a software-only version of this idea, with the help of a list that stores which threads have consumed a value for a particular predecessor. -Perfect squashing: Discards offending threads and those successors that have consumed the incorrect value or any value generated using it.…”

Section: Design Choices Overviewmentioning

confidence: 99%

A Survey on Thread-Level Speculation Techniques

2016

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Design Choices Overviewmentioning

confidence: 99%

A Survey on Thread-Level Speculation Techniques

2016

Self Cite

View full text Add to dashboard Cite

show abstract

“…Tian et al [240] also proposed a solution that does not discard all the produced values, only a small part of them. Also, Garcia et al [97,98] developed a software-only version of this idea, with the help of a list that stores which threads have consumed a value for a particular predecessor.…”

Section: Squashing Alternativesmentioning

confidence: 99%

Design and evaluation of a Thread-Level Speculation runtime library

López¹

View full text Add to dashboard Cite

It is very likely that, in the next years, shared-memory systems with hundreds or even thousands of computational units will become commonplace. Since parallel programming is conceptually difficult, and to take advantage of these platforms, it is desirable to have compiling and/or runtime systems that automatically extract all the available parallelism of a sequential application. Although many parallel processing approaches have been developed in the last decades, most automatic parallelization proposals are focused on codes with no hurdles. Speculative parallelization (SP) techniques arise as a more general solution, allowing the parallel execution of any code, even in the presence of dependence violations. To ensure that, SP approaches rely on a runtime monitor responsible for ensuring that the results of the parallel execution match the expected output of the original, sequential code. This technique, based on the optimistic assumption that no dependences will arise when executing the code in parallel, launches threads that execute different fragments of the sequential code at the same time. If a dependence violation is detected, the offending threads are stopped and restarted with the correct values, thus ensuring that the execution follows sequential semantics. Our contribution in this field includes (1) a new, easy-to-use speculative runtime library; (2) new proposals which allow to decrease the number of memory accesses involved in speculative operations, as well as some advice to decrement the memory footprint; (3) research on new scheduling methods focused on the dynamic management of chunks of iterations in speculative executions; (4) an hybrid approach which implements speculative parallelism using transactional memory to handle its critical sections; and (5) an analysis of the speculative techniques in one of the most state-of-the-art devices as are Intel Xeon Phi coprocessors. Speculative parallelization is a lively research field. Our results show that these techniques have the potential of leading to considerable improvements in the performance of many applications. We expect that this work, among others, will foster the use of SP-based solutions in commercial compilers and shared-memory parallel programming models.

show abstract