Name
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. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1109/32.4677 | Software Engineering, IEEE Transactions |
Keywords | Field | DocType |
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 | Shared memory,Computer science,Parallel computing,Deadlock,Network simulation,Node (networking),Real-time computing,Network topology,Queueing theory,Network traffic simulation,Discrete event simulation,Distributed computing | Journal |
Volume | Issue | ISSN |
14 | 4 | 0098-5589 |
Citations | PageRank | References |
53 | 11.28 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel A. Reed | 1 | 2024 | 313.41 |
| Allen D. Malony | 2 | 251 | 31.26 |
| Bradley McCredie | 3 | 53 | 11.28 |