HMM: a static mapping algorithm to map parallel applications on grids

Authors:
Ranieri Baraglia;Renato Ferrini;Pierluigi Ritrovato
Affiliations:
ISTI, Institute of the Italian National Research Council;ISTI, Institute of the Italian National Research Council;CRMPA, University of Salerno
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 11
Cited 0

Heuristic Algorithms for Task Assignment in Distributed Systems

IEEE Transactions on Computers
Metacomputing

Communications of the ACM
Task scheduling in parallel and distributed systems

Task scheduling in parallel and distributed systems
The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Using MPI (2nd ed.): portable parallel programming with the message-passing interface

Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Tabu Search

Tabu Search
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing

IEEE Transactions on Parallel and Distributed Systems
Guest Editor's Introduction: Heterogeneous Processing

Computer
Experiments in MIMD Parallelism

PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
A static mapping heuristics to map parallel applications to heterogeneous computing systems: Research Articles

Concurrency and Computation: Practice & Experience
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a static mapping heuristic, called Heterogeneous Multi-phase Mapping (HMM), which allows a suboptimal mapping of a parallel program onto a metacomputer to minimize the program execution time. HMM 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.