Distributed discrete-event simulation using null message algorithms on hypercube architectures
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
An algorithm for parallel discrete event simulation using common memory
ANSS '89 Proceedings of the 22nd annual symposium on Simulation
Conservative simulation using distributed-shared memory
Proceedings of the sixteenth workshop on Parallel and distributed simulation
A distributed approach to queueing network simulation
WSC '79 Proceedings of the 11th conference on Winter simulation - Volume 2
Problem oriented protocol design
WSC '84 Proceedings of the 16th conference on Winter simulation
Parallel simulation: distributed simulation systems
Proceedings of the 35th conference on Winter simulation: driving innovation
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Null message algorithm is an important conservative time management protocol in parallel discrete event simulation systems for providing synchronization between the distributed computers with the capability of both avoiding and resolving the deadlock. However, the excessive generation of null messages prevents the widespread use of this algorithm. The excessive generation of null messages results due to an improper use of some of the critical parameters such as frequency of transmission and Lookahead values. However, if we could minimize the generation of null messages, most of the parallel discrete event simulation systems would be likely to take advantage of this algorithm in order to gain increased system throughput and minimum transmission delays. In this paper, a new mathematical model for optimizing the performance of parallel and distributed simulation systems is proposed. The proposed mathematical model utilizes various optimization techniques such as variance of null message elimination to improve the performance of parallel and distributed simulation systems. For the sake of simulation results, we consider both uniform and non-uniform distribution of Lookahead values across multiple output lines of an LP. Our experimental verifications demonstrate that an optimal NMA offers better scalability in parallel discrete event simulation systems if it is used with the proper selection of critical parameters.