A static mapping heuristics to map parallel applications to heterogeneous computing systems

Baraglia R., Ferrini R., Ritrovato P.

Computational Theory and Mathematics  Computer Science Applications  Theoretical Computer Science  Process Management  Software  Computer Networks and Communications 

In order to minimize the execution time of a parallel application running on a heterogeneously distributed computing system, an appropriate mapping scheme is needed to allocate the application tasks to the processors . The general problem of mapping tasks to machines is a well known NP-hard problem and several heuristics have been proposed to approximate its optimal solution. In this paper we propose a static graph-based mapping algorithm, called Heterogeneous Multi-phase Mapping (HMM), that permits suboptimal mapping of a parallel application onto a heterogeneous computing distributed system by using a local search technique together with a tabu search meta-heuristic. HMM allocates parallel tasks by exploiting the information embedded in the parallelism forms used to implement an application, and considering an affinity parameter, that identifies which machine in the HC system is most suitable for executing a task. We compare HMM with four different leading techniques and with an exhaustive mapping algorithm. We also give an example of mapping of two real applications using HMM. Experimental results show that HMM performs well demonstrating the applicability of our approach.

Source: Concurrency and computation 17 (2005): 1579–1605. doi:10.1002/cpe.902

Publisher: John Wiley & Sons,, Chichester, UK , Regno Unito

Metrics