Fast Scheduling and Partitioning Algorithm in the Multi-processor System with Redundant Communication Resources
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. Parallel program scheduling in such a kind of environment incorporates graph partitioning problem. The paper presents a scheduling algorithm for look-ahead reconfigurable multi-processor systems. It is based on list scheduling and utilizes a fast section clustering heuristic for graph partitioning. The experimental results are compared with results of a genetic graph partitioning algorithm.
KeywordsSchedule Algorithm Direct Acyclic Graph Program Execution Multiprocessor System List Schedule
Unable to display preview. Download preview PDF.
- 1.M. Tudruj, Look-Ahead Dynamic Reconfiguration of Link Connections in Multi-Processor Architectures, Parallel Computing’ 95, Gent, Sept. 1995, pp. 539–546.Google Scholar
- 3.E. Laskowski, M. Tudruj, A Testbed for Parallel Program Execution with Dynamic Look-Ahead Inter-Processor Connections, Proc. of the 3rd Int. Conf. on Parallel Processing and Applied Mathematics PPAM’ 99, Sept. 1999, Kazimierz Dolny, pp. 427–436.Google Scholar
- 4.T. Kalinowski, Program Execution Control in Dynamically Reconfigurable Multi-Processor Systems, PhD Thesis, Institute of Computer Science PAS, Warsaw 1997.Google Scholar
- 5.El-Rewini H., Lewis T. G., Ali H. H. Task Scheduling in Parallel and Distributed Systems. Prentice Hall 1994Google Scholar