Thirty-Second Annual Simulation Symposium A Simulation - Based Performance Analysis of Gang Scheduling in a Distributed System San Diego, California April 11-April 15 ISBN: 0-7695-0128-1
In distributed systems job scheduling is a difficult problem. In this work we study a special type of scheduling called gang scheduling under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors.The performance of various gang scheduling schemes is studied and compared for a variety of workloads. The main objective of the processor schedulers is to achieve high overall system throughput while at the same time providing some guarantee for the performance of individual jobs in the system.
Index Terms:
Discrete Simulation, Computer Performance, Scheduling, Queueing.
Citation:
Helen D. Karatza, "A Simulation - Based Performance Analysis of Gang Scheduling in a Distributed System," ss, pp.26, Thirty-Second Annual Simulation Symposium, 1999 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||