{"title":"Parallel simulation of Markovian queueing networks","authors":"P. Heidelberger, D. Nicol","doi":"10.1109/MASCOT.1994.284451","DOIUrl":null,"url":null,"abstract":"Consider simulating a large queueing network, i.e., one with many queues and jobs, on a parallel computer. Suppose the network is partitioned so that each processor is assigned a set of queues to simulate. The basic difficulty in parallel simulation is synchronizing the simulation clocks on each of the processors so that events appear to get executed in the proper order. If the network possesses a Markovian structure, then algorithms described by the authors (1993) can be used to simplify the clock synchronization problem. For appropriately structured queueing networks, these algorithms are quite efficient and large speedups have been obtained; in one example a speedup of 220 was measured on 256 processors of the Intel Touchstone Delta computer.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.1994.284451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Consider simulating a large queueing network, i.e., one with many queues and jobs, on a parallel computer. Suppose the network is partitioned so that each processor is assigned a set of queues to simulate. The basic difficulty in parallel simulation is synchronizing the simulation clocks on each of the processors so that events appear to get executed in the proper order. If the network possesses a Markovian structure, then algorithms described by the authors (1993) can be used to simplify the clock synchronization problem. For appropriately structured queueing networks, these algorithms are quite efficient and large speedups have been obtained; in one example a speedup of 220 was measured on 256 processors of the Intel Touchstone Delta computer.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
