Program graph scheduling in the look-ahead reconfigurable multiprocessor system

The paper presents scheduling algorithms in look-ahead reconfigurable multi-processor systems. In multiprocessor systems with message passing, link connection reconfiguration is a very promising alternative to fixed interconnection networks. To eliminate connection reconfiguration time overheads, a new approach called look-ahead dynamic link reconfiguration has been proposed. 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. Two algorithms for scheduling parallel program graphs are presented. The first algorithm, based on list scheduling utilizes a genetic heuristic for section partitioning. The second approach combines scheduling and partitioning into one heuristic