NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Parallel discrete event simulation using shared memoryWith 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 queueing network models.
Document ID
19880051915
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Reed, Daniel A. (Illinois Univ. Urbana, IL, United States)
Malony, Allen D. (Illinois Univ. Urbana, IL, United States)
Mccredie, Bradley D. (Illinois, University Urbana, United States)
Date Acquired
August 13, 2013
Publication Date
March 1, 1988
Publication Information
Publication: IEEE Transactions on Software Engineering
Volume: 24
ISSN: 0098-5589
Subject Category
COMPUTER SYSTEMS
Funding Number(s)
CONTRACT_GRANT: NSF DCR-84-10110
CONTRACT_GRANT: NAG1-613
CONTRACT_GRANT: NSF DCR-84-17948
CONTRACT_GRANT: DE-FG02-85ER-25001
CONTRACT_GRANT: NSF DCR-84-06916
Distribution Limits
Public
Copyright
Other