Earliest starting and finishing time duplication-based algorithm

Authors:
Mahsa Hosseinzadeh;Hadi Shahriar Shahhoseini
Affiliations:
Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran;Electrical Engineering Department, Iran University of Science and Technology, Tehran, Iran
Venue:
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Year:
2009

Citing 13
Cited 1

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
An Efficient Optimization Technique for Task Matching and Scheduling in Heterogeneous Computing Systems

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
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
Levelized Scheduling of Directed A-Cyclic Precedence Constrained Task Graphs onto Heterogeneous Computing System

DFMA '05 Proceedings of the First International Conference on Distributed Frameworks for Multimedia Applications
Toward a Realistic Task Scheduling Model

IEEE Transactions on Parallel and Distributed Systems
An Availability-Aware Task Scheduling Strategy for Heterogeneous Systems

IEEE Transactions on Computers
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
A simple scheduling heuristic for heterogeneous computing environments

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

An effective duplication-based task-scheduling algorithm for heterogeneous systems

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimal task scheduling of a direct acyclic graph (DAG) onto distributed environments is a NP-hard problem. In this paper, we propose a new scheduling algorithm called Earliest Starting and Finishing time Duplication based (ESFD). ESFD has three phases: priority processing, task scheduling and task duplication. ESFD considers all parameters related to the task and its immediate predecessors to assigning a task. After each schedule ESFD will be updated its first phase, so ESFD is a dynamic algorithm. Experimental results on random graphs and real application graphs show that the NSL and speedups generated by the ESFD are better than those generated by the well-known HCPT, HEFT and LHCNF algorithms.