Program Structuring Heuristics for Parallel Systems Based on Multiple Crossbar Switches

Abstract

A new graph structuring algorithm for look-ahead reconfigurable multi-processor systems based on multiple crossbar switches is presented. It is based on list scheduling and a new iterative clustering heuristics for graph partitioning. Look-ahead dynamic inter-processor connection reconfiguration is a multi-processor architectural model, which has been proposed to eliminate connection reconfiguration time overheads. It consists in preparing link connections in advance in parallel with program execution. An application program is partitioned into sections, which are executed using redundant communication resources, i.e. crossbar switches. Parallel program scheduling in such a kind of environment incorporates graph partitioning problem. The experimental results are presented, which compare the performance of several graph partitioning algorithms for such a kind of environment.