Efficient communication scheduling methods for irregular data redistribution in parallelizing compilers

Tunghai University Institutional Repository > 工學院 > 電機工程學系所 > 會議論文 > Item 310901/21822

請使用永久網址來引用或連結此文件: http://140.128.103.80:8080/handle/310901/21822

題名:	Efficient communication scheduling methods for irregular data redistribution in parallelizing compilers
作者:	Chen, S.-C., Hsu, C.-H., Lan, C.-Y., Yang, C.-T., Li, K.-C.
貢獻者:	Department of Computer Science and Information Engineering, Tunghai University
關鍵詞:	Algorithms;Arrays;Computation theory;Computer simulation;Costs;Data mining;Phase separation;Program compilers;Program processors;Scheduling
日期:	2005-09-05
上傳時間:	2013-05-15T09:06:17Z (UTC)
出版者:	Krasnoyarsk; Russian Federation
摘要:	Irregular array redistribution has been paid attention recently since it can distribute different size of data segment to processors according to their own computation ability. It's also the reason why it has been kept an eye on load balance. In this work, we present a two-phase degree-reduction (TPDR) method for scheduling HPF2 irregular data redistribution. An extended algorithm based on TPDR is also presented. Effectiveness of the proposed methods not only avoids node contention but also shortens the overall communication length. To evaluate the performance of our methods, we have implemented both algorithms along with the divide-and-conquer algorithm. The simulation results show improvement of communication costs. ? Springer-Verlag Berlin Heidelberg 2005.
關聯:	Lecture Notes in Computer Science 3606 , pp. 216-225
顯示於類別:	[電機工程學系所] 會議論文

文件中的檔案:

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

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