Systolic algorithms for some scheduling and graph problems

  • Oscar H. Ibarra
  • Tao Jiang
  • Jik H. Chang
  • Michael A. Palis
Article

DOI: 10.1007/BF00929924

Cite this article as:
Ibarra, O.H., Jiang, T., Chang, J.H. et al. J VLSI Sign Process Syst Sign Image Video Technol (1990) 1: 307. doi:10.1007/BF00929924

Abstract

We consider a simple model of a linear systolic array with serial input/output and one-way data communication. We show that such an array can be used to solve some scheduling and graph problems efficiently. The systolic algorithms are developed in two stages. First an algorithm on a restricted type of sequential machine is constructed. Then the sequential machine algorithm is transformed into a systolic algorithm. The transformation can be done automatically and efficiently.

Copyright information

© Kluwer Academic Publishers 1990

Authors and Affiliations

  • Oscar H. Ibarra
    • 1
  • Tao Jiang
    • 2
  • Jik H. Chang
    • 3
  • Michael A. Palis
    • 4
  1. 1.Department of Computer ScienceUniversity of CaliforniaSanta Barbara
  2. 2.Department of Computer Science and SystemsMcMaster UniversityHamiltonCanada
  3. 3.Department of Computer ScienceSogang UniversitySeoulSouth Korea
  4. 4.Department of Computer and Information ScienceUniversity of PennsylvaniaPhiladelphia

Personalised recommendations