ODCHP: a new effective mechanism to maximize parallelism of nested loops with non-uniform dependences
Simple item page Statistics| Field | Value | Language |
|---|---|---|
dc.citation.epage |
297 | en_US |
dc.citation.issue |
3 | en_US |
dc.citation.spage |
279 | en_US |
dc.citation.volume |
56 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Pean, DL | en_US |
dc.contributor.author |
Chen, C | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:44:03Z | |
dc.date.available |
2014-12-08T15:44:03Z | |
dc.date.issued |
2001-03-15 | en_US |
dc.description.abstract |
There are many methods for nested loop partitioning. However, most of them perform poorly when partitioning loops with nonuniform dependences. This paper proposes a generalized and optimized loop partitioning mechanism to exploit parallelism from nested loops with non-uniform dependences. Our approach, based on dependence convex theory, will divide the loop into variable size partitions. Furthermore, the proposed algorithm partitions a nested loop by using the copy-renaming and the optimized partitioning techniques to minimize the number of parallel regions of the iteration space. Consequently, it outperforms the previous partitioning mechanisms of nested loops with non-uniform dependences. Many optimization techniques are used to reduce the complexity of the algorithm. Compared with other popular techniques, our scheme shows a dramatic improvement in the preliminary performance results. (C) 2001 Elsevier Science Inc. All rights reserved. | en_US |
dc.identifier.doi |
10.1016/S0164-1212(00)00103-5 | en_US |
dc.identifier.issn |
0164-1212 | en_US |
dc.identifier.journal |
JOURNAL OF SYSTEMS AND SOFTWARE | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/S0164-1212(00)00103-5 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/29770 | |
dc.identifier.wosnumber |
WOS:000167683000006 | |
dc.language.iso |
en_US | en_US |
dc.subject |
compilers | en_US |
dc.subject |
non-uniform dependence | en_US |
dc.subject |
loop parallelization | en_US |
dc.subject |
parallel compiler | en_US |
dc.subject |
parallel processing | en_US |
dc.subject |
dependence convex hull | en_US |
dc.title |
ODCHP: a new effective mechanism to maximize parallelism of nested loops with non-uniform dependences | en_US |
dc.type |
Article | en_US |
Files
- 000167683000006.pdf (2.50 MB, Adobe PDF)
Collections: Articles
Cite this item
Pean, D., & Chen, C. (2001). ODCHP: a new effective mechanism to maximize parallelism of nested loops with non-uniform dependences. JOURNAL OF SYSTEMS AND SOFTWARE, 56(3), 279–297. https://doi.org/10.1016/S0164-1212(00)00103-5
Citation generated in APA 7th edition style; please check it before use.
Share
Permanent link: https://ir.lib.nycu.edu.tw/handle/11536/29770