{"title":"一种预测仿真并行度的解析方法","authors":"Hong Wang, Y. M. Teo, S. Tay","doi":"10.1109/SIMSYM.2000.844918","DOIUrl":null,"url":null,"abstract":"The ability to predict the performance of a simulation application before its implementation is an important factor for the adoption of parallel simulation technology in industry. Ideally, a simulationist estimates the inherent parallelism of a simulation problem to determine whether it is worthwhile to invest resources to carry out a parallel simulation. We propose an analytic method for predicting the simulation parallelism of a simulation problem that is independent of implementation details. We assume that the system to be simulated is modelled as a network of logical processes, and each logical process models a queuing server center. Unlike many analytic models reported in the literature, we consider the causal relations among events in a simulation. Causality effects reduce event parallelism. Our proposed analytic method gives a tighter upper bound on performance speedup. Validation experiments show that our analytic prediction of simulation parallelism differs from that of critical path analysis by 2.9% and 18.8% in open and closed systems respectively.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An analytic method for predicting simulation parallelism\",\"authors\":\"Hong Wang, Y. M. Teo, S. Tay\",\"doi\":\"10.1109/SIMSYM.2000.844918\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ability to predict the performance of a simulation application before its implementation is an important factor for the adoption of parallel simulation technology in industry. Ideally, a simulationist estimates the inherent parallelism of a simulation problem to determine whether it is worthwhile to invest resources to carry out a parallel simulation. We propose an analytic method for predicting the simulation parallelism of a simulation problem that is independent of implementation details. We assume that the system to be simulated is modelled as a network of logical processes, and each logical process models a queuing server center. Unlike many analytic models reported in the literature, we consider the causal relations among events in a simulation. Causality effects reduce event parallelism. Our proposed analytic method gives a tighter upper bound on performance speedup. Validation experiments show that our analytic prediction of simulation parallelism differs from that of critical path analysis by 2.9% and 18.8% in open and closed systems respectively.\",\"PeriodicalId\":361153,\"journal\":{\"name\":\"Proceedings 33rd Annual Simulation Symposium (SS 2000)\",\"volume\":\"133 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 33rd Annual Simulation Symposium (SS 2000)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIMSYM.2000.844918\",\"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 33rd Annual Simulation Symposium (SS 2000)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.2000.844918","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An analytic method for predicting simulation parallelism
The ability to predict the performance of a simulation application before its implementation is an important factor for the adoption of parallel simulation technology in industry. Ideally, a simulationist estimates the inherent parallelism of a simulation problem to determine whether it is worthwhile to invest resources to carry out a parallel simulation. We propose an analytic method for predicting the simulation parallelism of a simulation problem that is independent of implementation details. We assume that the system to be simulated is modelled as a network of logical processes, and each logical process models a queuing server center. Unlike many analytic models reported in the literature, we consider the causal relations among events in a simulation. Causality effects reduce event parallelism. Our proposed analytic method gives a tighter upper bound on performance speedup. Validation experiments show that our analytic prediction of simulation parallelism differs from that of critical path analysis by 2.9% and 18.8% in open and closed systems respectively.