Loading...
Please wait, while we are loading the content...
Similar Documents
Parallel Discrete Event Simulation on Shared-Memory Multiprocessors (1991)
| Content Provider | CiteSeerX |
|---|---|
| Author | Konas, Pavlos Yew, Pen-Chung |
| Description | This paper describes the implementation and the performance study of three parallel discrete event simulation methods on a shared memory machine. These methods, which share a single user interface, include the Chandy-Misra paradigm with deadlock avoidance; the Time Warp approach with direct, aggressive, and lazy cancellation; and a hybrid approach, which exploits the parallelism available at each point in simulated time. In this study we also examine the impact of task-partitioning and of processor self-scheduling on the efficient implementation of the above methods. Two kinds of systems are simulated: a synchronous multiprocessor machine and an asynchronous toroid network with FCFS server nodes. The performance of the implemented methods is discussed, and conclusions are drawn from the obtained results. 1 Introduction As computer systems become more complex, it is increasingly difficult to use analytical models to describe their behavior and assess their performance [5]. Simulation ... Proceedings of the 24th Annual Simulation Symposium |
| File Format | |
| Language | English |
| Publisher | IEEE Computer Society Press |
| Publisher Date | 1991-01-01 |
| Access Restriction | Open |
| Subject Keyword | Computer System Time Warp Approach Deadlock Avoidance Parallel Discrete Event Simulation Method Parallel Discrete Event Simulation Simulated Time Efficient Implementation Processor Self-scheduling Analytical Model Performance Study Shared-memory Multiprocessor Synchronous Multiprocessor Machine Chandy-misra Paradigm Hybrid Approach Shared Memory Machine Asynchronous Toroid Network Single User Interface Lazy Cancellation Fcfs Server Node Implemented Method |
| Content Type | Text |
| Resource Type | Article |
