By Topic

AMTHA: An Algorithm for Automatically Mapping Tasks to Processors in Heterogeneous Multiprocessor Architectures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
De Giusti, Laura ; Sch. of Comput. Sci., UNLP, La Plata, Argentina ; Luque, E. ; Chichizola, F. ; Naiouf, M.
more authors

An automatic task-to-processor mapping algorithm is analyzed in parallel systems that run over loosely coupled distributed architectures. The MPAHA (Model on Parallel Algorithms on Heterogeneous Architectures) model that allows predicting parallel application performance running over heterogeneous architectures is presented. In particular, the heterogeneity of both processors and communications is taken into consideration. From the results obtained with the MPAHA model, the AMTHA (Automatic Mapping Task on Heterogeneous Architectures) algorithm for task-to-processors assignment is presented and its implementation is analyzed. Experimental results compare execution time obtained with AMTHA mapping scheme with those obtained using the known mapping algorithm HEFT (Heterogeneous - Earliest Finish - Time), using a simple heterogeneous multicluster architecture. Finally actual lines of research are presented, focusing extensions to multicore processors and Grid environments.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:2 )

Date of Conference:

March 31 2009-April 2 2009