In this paper we present a static mapping heuristic, called Heterogeneous Multi-phase Mapping (
), which allows a suboptimal mapping of a parallel program onto a metacomputer to minimize the program execution time.
allocates parallel tasks by exploiting the information embedded in the parallelism forms used to implement an application. Moreover, it uses a local search technique together with the tabu search meta-heuristic. The experimental results show that the proposed approach performs well promising a significant potential to develop efficient mapping solutions for metacomputers.