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

    Research output: Contribution to journalArticleResearchpeer-review

    11 Citations (Scopus)

    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. © 2003 Elsevier Science B.V. All rights reerved.
    Original languageEnglish
    Pages (from-to)267-283
    JournalJournal of Systems Architecture
    Volume48
    Issue number8-10
    DOIs
    Publication statusPublished - 1 Mar 2003

    Keywords

    • Clustering
    • Graph partitioning
    • Heuristic algorithms
    • Mapping problem
    • Task allocation/assignment

    Fingerprint Dive into the research topics of 'Clustering and reassignment-based mapping strategy for message-passing architectures'. Together they form a unique fingerprint.

  • Cite this