Program structuring algorithms for dynamically reconfigurable parallel systems based on redundant connection switches

Abstract

A new program graph structuring algorithm for dynamically reconfigurable multi-processor systems based on the look-ahead dynamic connection reconfiguration is presented. This architectural model enables elimination of connection reconfiguration time overheads. It consists in preparing link connections in advance in redundant connection switches in parallel with program execution. An application program is partitioned into sections, which are executed using such connections. Parallel program scheduling in this environment incorporates graph partitioning problem. The new algorithm is based on list scheduling and a new iterative clustering heuristics for graph partitioning. The experimental results are presented, which compare performance of several graph partitioning heuristics for such environment.