New program structuring heuristics for multi-processor systems with redundant communication resources

The paper presents a new graph structuring algorithm for look-ahead reconfigurable multi-processor systems. An application program in such a kind of system is partitioned into sections, which are executed using redundant communication resources. Thus program scheduling in a look-ahead environment incorporates the graph partitioning problem. The new proposed algorithm is based on list scheduling and utilizes a new section clustering heuristics for graph partitioning. The main difference between the proposed heuristics and existing ones lies in the new partitioning methodology, based on the critical path controlled, iterative algorithm. The new heuristics for vertex selection are also applied, which use the extensive range of the system and program parameters, including the reconfiguration critical point function. The experimental results are presented and compared with results of existing graph partitioning algorithms for such a kind of environment.