Abstract
In this chapter, we extend the hierarchical scheduling policy to cluster systems. Cluster systems differ from the shared-memory and distributed-memory systems in several aspects. We present these differences in the first section to provide motivation for the proposed changes to the hierarchical policy for cluster systems. We enhance the hierarchical policy by adding a load-balancing component that can take local load fluctuations into account. Performance of this revised policy is compared with the space- and time-sharing policies used in the last chapter. Our results show that the revised policy handles local load variations and system heterogeneity well and provides better performance than the other two policies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Dandamudi, S. (2003). Scheduling in Cluster Systems. In: Hierarchical Scheduling in Parallel and Cluster Systems. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0133-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0133-6_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4938-9
Online ISBN: 978-1-4615-0133-6
eBook Packages: Springer Book Archive