Clustering and reassignment-based mapping strategy for message-passing architectures

  • Authors:

  • Miquel A. Senar;Ana Ripoll;Ana Cortés;Emilio Luque

  • Affiliations:

  • Departament d'Informàtica, Unitat d'Arquitectura d'Ordinadors i Sistemes Operatius, Universitat Autònoma de Barcelona, 08193 Bellaterra (Barcelona), Spain;Departament d'Informàtica, Unitat d'Arquitectura d'Ordinadors i Sistemes Operatius, Universitat Autònoma de Barcelona, 08193 Bellaterra (Barcelona), Spain;Departament d'Informàtica, Unitat d'Arquitectura d'Ordinadors i Sistemes Operatius, Universitat Autònoma de Barcelona, 08193 Bellaterra (Barcelona), Spain;Departament d'Informàtica, Unitat d'Arquitectura d'Ordinadors i Sistemes Operatius, Universitat Autònoma de Barcelona, 08193 Bellaterra (Barcelona), Spain

  • Venue:
  • Journal of Systems Architecture: the EUROMICRO Journal
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A fundamental issue affecting the performance of a parallel application running on message-passing parallel systems is the assignment of tasks to processors. In this paper we present a compilation-time two stage mapping strategy (denoted as Task Allocation by Clustering, Reassignment and Embedding, TACRE) used for mapping arbitrary programs (modeled as task interaction graphs) onto message-passing parallel systems. The first stage is based on task clustering and task reassignment algorithms that contract the original task graph. The second stage takes the contracted graph and tries to well match the physical properties of the target system. The results shown that TACRE provides a good trade-off between mapping quality and computational complexity.