Browsing by Author "Lai, GJ"

Now showing 1 - 3 of 3

A new scheduling strategy for NUMA multiprocessor systems
(1996)
Lai, GJ
;
Chen, C
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
An optimized dependence convex hull partitioning technique to maximize parallelism of nested loops with non-uniform dependences
(2000)
Pean, DL
;
Lai, GJ
;
Chen, C
;
資訊工程學系
;
Department of Computer Science
There are many methods existing for nested loop partitioning; however most of them perform poorly when partitioning loops with non-uniform 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 the 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, outperforming the other previous partition mechanisms of nested loops with non-uniform dependences.
New program model for program partitioning on NUMA multiprocessor systems
(1996-11-01)
Lai, GJ
;
Chen, C
;
交大名義發表
;
資訊科學與工程研究所
;
National Chiao Tung University
A new program model is presented to accurately represent parallel programs for partitioning and scheduling problems. This model extends the graphic representation of the macrodataflow by considering the complex communication options supported by NUMA systems. The proposed model shows not only task precedence relations but also data sharing status. Moreover, a new partitioning method based on the proposed model is also developed. Experimental results show that many conventional partitioning algorithms operate more efficiently using the proposed model, and that the proposed algorithm surpasses existing algorithms.