Advertisement

Bottom-Up Scheduling with Wormhole and Circuit Switched Routing

  • Kanad Ghose
  • Neelima Mehdiratta

Abstract

We present a static list scheduling technique for assigning tasks of a parallel program described as a task graph onto a distributed memory multiprocessor (DMM). Our technique factors in the impact of inter-task communication delays in heuristics for processor selection and channel assignment. Unlike conventional list schedulers that schedule task graph nodes top-down, we schedule task graph nodes bottom-up to get a better estimate of the scheduling weight of a task in the face of finite communication delays [2]. In [3] and [4], we applied and evaluated our scheduler for message switched architectures for a variety of interconnection topologies. This paper describes our scheduling technique as applied to hypercube connected systems using wormhole and circuit-switched routing.

Keywords

Communication Cost Critical Path Terminal Node Channel Assignment Channel Allocation 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H. El-Rewini and T. G. Lewis, “Scheduling Parallel Program Tasks onto Arbitrary Target Machines,” Journal of Parallel and Distributed Computing, 9, pp. 138–153, 1990.CrossRefGoogle Scholar
  2. [2]
    K. Ghose and N. Mehdiratta, “A Universal Approach for Task Scheduling for Distributed Memory Multiprocessors”, in Proc. Scalable High Perf. Computing Conf. 1994 (SHPCC 94), pp. 577–584.Google Scholar
  3. [3]
    N. Mehdiratta and K. Ghose, “Scheduling Task Graphs onto Distributed Memory Multiprocessors Under Realistic Constraints”, in Proc. Parallel Architectures and Languages Europe, pp. 589–600, 1994 (PARLE 94).CrossRefGoogle Scholar
  4. [4]
    N. Mehdiratta and K. Ghose, “A Bottom-Up Approach To Task Scheduling on Distributed Memory Multiprocessors”, in Proc. Int. Conf. Parallel Processing, vol. 2 pp. 151–154, 1994.Google Scholar

Copyright information

© Springer Science+Business Media New York 1996

Authors and Affiliations

  • Kanad Ghose
    • 1
  • Neelima Mehdiratta
    • 1
  1. 1.Department of Computer ScienceState University of New YorkBinghamtonUSA

Personalised recommendations