Scheduling parallel tasks onto NUMA multiprocessors with inter-processor communication overhead

Authors:
Guan-Joe Lai;Jywe-Fei Fang;Pei-Shan Sung;Der-Lin Pean
Affiliations:
National Taichung Teachers College, Taichung, Taiwan, R.O.C.;Tung Nan Institute of Technology, Taipei, Taiwan, R.O.C.;National Taichung Teachers College, Taichung, Taiwan, R.O.C;Silicon Integrated Systems Corp., Hsin-Chu, Taiwan, R.O.C.
Venue:
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Year:
2003

Citing 13
Cited 2

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Program partitioning for NUMA multiprocessor computer systems

Journal of Parallel and Distributed Computing - Special issue on performance of supercomputers
Task Clustering and Scheduling for Distributed Memory Parallel Architectures

IEEE Transactions on Parallel and Distributed Systems
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
On Parallelizing the Multiprocessor Scheduling Problem

IEEE Transactions on Parallel and Distributed Systems
On Exploiting Task Duplication in Parallel Program Scheduling

IEEE Transactions on Parallel and Distributed Systems
Partitioning and Scheduling Parallel Programs for Multiprocessors

Partitioning and Scheduling Parallel Programs for Multiprocessors
Operating Systems Theory

Operating Systems Theory
Task Scheduling in Multiprocessing Systems

Computer
Hypertool: A Programming Aid for Message-Passing Systems

IEEE Transactions on Parallel and Distributed Systems
A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures

IEEE Transactions on Parallel and Distributed Systems
Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors

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

IEEE Transactions on Parallel and Distributed Systems

Dynamic Critical Path Duplication Task Scheduling Algorithm for Distributed Heterogeneous Computing Systems

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A dominant predecessor duplication scheduling algorithm for heterogeneous systems

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of scheduling tasks onto Non-Uniform Memory Access (NUMA) multiprocessors with a bounded number of processors. An algorithm is proposed to schedule tasks by considering intertask communication overhead. The proposed algorithm exploits the schedule-holes in schedules; therefore, it could produce better schedules than that produced by existing algorithms. The proposed algorithm ensures performance within a factor of two times of the optimum for general directed acyclic task graphs. Experimental results demonstrate the superiority of the proposed algorithm over that presented in literature. A sharper bound on the multiprocessor scheduling problem by considering communication delay is also shown.