Summary: J. Parallel Distrib. Comput. 66 (2006) 77­98
www.elsevier.com/locate/jpdc
A semi-static approach to mapping dynamic iterative tasks onto
heterogeneous computing systems
Yu-Kwong Kwoka
, Anthony A. Maciejewskib
, Howard Jay Siegelb,c
, Ishfaq Ahmadd,
,
Arif Ghafoore
aDepartment of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong, Hong Kong
bDepartment of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO 80523-1373, USA
cDepartment of Computer Science, Colorado State University, Fort Collins, CO 80523-1873, USA
dDepartment of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX 76019-0015, USA
eSchool of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907-1285, USA
Received 17 February 2005; received in revised form 2 June 2005; accepted 23 June 2005
Available online 10 November 2005
Abstract
Minimization of the execution time of an iterative application in a heterogeneous parallel computing environment requires an appropriate
mapping scheme for matching and scheduling the subtasks of a given application onto the processors. Often, some of the characteristics

Source: Ahmad, Ishfaq - Department of Computer Science and Engineering, University of Texas at Arlington
Maciejewski, Anthony A. - Department of Electrical and Computer Engineering, Colorado State University

Collections: Computer Technologies and Information Sciences; Engineering