Conservative Parallel Simulation of Priority Class Queueing Networks
Abstract
This paper describes a conservative synchronization protocol for the parallel simulation of queueing networks having C job priority classes, where a job's class is fixed. This problem has long vexed designers of conservative synchronization protocols because of is seemingly poor ability to compute lookahead: the time of the next departure. For, a job service having low priority can be preempted at any time by an arrival having higher priority and an arbitrarily small service time. Our solution is to skew the event generation activity so that events for higher priority jobs are generated farther ahead is simulated time than lower priority jobs. Thus, when a lower priority job enters service for the first time, all the higher priority jobs that may preempt it are already known and the job's departure time can be exactly predicted. Finally, we analyze the protocol and demonstrate that good performance can be expected on the simulation of large queueing networks.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1990
- Accession Number
- ADA227739
Entities
People
- David M. Nicol