Performance of Discrete Event Simulation on a Multiprocessor Using Optimistic and Conservative Synchronization | Data Structures and Algorithms with Object-Oriented Design Patterns in Java (Worldwide Series in Computer Science)

Website of Bruno R. Preiss

Next : The Impact of Lookahead Up: Conference Papers Previous: Null Message Cancellation in

Bruno Richard Preiss. In Proc. 1990 Int. Conf. on Parallel Processing , pages 218-222, St.\ Charles, IL, August 1990. Penn. State University[32].

This paper presents an empirical study of the performance of various approaches to distributed discrete event simulation on a message-passing multiprocessor. This study compares the performance of distributed simulation to a sequential simulation of exactly the same system.
Four simulation benchmarks are presented. Each is a closed queueing network with a different topology. Four implementations of each benchmark are described--each with a different lookahead. Each benchmark was run under three customer loads. Each benchmark was run using one, two, four, and eight processors. This paper presents data showing the relationships between speedup , number of processors, lookahead, and computation load.

external Full text. Presentation slides. $external$ BibTeX entry.