{"title":"Evaluation of a Local Adaptive Protocol for Distributed Discrete Event Simulation","authors":"Donald O. Hamnes, A. Tripathi","doi":"10.1109/ICPP.1994.106","DOIUrl":null,"url":null,"abstract":"The performance of a local adaptive protocol for distributed discrete event simulation is evaluated. This protocol allows each process to adapt at runtime to its environment on a per channel basis with the possible range of behavior varying from conservative to optimistic. This evaluation includes a comparison of the performance of the algorithm with that of both a conservative and an optimistic protocol, as well as, an examination of a number of unique characteristics of the algorithm. Results from simulations using a network of workstations on a closed queueing system are presented. The results demonstrate the importance of various protocol features and show that it performs better than either the conservative or optimistic protocols in certain simulations.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 International Conference on Parallel Processing Vol. 3","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.1994.106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
The performance of a local adaptive protocol for distributed discrete event simulation is evaluated. This protocol allows each process to adapt at runtime to its environment on a per channel basis with the possible range of behavior varying from conservative to optimistic. This evaluation includes a comparison of the performance of the algorithm with that of both a conservative and an optimistic protocol, as well as, an examination of a number of unique characteristics of the algorithm. Results from simulations using a network of workstations on a closed queueing system are presented. The results demonstrate the importance of various protocol features and show that it performs better than either the conservative or optimistic protocols in certain simulations.