Randomizing task placement does not randomize traffic (enough)

Ana Jokanovic, B. Prisacari, G. Rodríguez, C. Minkenberg
{"title":"Randomizing task placement does not randomize traffic (enough)","authors":"Ana Jokanovic, B. Prisacari, G. Rodríguez, C. Minkenberg","doi":"10.1145/2482759.2482762","DOIUrl":null,"url":null,"abstract":"Dragonflies are one of the most promising topologies for the Exascale effort for their scalability and cost. Dragonflies achieve very high throughput under uniform traffic, but have a pathological behavior under other regular traffic patterns, some of them very common in HPC applications. A recent study showed that randomization of task placement can make pathological, regular (multi-dimensional stencil) traffic patterns behave similar to uniform traffic.\n In this work we provide a theoretical model that is able to predict the expected performance of a generic dragonfly network under uniform traffic and characterize performance-optimal dragonflies. We then analyze whether this model can be extended to other patterns by means of benchmarking the performance of multiple such patterns under both contiguous and randomized task placement. We conclude that, although in comparison with contiguous task placement, randomization does lead to a significant improvement in performance for pathological communication patterns, this performance is not on par with that of uniform traffic, but rather half of it.","PeriodicalId":142364,"journal":{"name":"IMA-OCMC '13","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IMA-OCMC '13","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2482759.2482762","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Dragonflies are one of the most promising topologies for the Exascale effort for their scalability and cost. Dragonflies achieve very high throughput under uniform traffic, but have a pathological behavior under other regular traffic patterns, some of them very common in HPC applications. A recent study showed that randomization of task placement can make pathological, regular (multi-dimensional stencil) traffic patterns behave similar to uniform traffic. In this work we provide a theoretical model that is able to predict the expected performance of a generic dragonfly network under uniform traffic and characterize performance-optimal dragonflies. We then analyze whether this model can be extended to other patterns by means of benchmarking the performance of multiple such patterns under both contiguous and randomized task placement. We conclude that, although in comparison with contiguous task placement, randomization does lead to a significant improvement in performance for pathological communication patterns, this performance is not on par with that of uniform traffic, but rather half of it.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
随机任务布置不能随机化流量(足够)
蜻蜓是Exascale项目中最有前途的拓扑之一,因为它具有可扩展性和成本。蜻蜓在均匀流量下可以实现非常高的吞吐量,但在其他规则流量模式下会出现病态行为,其中一些在高性能计算应用中非常常见。最近的一项研究表明,任务放置的随机化可以使病态的、规则的(多维模板)交通模式表现得与均匀交通相似。在这项工作中,我们提供了一个理论模型,能够预测均匀流量下通用蜻蜓网络的预期性能,并表征性能最优的蜻蜓。然后,我们通过对多个此类模式在连续和随机任务布置下的性能进行基准测试,分析该模型是否可以扩展到其他模式。我们得出的结论是,尽管与连续任务放置相比,随机化确实导致病态通信模式的性能显著提高,但这种性能与均匀流量的性能相比并不相同,而是一半。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
NBTI-aware design of NoC buffers A fast algorithm for runtime reconfiguration to maximize the lifetime of nanoscale NoCs Arbitration of many thousand flows at 100G and beyond Randomizing task placement does not randomize traffic (enough) Global misrouting policies in two-level hierarchical networks
×
引用
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