Abstract
This chapter focuses on the hierarchical organization introduced in the last chapter. Here, we study the impact of various scheduling policies on the performance of the hierarchical organization. We consider both job scheduling and task scheduling policies. We compare the performance of the FCFS job scheduling policy with two other policies that require a priori information on job characteristics. Our results show that both policies perform better than the FCFS policy. We also report the performance of four round robin task scheduling policies. It turns out that these preemptive round robin policies do not provide performance improvement over the FCFS task scheduling policy.
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). Performance of Scheduling Policies. 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_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0133-6_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4938-9
Online ISBN: 978-1-4615-0133-6
eBook Packages: Springer Book Archive