標題: ODCHP: a new effective mechanism to maximize parallelism of nested loops with non-uniform dependences
作者: Pean, DL
Chen, C
資訊工程學系
Department of Computer Science
關鍵字: compilers;non-uniform dependence;loop parallelization;parallel compiler;parallel processing;dependence convex hull
公開日期: 15-三月-2001
摘要: 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.
URI: http://dx.doi.org/10.1016/S0164-1212(00)00103-5
http://hdl.handle.net/11536/29770
ISSN: 0164-1212
DOI: 10.1016/S0164-1212(00)00103-5
期刊: JOURNAL OF SYSTEMS AND SOFTWARE
Volume: 56
Issue: 3
起始頁: 279
結束頁: 297
顯示於類別:期刊論文


文件中的檔案:

  1. 000167683000006.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。