Title :
Parallel simulation of Markovian queueing networks
Author :
Heidelberger, Philip ; Nicol, David M.
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fDate :
31 Jan-2 Feb 1994
Abstract :
Consider simulating a large queueing network, i.e., one with many queues and jobs, on a parallel computer. Suppose the network is partitioned so that each processor is assigned a set of queues to simulate. The basic difficulty in parallel simulation is synchronizing the simulation clocks on each of the processors so that events appear to get executed in the proper order. If the network possesses a Markovian structure, then algorithms described by the authors (1993) can be used to simplify the clock synchronization problem. For appropriately structured queueing networks, these algorithms are quite efficient and large speedups have been obtained; in one example a speedup of 220 was measured on 256 processors of the Intel Touchstone Delta computer
Keywords :
parallel machines; performance evaluation; queueing theory; synchronisation; virtual machines; Intel Touchstone Delta computer; Markovian queueing networks; large queueing network; parallel computer; simulation clocks; synchronizing; Clocks; Computer networks; Computer science; Discrete event simulation; NASA; Partitioning algorithms; Synchronization; Velocity measurement;
Conference_Titel :
Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1994., MASCOTS '94., Proceedings of the Second International Workshop on
Conference_Location :
Durham, NC
Print_ISBN :
0-8186-5292-6
DOI :
10.1109/MASCOT.1994.284451
