In recent years workstation clusters have been increasingly used as general purpose computing servers for the execution of parallel and sequential applications submitted by many competing users. To make clusters a real alternative to more traditional general purpose computing platforms, scheduling techniques able to efficiently and fairly schedule collections of parallel and sequential applications must be devised. In this paper we propose a scheduling technique able to achieve the above goals by combining stride scheduling with a ticket redistribution policy that results in the spontaneous coscheduling of parallel applications. A simulation analysis carried out for a variety of workloads and operational conditions shows that our strategy outperforms previous strategies both in terms of efficiency and fairness.
A Fair and Effective Scheduling Strategy for Workstation Clusters
ANGLANO, Cosimo Filomeno
2000-01-01
Abstract
In recent years workstation clusters have been increasingly used as general purpose computing servers for the execution of parallel and sequential applications submitted by many competing users. To make clusters a real alternative to more traditional general purpose computing platforms, scheduling techniques able to efficiently and fairly schedule collections of parallel and sequential applications must be devised. In this paper we propose a scheduling technique able to achieve the above goals by combining stride scheduling with a ticket redistribution policy that results in the spontaneous coscheduling of parallel applications. A simulation analysis carried out for a variety of workloads and operational conditions shows that our strategy outperforms previous strategies both in terms of efficiency and fairness.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
