期刊文献+

基于数据空间融合的全局计算与数据划分方法 被引量:7

A Data Space Fusion Based Approach for Global Computation and Data Decompositions
下载PDF
导出
摘要 计算与数据划分问题是影响并行程序在分布主存多处理机中执行性能的重要因素,也是并行编译优化的重点.针对该问题,提出了一套关于数据空间融合的理论框架,并基于该框架给出了一种有效的全局计算与数据划分方法,用于分布主存计算环境中的计算与数据划分问题的求解.该方法能够尽量开发计算空间的并行度,利用数据融合技术优化数据分布,并能搜寻优化的全局计算与数据划分.该方法还能很自然地与数据复制以及偏移常量的对准结合在一起,从而使得数据通信量尽可能地小.实验结果表明了所提出方法的有效性. Computation and data decompositions are key factors of affecting the performance of parallel programs running on distributed memory multicomputers. This paper presents a theoretical framework of data space fusion and an effective global computation and data decomposition approach based on it, which can be used to solve computation and data decomposition problems on distributed memory multicomputers. The approach can exploit the parallelism of computation space as high as possible, use the technique of data space fusion to optimize data distribution, and search the optimizing global computation and data decompositions. The approach can also be integrated with data replication and offset alignment naturally, and therefore can make the communication overhead as low as possible. Experimental results show that the approach presented in the paper is effective.
作者 夏军 杨学军
出处 《软件学报》 EI CSCD 北大核心 2004年第9期1311-1327,共17页 Journal of Software
基金 国家自然科学基金~~
关键词 分布主存多处理机 并行编译器 计算划分 数据划分 数据融合 distributed memory multicomputer parallel compiler computation decomposition data decomposition data fusion
  • 相关文献

参考文献14

  • 1[1]Chen TS, Chang CY. Skewed data partition and alignment techniques for compiling programs on distributed memory multicomputers. The Journal of Supercomputing 2002,21 (2): 191~211.
  • 2[2]Chang WL, Chu CP, Wu JH. Communication-Free alignment for array references with linear subscripts in three loop index variables or quadratic subscripts. The Journal of Supercomputer; 2001,20(1):67~83.
  • 3[3]Shih KP, Sheu JP, Huang CH. Statement-Level communication-free partitioning technique for parallelizing compilers. The Journal of Supercomputing, 2000,15(3):243~269.
  • 4[4]Lim AW. Improve parallelism and data locality with affine partitioning[Ph.D. Thesis]. Palo Alto: Stanford University, 2001.
  • 5[5]Chen TS, Sheu JP. Communication-Free data allocation techniques for parallelizing compilers on multicomputers. IEEE Trans on Parallel and Distributed Systems, 1994,5(9):924~938.
  • 6[6]Ramanujam J, Sadayappan P. Compile-Time techniques for data distribution in distributed memory machines IEEE Trans. on Parallel and Distributed systems, 1991,2(4):472~482.
  • 7[7]Huang CH, Sadayappan P. Communication-Free hyperplane partitioning of nested loops. Journal of Parallel ard Distributed Computing, 1993,19(2):90~102.
  • 8[8]Wolf M. High Performance Compilers for Parallel Computing. Redwood Addison-Wesley Publishing Company, 1996. 137~510.
  • 9[9]Wolf M, Lam M. A data locality optimizing algorithm. In: Mauney J, ed. Proc. of the SIGPLAN'91 Conf. on Programming Language Design and Implementation. New York: ACM Press, 1991.30~44.
  • 10[10]Shen ZY, Hu ZA, Liao XK, Wu HP, Zhao KJ, Lu YT. Methods of Parallel Compilation. Beijing: National Defence Industry Press,2000.31~127 (in Chinese).

同被引文献92

引证文献7

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部