A Latency-Hiding Algorithm for ABMS on Parallel/Distributed Computing Environment

Lili Chen, Jianwen Huang, Jing Zhang
{"title":"A Latency-Hiding Algorithm for ABMS on Parallel/Distributed Computing Environment","authors":"Lili Chen, Jianwen Huang, Jing Zhang","doi":"10.1109/PADS.2012.2","DOIUrl":null,"url":null,"abstract":"A latency-hiding algorithm for the parallelization of large scale agent-based model simulations (ABMS) on parallel/distributed computing platform is proposed. The key idea of this algorithm is using redundant computations to hide communication latencies. An analytical model for this algorithm is presented to tell how to select R value to reach the best speedup. Compared to B+2R algorithm [1], theoretical analysis and experimental result show that the algorithm proposed in this paper has the following advantages when running on CPU cluster: 1) it can hide more communication latency, 2) a smaller R can satisfy the best communication latency hiding.","PeriodicalId":299627,"journal":{"name":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PADS.2012.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

A latency-hiding algorithm for the parallelization of large scale agent-based model simulations (ABMS) on parallel/distributed computing platform is proposed. The key idea of this algorithm is using redundant computations to hide communication latencies. An analytical model for this algorithm is presented to tell how to select R value to reach the best speedup. Compared to B+2R algorithm [1], theoretical analysis and experimental result show that the algorithm proposed in this paper has the following advantages when running on CPU cluster: 1) it can hide more communication latency, 2) a smaller R can satisfy the best communication latency hiding.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
并行/分布式计算环境下ABMS的延迟隐藏算法
提出了一种用于并行/分布式计算平台上大规模基于agent的模型仿真(ABMS)并行化的延迟隐藏算法。该算法的核心思想是利用冗余计算来隐藏通信延迟。给出了该算法的解析模型,说明如何选择R值以达到最佳加速。理论分析和实验结果表明,与B+2R算法相比[1],本文提出的算法在CPU集群上运行时具有以下优点:1)可以隐藏更多的通信延迟,2)较小的R可以满足最佳的通信延迟隐藏。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Virtual Time Integration of Emulation and Parallel Simulation A Bug Locating Method for the Debugging of Parallel Discrete Event Simulation Characterizing and Understanding PDES Behavior on Tilera Architecture Exploiting Sensor Spatial Correlation for Dynamic Data Driven Simulation of Wildfire Partitioning on Dynamic Behavior for Parallel Discrete Event Simulation
×
引用
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