虚拟时间 III,第 3 部分:节流和信息取消

IF 0.7 4区 计算机科学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
David R. Jefferson, Peter D. Barnes
{"title":"虚拟时间 III,第 3 部分:节流和信息取消","authors":"David R. Jefferson, Peter D. Barnes","doi":"10.1145/3678173","DOIUrl":null,"url":null,"abstract":"\n This is\n Part 3\n of a trio of papers that unify in a natural way the two historically distinct parallel discrete event synchronization paradigms, optimistic and conservative, combining the best properties of both into a single framework called\n Unified Virtual Time (UVT)\n . In this part we survey the synchronization effects that can be achieved by restricting to corner cases the relationships permitted among the control variables,\n GVT\n ,\n CVT\n ,\n TVT\n , and\n LVT\n , which were defined in\n Part 1\n . We also survey various throttling policies from the literature and describe how they can be implemented in UVT by controlling the value of\n TVT\n , including policies that can take advantage of rollback in addition to LP blocking. A significant result is a new category of efficient and higher precision throttling algorithms for optimistic execution that are based on\n optimistic lookahead\n , defined in a way that is symmetric to what we now call the\n conservative lookahead\n information that is traditionally used for conservative synchronization. Finally, we present a novel algorithm allowing the choice between lazy and aggressive cancellation to be made on a message-by-message basis using either external logic expressed in the model code, or policy code internal to the simulator, or a mixture of both.\n","PeriodicalId":50943,"journal":{"name":"ACM Transactions on Modeling and Computer Simulation","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Virtual Time III, Part 3: Throttling and Message Cancellation\",\"authors\":\"David R. Jefferson, Peter D. Barnes\",\"doi\":\"10.1145/3678173\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n This is\\n Part 3\\n of a trio of papers that unify in a natural way the two historically distinct parallel discrete event synchronization paradigms, optimistic and conservative, combining the best properties of both into a single framework called\\n Unified Virtual Time (UVT)\\n . In this part we survey the synchronization effects that can be achieved by restricting to corner cases the relationships permitted among the control variables,\\n GVT\\n ,\\n CVT\\n ,\\n TVT\\n , and\\n LVT\\n , which were defined in\\n Part 1\\n . We also survey various throttling policies from the literature and describe how they can be implemented in UVT by controlling the value of\\n TVT\\n , including policies that can take advantage of rollback in addition to LP blocking. A significant result is a new category of efficient and higher precision throttling algorithms for optimistic execution that are based on\\n optimistic lookahead\\n , defined in a way that is symmetric to what we now call the\\n conservative lookahead\\n information that is traditionally used for conservative synchronization. Finally, we present a novel algorithm allowing the choice between lazy and aggressive cancellation to be made on a message-by-message basis using either external logic expressed in the model code, or policy code internal to the simulator, or a mixture of both.\\n\",\"PeriodicalId\":50943,\"journal\":{\"name\":\"ACM Transactions on Modeling and Computer Simulation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Modeling and Computer Simulation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/3678173\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Modeling and Computer Simulation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3678173","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

本文是三篇论文的第 3 部分,这三篇论文以一种自然的方式统一了历史上两种截然不同的并行离散事件同步范式--乐观型和保守型,并将两者的最佳特性结合到一个称为统一虚拟时间(UVT)的单一框架中。在本部分中,我们将考察通过将第 1 部分中定义的控制变量 GVT、CVT、TVT 和 LVT 之间允许的关系限制在角情况下可以实现的同步效果。我们还考察了文献中的各种节流策略,并描述了如何通过控制 TVT 的值在 UVT 中实现这些策略,包括除了 LP 阻塞外还能利用回滚的策略。一个重要成果是为乐观执行提供了一类新的高效且精度更高的节流算法,这些算法基于乐观前瞻,其定义方式与我们现在所说的保守前瞻信息对称,保守前瞻信息传统上用于保守同步。最后,我们提出了一种新颖的算法,允许使用模型代码中表达的外部逻辑或模拟器内部的策略代码,或两者的混合使用,在逐个消息的基础上,在懒惰和积极取消之间做出选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Virtual Time III, Part 3: Throttling and Message Cancellation
This is Part 3 of a trio of papers that unify in a natural way the two historically distinct parallel discrete event synchronization paradigms, optimistic and conservative, combining the best properties of both into a single framework called Unified Virtual Time (UVT) . In this part we survey the synchronization effects that can be achieved by restricting to corner cases the relationships permitted among the control variables, GVT , CVT , TVT , and LVT , which were defined in Part 1 . We also survey various throttling policies from the literature and describe how they can be implemented in UVT by controlling the value of TVT , including policies that can take advantage of rollback in addition to LP blocking. A significant result is a new category of efficient and higher precision throttling algorithms for optimistic execution that are based on optimistic lookahead , defined in a way that is symmetric to what we now call the conservative lookahead information that is traditionally used for conservative synchronization. Finally, we present a novel algorithm allowing the choice between lazy and aggressive cancellation to be made on a message-by-message basis using either external logic expressed in the model code, or policy code internal to the simulator, or a mixture of both.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on Modeling and Computer Simulation
ACM Transactions on Modeling and Computer Simulation 工程技术-计算机:跨学科应用
CiteScore
2.50
自引率
22.20%
发文量
29
审稿时长
>12 weeks
期刊介绍: The ACM Transactions on Modeling and Computer Simulation (TOMACS) provides a single archival source for the publication of high-quality research and developmental results referring to all phases of the modeling and simulation life cycle. The subjects of emphasis are discrete event simulation, combined discrete and continuous simulation, as well as Monte Carlo methods. The use of simulation techniques is pervasive, extending to virtually all the sciences. TOMACS serves to enhance the understanding, improve the practice, and increase the utilization of computer simulation. Submissions should contribute to the realization of these objectives, and papers treating applications should stress their contributions vis-á-vis these objectives.
×
引用
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学术官方微信