Systolic algorithms for some scheduling and graph problems
- 36 Downloads
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.
- 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.C. Savage and M. Stallmann, “Decomposability and fault-tolerance in one-dimensional array algorithms,” 1987. In preparation.Google Scholar
- 3.K. Baker,Introduction to sequenching and scheduling, New York: Wiley, 1974.Google Scholar
- 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
- 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