{"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":0,"journal":{"name":"","volume":" 36","pages":""},"PeriodicalIF":0.0,"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\":0,\"journal\":{\"name\":\"\",\"volume\":\" 36\",\"pages\":\"\"},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1145/3678173\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1145/3678173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.