A task duplication based bottom-up scheduling algorithm for heterogeneous environments

Authors:
Doruk Bozdağ;Umit Catalyurek;Füsun Özgüner
Affiliations:
The Ohio State University, Dept. of Electrical and Computer Engineering, Columbus, OH;The Ohio State University, Dept. of Biomedical Informatics, Columbus, OH and The Ohio State University, Dept. of Electrical and Computer Engineering, Columbus, OH;The Ohio State University, Dept. of Electrical and Computer Engineering, Columbus, OH
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 12
Cited 8

On Exploiting Task Duplication in Parallel Program Scheduling

IEEE Transactions on Parallel and Distributed Systems
Statistical Prediction of Task Execution Times through Analytic Benchmarking for Scheduling in a Heterogeneous Environment

IEEE Transactions on Computers
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
Fast and Effective Task Scheduling in Heterogeneous Systems

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
A Task Duplication Based Scheduling Algorithm with Optimality Condition in Heterogeneous Systems

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Triplet: A Clustering Scheduling Algorithm for Heterogeneous Systems

ICPPW '01 Proceedings of the 2001 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
A Cluster-based Strategy for Scheduling Task on Heterogeneous Processors

SBAC-PAD '04 Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing
A Task Duplication Based Scheduling Algorithm Using Partial Schedules

ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing

Minimizing Energy Consumption for Precedence-Constrained Applications Using Dynamic Voltage Scaling

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems

Journal of Parallel and Distributed Computing
Optimizing latency and throughput of application workflows on clusters

Parallel Computing
Latency modeling and minimization for large-scale scientific workflows in distributed network environments

Proceedings of the 44th Annual Simulation Symposium
On a multi-objective evolutionary algorithm for optimizing end-to-end performance of scientific workflows in distributed environments

Proceedings of the 45th Annual Simulation Symposium
A Distributed Workflow Management System with Case Study of Real-life Scientific Applications on Grids

Journal of Grid Computing
Deadline-constrained workflow scheduling algorithms for Infrastructure as a Service Clouds

Future Generation Computer Systems
Resource Minimization for Real-Time Applications Using Computer Clouds

UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new duplication-basedDAG scheduling algorithm for heterogeneous computing environments. Contrary to the traditional approaches, proposed algorithm traverses the DAG in a bottom-up fashion while taking advantage of task duplication and task insertion. Experimental results on random DAGs and three different application DAGs show that the makespans generated by the proposed DBUS algorithm are much better than those generated by the existing algorithms, HEFT, HCPFD and HCNF.