Parallel Discrete-Event Simulation on Distributed-Memory Multicomputers
| dc.contributor.author | Tay S C | en_US |
| dc.contributor.author | Teo Yong Meng | en_US |
| dc.date.accessioned | 2004-10-21T14:28:52Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:40Z | |
| dc.date.available | 2004-10-21T14:28:52Z | en_US |
| dc.date.available | 2017-01-23T07:00:40Z | |
| dc.date.issued | 1994-03-01T00:00:00Z | en_US |
| dc.description.abstract | As computers become more powerful and their use expands, the need to simulate larger and more complex systems in reasonable computing times becomes more important. Parallel simulation can significantly speedup the process. Nevertheless, simulating complex systems on high-speed computers with multiprocessor capabilities is not a trivial task. This paper describes the parallel simulation of multi-station queueing networks on distributed-memory multicomputers. A deadlock-free conservative scheme for organizing parallel simulation is proposed, and implemented on a network of workstations running the PVM software. Preliminary results show that close-to-linear performance speedup can be achieved when the simulated system can be partitioned into processes of sufficiently large grain-size. | en_US |
| dc.format.extent | 168219 bytes | en_US |
| dc.format.extent | 66425 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.format.mimetype | application/postscript | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1359 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRA3/94 | en_US |
| dc.title | Parallel Discrete-Event Simulation on Distributed-Memory Multicomputers | en_US |
| dc.type | Technical Report | en_US |
Files
License bundle
1 - 1 of 1