ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Experience with concurrent simulation
WSC '89 Proceedings of the 21st conference on Winter simulation
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Virtual time II: storage management in conservative and optimistic systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Distributed Shared Memory: A Survey of Issues and Algorithms
Computer - Distributed computing systems: separate resources acting as one
An analysis of rollback-based simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Optimal memory management for time warp parallel simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on parallel and distributed systems performance
Mathematical foundations for time warp systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Concurrent simulation: an alternative to distributed simulation
WSC '86 Proceedings of the 18th conference on Winter simulation
Replicated state space approach for parallel simulation
WSC '86 Proceedings of the 18th conference on Winter simulation
A “conservative” approach to parallelizing the Sharks World simulation
WSC' 90 Proceedings of the 22nd conference on Winter simulation
| Hi-index | 0.00 |
Although users may want to employ shared variables when they program distributed simulation applications, almost none of the currently existing distributed simulation systems does offer this facility. In this paper, we systematically present new algorithms which provide consistent shared variables for distributed simulation applications. Basically, our approach combines known techniques to realize distributed shared memory with simulation algorithms. As there are essentially two classes of distributed simulation algorithms---conservative and optimistic---we study shared variable algorithms for both of them and propose five new algorithms. Initial performance measurements of a prototype implementation are described. Potential performance degradation by the usage of shared variables is expected to depend to a high degree on the access behavior of the simulation application. Having the abstraction of shared variables available provides the user with a simple concept to design distributed simulation applications in the presence of inherent global data.