S3MP: A Task Duplication Based Scalable Scheduling Algorithm for Symmetric Multiprocessors

Authors:
Affiliations:
Venue:
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Year:
2000

Citing 0
Cited 1

A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

Parallel Computing - Heterogeneous computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a task duplication based scalable scheduling algorithm for Symmetric Multiprocessors (SMP), called S3MP (Scalable Scheduling for SMP), to address the problem of task scheduling. The algorithm pre-allocates network communication resources to avoid potential communication conflicts, and generates a schedule for the number of processors available in a SMP. This algorithm employs heuristics to select duplication of tasks so that schedule length is reduced/minimized. The performance of the S3MP algorithm has been observed by comparing the schedule length under various numbers of processors and the ratio of communication to computation cost. This algorithm also has been applied to some practical DAGs.