<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

20012

Settings

🏛️國立陽明交通大學機構典藏

Author: search.filters.author.Chen, CSubject: search.filters.subject.loop parallelization

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item type:Item,
    ODCHP: a new effective mechanism to maximize parallelism of nested loops with non-uniform dependences
    (2001-03-15)
    Pean, DL
    ;
    Chen, C
    ;
    資訊工程學系
    ;
    Department of Computer Science
    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.
  • Thumbnail Image
    Item type:Item,
    An optimized three region partitioning technique to maximize parallelism of nested loops with non-uniform dependences
    (2001-05-01)
    Pean, DL
    ;
    Chen, C
    ;
    資訊工程學系
    ;
    Department of Computer Science
    There are many methods for nested loop partitioning exist: however. most of them perform poorly when they partition loops with non-uniform dependences. This paper proposes a generalized and optimized loop partitioning mechanism which can exploit parallelism in nested loops with non-uniform dependences. Our approach based on the region partitioning technique divides the loop into variable size partitions. Furthermore, the proposed algorithm partitions a nested loop using the copy-renaming and optimized partitioning techniques so as to minimize the serial part of the iteration space. Thus, it out performs previous partition mechanisms for nested loops with non-uniform dependences. Compared with other popular techniques, our scheme shows dramatic improve ment in preliminary performance results.