在消息传递并行机器上进行静态数组分区的两种技术

Eric Hung-Yu Tseng, J. Gaudiot
{"title":"在消息传递并行机器上进行静态数组分区的两种技术","authors":"Eric Hung-Yu Tseng, J. Gaudiot","doi":"10.1109/PACT.1997.644018","DOIUrl":null,"url":null,"abstract":"We present two techniques for partitioning arrays in parallel DoAll loops for message-passing parallel machines. (1) Communication-free array partitioning: a general solution of communication-free partitioning is derived for arrays in a DoAll loop. The derivation is based on the Smith normal form decomposition of the matrix which characterizes the array references in a DoAll loop. (2) One block-communication partitioning: when communication-free partitioning is not possible, we derive the partitioning equations which allocate all remote data to a unique processor. Thus, at most one block-communication is required for each processor to obtain the remote data it needs during computation.","PeriodicalId":177411,"journal":{"name":"Proceedings 1997 International Conference on Parallel Architectures and Compilation Techniques","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Two techniques for static array partitioning on message-passing parallel machines\",\"authors\":\"Eric Hung-Yu Tseng, J. Gaudiot\",\"doi\":\"10.1109/PACT.1997.644018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present two techniques for partitioning arrays in parallel DoAll loops for message-passing parallel machines. (1) Communication-free array partitioning: a general solution of communication-free partitioning is derived for arrays in a DoAll loop. The derivation is based on the Smith normal form decomposition of the matrix which characterizes the array references in a DoAll loop. (2) One block-communication partitioning: when communication-free partitioning is not possible, we derive the partitioning equations which allocate all remote data to a unique processor. Thus, at most one block-communication is required for each processor to obtain the remote data it needs during computation.\",\"PeriodicalId\":177411,\"journal\":{\"name\":\"Proceedings 1997 International Conference on Parallel Architectures and Compilation Techniques\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-11-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1997 International Conference on Parallel Architectures and Compilation Techniques\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACT.1997.644018\",\"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 1997 International Conference on Parallel Architectures and Compilation Techniques","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACT.1997.644018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

我们提出了在消息传递并行机器的并行DoAll循环中对数组进行分区的两种技术。(1)无通信阵列分区:推导了DoAll循环中阵列无通信分区的一般解决方案。推导基于矩阵的Smith范式分解,该矩阵表征了DoAll循环中的数组引用。(2)单块通信分区:当无法实现无通信分区时,推导出将所有远程数据分配给唯一处理器的分区方程。因此,每个处理器最多需要一个块通信来获得计算过程中所需的远程数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Two techniques for static array partitioning on message-passing parallel machines
We present two techniques for partitioning arrays in parallel DoAll loops for message-passing parallel machines. (1) Communication-free array partitioning: a general solution of communication-free partitioning is derived for arrays in a DoAll loop. The derivation is based on the Smith normal form decomposition of the matrix which characterizes the array references in a DoAll loop. (2) One block-communication partitioning: when communication-free partitioning is not possible, we derive the partitioning equations which allocate all remote data to a unique processor. Thus, at most one block-communication is required for each processor to obtain the remote data it needs during computation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信