CPOC: effective static task scheduling for grid computing

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:
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
Year:
2005

Citing 17
Cited 3

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
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
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
Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The Anatomy of the Grid: Enabling Scalable Virtual Organizations

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Grid Computing: Making the Global Infrastructure a Reality

Grid Computing: Making the Global Infrastructure a Reality
Hybrid Task Scheduling: Integrating Static and Dynamic Heuristics

SBAC-PAD '03 Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing
Near-optimal dynamic task scheduling of precedence constrained coarse-grained tasks onto a computational grid

ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing

Research Note: A high performance algorithm for static task scheduling in heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Robust scheduler for grid networks under uncertainties of both application demands and resource availability

Computer Networks: The International Journal of Computer and Telecommunications Networking
A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks

Journal of Parallel and Distributed Computing

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 and CPOP is one of the scheduling algorithms. In this paper we present new scheduling algorithms, CPOC and CPOC_E by modifying the CPOP. We use a cluster of processors for critical-path tasks while a single processor is used in the CPOP. This heuristic is useful for realistic Grid 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 non critical-path tasks are scheduled. For performance study we developed a task graph generator and a tool which would support more realistic network configuration. The experimental results show our scheduling algorithm outperforms the CPOP as well as the HEFT.