Abstract
We consider the problem of computing transitive closure of a given directed graph on the regular bidirectional systolic array. The designed array has n PEs, where n is a number of nodes in the graph. This is an optimal number for a given problem size.
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
Roy, B.: Transitivite et connexite. C. R. Acad. Sci. Paris 249, 216–218 (1959)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Design and analysis of computer algorithms. Addison-wesley, Reading (1975)
Kung, H.T.: Why systolic architectures. Computer 15(1), 37–46 (1982)
Johnson, K.T., Hurson, A.R., Shirazi, B.: General purpose systolic arrays. Computer 26(11), 20–31 (1993)
Warshall, S.: A Theorem on Boolean matrices. J. ACM 9, 11–12 (1962)
Kung, S.Y., Lo, S.C., Lewis, P.S.: Optimal systolic design for the transitive closure problem. IEEE Trans. Comput. C-36(5), 603–614 (1987)
Shang, W., Fortes, J.A.B.: On mapping of uniform dependence algorithms into lower dimensional processor arrays. IEEE Trans. Parall. Distr. Systems 3(3), 350–363 (1992)
Bekakos, M., Milovanović, E., Stojanović, N., Tokić, T., Milovanović, I., Milentijević, I.: Transformation matrices for systolic array synthesis. J. Electrothn. Math. 7, 9–15 (2002)
Bekakos, M.P., Milovanović, I.Ž., Milovanović, E.I., Tokić, T.I., Stojčev, M.K.: Hexagonal systolic arrays for matrix multiplications. In: Bekakos, M.P. (ed.) Series: advances in High Performance Computing, vol. 5, pp. 175–209. WITpress, Southampton (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milovanović, I.Ž., Milovanović, E.I., Randjelović, B.M. (2005). Computing Transitive Closure Problem on Linear Systolic Array. In: Li, Z., Vulkov, L., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2004. Lecture Notes in Computer Science, vol 3401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31852-1_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-31852-1_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24937-5
Online ISBN: 978-3-540-31852-1
eBook Packages: Computer ScienceComputer Science (R0)