Abstract
This chapter presents details about parallel job scheduling policies. Of necessity, we will not cover the complete spectrum of policies proposed in the literature. However, we point to a comprehensive reference on the subject matter. Our goal here is to give enough background information to motivate the reader for the hierarchical scheduling policies. The hierarchical policies are based on the hierarchical task queue organization that we discuss in the next chapter. The remainder of the book focuses on the hierarchical policy and shows how it can adapted to different types of parallel system architectures including shared-memory, distributed-memory, and cluster systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Based on “A Comparison of Task Scheduling Strategies for Multiprocessor Systems” by S. P. Dandamudi, which appeared in IEEE Symp. Parallel and Distributed Processing, IEEE CS Press, Los Alamitos, Calif., 1991, pp. 423–426. © 1991 IEEE.
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). Parallel Job Scheduling. 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_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0133-6_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4938-9
Online ISBN: 978-1-4615-0133-6
eBook Packages: Springer Book Archive