完整後設資料紀錄
DC 欄位語言
dc.contributor.authorPean, DLen_US
dc.contributor.authorLai, GJen_US
dc.contributor.authorChen, Cen_US
dc.date.accessioned2014-12-08T15:27:06Z-
dc.date.available2014-12-08T15:27:06Z-
dc.date.issued2000en_US
dc.identifier.isbn0-7695-0568-6en_US
dc.identifier.urihttp://hdl.handle.net/11536/19328-
dc.description.abstractThere 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.en_US
dc.language.isoen_USen_US
dc.titleAn optimized dependence convex hull partitioning technique to maximize parallelism of nested loops with non-uniform dependencesen_US
dc.typeProceedings Paperen_US
dc.identifier.journalSEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGSen_US
dc.citation.spage367en_US
dc.citation.epage374en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000089422500043-
顯示於類別:會議論文