Abstract
In the last chapter, we looked at the centralized and distributed organizations, which are frequently used in multiprocessor systems. Each of these organizations has its advantages and drawbacks. In this chapter, we present a task queue organization that incorporates the best features of these two organizations while minimizing the impact of their problems on the overall performance of the system. We show that the hierarchical organization presented here indeed achieves this objective. In fact, as the later chapters show, this organization is suitable to devise scheduling policies for a variety of systems including shared-memory and distributed-memory systems as well as 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
This chapter is based on “A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems” by S. P. Dandamudi and S. P. Cheng, which appeared in IEEE Trans. Parallel and Distributed Systems, Vol. 6, January 1995, pp. 1–16. © 1995 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). Hierarchical Task Queue Organization. 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_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0133-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4938-9
Online ISBN: 978-1-4615-0133-6
eBook Packages: Springer Book Archive