Abstract
Systolic Algorithms are computational procedures which may be efficiently implemented on systems which are representable as finite, deterministic, time-invariant, cellular automata. It is important to recall that the VLSI requirements of planarity, modularity of design and very short communication paths are inherent properties of systolic systems CKULE 78, SAVA 81]. That is why they constitute a very promising area in computer architecture at the VLSI or WSI levels. The usual criticism with respect to systolic systems is that they are too specialized: they achieve a very high efficiency at the price of inflexibility.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cappello P. and Steiglitz K.: Unifying VLSI array designs with geometric transformations. Proc. International Conference on Parallel Processing, 448–457. IEEE-CS-Press. (1983).
Floyd R.W.: Algorithm 97: Shortest Path. Comm. ACM 5, 345, (1962).
Kung H.T. and Leiserson C.E.: Systolic Arrays (for VLSI). Proc. Symposium on Sparse Matrix Computations and their Applications. SIAM-Press, (1978).
Kung S.Y., Lo S.C. and Lewis P.S.: Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems. IEEE Trans. on Computers C-36,(5), 603–614, (1987).
Leontief W.W.: “The Structure of American Economy”, Harvard University Press, Cambridge MA, (1941).
Moraga C.: Systolic Algorithms. Proc. Fall International Symposium on Applied Logic, 181–189, ISBN-84-600-4583-8, University of the Balearic Islands, (1984).
Savage J.E.: Area-time tradeoffs for matrix multiplication and related problems in VLSI models. Journal of Computer and System Sciences 22, 230–242, (1981).
Van Scoy F.L.: Parallel Algorithms in Cellular Spaces. Ph. D. Dissertation, University of Virginia, Charlotteville, VA, (1976).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moraga, C. (1988). A Systolic Algorithm for the Generalized Transitive Closure. In: Kastens, U., Rammig, F.J. (eds) Architektur und Betrieb von Rechensystemen. Informatik-Fachberichte, vol 168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73451-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-73451-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18994-7
Online ISBN: 978-3-642-73451-9
eBook Packages: Springer Book Archive