A path priority-based task scheduling algorithm for heterogeneous distributed systems

Authors:
R. Eswari;S. Nickolas;Michael Arock
Affiliations:
Department of Computer Applications, National Institute of Technology, Tiruchirappalli - 620015, Tamilnadu, India;Department of Computer Applications, National Institute of Technology, Tiruchirappalli - 620015, Tamilnadu, India;Department of Computer Applications, National Institute of Technology, Tiruchirappalli - 620015, Tamilnadu, India
Venue:
International Journal of Communication Networks and Distributed Systems
Year:
2014

Citing 16
Cited 0

Scheduling parallel program tasks onto arbitrary target machines

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

IEEE Transactions on Parallel and Distributed Systems
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
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
Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication

Journal of Parallel and Distributed Computing
Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments

Journal of Parallel and Distributed Computing
A New Approach to Scheduling Parallel Programs Using Task Duplication

ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 02
Improving Static Task Scheduling in Heterogeneous and Homogeneous Computing Systems

ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Research Note: A high performance algorithm for static task scheduling in heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Scheduling Concurrent Bag-of-Tasks Applications on Heterogeneous Platforms

IEEE Transactions on Computers
Contention-aware scheduling with task duplication

Journal of Parallel and Distributed Computing
Task scheduling in heterogeneous distributed systems with security and QoS requirements

International Journal of Communication Networks and Distributed Systems
SPA-based task scheduling for hypercubic P2P grid systems

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding an effective schedule of tasks of distributed applications on the heterogeneous distributed computing systems is a trade-off between minimising the makespan and maximising the processor utilisation. The performance can be exploited in these systems through proper scheduling of application tasks. In this paper, a new task scheduling algorithm, called path-based heuristic task scheduling PHTS algorithm is proposed. The performance of the proposed algorithm is experimentally compared with the three existing scheduling algorithms. The results show that the PHTS algorithm outperforms other algorithms in terms of schedule length ratio, speedup and efficiency for applications with more tasks.