Task scheduling performance in distributed systems with time varying workload
Neural, Parallel & Scientific Computations
Performance Analysis of Parallel Job Scheduling in Distributed Systems
ANSS '03 Proceedings of the 36th annual symposium on Simulation
| Hi-index | 0.00 |
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.