A dominant predecessor duplication scheduling algorithm for heterogeneous systems

Authors:
Kuan-Chou Lai;Chao-Tung Yang
Affiliations:
Department of Computer and Information Science, National Taichung University, Taichung, Taiwan 40302;Department of Computer Science and Information Engineering, Tunghai University, Taichung, Taiwan 40704
Venue:
The Journal of Supercomputing
Year:
2008

Citing 24
Cited 2

Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors

Proceedings of the 1992 ACM/IEEE conference on Supercomputing
A threshold scheduling strategy for Sisal on distributed memory machines

Journal of Parallel and Distributed Computing
A Scalable Scheduling Scheme for Functional Parallelism on Distributed Memory Multiprocessor Systems

IEEE Transactions on Parallel and Distributed Systems
Task Clustering and Scheduling for Distributed Memory Parallel Architectures

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)
Partitioning and Scheduling Parallel Programs for Multiprocessors

Partitioning and Scheduling Parallel Programs for Multiprocessors
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Link contention-constrained scheduling and mapping of tasks

Cluster Computing
Grain Size Determination for Parallel Processing

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

IEEE Transactions on Parallel and Distributed Systems
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 Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
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
Communication Contention in Task Scheduling

IEEE Transactions on Parallel and Distributed Systems
Transformations to Parallel Codes for Communication-Computation Overlap

SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

Parallel Computing - Heterogeneous computing
Scheduling parallel tasks onto NUMA multiprocessors with inter-processor communication overhead

ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
The Iso-level scheduling heuristic for heterogeneous processors

EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing

Energy-Aware Scheduling Algorithm with Duplication on Heterogeneous Computing Systems

GRID '12 Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing
Task graph pre-scheduling, using Nash equilibrium in game theory

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new duplication-based task scheduling algorithm for distributed heterogeneous computing (DHC) systems. For such systems, many researchers have focused on solving the NP-complete problem of scheduling directed acyclic task graphs to minimize the makespan. However, the heterogeneity of computational resources and communication mechanisms poses some major obstacles to achieving high parallel efficiency. This paper proposes a heuristic strategy called the Dominant Predecessor Duplication (DPD) scheduling algorithm, which allows for system heterogeneities and communication bandwidth to exploit the potential of parallel processing. This algorithm can improve system utilization and avoid redundant resource consumption, resulting in better schedules. Experimental results show that the system heterogeneities and program structures of applications affect scheduling performance, and that our presented algorithm is better able to avoid these problems than those presented in previous literature. Here, we show that our algorithm can be applied to design efficient distributed systems to overcome performance bottlenecks caused by system heterogeneities.