Incremental Banerjee test conditions committing for robust parallelization framework
| dc.contributor.author | Haddi, BAKHTI | |
| dc.contributor.author | Aimad Eddine, DEBBI | |
| dc.date.accessioned | 2020-10-26T09:40:27Z | |
| dc.date.available | 2020-10-26T09:40:27Z | |
| dc.date.issued | 2018-05 | |
| dc.description.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 (IR2 ), 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 IR2 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 | en_US |
| dc.identifier.uri | http://dspace.univ-msila.dz:8080//xmlui/handle/123456789/20058 | |
| dc.publisher | Université de M'sila | en_US |
| dc.subject | Automatic parallelization, parallel programming, source-to-source compilation, data dependency profiling, parallelism assessment, benchmarking | en_US |
| dc.title | Incremental Banerjee test conditions committing for robust parallelization framework | en_US |
| dc.type | Article | en_US |