{"title":"并行分布式仿真中最小时间桶同步算法的设计与分析","authors":"Xuehui Wang, Lei Zhang","doi":"10.1109/ISADS.2017.51","DOIUrl":null,"url":null,"abstract":"Time synchronization is critical for parallel and distributed simulation (PADS). In this paper we first compare the two main synchronization mechanisms in PADS, namely conservative and optimistic protocols. Then we propose a Minimum Time Buckets synchronization algorithm, which can optimistically schedule events without sending anti-messages. Comparing to the well-known Breathing Time Bucket (MTB) synchronization algorithm, our algorithm reduces the waiting time and rollback probability for logical processes, yet it commits the same number of events in each time advance interval. Experiment results show that the MTB algorithm can effectively decrease the rollback rate, reduce the execution time, and achieve a higher speed up.","PeriodicalId":303882,"journal":{"name":"2017 IEEE 13th International Symposium on Autonomous Decentralized System (ISADS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Design and Analysis of a Minimum Time Buckets Synchronization Algorithm for Parallel and Distributed Simulation\",\"authors\":\"Xuehui Wang, Lei Zhang\",\"doi\":\"10.1109/ISADS.2017.51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Time synchronization is critical for parallel and distributed simulation (PADS). In this paper we first compare the two main synchronization mechanisms in PADS, namely conservative and optimistic protocols. Then we propose a Minimum Time Buckets synchronization algorithm, which can optimistically schedule events without sending anti-messages. Comparing to the well-known Breathing Time Bucket (MTB) synchronization algorithm, our algorithm reduces the waiting time and rollback probability for logical processes, yet it commits the same number of events in each time advance interval. Experiment results show that the MTB algorithm can effectively decrease the rollback rate, reduce the execution time, and achieve a higher speed up.\",\"PeriodicalId\":303882,\"journal\":{\"name\":\"2017 IEEE 13th International Symposium on Autonomous Decentralized System (ISADS)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 13th International Symposium on Autonomous Decentralized System (ISADS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISADS.2017.51\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 13th International Symposium on Autonomous Decentralized System (ISADS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISADS.2017.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
时间同步是并行和分布式仿真(PADS)的关键。本文首先比较了PADS中两种主要的同步机制，即保守协议和乐观协议。然后提出了一种最小时间桶同步算法，该算法可以在不发送反消息的情况下乐观地调度事件。与著名的MTB (Breathing Time Bucket)同步算法相比，该算法减少了逻辑进程的等待时间和回滚概率，同时在每个时间推进间隔内提交的事件数量相同。实验结果表明，MTB算法可以有效地降低回滚率，减少执行时间，实现更高的提速。
Design and Analysis of a Minimum Time Buckets Synchronization Algorithm for Parallel and Distributed Simulation
Time synchronization is critical for parallel and distributed simulation (PADS). In this paper we first compare the two main synchronization mechanisms in PADS, namely conservative and optimistic protocols. Then we propose a Minimum Time Buckets synchronization algorithm, which can optimistically schedule events without sending anti-messages. Comparing to the well-known Breathing Time Bucket (MTB) synchronization algorithm, our algorithm reduces the waiting time and rollback probability for logical processes, yet it commits the same number of events in each time advance interval. Experiment results show that the MTB algorithm can effectively decrease the rollback rate, reduce the execution time, and achieve a higher speed up.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
