TY - GEN
T1 - Co-ordinated coscheduling in time-sharing clusters through a generic framework
AU - Agarwal, Saurabh
AU - Choi, Gyu Sang
AU - Das, Chita R.
AU - Yoo, Andy B.
AU - Nagar, Shailabh
N1 - Publisher Copyright:
© 2003 IEEE.
PY - 2003
Y1 - 2003
N2 - In this paper, we attempt to address several key issues in designing coscheduling algorithms for clusters. First, we propose a generic framework for deploying coscheduling techniques by providing a reusable and dynamically loadable kernel module. Second, we implement all prior dynamic coscheduling algorithms (Dynamic coscheduling (DCS), Spin Block (SB) and Periodic Boost (PB)) and a new coscheduling technique, called Co-ordinated coscheduling (CC), using the above framework. Third, with exhaustive experimentation using mixed workloads, we observe that unlike PB, which provided the best performance on a Solaris platform (followed by SB and DCS), the proposed CC scheme outperforms all other techniques on a Linux platform, followed by SB, PB and DCS, in that order. Finally, we argue that due to its modular design, portable implementation on a standard platform, high performance and tolerance to workload mixes, the proposed CC scheme can be a viable scheduling option for time-sharing clusters.
AB - In this paper, we attempt to address several key issues in designing coscheduling algorithms for clusters. First, we propose a generic framework for deploying coscheduling techniques by providing a reusable and dynamically loadable kernel module. Second, we implement all prior dynamic coscheduling algorithms (Dynamic coscheduling (DCS), Spin Block (SB) and Periodic Boost (PB)) and a new coscheduling technique, called Co-ordinated coscheduling (CC), using the above framework. Third, with exhaustive experimentation using mixed workloads, we observe that unlike PB, which provided the best performance on a Solaris platform (followed by SB and DCS), the proposed CC scheme outperforms all other techniques on a Linux platform, followed by SB, PB and DCS, in that order. Finally, we argue that due to its modular design, portable implementation on a standard platform, high performance and tolerance to workload mixes, the proposed CC scheme can be a viable scheduling option for time-sharing clusters.
UR - http://www.scopus.com/inward/record.url?scp=33745170235&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33745170235&partnerID=8YFLogxK
U2 - 10.1109/CLUSTR.2003.1253303
DO - 10.1109/CLUSTR.2003.1253303
M3 - Conference contribution
AN - SCOPUS:33745170235
T3 - Proceedings - IEEE International Conference on Cluster Computing, ICCC
SP - 84
EP - 91
BT - Proceedings - IEEE International Conference on Cluster Computing, CLUSTER 2003
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - IEEE International Conference on Cluster Computing, CLUSTER 2003
Y2 - 1 December 2003 through 4 December 2003
ER -