一种新的硬件支持的全局同步单元的灵敏度分析

E. Lynch, G. Riley
{"title":"一种新的硬件支持的全局同步单元的灵敏度分析","authors":"E. Lynch, G. Riley","doi":"10.1109/MASCOT.2009.5367047","DOIUrl":null,"url":null,"abstract":"Historically, large-scale low-lookahead parallel simulation has been a difficult problem. As a solution, we have designed a Global Synchronization Unit (GSU) that would reside centrally on a multi-core chip and asynchronously compute the Lower Bound on Time Stamps (LBTS), the minimum timestamp of all unprocessed events in the simulation, on demand to synchronize conservative parallel simulators. Our GSU also accounts for transient messages, messages that have been sent but not yet processed by their recipient, eliminating the need for the simulator to acknowledge received messages. In this paper we analyze the sensitivity of simulation performance to the time required to access the GSU. The sensitivity analysis revealed that with GSU access times as high as hundreds of cycles, there was still a significant performance advantage over the baseline shared-memory implementation.","PeriodicalId":275737,"journal":{"name":"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A sensitivity analysis of a new hardware-supported Global Synchronization Unit\",\"authors\":\"E. Lynch, G. Riley\",\"doi\":\"10.1109/MASCOT.2009.5367047\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Historically, large-scale low-lookahead parallel simulation has been a difficult problem. As a solution, we have designed a Global Synchronization Unit (GSU) that would reside centrally on a multi-core chip and asynchronously compute the Lower Bound on Time Stamps (LBTS), the minimum timestamp of all unprocessed events in the simulation, on demand to synchronize conservative parallel simulators. Our GSU also accounts for transient messages, messages that have been sent but not yet processed by their recipient, eliminating the need for the simulator to acknowledge received messages. In this paper we analyze the sensitivity of simulation performance to the time required to access the GSU. The sensitivity analysis revealed that with GSU access times as high as hundreds of cycles, there was still a significant performance advantage over the baseline shared-memory implementation.\",\"PeriodicalId\":275737,\"journal\":{\"name\":\"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.2009.5367047\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2009.5367047","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

长期以来,大规模低前瞻并行仿真一直是一个难题。作为一种解决方案,我们设计了一个全局同步单元(GSU),它将驻留在多核芯片上,并根据需要异步计算时间戳下限(LBTS),即仿真中所有未处理事件的最小时间戳,以同步保守并行模拟器。我们的GSU还考虑了瞬态消息,即已发送但尚未被接收方处理的消息,从而消除了模拟器确认接收消息的需要。在本文中,我们分析了仿真性能对访问GSU所需时间的敏感性。灵敏度分析显示,即使GSU访问时间高达数百个周期,仍然比基线共享内存实现具有显著的性能优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A sensitivity analysis of a new hardware-supported Global Synchronization Unit
Historically, large-scale low-lookahead parallel simulation has been a difficult problem. As a solution, we have designed a Global Synchronization Unit (GSU) that would reside centrally on a multi-core chip and asynchronously compute the Lower Bound on Time Stamps (LBTS), the minimum timestamp of all unprocessed events in the simulation, on demand to synchronize conservative parallel simulators. Our GSU also accounts for transient messages, messages that have been sent but not yet processed by their recipient, eliminating the need for the simulator to acknowledge received messages. In this paper we analyze the sensitivity of simulation performance to the time required to access the GSU. The sensitivity analysis revealed that with GSU access times as high as hundreds of cycles, there was still a significant performance advantage over the baseline shared-memory implementation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信