Parallel distributed simulation and modeling methods: SyncSim: a synchronous simple optimistic simulation technique based on a global parallel heap event queue

Authors:
Sushil K. Prasad;Zhiyong Cao
Affiliations:
Georgia State University, Atlanta, GA;Georgia State University, Atlanta, GA
Venue:
Proceedings of the 35th conference on Winter simulation: driving innovation
Year:
2003

Citing 18
Cited 0

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent Access of Priority Queues

IEEE Transactions on Computers
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem

Communications of the ACM
Concurrent operations on priority queues

Communications of the ACM
Parallel discrete event simulation

Communications of the ACM - Special issue on simulation
Parallel heap: an optimal parallel priority queue

The Journal of Supercomputing
Breathing Time Warp

PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Efficient and scalable PRAM algorithms for discrete-event simulation of bounded degree networks

Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
pGVT: an algorithm for accurate GVT estimation

PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Effectiveness of global event queues in rollback reduction and load balancing

PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Parallel execution for serial simulators

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Automatic parallelization of discrete event simulation programs

WSC '93 Proceedings of the 25th conference on Winter simulation
An approach for federating parallel simulators

PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Parallelizing a sequential logic simulator using an optimistic framework based on a global parallel heap event queue: an experience and performance report

PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
Using optimistic execution techniques as a parallelisation tool for general purpose computing

HPCN Europe '95 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
A Generic Framework for Parallelization of Network Simulations

MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Parallel heap: A practical priority queue for fine-to-medium-grained applications on small multiprocessors

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Efficient parallel algorithms and data structures for discrete-event simulation

Efficient parallel algorithms and data structures for discrete-event simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We developed and implemented two highly optimized optimistic discrete event simulation techniques based on an efficient and scalable Parallel Heap data structure as a global event queue. The primary results are (i) the design of an optimistic simulation algorithm, namely SyncSim, which does not rely on traditional state and message saving data structures, but employs only one backup state per state variable, (ii) a demonstration, through implementation of SyncSim, of an optimistic technique which overcomes the two main mutually conflicting and unbounded overheads of the existing optimistic simulation algorithms: SyncSim bounds the additional space requirements to just one copy per state variable and drastically limits the number of rollbacks encountered. Furthermore, SyncSim beats the highly optimized traditional simulator simglobal on a wide variety of large networks on an Origin-2000 computer. The algorithm SyncSim could form a basis for a good parallelizing engine attachable relatively easily to an existing serial simulator.