A critical predecessor duplication scheduling algorithm for distributed heterogeneous computing environments

Authors:
Kuan-Chou Lai;Chun-Mei Lee;Jywe-Fei Fang
Affiliations:
Department of Computer and Information Science, National Taichung University, Taichung, Taiwan, Republic of China;Department of Information Management, TungNan Institute of Technology, Taipei, Taiwan, Republic of China;Department of Digital Content and Technology, National Taichung University, Taichung, Taiwan, Republic of China
Venue:
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Year:
2006

Citing 10
Cited 2

Task Clustering and Scheduling for Distributed Memory Parallel Architectures

IEEE Transactions on Parallel and Distributed Systems
Link contention-constrained scheduling and mapping of tasks

Cluster Computing
Grain Size Determination for Parallel Processing

IEEE Software
On the Granularity and Clustering of Directed Acyclic Task Graphs

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
A Comparison Study of Static Mapping Heuristics for a Class of Meta-Tasks on Heterogeneous Computing Systems

HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
Improving Scheduling of Tasks in a Heterogeneous Environment

IEEE Transactions on Parallel and Distributed Systems
A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems

ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
NP-complete scheduling problems

Journal of Computer and System Sciences

An efficient A* algorithm for the directed linear arrangement problem

WSEAS Transactions on Computers
Using A* algorithm for directed linear arrangement problem

MAMECTIS'08 Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new duplication-based scheduling algorithm, called the Critical Predecessor Duplication scheduling algorithm, to exploit the potential of parallel processing in distributed heterogeneous computing systems. In such systems, designing efficient scheduling algorithm may lead to a significant variation in the generated schedule. The proposed scheduling algorithm could improve system utilization, avoid the redundant resource consumption, and then get the better schedules. Experimental results show the superiority of this algorithm to those presented in previous literature.