Advertisement

Cluster-partitioning approaches to mapping parallel programs onto a hypercube

  • P. Sadayappan
  • Fikret Ercal
Session 6A: Problem Mapping And Scheduling
Part of the Lecture Notes in Computer Science book series (LNCS, volume 297)

Abstract

The process-to-processor mapping problem is addressed in the context of a local-memory parallel computer with a hypercube interconnection topology. Two heuristic cluster-based mapping strategies are compared - 1) a nearest-neighbor approach and 2) a recursive-clustering scheme. The nearest-neighbor strategy is shown to be very effective with planar graphs and graphs with a high degree of locality while the recursive partitioning heuristic is better with highly irregular graphs.

Keywords

Load Balance Communication Cost Parallel Program Task Graph Mapping Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • P. Sadayappan
    • 1
  • Fikret Ercal
    • 1
  1. 1.Department of Computer and Information ScienceThe Ohio State UniversityColumbusUSA

Personalised recommendations