Skip to main content

Computing Transitive Closure Problem on Linear Systolic Array

  • Conference paper
Numerical Analysis and Its Applications (NAA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3401))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Roy, B.: Transitivite et connexite. C. R. Acad. Sci. Paris 249, 216–218 (1959)

    MATH  MathSciNet  Google Scholar 

  2. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Design and analysis of computer algorithms. Addison-wesley, Reading (1975)

    Google Scholar 

  3. Kung, H.T.: Why systolic architectures. Computer 15(1), 37–46 (1982)

    Article  Google Scholar 

  4. Johnson, K.T., Hurson, A.R., Shirazi, B.: General purpose systolic arrays. Computer 26(11), 20–31 (1993)

    Article  Google Scholar 

  5. Warshall, S.: A Theorem on Boolean matrices. J. ACM 9, 11–12 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. 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)

    Article  Google Scholar 

  8. 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)

    MATH  Google Scholar 

  9. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics