当“颗粒大小”不重要时

M. Carter, N. Nayar, J. Gustafson, D. Hoffman, D. Kouri, O. Sharafeddin
{"title":"当“颗粒大小”不重要时","authors":"M. Carter, N. Nayar, J. Gustafson, D. Hoffman, D. Kouri, O. Sharafeddin","doi":"10.1109/DMCC.1991.633317","DOIUrl":null,"url":null,"abstract":"We describe insights gained from putting a quantum scattering problem on two very different parallel architectures: MasPar MP-I (massively parallel) and nCUBE 2 (moderately parallel). Our nearly trivial port from the SIMD MasPar to the MIMD nCUBE demonstrates that it is not categorically difficult to move software from one parallel architecture class to another. These machines show widely different processor and problem grain sizes. Their performance is strikingly similar on mal l problems, a fact not predicted by machine grain size, problem grain size, or peak speed comparisons. We introduce a new metric, fixed-time efficiency, that correlates very well with our experiments and has predictive value. Data and control decomposition and communication considerations are analyzed for each machine.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"When \\\"Grain Size\\\" Doesn't Matter\",\"authors\":\"M. Carter, N. Nayar, J. Gustafson, D. Hoffman, D. Kouri, O. Sharafeddin\",\"doi\":\"10.1109/DMCC.1991.633317\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe insights gained from putting a quantum scattering problem on two very different parallel architectures: MasPar MP-I (massively parallel) and nCUBE 2 (moderately parallel). Our nearly trivial port from the SIMD MasPar to the MIMD nCUBE demonstrates that it is not categorically difficult to move software from one parallel architecture class to another. These machines show widely different processor and problem grain sizes. Their performance is strikingly similar on mal l problems, a fact not predicted by machine grain size, problem grain size, or peak speed comparisons. We introduce a new metric, fixed-time efficiency, that correlates very well with our experiments and has predictive value. Data and control decomposition and communication considerations are analyzed for each machine.\",\"PeriodicalId\":313314,\"journal\":{\"name\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"volume\":\"82 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Sixth Distributed Memory Computing Conference, 1991. Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DMCC.1991.633317\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1991.633317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们描述了将量子散射问题放在两个非常不同的并行架构上所获得的见解:MasPar MP-I(大规模并行)和nCUBE 2(适度并行)。我们从SIMD MasPar到MIMD nCUBE几乎微不足道的移植表明,将软件从一个并行体系结构类移动到另一个并行体系结构类并不是绝对困难的。这些机器显示出不同的处理器和问题颗粒大小。它们在正常问题上的性能惊人地相似,这是机器粒度、问题粒度或峰值速度比较无法预测的事实。我们引入了一个新的度量,固定时间效率,它与我们的实验非常相关,具有预测价值。分析了每台机器的数据和控制分解以及通信考虑因素。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
When "Grain Size" Doesn't Matter
We describe insights gained from putting a quantum scattering problem on two very different parallel architectures: MasPar MP-I (massively parallel) and nCUBE 2 (moderately parallel). Our nearly trivial port from the SIMD MasPar to the MIMD nCUBE demonstrates that it is not categorically difficult to move software from one parallel architecture class to another. These machines show widely different processor and problem grain sizes. Their performance is strikingly similar on mal l problems, a fact not predicted by machine grain size, problem grain size, or peak speed comparisons. We introduce a new metric, fixed-time efficiency, that correlates very well with our experiments and has predictive value. Data and control decomposition and communication considerations are analyzed for each machine.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信