{"title":"大规模并行计算机中保守与乐观分布仿真的比较研究","authors":"J. M. Alonso, A.A. Frutos, R. B. Palacio","doi":"10.1109/MPCS.1994.367036","DOIUrl":null,"url":null,"abstract":"The main algorithms for sequential and parallel discrete event simulations are introduced. A set of different simulators is evaluated and compared using a transputer-based multicomputer: sequential, parallel conservative and parallel optimistic. For the proposed model, the conservative simulator shows better speedups. The obtained results show that a significant improvement on execution time can be obtained using parallel systems, but only if the model under simulation have some properties like coarse grain size and high degree of self-synchronisation.<<ETX>>","PeriodicalId":64175,"journal":{"name":"专用汽车","volume":"39 1","pages":"528-532"},"PeriodicalIF":0.0000,"publicationDate":"1994-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Conservative and optimistic distributed simulation in massively parallel computers: a comparative study\",\"authors\":\"J. M. Alonso, A.A. Frutos, R. B. Palacio\",\"doi\":\"10.1109/MPCS.1994.367036\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The main algorithms for sequential and parallel discrete event simulations are introduced. A set of different simulators is evaluated and compared using a transputer-based multicomputer: sequential, parallel conservative and parallel optimistic. For the proposed model, the conservative simulator shows better speedups. The obtained results show that a significant improvement on execution time can be obtained using parallel systems, but only if the model under simulation have some properties like coarse grain size and high degree of self-synchronisation.<<ETX>>\",\"PeriodicalId\":64175,\"journal\":{\"name\":\"专用汽车\",\"volume\":\"39 1\",\"pages\":\"528-532\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-05-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"专用汽车\",\"FirstCategoryId\":\"1087\",\"ListUrlMain\":\"https://doi.org/10.1109/MPCS.1994.367036\",\"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":"1087","ListUrlMain":"https://doi.org/10.1109/MPCS.1994.367036","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Conservative and optimistic distributed simulation in massively parallel computers: a comparative study
The main algorithms for sequential and parallel discrete event simulations are introduced. A set of different simulators is evaluated and compared using a transputer-based multicomputer: sequential, parallel conservative and parallel optimistic. For the proposed model, the conservative simulator shows better speedups. The obtained results show that a significant improvement on execution time can be obtained using parallel systems, but only if the model under simulation have some properties like coarse grain size and high degree of self-synchronisation.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
