Scheduling in Distributed-Memory Multicomputers

  • Sivarama Dandamudi
Part of the Series in Computer Science book series (SCS)


This chapter presents the hierarchical scheduling policy for distributed-memory multicomputers. It is based on the basic hierarchical task queue organization we introduced in Chapter 4. However, task movement and scheduling as well as communication overheads are different from those in the shared-memory systems discussed in the last chapter. Thus, we use a different workload model that takes the increased communication costs into account. We compare the performance of the hierarchical policy with a space-sharing policy and a time-sharing policy.


Service Demand Space Sharing Task Queue Hierarchical Schedule Local Queue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 2.
    This chapter is based on “A Hierarchical Scheduling Policy for Distributed-Memory Multicomputer Systems” by S. P. Dandamudi and T. K. Thyagaraj, which appeared in IEEE Int. Conf. High Performance Computing, Bangalore, India, December 1997, pp. 218–223. © 1997 IEEE.Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Sivarama Dandamudi
    • 1
  1. 1.Carleton UniversityOttawaCanada

Personalised recommendations