Name
Abstract | ||
|---|---|---|
A new Conservative algorithm for both parallel and sequential simulation of networks is described. The technique is motivated by the construction of a high performance simulator for ATM networks. It permits very fast execution of models of ATM systems, both sequentially and in parallel. A simple analysis of the performance of the system is made. Initial performance results from parallel and sequential implementations are presented and compared with comparable results from an optimistic TimeWarp based simulator. It is shown that the conservative simulator performs well when the "density" of messages in the simulated system is high, a condition which is likely to hold in many interesting ATM scenarios. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1145/238788.238807 | PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation |
Keywords | Field | DocType |
computer simulation,discrete event simulation,switches,computer science,parallel processing,working paper,computational modeling,asynchronous transfer mode | Parallel simulation,Computer science,Simulation,Parallel computing,Parallel processing,Asynchronous Transfer Mode,Real-time computing,Implementation,Atmosphere (unit),Sequential simulation,Distributed computing,Discrete event simulation | Conference |
Volume | Issue | ISSN |
26 | 1 | 0163-6103 |
ISBN | Citations | PageRank |
0-8186-7539-X | 10 | 7.03 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John G. Cleary | 1 | 1791 | 365.78 |
| Jya-Jang Tsai | 2 | 71 | 12.33 |