AMTHA : an algorithm for automatically mapping tasks to processors in heterogeneous multiprocessor architectures

By: Contributor(s): Material type: ArticleArticleDescription: Datos electrónicos (1 archivo: 359 KB)Subject(s): Online resources: Summary: 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 communications is taken into consideration. the results obtained with the MPAHA model, the AMTHA (Automatic Mapping Task on Heterogeneous Architectures) algorithm for task-toprocessors assignment is presented 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 asimple heterogeneous multicluster architecture.Finally actual lines of research are presented,focusing extensions to multicore processors Gridenvironments.
Star ratings
    Average rating: 0.0 (0 votes)

Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.) -- Disponible también en línea (Cons. 04/05/2011)

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 communications is taken into consideration. the results obtained with the MPAHA model, the AMTHA (Automatic Mapping Task on Heterogeneous Architectures) algorithm for task-toprocessors assignment is presented 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 asimple heterogeneous multicluster architecture.Finally actual lines of research are presented,focusing extensions to multicore processors Gridenvironments.

WRI World Congress on Computer Science Information Engineering (2009 : Los Angeles)