Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) (1995)
Lake Placid, New York
June 14, 1995 to June 16, 1995
S.K. Prasad , Dept. of Math. & Comput. Sci., Georgia State Univ., Atlanta, GA, USA
B. Naqib , Dept. of Math. & Comput. Sci., Georgia State Univ., Atlanta, GA, USA
Compared to highly optimized optimistic simulators which use local event queues for individual processors on a shared-memory computer, we demonstrate that employing a single global event queue drastically reduces the number of rollbacks, brings down the storage requirements, and achieves superior load balance. On a bus-based Silicon Graphics multiprocessor, these virtues consistently translated into faster execution times and higher speedups on those synthetic networks of medium- to coarse-grained logical processes which were ridden with rollbacks and load imbalance on local-queue-based simulators. A dynamic randomization-based load distribution scheme for local-event-queue simulators is also shown to be an effective improvement.
resource allocation; discrete event simulation; shared memory systems; data structures; parallel algorithms; global event queues; rollback reduction; load balancing; shared-memory computer; global event queue; load distribution scheme
S. Prasad and B. Naqib, "Effectiveness of global event queues in rollback reduction and load balancing," Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)(PADS), Lake Placid, New York, 1995, pp. 187.