Scheduling convex bipartite communications toward efficient GEN_BLOCK transformations

Abstract

Irregular data redistribution is used to enhance data locality and algorithm performance on heterogeneous processor systems. In this paper, we present an efficient scheduling algorithm based on convex bipartite communications for irregular GEN_BLOCK transformations. The proposed technique consists of two phases: degree reduction phase, schedules communications involved in processors with degree greater than two; and coloring phase, schedules remaining communications of all processors with degree-2 and degree-1. To evaluate the performance of our algorithm, we have implemented the proposed technique along with three scheduling methods. The simulation results show improvement of total communication costs by the proposed algorithm. © Springer-Verlag Berlin Heidelberg 2005.