| 引用本文: | 孙安香,张理论,宋君强.并行计算的数据重分配.[J].国防科技大学学报,2002,24(4):33-36.[点击复制] |
| SUN Anxiang,ZHANG Lilun,SONG Junqiang.Data Redistribution of Parallel Computing[J].Journal of National University of Defense Technology,2002,24(4):33-36[点击复制] |
|
| |
|
|
| 本文已被：浏览 7404次 下载 6416次 |
| 并行计算的数据重分配 |
| 孙安香, 张理论, 宋君强 |
|
(国防科技大学 计算机学院，湖南 长沙 410073)
|
| 摘要: |
| 为提高算法的并行计算性能，许多并行程序必须进行数据重分配。数据重分配是在并行计算过程中实现的，其开销影响算法的并行性能，高效的数据重分配对提高并行计算的性能有重要意义。本文阐述了数据重分配的环形算法；提出了数据重分配的蝶网算法，并证明了其正确性；设计了结构性数据交换方法；通过理论和数值实验分析了两种算法的性能。 |
| 关键词: 并行计算 数据重分配 环形算法 蝶网算法 结构性数据交换 |
| DOI： |
| 投稿日期：2002-03-12 |
| 基金项目:国家863高技术项目资助(306-ZD01-03-4) |
|
| Data Redistribution of Parallel Computing |
| SUN Anxiang, ZHANG Lilun, SONG Junqiang |
|
(College of Computer, National Univ. of Defense Technology, Changsha 410073, China)
|
| Abstract: |
| Data redistribution is necessary to enhance the algorithm performance in many parallel programs.Since data redistribution is performed at run-time,the cost of redistributing data among processors affects the performance of algorithm.High performance data redistribution is important for the parallel program.Butterfly algorithm for data redistribution of parallel computing is put forward in the paper.We have proved the correctness of the algorithm.Structured data transposition is designed.The performance is analyzed both theoretically and numerically. |
| Keywords: parallel computing data redistribution circle algorithm butterfly algorithm structured data transposition. |
|
|
