Dynamically Spawning Speculative Threads to Improve Speculative Path Execution

Li, Meirong; Zhao, Yang; Tao, You

doi:10.1007/978-3-319-11194-0_15

Cited by 1 publication

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Usually, they concentrate the dealing on loops regions and make loops iterations spread over threads. Some proposed techniques for making privatization successful [20][21][22], while others suggested threads speculations algorithms [18,19,23]. Unlike polyhedral tools [24], the parallelization compiler that we have built is not restricted to only certain code regions satisfying some exigencies and conditions.…”

Section: Introductionmentioning

confidence: 99%

Incremental Banerjee test conditions committing for robust parallelization framework

Debbi¹,

Bakhti²

2018

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

This paper describes the design of an automatic parallelization framework. The kernel supplied at its front end was suggested as an instrument for parallel potential assessment. It was used to measure the maximum achievable speedups in the major set of the CHStone benchmark suite programs. In such framework, we suggested the liberation of parallelism incrementally. We proposed a data dependency heuristic-based transformation method to make true dependences dissociation. We generated an internal representation (IR 2), where the Banerjee test conditions are met. Two among three of Banerjee test conditions came to be committed. In shared memory many/multicore platforms, the third condition could be satisfied by privatization. We would be able to choose the safe and the opportune pairwise (mapping-privatization) scheme among a number of threads mapping scenarios that become available in the IR 2 structure. Instrumentation on a subset of CHStone benchmark was carried out as a validity proof of our proposal, and the results confirmed that our framework kernel is robust.

show abstract