Mapping tasks to processors in heterogeneous multiprocessor architectures : the MATEHa algorithm
Material type:
ArticleSeries: ^p Datos electrónicos (1 archivo: 299 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. This research is based on the TTIGHa model that allows predicting parallel application performance running over heterogeneous architectures. In particular, the heterogeneity of both processors communications is taken into consideration. the results obtained with the TTIGHa model, the MATEHa algorithm for task-to-processors assignment is presented its implementation is analyzed. Experimental results working on subsets of twocluster heterogeneous machines are presented, analyzing the resulting mapping scheme with MATEHa two previous mapping methods: MATE HEFT. Finally, the algorithm robustness is considered based on the variation of model parameters: interprocess communication times processing times.
| Item type | Home library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Capítulo de libro
|
Biblioteca de la Facultad de Informática | A0230 (Browse shelf(Opens below)) | No corresponde |
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. 02/05/2011)
An automatic task-to-processor mapping algorithm is analyzed in parallel systems that run over loosely coupled distributed architectures. This research is based on the TTIGHa model that allows predicting parallel application performance running over heterogeneous architectures. In particular, the heterogeneity of both processors communications is taken into consideration. the results obtained with the TTIGHa model, the MATEHa algorithm for task-to-processors assignment is presented its implementation is analyzed. Experimental results working on subsets of twocluster heterogeneous machines are presented, analyzing the resulting mapping scheme with MATEHa two previous mapping methods: MATE HEFT. Finally, the algorithm robustness is considered based on the variation of model parameters: interprocess communication times processing times.
International Conference on the Chilean Computer Science Society (27th : 2008 : Punta Arenas)