Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Fast and Effective Task Scheduling in Heterogeneous Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
ICPADS '02 Proceedings of the 9th International Conference on Parallel and Distributed Systems
A Task Duplication Based Scheduling Algorithm with Optimality Condition in Heterogeneous Systems
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Improving Scheduling of Tasks in a Heterogeneous Environment
IEEE Transactions on Parallel and Distributed 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
DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications
Journal of Parallel and Distributed Computing
Toward a Realistic Task Scheduling Model
IEEE Transactions on Parallel and Distributed Systems
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
HASE '07 Proceedings of the 10th IEEE High Assurance Systems Engineering Symposium
An Availability-Aware Task Scheduling Strategy for Heterogeneous Systems
IEEE Transactions on Computers
A Low-Complexity Task Scheduling Algorithm for Heterogeneous Computing Systems
AMS '09 Proceedings of the 2009 Third Asia International Conference on Modelling & Simulation
An Improved Task Scheduling Algorithm for Heterogeneous Systems
CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 01
Heterogeneity-Aware Task Scheduling Using Critical Path in Grid Environments
ICSPS '09 Proceedings of the 2009 International Conference on Signal Processing Systems
Resource allocation strategies for constructive in-network stream processing
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms
IEEE Transactions on Parallel and Distributed Systems
Earliest starting and finishing time duplication-based algorithm
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Posterior task scheduling algorithms for heterogeneous computing systems
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Journal of Systems and Software
A simple scheduling heuristic for heterogeneous computing environments
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
| Hi-index | 0.00 |
One of the main issues in distributed computing systems is to determine an optimal task-scheduling method. In this paper, we present an effective algorithm to schedule a directed acyclic graph onto a heterogeneous distributed system, called the Earliest Starting and Finishing time Duplication based (ESFD) algorithm. Our proposed algorithm considers all parameters associated with the processors, the task, and its immediate predecessors to perform an effective task allocation. The ESFD algorithm is a three-phase algorithm with a dynamic phase to assign a priority to each task. Simulation results on both random graphs and real application graphs show that the network storage link, speedup, and efficiency generated by ESFD algorithm are better than those generated by the well-known Heterogeneous Critical Parent Trees, Heterogeneous Earliest Finish Time, and Levelized Heavily Communicating Node First algorithms.