Advertisement

Fast Scheduling and Partitioning Algorithm in the Multi-processor System with Redundant Communication Resources

  • Eryk Laskowski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2328)

Abstract

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.

Keywords

Schedule Algorithm Direct Acyclic Graph Program Execution Multiprocessor System List Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    J.-J. Hwang, Y.-Ch. Chow, F. D. Angers, Ch.-Y. Lee; Scheduling Precedence Graphs in Systems with Interprocessor Communication Times, Siam J. Comput., Vol. 18, No. 2, pp. 244–257, April 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  3. 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. 4.
    T. Kalinowski, Program Execution Control in Dynamically Reconfigurable Multi-Processor Systems, PhD Thesis, Institute of Computer Science PAS, Warsaw 1997.Google Scholar
  5. 5.
    El-Rewini H., Lewis T. G., Ali H. H. Task Scheduling in Parallel and Distributed Systems. Prentice Hall 1994Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Eryk Laskowski
    • 1
  1. 1.Institute of Computer SciencePolish Academy of SciencesWarsawPoland

Personalised recommendations