{"title":"分布式仿真中事件的高效提交","authors":"V. Bharghavan, C. Ramamoorthy","doi":"10.1109/CMPSAC.1993.404184","DOIUrl":null,"url":null,"abstract":"We have built a distributed discrete-event simulator called Empathy. This paper describes some aspects of the Empathy simulation algorithm. Optimistic simulation incurs enormous memory overhead. In this paper, we propose an algorithm for optimistic simulation that is based on the concept of local conservative control for commitment of events. This algorithm reduces the memory overhead by an average of 30% and reduces the aggregate computational time for simulation by up to 25%.<<ETX>>","PeriodicalId":375808,"journal":{"name":"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient commitment of events in distributed simulation\",\"authors\":\"V. Bharghavan, C. Ramamoorthy\",\"doi\":\"10.1109/CMPSAC.1993.404184\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have built a distributed discrete-event simulator called Empathy. This paper describes some aspects of the Empathy simulation algorithm. Optimistic simulation incurs enormous memory overhead. In this paper, we propose an algorithm for optimistic simulation that is based on the concept of local conservative control for commitment of events. This algorithm reduces the memory overhead by an average of 30% and reduces the aggregate computational time for simulation by up to 25%.<<ETX>>\",\"PeriodicalId\":375808,\"journal\":{\"name\":\"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1993.404184\",\"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 of 1993 IEEE 17th International Computer Software and Applications Conference COMPSAC '93","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1993.404184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient commitment of events in distributed simulation
We have built a distributed discrete-event simulator called Empathy. This paper describes some aspects of the Empathy simulation algorithm. Optimistic simulation incurs enormous memory overhead. In this paper, we propose an algorithm for optimistic simulation that is based on the concept of local conservative control for commitment of events. This algorithm reduces the memory overhead by an average of 30% and reduces the aggregate computational time for simulation by up to 25%.<>