Scalable scheduling for symmetric multiprocessors (SMP)

Authors:
Oh-Han Kang;Dharma P. Agrawal
Affiliations:
Department of Computer Education, Andong National University, Andong, Kyungbuk, 760-749 South Korea;Department of Electrical and Computer Engineering and Computer Science Center for Distributed and Mobile Computing, University of Cincinnati, 816 Engineering Research Centre Building, Box 210030, ...
Venue:
Journal of Parallel and Distributed Computing
Year:
2003

Citing 11
Cited 1

Design of the AlphaServer multiprocessor server systems

Digital Technical Journal
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Coordinating parallel processes on networks of workstations

Journal of Parallel and Distributed Computing
A task duplication based scalable scheduling algorithm for distributed memory systems

Journal of Parallel and Distributed Computing
In search of clusters (2nd ed.)

In search of clusters (2nd ed.)
Task Scheduling in Multiprocessing Systems

Computer
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor Systems

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors

Proceedings of the 8th International Symposium on Parallel Processing
Building Synthetic Parallel Programs: the Project ALPES

Proceedings of the IFIP WG 10.3 Workshop on Programming Environments for Parallel Computing

Iterative list scheduling for heterogeneous computing

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.01

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 so as 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 algorithm can schedule the tasks of a directed acyclic graph (DAG) on to the processors of SMP with a worst case time complexity O(V2), where V is the number nodes of the DAG. The performance of the S3MP algorithm has been observed by comparing the schedule length under various number of processors and the ratio of communication to computation cost. This algorithm also has been applied to some practical DAGs.