分布式内存多计算机的数据重映射

C. Chase, A. Reeves
{"title":"分布式内存多计算机的数据重映射","authors":"C. Chase, A. Reeves","doi":"10.1109/SHPCC.1992.232660","DOIUrl":null,"url":null,"abstract":"The fragmented memory model of distributed-memory multicomputers, such as the Intel iPSC and Paragon series of computers, and the Thinking Machines CM-5, introduces significant complexity into the compilation process. Since most conventional programming languages provide a model of a global memory, a distributed-memory compiler must translate all data references to correspond to the fragmented memory on the system hardware. This paper describes a technique called array remapping which can automatically be applied to parallel loops containing arbitrary array subscripts. The compile time and runtime aspects of providing support for remapping are described, and the performance of this implementation of remapping is presented.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"107 5-6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Data remapping for distributed-memory multicomputers\",\"authors\":\"C. Chase, A. Reeves\",\"doi\":\"10.1109/SHPCC.1992.232660\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The fragmented memory model of distributed-memory multicomputers, such as the Intel iPSC and Paragon series of computers, and the Thinking Machines CM-5, introduces significant complexity into the compilation process. Since most conventional programming languages provide a model of a global memory, a distributed-memory compiler must translate all data references to correspond to the fragmented memory on the system hardware. This paper describes a technique called array remapping which can automatically be applied to parallel loops containing arbitrary array subscripts. The compile time and runtime aspects of providing support for remapping are described, and the performance of this implementation of remapping is presented.<<ETX>>\",\"PeriodicalId\":254515,\"journal\":{\"name\":\"Proceedings Scalable High Performance Computing Conference SHPCC-92.\",\"volume\":\"107 5-6\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Scalable High Performance Computing Conference SHPCC-92.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SHPCC.1992.232660\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SHPCC.1992.232660","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

分布式内存多计算机(如Intel iPSC和Paragon系列计算机以及Thinking Machines CM-5)的碎片内存模型给编译过程带来了极大的复杂性。由于大多数传统编程语言都提供了全局内存模型,因此分布式内存编译器必须翻译所有数据引用,以与系统硬件上的碎片内存相对应。本文描述了一种可以自动应用于包含任意数组下标的并行循环的阵列重映射技术。本文描述了对重新映射提供支持的编译时和运行时方面,并给出了这种重新映射实现的性能
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Data remapping for distributed-memory multicomputers
The fragmented memory model of distributed-memory multicomputers, such as the Intel iPSC and Paragon series of computers, and the Thinking Machines CM-5, introduces significant complexity into the compilation process. Since most conventional programming languages provide a model of a global memory, a distributed-memory compiler must translate all data references to correspond to the fragmented memory on the system hardware. This paper describes a technique called array remapping which can automatically be applied to parallel loops containing arbitrary array subscripts. The compile time and runtime aspects of providing support for remapping are described, and the performance of this implementation of remapping is presented.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信