Effective static task scheduling for realistic heterogeneous environment

Authors:
Junghwan Kim;Jungkyu Rho;Jeong-Ook Lee;Myeong-Cheol Ko
Affiliations:
Department of Computer Science, Konkuk University, Chungbuk, Korea;Department of Computer Science, Seokyeong University, Seoul, Korea;Department of Computer Science, Konkuk University, Chungbuk, Korea;Department of Computer Science, Konkuk University, Chungbuk, Korea
Venue:
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Year:
2005

Citing 11
Cited 0

Scheduling precedence graphs in systems with interprocessor communication times

SIAM Journal on Computing
Scheduling parallel program tasks onto arbitrary target machines

Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

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

IEEE Transactions on Parallel and Distributed Systems
Static scheduling algorithms for allocating directed task graphs to multiprocessors

ACM Computing Surveys (CSUR)
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
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
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
A taxonomy of scheduling in general-purpose distributed computing systems

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Effective task scheduling is crucial for achieving good performance in high performance computing. Many scheduling algorithms have been devised for heterogeneous computing, but most of algorithms have not been considered in realistic heterogeneous environments which are not arbitrarily heterogeneous but have locality in communication. In this paper we present new scheduling algorithms by considering the locality. It is thought that critical-path tasks are often important in reducing schedule length, however one of the previous scheduling algorithms, CPOP (Critical-Path-On-a-Processor) does not show good result against to expectation. Our first heuristic uses a cluster of processors for critical-path tasks while a single processor is used in the CPOP. This heuristic well exploits realistic computing environments in which communication costs are not arbitrarily heterogeneous. In an additional heuristic the critical-path tasks are considered to finish (or start) as early as possible when even non critical-path tasks are scheduled. For a performance study five scheduling algorithms are compared by experimenting on three different environments. The experimental results show our scheduling algorithm outperforms the others in the realistic heterogeneous environments.