Bottom-Up Scheduling with Wormhole and Circuit Switched Routing
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 . In  and , 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.
KeywordsCommunication Cost Critical Path Terminal Node Channel Assignment Channel Allocation
Unable to display preview. Download preview PDF.
- 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
- 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