减少时间扭曲开销的技术

M. Chung, Jinsheng Xu
{"title":"减少时间扭曲开销的技术","authors":"M. Chung, Jinsheng Xu","doi":"10.1109/DISRTA.2002.1166894","DOIUrl":null,"url":null,"abstract":"We introduce a technique that reduces the number of state savings and the maximum memory needed for the Time Warp. We present a technique to determine if an event is safe or not. If an event execution is safe, no state saving is carried out. The technique discards some saved states even though the time stamps are larger than the GVT. We prove that the technique is correct under both the aggressive and lazy cancellation scheme. This technique can be implemented with minimal additional overhead. Benchmark results on circuit simulation show that the mechanism can reduce the number of state savings and maximum memory size significantly. The technique is applicable to hardware simulation, network simulation and other systems that have fixed interconnection.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An overhead reducing technique for Time Warp\",\"authors\":\"M. Chung, Jinsheng Xu\",\"doi\":\"10.1109/DISRTA.2002.1166894\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a technique that reduces the number of state savings and the maximum memory needed for the Time Warp. We present a technique to determine if an event is safe or not. If an event execution is safe, no state saving is carried out. The technique discards some saved states even though the time stamps are larger than the GVT. We prove that the technique is correct under both the aggressive and lazy cancellation scheme. This technique can be implemented with minimal additional overhead. Benchmark results on circuit simulation show that the mechanism can reduce the number of state savings and maximum memory size significantly. The technique is applicable to hardware simulation, network simulation and other systems that have fixed interconnection.\",\"PeriodicalId\":375320,\"journal\":{\"name\":\"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DISRTA.2002.1166894\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DISRTA.2002.1166894","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

我们引入了一种技术,可以减少状态节省的数量和Time Warp所需的最大内存。我们提出了一种确定事件是否安全的技术。如果事件执行是安全的,则不执行状态保存。即使时间戳比GVT大,该技术也会丢弃一些保存的状态。证明了该方法在主动抵消和惰性抵消方案下都是正确的。这种技术可以用最小的额外开销来实现。电路仿真的基准测试结果表明,该机制可以显著减少状态节省次数和最大内存大小。该技术适用于硬件仿真、网络仿真及其他具有固定互连的系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An overhead reducing technique for Time Warp
We introduce a technique that reduces the number of state savings and the maximum memory needed for the Time Warp. We present a technique to determine if an event is safe or not. If an event execution is safe, no state saving is carried out. The technique discards some saved states even though the time stamps are larger than the GVT. We prove that the technique is correct under both the aggressive and lazy cancellation scheme. This technique can be implemented with minimal additional overhead. Benchmark results on circuit simulation show that the mechanism can reduce the number of state savings and maximum memory size significantly. The technique is applicable to hardware simulation, network simulation and other systems that have fixed interconnection.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信