Network aware time management and event distribution

Authors:
George F. Riley;Richard Fujimoto;Mostafa H. Ammar
Affiliations:
College of Computing, Georgia Institute of Technology, Atlanta, GA;College of Computing, Georgia Institute of Technology, Atlanta, GA;College of Computing, Georgia Institute of Technology, Atlanta, GA
Venue:
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Year:
2000

Citing 6
Cited 4

The butterfly barrier

International Journal of Parallel Programming
Efficient distributed event-driven simulations of multiple-loop networks

Communications of the ACM
The cost of conservative synchronization in parallel discrete event simulations

Journal of the ACM (JACM)
Efficient algorithms for distributed snapshots and global virtual time approximation

Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Asynchronous distributed simulation via a sequence of parallel computations

Communications of the ACM - Special issue on simulation modeling and statistical computing
SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS

SIMULATION OF PACKET COMMUNICATION ARCHITECTURE COMPUTER SYSTEMS

Virtual time synchronization over unreliable network transport

Proceedings of the fifteenth workshop on Parallel and distributed simulation
Next generation modeling III - agents: Spades --- a distributed agent simulation environment with software-in-the-loop execution

Proceedings of the 35th conference on Winter simulation: driving innovation
An efficient algorithm in the HLA time management

Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Hierarchical Federation Community and Time Management

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss new synchronization algorithms for Parallel and Distributed Discrete Event Simulations (PDES) which exploit the capabilities and behavior of the underlying communications network. Previous work in this areas has assumed the network to be a Black Box which provides a one-to-one, reliable and in-order message passing paradigm. In our work, we utilize the Broadcast capability of the ubiquitous Ethernet for synchronization computations, and both unreliable and reliable protocols for message passing, to achieve more efficient communications between the participating systems.We describe two new algorithms for computation of a distributed snapshot of global reduction operations on monotonically increasing values. The algorithms require O(N) messages (where N is the number of systems participating in the snapshot) in the normal case. We specifically target the use of this algorithm for distributed discrete event simulations to determine a global lower bound on time-stamp (LBTS), but expect the algorithm has applicability outside the simulation community.