Turkish Journal of Electrical Engineering and Computer Sciences
DOI
10.3906/elk-1712-374
Abstract
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.
Keywords
Automatic parallelization, parallel programming, source-to-source compilation, data dependency profiling, parallelism assessment, benchmarking
First Page
2595
Last Page
2604
Recommended Citation
DEBBI, AIMAD EDDINE and BAKHTI, HADDI
(2018)
"Incremental Banerjee test conditions committing for robust parallelization framework,"
Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 26:
No.
5, Article 35.
https://doi.org/10.3906/elk-1712-374
Available at:
https://journals.tubitak.gov.tr/elektrik/vol26/iss5/35
Included in
Computer Engineering Commons, Computer Sciences Commons, Electrical and Computer Engineering Commons