New Program Structuring Heuristics for Multi-Processor Systems with Redundant Communication Resources
International Conference on Parallel Computing in Electrical Engineering (PARELEC'02) (2002)
Sept. 22, 2002 to Sept. 25, 2002
Eryk Laskowski , Polish Academy of Sciences
<p>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 look-ahead environment incorporates 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 is also applied, which uses extensive range of system and program parameters, including the reconfiguration critical point function.</p> <p>The experimental results are presented and compared with results of existing graph partitioning algorithms for such a kind of environment.</p>
E. Laskowski, "New Program Structuring Heuristics for Multi-Processor Systems with Redundant Communication Resources," International Conference on Parallel Computing in Electrical Engineering (PARELEC'02)(PARELEC), Warsaw, Poland, 2002, pp. 183.