Welcome to the InfoSci Platform
Process Scheduling Using Task Duplication in Heterogeneous Distributed Systems

Process Scheduling Using Task Duplication in Heterogeneous Distributed Systems

Jeffrey Elcock, Pranay Chaudhuri
Copyright: © 2012 |Pages: 13
ISBN13: 9781613504772|ISBN10: 1613504772|EISBN13: 9781613504789
DOI: 10.4018/978-1-61350-477-2.ch014
Cite Chapter Cite Chapter

MLA

Elcock, Jeffrey, and Pranay Chaudhuri. "Process Scheduling Using Task Duplication in Heterogeneous Distributed Systems." Next Generation Data Communication Technologies: Emerging Trends, edited by Debashis Saha and Varadharajan Sridhar, IGI Global, 2012, pp. 296-308. https://doi.org/10.4018/978-1-61350-477-2.ch014

APA

Elcock, J. & Chaudhuri, P. (2012). Process Scheduling Using Task Duplication in Heterogeneous Distributed Systems. In D. Saha & V. Sridhar (Eds.), Next Generation Data Communication Technologies: Emerging Trends (pp. 296-308). IGI Global. https://doi.org/10.4018/978-1-61350-477-2.ch014

Chicago

Elcock, Jeffrey, and Pranay Chaudhuri. "Process Scheduling Using Task Duplication in Heterogeneous Distributed Systems." In Next Generation Data Communication Technologies: Emerging Trends, edited by Debashis Saha and Varadharajan Sridhar, 296-308. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-61350-477-2.ch014

Export Reference

Mendeley
Favorite

Abstract

Task scheduling in heterogeneous parallel and distributed computing environments continues to be one of the most challenging problems. In this chapter, the authors investigate the Heterogeneous Earliest Finish Time (HEFT) algorithm, along with its alternative scheduling policies for the task prioritising phases, and the Critical Path on a Processor (CPOP) for scheduling tasks on a heterogeneous multiprocessor system. It is shown that, by combining the HEFT algorithm selection policy with the task duplication strategy, it is possible to further reduce the schedule length produced by both HEFT and CPOP. The process scheduling algorithm presented in this chapter compares favourably with other algorithms that use a similar strategy. The proposed algorithm has a time complexity of ?(|V|2(p + d)), whererepresents the number of tasks, p represents the number of processors, and d the maximum in-degree of tasks.

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.