期刊文献+

分布式系统中数据分解代码的自动产生

Automatic Code Generation of Data Decomposition in Distributed Shared Memory System
下载PDF
导出
摘要 为分布内存系统开发的并行编译器碰到的第一个问题就是如何分解一个应用程序中的数据。由于访问非本地节点上数据的代价是昂贵的,所以数据分解必须仔细考虑。尽管数据分解的定义已被提出,但是文献并没有给出相应的算法.本文介绍了在一个已被证明且功能强大的数学模型下如何产生数据分解代码的算法,并在SUIF(Stanforduniversityintermediateformat)系统中的Paraguin编译器上得到实现。 The fist problem of developing parallelizing compiler in DSM(Distributed Shared Memory) system is how to decompose the data of a program.. The non-local data accesses result in communication that can greatly impact performance, thus the mapping or decomposition of data must be carefully considered. Although a concept of data decomposition has been introduced in previous work,the algorithm was not shown. In this paper, an algorithm to decompose data based on a proven and powerful mathematical model is introduced and is implemented in Paraguin compiler of SUIF.
出处 《微计算机信息》 北大核心 2005年第10X期156-157,189,共3页 Control & Automation
基金 河士南省杰出人才创新基金 项目编号0521000200
关键词 并行编译器 消息传递 不等式多面体系统 数据分解 Parallelizing compilers Message passing Datadecomposition Linear inequalities
  • 相关文献

参考文献5

  • 1S. P. Amarasinghe and M. S. Lam, "Communication optimization and Code Generation for distributed memory machines," In the Proc. of The ACM SIGPLAN' 93 Conference on Programming Language Design and Implernentation (PLDI), Albuquerque, June 1993.
  • 2Saman Prabhath Amarasinghe "PARALLELIZING COMPILERTECHNIQUES BASED ON LINEAR INEQUALITIES" Ph.D.Thesis,University of Stanford 1997.
  • 3J. M. Anderson and M. S. Lam. Global Optimizations for Parallelism and Locality on Scalable Parallel Machines. InProceedings of the SIGPLAN '93 Conference on Program Language Design and Implementation, June 1993.
  • 4C.S. Ferner, "The Paraguin compiler_Message-passing code generation using SUIF," in the Proceedings of the IEEE SoutheastCon 2002 ,Columbia, SC, April 5-7, 2002.
  • 5A. Schrijver, Theory of Linear and Integer Programming, Wiley,Chichester 1986.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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