Welcome to the InfoSci Platform
Reference Hub5
Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication

Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication

Pranay Chaudhuri, Jeffrey Elcock
Copyright: © 2010 |Volume: 6 |Issue: 1 |Pages: 12
ISSN: 1548-0631|EISSN: 1548-064X|ISSN: 1548-0631|EISBN13: 9781616929268|EISSN: 1548-064X|DOI: 10.4018/jbdcn.2010010104
Cite Article Cite Article

MLA

Chaudhuri, Pranay, and Jeffrey Elcock. "Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication." IJBDCN vol.6, no.1 2010: pp.58-69. http://doi.org/10.4018/jbdcn.2010010104

APA

Chaudhuri, P. & Elcock, J. (2010). Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication. International Journal of Business Data Communications and Networking (IJBDCN), 6(1), 58-69. http://doi.org/10.4018/jbdcn.2010010104

Chicago

Chaudhuri, Pranay, and Jeffrey Elcock. "Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication," International Journal of Business Data Communications and Networking (IJBDCN) 6, no.1: 58-69. http://doi.org/10.4018/jbdcn.2010010104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Scheduling tasks in heterogeneous parallel and distributed computing environments continues to be a challenging problem. In this paper, the authors investigate the Heterogeneous Earliest Finish Time (HEFT) algorithm, along with alternative scheduling policies for task prioritising phases and the Critical Path on a Processor (CPOP) for scheduling tasks on a heterogeneous multiprocessor system. The authors show 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 paper 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.