PARTITIONING AND MAPPING OF NESTED LOOPS FOR LINEAR-ARRAY MULTICOMPUTERS

NCU Institutional Repository > 資訊電機學院 > 電機工程研究所 > 期刊論文 > Item 987654321/29394

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29394

題名:	PARTITIONING AND MAPPING OF NESTED LOOPS FOR LINEAR-ARRAY MULTICOMPUTERS
作者:	SHEU,JP;CHEN,TS
貢獻者:	電機工程研究所
關鍵詞:	MULTIPROCESSOR SYSTEMS;PARALLEL
日期:	1995
上傳時間:	2010-06-29 20:23:38 (UTC+8)
出版者:	中央大學
摘要:	In distributed-memory multicomputers, minimizing interprocessor communication is the key to the efficient execution of parallel programs. In order to reduce the amount of communication overhead, parallel programs on multicomputers must be carefully scheduled by parallelizing compilers. This paper proposes some compilation techniques for partitioning and mapping nested loops with constant data dependences onto linear array multicomputers. First, a systematic partition strategy is proposed to project an n-dimensional computational structure, representing an n-nested loop, onto a line to form a one-dimensional projected structure with low communication overhead. Then, a mapping algorithm is proposed for mapping the partitioned loops onto linear arrays in a way that balances the workload and minimizes the communication cost among processors. Finally, parallel execution codes can be automatically generated for such linear array multicomputers.
關聯:	JOURNAL OF SUPERCOMPUTING
顯示於類別:	[電機工程研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	579	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing