Distribution assignment placement: A new aggressive approach for optimizing redistribution costs

Distribution assignment placement: A new aggressive approach for optimizing redistribution costs

Abstract

Dynamic data redistribution is a key technique for maintaining data locality and workload balance in data-parallel languages like High Performance Fortran (HPF). On the other hand, redistributions can be very expensive and significantly degrade a program's performance. In this article, we present a novel and aggressive approach for avoiding unnecessary remappings by eliminating partially dead and partially redundant distribution changes. Basically, this approach evolves from extending and combining two algorithms for these optimizations achieving optimal results for sequential programs. Optimality, however, becomes more intricate by the combination. Unlike the sequential setting the data-parallel setting leads to a hierarchy of algorithms of varying power and efficiency fitting a user's individual needs. The power and flexibility of the new approach are demonstrated by illustrating examples. First practical experiences underline its importance and effectivity.

Grafik Top
Authors
  • Mehofer, Eduard
  • Knoop, J.
Grafik Top
Shortfacts
Category
Technical Report (Technical Report)
Divisions
Scientific Computing
Publisher
Institute for Software Technology and Parallel Systems, University of Vienna
Date
1997
Official URL
http://www.par.univie.ac.at/publications/download/...
Export
Grafik Top