DocumentCode :
992849
Title :
Parallel discrete event simulation using shared memory
Author :
Reed, Daniel A. ; Malony, Allan D. ; McCredie, Bradley D.
Author_Institution :
Illinois Univ., Urbana, IL, USA
Volume :
14
Issue :
4
fYear :
1988
fDate :
4/1/1988 12:00:00 AM
Firstpage :
541
Lastpage :
553
Abstract :
With traditional event-list techniques, evaluating a detailed discrete event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments using the Chandy-Misra distributed simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queuing network models.
Keywords :
digital simulation; parallel processing; performance evaluation; queueing theory; Chandy-Misra distributed simulation algorithm; deadlock recovery; discrete event simulation-model; parallel processing; parallel simulation; performance evaluation; queueing network topology; routing probabilities; shared memory; synchronization; Analytical models; Circuit simulation; Computational modeling; Computer networks; Computer simulation; Concurrent computing; Discrete event simulation; Network topology; Parallel processing; Routing;
fLanguage :
English
Journal_Title :
Software Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-5589
Type :
jour
DOI :
10.1109/32.4677
Filename :
4677
Link To Document :
بازگشت