Systolic algorithms for some scheduling and graph problems

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


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H.-T. Kung and M. Lam, “Fault-tolerance and two-level pipelining in VLSI systolic arrays,”Proc. 1984 Conference on Advanced Research in VLSI, Ed. Paul Penfield, Jr. Dedham, MA: Artech House, pp. 74–83.Google Scholar
  2. 2.
    C. Savage and M. Stallmann, “Decomposability and fault-tolerance in one-dimensional array algorithms,” 1987. In preparation.Google Scholar
  3. 3.
    K. Baker,Introduction to sequenching and scheduling, New York: Wiley, 1974.Google Scholar
  4. 4.
    G. Gallo, “An O(n log n) algorithm for the convex bipartite matching problem,”Oper. Res. Lett., vol. 3, 1984, pp. 31–34.MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    F. Glover, “Maximum matching in a convex bipartite graph,”Naval Res. Logist. Quart, vol. 14, 1967, pp. 313–316.CrossRefMATHGoogle Scholar
  6. 6.
    E. Horowitz and S. Sahni,Fundamentals of computer algorithms, Rockville, MD: Computer Science Press, 1978.MATHGoogle Scholar
  7. 7.
    O. Ibarra, M. Palis, and S. Kim, “Some results concerning linear iterative (systolic) arrays,”Journal of Parallel and Distributed Computing, vol. 2, 1985, pp. 182–218.CrossRefGoogle Scholar
  8. 8.
    J. Van Leeuwen and M. Nivat, “Efficient recognition of rational relations,”Inform. Processing Lett., vol. 14, 1982, pp. 34–38.CrossRefMATHGoogle Scholar
  9. 9.
    O. Ibarra, S. Kim, and M. Palis, “Designing systolic algorithms using sequential machines,”IEEE Trans. on Comput., vol. 35, 1986, pp. 531–542.MathSciNetCrossRefGoogle Scholar
  10. 10.
    J.A.B. Fortes and F. Parisi-Presicce, “Optimal linear schedules for the parallel execution of algorithms,”Proc. International Conference on Parallel Processing, 1984.Google Scholar
  11. 11.
    G.J. Li and B.W. Wah, “The design of optimal systolic arrays,”IEEE Transactions on Computers, vol. C-34, 1985, pp. 66–77.MATHGoogle Scholar
  12. 12.
    D.I. Moldovan, “On the design of algorithms for VLSI systolic arrays,”Proc. IEEE, vol. 71, 1983, pp. 113–120.CrossRefGoogle Scholar
  13. 13.
    M.T. O'Keefe and J.A.B. Fortes, “A comparative study of two systematic design methodologies for systolic arrays,”Proc. International Conference on Parallel Processing, 1986, pp. 672–675.Google Scholar
  14. 14.
    U. Gupta, D. Lee, and J. Leung, “An optimal solution for the channel-assignment problem,”IEEE Trans. on Comput., vol. C-28, 1979, pp. 807–810.CrossRefMATHGoogle Scholar
  15. 15.
    E. Dekel and S. Sahni, “A parallel matching algorithm for convex bipartite graphs and applications to scheduling,”J. of Parallel and Distributed Computing, 1, 1984, pp. 185–205.CrossRefGoogle Scholar

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