完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Pean, DL | en_US |
dc.contributor.author | Lai, GJ | en_US |
dc.contributor.author | Chen, C | en_US |
dc.date.accessioned | 2014-12-08T15:27:06Z | - |
dc.date.available | 2014-12-08T15:27:06Z | - |
dc.date.issued | 2000 | en_US |
dc.identifier.isbn | 0-7695-0568-6 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/19328 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en_US | en_US |
dc.title | An optimized dependence convex hull partitioning technique to maximize parallelism of nested loops with non-uniform dependences | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS | en_US |
dc.citation.spage | 367 | en_US |
dc.citation.epage | 374 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000089422500043 | - |
顯示於類別: | 會議論文 |