In this paper, we study various policies for scheduling tasks in distributed processor queues. Their performance is studied and compared for a variety of workloads. It is our intention to find a policy that increases throughput and is fair to jobs. Simulation results indicate that the policy that schedules the shortest task in a queue, when there is not any other task that has been waiting more than some configurable period of time, yields good system performance and also provides a guarantee for fairness in individual job execution.
Index Terms:
Scheduling, Distributed Systems, Performance, Simulation
Citation:
Helen D. Karatza, "Scheduling Strategies for Multitasking in a Distributed System," ss, pp.83, 33rd Annual Simulation Symposium, 2000