期刊文献+

分布式系统中数据分解的研究 被引量:2

Study of Data Decomposition in Distributed Shared Memory System
下载PDF
导出
摘要 数据分解对消息传递并行机下的并行编译器取得高性能至关重要。根据编译器自动得出的数据分解(映射数据到处理机)信息,C语言版本的发送/接收消息循环嵌套可产生出来,从而在处理机之间实现分布数据。不仅一个已被证明且功能强大的数学模型用于产生数据分解代码,而且一个形式化的算法及其实现也已给出。初步实验结果显示该算法能显著提高性能。 Data decomposing is crucial for parallelizing compilers for message-passing parallel machines to achieve high performance. The data decomposition (mapping data onto processors) analysis is automatically from compiler, loop nests in C for arrays that needed to be distributed to send and receive messages between processors are generated, Not only a proven and powerful mathematical model is put into the use of generating code of data decomposition, but also a formal specification of the algorithm as well as its implementation is given. Preliminary experimental results indicate that the algorithm significantly improves the performance.
出处 《计算机工程》 EI CAS CSCD 北大核心 2006年第11期114-115,132,共3页 Computer Engineering
关键词 并行编译器 消息传递 线性不等式 数据分解 Parallelizing compilers Message-passing Linear inequalities Data decomposition
  • 相关文献

参考文献4

  • 1Ferner C S. The Paraguin Compiler_Message-passing Code Generation Using SUIF[C]. Proceedings of the IEEE Southeast Con.Columbia, SC, 2002-04.
  • 2Anderson J M, Lam M S. Global Optimizations for Parallelism and Locality on Scalable Parallel Machines[C]. Proceedings of the SIGPLAN'93 Conference on Program Language Design and Implementation, 1993-06.
  • 3Amarasinghe S P. Arallelizing Compiler Techniques Based on Linear Inequalities[D]. University of Stanford, 1997.
  • 4Amarasinghe S P, Lam M S. Communication Optimization and Code Generation for Distributed Memory Machines[C]. Proc. of the ACM SIGPLAN'93 Conference on Programming Language Design and Implementation, Albuquerque, 1993-06.

同被引文献4

  • 1Amarasinghe S P, Lain M S. Communication Optimization and Code Generation for Distributed Memory Machines[C].Proc. of the ACM SIGPLAN'93 Conference on Programming Language Design and Implementation. Albuquerque, New Mexico: [s. n.], 1993: 126-138.
  • 2Saman P A. Parallelizing Compiler Techniques Based on Linear Inequalities[D]. California, USA: Stanford University, 1997.
  • 3Schrijiver A. Theory of Linear and Integer Programming[M]. New Jersey Turnpike: Wiley-Chichester, 1986: 36-43.
  • 4Anderson J A M. Automatic Computation and Data Decomposition for Multiprocessors[D]. California: Stanford University, 1997.

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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