Workshop on Parallel and Distributed Simulation最新文献_第6页

Parallel simulation of communicating finite state machines 通信有限状态机的并行仿真

Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158477

C. Tropper, A. Boukerche

引用次数: 13

Restructuring a parallel simulation to improve cache behavior in a shared-memory multiprocessor: the value of distributed synchronization 重构并行模拟以改善共享内存多处理器中的缓存行为:分布式同步的价值

Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158480

D. Cheriton, H. A. Goosen, H. Holbrook, P. Machanick

{"title":"Restructuring a parallel simulation to improve cache behavior in a shared-memory multiprocessor: the value of distributed synchronization","authors":"D. Cheriton, H. A. Goosen, H. Holbrook, P. Machanick","doi":"10.1145/158459.158480","DOIUrl":"https://doi.org/10.1145/158459.158480","url":null,"abstract":"Synchronization is a significant cost in many parallel programs, and can be a major bottleneck if it is handled in a centralized fashion using traditional shared-memory constructs such as barriers. In a parallel time-stepped simulation, the use of global synchronization primitives limits scalability, increases the sensitivity to load imbalance, and reduces the potential for exploiting locality to improve cache behavior.\u0000This paper presents the results of an initial one-application study quantifying the costs and performance benefits of distributed, nearest neighbors synchronization. The application studied, MP3D, is a particle-based wind tunnel simulation. Our results for this one application on current shared-memory multiprocessors show a significant decrease in synchronization time using these techniques. We prototyped an application-independent library that implements distributed synchronization. The library allows a variety of parallel simulations to exploit these techniques without increasing the application programming beyond that of conventional approaches.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123659315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 20

Selecting the checkpoint interval in time warp simulation 时间扭曲模拟中检查点间隔的选择

Workshop on Parallel and Distributed Simulation Pub Date : 1993-07-01 DOI: 10.1145/158459.158460

Yi-Bing Lin, B. R. Preiss, W. Loucks, Ed Lazowska

{"title":"Selecting the checkpoint interval in time warp simulation","authors":"Yi-Bing Lin, B. R. Preiss, W. Loucks, Ed Lazowska","doi":"10.1145/158459.158460","DOIUrl":"https://doi.org/10.1145/158459.158460","url":null,"abstract":"In Time Warp parallel simulation, the state of each process must be saved (checkpointed) regularly in case a rollback is necessary. Although most existing Time Warp implementations checkpoint after every state transition, this is not necessary, and the checkpoint interval is in reality a tuning parameter of the simulation.\u0000Lin and Lazowska[6] proposed a model to derive the optimal checkpoint interval by assuming that the rollback behavior of Time Warp is not affected by the frequency of checkpointing. An experimental study conducted by Preiss et al.[10] indicates that the behavior of rollback is affected by the frequency of checkpointing in general, and that the Lin-Lazowska model may not reflect the real situations in general.\u0000This paper extends the Lin-Lazowska model to include the effect of the checkpoint interval on the rollback behavior. The relationship among the checkpoint interval, the rollback behavior, and the overhead associated with state saving and restoration is described. A checkpoint interval selection algorithm which quickly determines the optimal checkpoint interval during the execution of Time Warp simulation is proposed. Empirical results indicate that the algorithm converges quickly and always selects the optimal checkpoint interval.","PeriodicalId":194781,"journal":{"name":"Workshop on Parallel and Distributed Simulation","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124408528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 123

Workshop Committees 车间委员会

Workshop on Parallel and Distributed Simulation Pub Date : 1900-01-01 DOI: 10.1109/pads.2006.40

S. J. Turner, J. Lüthi, W. Cai, Joo Sing Tan, Lijun Lau, S. J. E. Taylor, A. S. Elmaghraby, B. W. Unger, G. F. Riley, D. M. Nicol, R. M. Fujimoto, A. Boukerche, J. Liu, A. L. M. T. Mclean, E. H. Page, R. Simmonds

引用次数: 0