Welcome to the InfoSci Platform
Reference Hub2
An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication

Amrit Agrawal, Pranay Chaudhuri
Copyright: © 2011 |Volume: 3 |Issue: 1 |Pages: 9
ISSN: 1938-0259|EISSN: 1938-0267|EISBN13: 9781613507216|DOI: 10.4018/jghpc.2011010105
Cite Article Cite Article

MLA

Agrawal, Amrit, and Pranay Chaudhuri. "An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication." IJGHPC vol.3, no.1 2011: pp.89-97. http://doi.org/10.4018/jghpc.2011010105

APA

Agrawal, A. & Chaudhuri, P. (2011). An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication. International Journal of Grid and High Performance Computing (IJGHPC), 3(1), 89-97. http://doi.org/10.4018/jghpc.2011010105

Chicago

Agrawal, Amrit, and Pranay Chaudhuri. "An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication," International Journal of Grid and High Performance Computing (IJGHPC) 3, no.1: 89-97. http://doi.org/10.4018/jghpc.2011010105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs (DAGs). Scheduling refers to the assignment of these parallel tasks on a set of bounded heterogeneous processors connected by high speed networks. Since task assignment is an NP-complete problem, instead of finding an exact solution, scheduling algorithms are developed based on heuristics, with the primary goal of minimizing the overall execution time of the application or schedule length. In this paper, the overall execution time (schedule length) of the tasks is reduced using task duplication on top of the Critical-Path-On-a-Processor (CPOP) algorithm.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.