FAST: a functional algorithm simulation testbed

M. Dikaiakos, Anne Rogers, K. Steiglitz
{"title":"FAST: a functional algorithm simulation testbed","authors":"M. Dikaiakos, Anne Rogers, K. Steiglitz","doi":"10.1109/MASCOT.1994.284432","DOIUrl":null,"url":null,"abstract":"We extend the practical range of simulations of parallel executions by \"functional algorithm simulation,\" that is, simulation without actually performing most of the numerical computations involved. We achieve this by introducing a new approach for generating and collecting communication and computation characteristics for a class of parallel scientific algorithms. We describe FAST (Fast Algorithm Simulation Testbed), a prototype system that we developed to implement and test our approach. FAST overcomes some of the difficulties imposed by the very high complexity of interesting scientific algorithms, collects profile information representative of the algorithms rather than the underlying mapping strategies and hardware design choices, and allows a performance assessment of parallel machines with various sites and different interconnection schemes.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"222 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.1994.284432","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

Abstract

We extend the practical range of simulations of parallel executions by "functional algorithm simulation," that is, simulation without actually performing most of the numerical computations involved. We achieve this by introducing a new approach for generating and collecting communication and computation characteristics for a class of parallel scientific algorithms. We describe FAST (Fast Algorithm Simulation Testbed), a prototype system that we developed to implement and test our approach. FAST overcomes some of the difficulties imposed by the very high complexity of interesting scientific algorithms, collects profile information representative of the algorithms rather than the underlying mapping strategies and hardware design choices, and allows a performance assessment of parallel machines with various sites and different interconnection schemes.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
FAST:一个功能算法仿真试验台
我们通过“功能算法模拟”扩展了并行执行模拟的实际范围,也就是说,不实际执行所涉及的大多数数值计算的模拟。我们通过引入一种新的方法来生成和收集一类并行科学算法的通信和计算特征来实现这一目标。我们描述了FAST(快速算法仿真试验台),这是我们开发的一个原型系统,用于实现和测试我们的方法。FAST克服了一些由有趣的科学算法的非常高的复杂性所带来的困难,收集了代表算法的概要信息,而不是底层的映射策略和硬件设计选择,并允许对具有各种站点和不同互连方案的并行机器进行性能评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Time constrained message transmission in a LAN environment Approximate analysis of a multi-class open queueing network with class blocking and push-out Evaluating memory system performance of a large scale NUMA multiprocessor Efficient technique for performance analysis of locking protocols A maximum entropy analysis of the single server queue
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1