A Combined Data and Program Partitioning Algorithm for Distributed Memory Multiprocessors
この論文をさがす
説明
In this paper we propose an algorithm to perform data partitioning and program partitioning simultaneously on an intermediate representation for parallelizing compilers which we have proposed the Data Partitioning Graph. Conventional and therefore conservative parallelizing compilers usually activate program partitioning prior to data partitioning. However on distributed memory multiprocessors it is quite difficult to partition a program effectively with consideration of data partitioning since communication costs change depending on a data partitioning and distribution decision. The proposed algorithm resolves this conflict by handling these inseparable partitioning problems simultaneously with and A* algorithm.
In this paper we propose an algorithm to perform data partitioning and program partitioning simultaneously on an intermediate representation for parallelizing compilers which we have proposed, the Data Partitioning Graph. Conventional and, therefore, conservative parallelizing compilers usually activate program partitioning prior to data partitioning. However, on distributed memory multiprocessors it is quite difficult to partition a program effectively with consideration of data partitioning since communication costs change depending on a data partitioning and distribution decision. The proposed algorithm resolves this conflict by handling these inseparable partitioning problems simultaneously with and A* algorithm.
収録刊行物
-
- 情報処理学会論文誌数理モデル化と応用（TOM）
-
情報処理学会論文誌数理モデル化と応用（TOM） 40 (SIG09(TOM2)), 30-41, 1999-12-15
東京 : 情報処理学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1050001337891814016
-
- NII論文ID
- 110002725208
-
- NII書誌ID
- AA11464803
-
- ISSN
- 18827780
- 03875806
-
- NDL書誌ID
- 5699062
-
- 本文言語コード
- en
-
- 資料種別
- article
-
- データソース種別
-
- IRDB
- NDL
- CiNii Articles
