Abstract
This paper deals with systolic algorithms for some path-finding problems. First we present the Guibas-Kung-Thompson systolic array for computing the reflexive and transitive closure of a binary relation. Then we introduce a more general class of all-pairs shortest paths problems in complete semi-rings which can not be solved using the previous array. We introduce the well-known Gauss-Jordan algorithm to solve this general class of problems, and we show how to map it onto a systolic array whose performances overcome those of all the systolic arrays previously introduced in the literature.
This work has been supported by the Coordinated Research Program C3 of C.N.R.S.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
AHMED H.M., DELOSME J.M., MORF M., Highly concurrent computing structures for matrix arithmetic and signal processing, Computer 15 (1982), 65–82
ATRUBIN A.J., A one-dimensional real time iterative multiplier, IEEE Trans. Computers 14, 6 (1965), 394–399
CODD E.F., Cellular Automata, Academic Press, 1968
COLE S.N., Real-time computation by n-dimensional iterative arrays of finite-state machines, IEEE Trans. Computers 18, 4 (1969), 349–365
GUIBAS L.J., KUNG H.T., THOMPSON C.D., Direct VLSI implementation of combinatorial algorithms, Proc. Caltech Conference on VLSI, California Inst. of Technology, Pasadena (1979), 509–525
HELLER D., Partitioning big matrices for small systolic arrays, in VLSI and Modern Signal Processing, S. Y. Kung et al. eds, Prentice Hall, Englewood Cliffs, NJ (1985), 185–199
HENNIE, Iterative arrays of logical circuits, MIT Press, Cambridge MA, U.S.A. 1961
HWANG K., CHENG Y.H., Partitioned matrix algorithm for VLSI arithmetic systems, IEEE Trans. Computers 31 (1982), 1215–1224
KRAMER M.R., VAN LEEUWEN J., Systolic computation and VLSI, Foundations of Computer Science IV, J.W. DeBakker et aJ. Van Leeeuwen eds (1983), 75–103
KUNG H.T., Why systolic architectures, Computer 15, 1 (1982), 37–46
KUNG H.T, LAM M.S. 1984 Fault-tolerance and two-level pipelining in VLSI systolic arrays, Journal of Parallel and Distributed Computing 1, 32–63
KUNG H.T, LEISERSON C.E., Systolic arrays (for VLSI), Proc. of the Symposium on Sparse Matrices Computations, I.S. Duff and G.W. Stewart eds, Knoxville (1978), 256–282
KUNG S.Y., On supercomputing with systolic/wavefront array processors, Proceedings of the IEEE 72 (1984), 867–884
KUNG S.Y., VLSI array processors, IEEE ASSP Magazine 2, 3 (1985), 4–22
KUNG S.Y., LO S.C., A spirial systolic architecture/algorithm for transitive closure problems, IEEE Int. Conf. on Computer Design ICCD'85, New-York, USA (1985), 622–626
MOLLER F., A survey of systolic systems for solving the Algebraic Path Problem, Report CS-85-22 (1985), Univ. of Waterloo, Canada
MORAGA C., Systolic Algorithms, Technical Report, Computer Science department (1984), University of Dortmund, F.R.G.
NASH J.G., HANSEN S., Modified Faddeev algorithm for matrix manipulation, Proc. 1984 SPIE Conf., San Diego, CA, USA, August 1984
ROBERT Y., Block LU decomposition of a band matrix on a systolic array, Int. J. Computer Math 17 (1985), 295–315
ROBERT Y., TCHUENTE M., Résolution systolique de systèmes linéaires denses, RAIRO Modélisation et Analyse Numérique 19 (1985), 315–326
ROBERT Y., TRYSTRAM D., Un réseau systolique orthogonal pour le problème du chemin algébrique, C.R.A.S. Paris, 302 I (1986), 241–244
ROTE G., A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion), Computing 34 (1985), 191–219
ULLMAN J.D., Computational aspects of VLSI, Chapter 5: Systolic algorithms, Computer Science Press, Rockville, Maryland, USA, 1984
VON NEUMANN, Theory of self-reproducing automata, University of Illinois Press, Urbana IL, U.S.A, 1966
WARSHALL S., A theorem on boolean matrices, J.A.C.M. 9, 1 (1972), 11–12
ZIMMERMANN U., Linear and combinatorial optimization in ordered algebraic structures, Ann. Discrete Math. 10 (1981), 1–380
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Robert, Y. (1988). Systolic algorithms for path-finding problems. In: Choffrut, C. (eds) Automata Networks. LITP 1986. Lecture Notes in Computer Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19444-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-19444-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19444-6
Online ISBN: 978-3-540-39270-5
eBook Packages: Springer Book Archive