{"title":"并行仿真克隆的可扩展性","authors":"M. Hybinette, R. Fujimoto","doi":"10.1109/SIMSYM.2002.1000164","DOIUrl":null,"url":null,"abstract":"In previous work we presented an algorithm for cloning parallel simulations that enables multiple simulated execution paths to be explored simultaneously. The method is targeted for parallel discrete event simulators that provide the simulation application developer a logical process (LP) execution model. The cloning algorithm gains efficiency by cloning logical processes only as necessary. In this work we examine the scalability of cloning in detail. Specifically, we examine how the number of clones impacts the performance of cloning as we vary the \"size\" of the simulation problem.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Scalability of parallel simulation cloning\",\"authors\":\"M. Hybinette, R. Fujimoto\",\"doi\":\"10.1109/SIMSYM.2002.1000164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In previous work we presented an algorithm for cloning parallel simulations that enables multiple simulated execution paths to be explored simultaneously. The method is targeted for parallel discrete event simulators that provide the simulation application developer a logical process (LP) execution model. The cloning algorithm gains efficiency by cloning logical processes only as necessary. In this work we examine the scalability of cloning in detail. Specifically, we examine how the number of clones impacts the performance of cloning as we vary the \\\"size\\\" of the simulation problem.\",\"PeriodicalId\":198576,\"journal\":{\"name\":\"Proceedings 35th Annual Simulation Symposium. SS 2002\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 35th Annual Simulation Symposium. SS 2002\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIMSYM.2002.1000164\",\"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 35th Annual Simulation Symposium. SS 2002","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.2002.1000164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In previous work we presented an algorithm for cloning parallel simulations that enables multiple simulated execution paths to be explored simultaneously. The method is targeted for parallel discrete event simulators that provide the simulation application developer a logical process (LP) execution model. The cloning algorithm gains efficiency by cloning logical processes only as necessary. In this work we examine the scalability of cloning in detail. Specifically, we examine how the number of clones impacts the performance of cloning as we vary the "size" of the simulation problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
