Skip to main content
SpringerLink
Log in

Systolic arrays: Characterizations and complexity

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, A., A comparative study of X-tree, pyramid and related machines, Proc. 25th IEEE Annual Symp. on Foundation of Computer Science, (1984), 89–99.

    Google Scholar 

  2. Atallah, M. and S.R. Kosaraju, A Generalized dictionary machine for VLSI, IEEE Trans. Comput. C-34, 2 (1985), 151–155.

    Google Scholar 

  3. Bucher, W. and K. Culik II, On real time and linear time cellular automata, RAIRO, Inf. Theoretique, in press.

    Google Scholar 

  4. Cappello, P.R. and Steiglitz, K., Using VLSI array designs with geometric transformation, IEEE, (1983).

    Google Scholar 

  5. Chandra, A., Kozen, D., and Stockmeyer, L., Alternation, JACM, 28-1 (1981), 114–133.

    Google Scholar 

  6. Chang, J., O. Ibarra, and M. Palis, Parallel parsing on a one-way array of finite-state machines, Computer Science Department, University of Minnesota, Tech. Rep., May 1985; submitted to IEEE Trans. on Comput.

    Google Scholar 

  7. Chang, J., O. Ibarra, and M. Palis, Efficient simulations of simple models of parallel computation by space-bounded TM's and time-bounded alternating TM's, submitted to TCS.

    Google Scholar 

  8. Chang, J., M. Chung, O. Ibarra, and K. Rao, Systolic tree implementations of data structures, Computer Science Department, University of Minnesota, Tech. Rep. TR 85-32, Sept. 1985, submitted to IEEE Trans. Comput.

    Google Scholar 

  9. Chang, J. and O. Ibarra, A simple sytolic tree algorithm for solving recurrence equations, submitted to IPL.

    Google Scholar 

  10. Chen, M., Synthesizing systolic design, International Conference on VLSI, Taiwan, ROC, (1985), 209–215.

    Google Scholar 

  11. Chiang, Y. and K. Fu, Parallel parsing and VLSI implementations for syntactic pattern recognition, IEEE Trans. on Pattern Analysis and Machine Intelligence, 6, 3 (1984), 302–313.

    Google Scholar 

  12. Choffrut, C. and K. Culik II, On real-time cellular automata and trellis automata, Acta Inform., in press.

    Google Scholar 

  13. Cole, S.N., Real-time computation by n-dimensional iterative arrays of finite-state machines, IEEE Trans. on Comp. Vol. c-18, 349–365, (1969).

    Google Scholar 

  14. Culik II, K. and S. Yu, Iterative tree automata, TCS, 32 (1984), 227–247.

    Google Scholar 

  15. Culik II, K., O. Ibarra, and S. Yu, Iterative tree arrays with logarithmic depth, to appear in International Journal of Computer Mathematics; also Department of Computer Science, University of Waterloo, Tech. Rep. CS-85-03, (1985).

    Google Scholar 

  16. Dyer, C.R., One-way bounded cellular automata, Info. and Control. 44, (1980), 261–281.

    Google Scholar 

  17. Dyer, C.R. and A. Rosenfeld, Triangle cellular automata, Info. and Control, 48 (1981), pp. 54–69.

    Google Scholar 

  18. Goldschlager, L., A universal interconnection pattern for parallel computers, J. ACM, 29-3 (1982), pp. 1073–1086.

    Google Scholar 

  19. Harrison, M.A., Introduction to Formal language Theory, Addision Wesley (1978).

    Google Scholar 

  20. Ibarra, O., S. Kim, and M. Palis, Designing systolic algorithms using sequential machines, Proc. 25th IEEE Annual Symp. on Found. of Comput. Sci., 1984, 46–55. Full paper to appear in IEEE Trans. Comput.

    Google Scholar 

  21. Ibarra, O. and S. Kim, Characterizations and computational complexity of systolic trellis automata, TCS 29 (1984), 123–153.

    Google Scholar 

  22. Ibarra, O. and M. Palis, A tool for designing systolic algorithms in linear algebra, submitted to Parallel Computing.

    Google Scholar 

  23. Ibarra, O and M. Palis, Two-dimensional systolic arrays: characterizations and applications, submitted to Journal of Parallel and Distributed Computing.

    Google Scholar 

  24. Ibarra, O., M. Palis, and S. Kim, Some results concerning linear iterative (systolic) arrays, Journal of Parallel and Distributed Computing 2 (1985), 182–218.

    Google Scholar 

  25. Ibarra, O. and M. palis, VLSI algorithms for solving recurrence equations and applications, submitted to J. of VLSI and Systems.

    Google Scholar 

  26. Ibarra, O. and M. Palis, On efficient simulations of systolic arrays by random-access machines, submitted to SIAM J. on Computing.

    Google Scholar 

  27. Kung, H., Let's design algorithms for VLSI systems, Proceedings Caltech Conference on VLSI: Architecture, Design, Fabrication, (1979), 65–90.

    Google Scholar 

  28. Kung, H., Why systolic architectures?, Computer, Vol. 15, (1982), 37–46.

    Google Scholar 

  29. Kung, H., An algebra for VLSI algorithm design, CMU Tech. Report, (1983).

    Google Scholar 

  30. Kung, H., A listing of systolic papers, Department of Computer Science, Carnegie-Mellon University, May 1984.

    Google Scholar 

  31. Leiserson, C., Systolic priority queues, Report CMU-CS-79-115, Dept. of Computer Science, CMU, (1979).

    Google Scholar 

  32. Leiserson, C. and J. Saxe, Optimizing synchronous sytems, Proc. 22nd Annual Symp. Foundations of Computer Science, Oct. (1981), 23–36.

    Google Scholar 

  33. Li, G.-J. and B. Wah, The design of optimal systolic arrays, IEEE Trans. Comput., C-34, (1985), 66–77.

    Google Scholar 

  34. Lin, T.Z. and C.A. Mead, The application of group theory in classifying systolic arrays, Display File 5006, Caltech, (1982).

    Google Scholar 

  35. Masek, W. and M. Paterson, A faster algorithm for computing string-edit distances, Journal of Computer and System Sciences, 20 (1980), pp. 18–31.

    Google Scholar 

  36. Miranker, W.L., Space time representations of computational structures, Computing, (1984), 93–114.

    Google Scholar 

  37. Moldovan, D., On the design of algorithms for VLSI systolic arrays, Proc. IEEE, (1983).

    Google Scholar 

  38. Ottman, T., Rosenberg, A.L. and Stockmeyer, L.J., Dictionary machine for VLSI, IEEE Trans. Computers, Vol. C-32, 892–897, 1982. MST 10 (1977), 239–251.

    Google Scholar 

  39. Quinton, P., Automatic synthesis of systolic arrays from uniform recurrent equations, Proc. of 11th Annual Symp. on Computer Architecture, (1984), 208–214.

    Google Scholar 

  40. Ruzzo, W., On uniform circuit complexity, JCSS 22 (1981), 365–383.

    Google Scholar 

  41. Seiferas, J., Iterative arrays with direct central control, Acta Inform., 8 (1977), 177–192.

    Google Scholar 

  42. Smith III, A.R., Real-time language recognition by one-dimensional cellular automata, JCSS 6 (1972), 233–253.

    Google Scholar 

  43. Somani, A. and Agarwal, V., An Efficient unsorted VLSI dictionary machine, IEEE Trans. Comput. C-34, 9 (1985), 841–852.

    Google Scholar 

  44. Stockmeyer, L. and U. Vishkin, Simulation of parallel random-access machines by circuits, SIAM J. Computing, 13-2 (1984), 409–422.

    Google Scholar 

  45. Umeo, H., Morita, K., and Sugata, K., Deterministic one-way si, Deterministic one-way simulation of two-way real-time cellular automata and its related problems, IPL 14 (1982), 158–161.

    Google Scholar 

  46. Wagner, R. and M. Fischer, The string-to-string correction problem, Journal of the Association for Computing Machinery, 21 (1974), pp. 168–173.

    Google Scholar 

  47. Weiser, U. and A. Davis, A wavefront notation tool for VLSI array design, VLSI Systems and Computations, Computer Science Press, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Minnesota, 55455, Minneapolis, MN

    Oscar H. Ibarra

Authors
  1. Oscar H. Ibarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ibarra, O.H. (1986). Systolic arrays: Characterizations and complexity. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016239

Download citation

  • DOI: https://doi.org/10.1007/BFb0016239

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation