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.
|Original language||English (US)|
|Journal||Proceedings of the International Conference on Parallel Processing|
|State||Published - 1994|
|Event||23rd International Conference on Parallel Processing, ICPP 1994 - Raleigh, NC, United States|
Duration: Aug 15 1994 → Aug 19 1994