Skip to main content

Systolic architectures, systems and computations

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1988)

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

Included in the following conference series:

Abstract

A variety of problems related to systolic architectures, systems and computations is discussed. The emphases are on fundamental and general problems of broader interest. The paper concentrates on theoretical models, techniques and results. Main motivations are discussed and interesting/important applications are shown. The main attention is devoted to problems related with synthesis, transformations and simulations of systolic systems and architectures. Special attention is paid to the study of the power and the structure of linear array computations. The goal is to present main problems, models and techniques in quite an informal way and to survey main directions and results.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bodlaender, H. L., van Leeuwen, J: Simulation of large networks on smaller networks. Tech. Rep. RUL-CS-84-4, Dept. of Comp. Sc., University of Utrecht.

    Google Scholar 

  2. Brooks, S. D.: Reasoning about synchronous systems, Dept. of Compt. Sc., Carnegie-Mellon University, CMU-CS-84-145.

    Google Scholar 

  3. Cappello, P. R., Steiglitz, K.: Unifying VLSI Design with Geometric Transformations, Proc. of the IEEE 1983 International Conference on Parallel Processing, 448–451.

    Google Scholar 

  4. Cerny, A., Gruska, J.: Modular trellises, In "The Book of L", Rozenberg, G. and Salomaa, eds., Springer-Verlag, 45–61.

    Google Scholar 

  5. Cerny, A., Gruska, J.: Modular real-time trellis automata. Fundamenta Informaticae IX, 253–282.

    Google Scholar 

  6. Chang, J. H., Chung, M. J., Ibarra, O. H., Rao, K. K.: Systolic tree implementations of data structures, Tech. Rep., Dept. of Comp. Sc., University of Minnesota.

    Google Scholar 

  7. Chang,J.H., Ibarra, O. H., Palis, M. A.: Parallel parsing on a one-way array of finite-state machines, Dept. of Computer Science, University of Minnesota, Tech. Rep. 85-20.

    Google Scholar 

  8. Chang, J. H., Ibarra, O. H.: On the power of one-way communication. TR 86-11, Dept. of Comp. Sc., University of Minnesota.

    Google Scholar 

  9. Chang, J. H., Ibarra, O. H., Palis, M. A.: Efficient simulations of simple models of parallel computation by time-bounded ATM's and space-bounded TM's. This Proceedings

    Google Scholar 

  10. Chen, M.: Very-high level programming in Crystal, Res. Rep., Dept. of Computer Science, RR 506, Yale University.

    Google Scholar 

  11. Choffrut,C., Culik II, K.: On Real-Time Cellular Automata and Trellis Automata, Acta Informatica, 21, 393–407.

    Google Scholar 

  12. Culik II, K., Fris, I.: Topological transformation as a tool in the design of systolic systems. Theoretical Computer Science, 37, 183–216.

    Google Scholar 

  13. Culik II, K., Gruska, J., Salomaa, A.: Systolic Trellis Automata, Part I and Part II, Inter., J. of Comp. Math., V15, 195–212, V 16, 3–22.

    Google Scholar 

  14. Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata: stability, decidability and complexity, Information and Control, V 71, N 3, 218–230.

    Google Scholar 

  15. Culik, K. II, Yu, S.: Real time pseudo real time and linear time ITA, Res. Rep. CS-86-03, Univ. of Waterloo.

    Google Scholar 

  16. Fischer, A. L.: Memory and modularity in systolic array implementations. Proceedings of the 1985 International Conference on Parallel Processing, 99–101.

    Google Scholar 

  17. deBaer, D., Paredaens, J.: A formal definition for systolic systems, Res. Rep. Dept. of Mathematics, University of Antwerp.

    Google Scholar 

  18. Fachini, E., Napoli, M.: C-tree systolic automata, Theoretical Computer Science, V 54.

    Google Scholar 

  19. Fiat, A., Shamir, A.: Polymorphic arrays: A novel VLSI layout for systolic comp-uters, STOC, 37–45.

    Google Scholar 

  20. Fischer, A. L, Kung, H. T.: Synchronizing large VLSI processor arrays, IEEE Transaction on Comput., VC-34, N 8, 734–740.

    Google Scholar 

  21. Frison, P., Gachet, P., Quinton, P.: Designing systolic arrays with DIASTOL. INRIA Research Report N 578.

    Google Scholar 

  22. Gruska, J.: Systolic automata-power, characterizations, nonhomogeneity, Proceedings of MFCS'84, LNCS 176, 32–49.

    Google Scholar 

  23. Hromkovic, J., Pardubska, D.: Some complexity aspects of VLSI computations. On the power of input bit permutations in tree and trellis automata, Computers and Artificial Intelligence, In print.

    Google Scholar 

  24. Hromkovic, J., Pardubska, D.: Some complexity aspects of VLSI computations. VLSI circuits with programs. Computers and Artificial Intelligence, In print.

    Google Scholar 

  25. Huang, C. H., Lengauer, C.: An implemented method for incremental systolic design. Proceedings of the conference PARLE. LNCS 259, VI, 160–177.

    Google Scholar 

  26. Ibarra, O. H.: Systolic arrays: characterizations and complexity. Proceedings of MFCS'86, LNCS 233, 140–153.

    Google Scholar 

  27. Ibarra, O. H., Jiang, T.: On some open problems concerning cellular arrays. Res. Rep.; Dept. of Comp. Sc., University of Minnesota.

    Google Scholar 

  28. Ibarra, O. H., Kim, S. M.: Characterizations and computational complexity of systolic trellis automata. Theoretical Computer Science, 29, 123–153.

    Google Scholar 

  29. Ibarra,O. H., Palis, M. A.: Two-dimensional systolic arrays: characterizations and applications. Theoretical Computer Science, V 56, N 1.

    Google Scholar 

  30. Ibarra, O. H., Palis, M. A., Kim, S. M.: Designing systolic algorithms using sequential machines, STOC, 46–55, also in IEEE Trans. on Computing.

    Google Scholar 

  31. Ibarra, O. H., Palis, M. A., Kim, S.: Some results concerning linear iterative (systolic) arrays, Journal of Parallel and Distributed Computing, V 2, 182–218.

    Google Scholar 

  32. Kochol, M.: Generalized Pascal triangles with maximal left periods. Computers and Artificial Intelligence, V6, N1, 54–76.

    Google Scholar 

  33. Korec, I.: Two kinds of processors are sufficient and large operating alphabets are necessary for regular trellis automata languages, Bulletin EATCS 23, 35–42.

    Google Scholar 

  34. Korec, I.: Generalized Pascal Triangles. Decidability Results. Acta Math. Univ. Comen., N 46–47, 93–130.

    Google Scholar 

  35. Korec, I.: Generalized Pascal triangles (In Slovak), Doctoral Thesis, Commenius University.

    Google Scholar 

  36. Korec,I.: Asymptotical densities in generalized Pascal Triangles, Computers and Artificial Inteligence, V 5, N 3, 187–198.

    Google Scholar 

  37. Korec, I.: Personal communication.

    Google Scholar 

  38. Kung, H. T.: Systolic algorithms for the CMU Warp processor. Tech. Rep. CMU-CS-84-158, Carnegie-Mellon University.

    Google Scholar 

  39. Kung, H. T.: Memory requirements for balanced computer architectures, Dept. of Comp. Sc., Carnegie-Mellon University.

    Google Scholar 

  40. Kung, H. T.: Warp Demo, Dept. of Comp. Sc., Carnegie-Mellon University.

    Google Scholar 

  41. Kung, H. T.: Special-purpose supercomputers. Information Processing IFIP'86, Participants edition, 565–570.

    Google Scholar 

  42. Kung, H. T., Lam, M.: Fault-Tolerance and Two-Level Pipelining in VLSI Systolic Arrays, Proceedings of the Conference on Advanced Research in VLSI, MIT.

    Google Scholar 

  43. Kung, H. T., Lam, M. S.: Wafer-Scale integration and two-level pipelined implementations of systolic arrays. Journal of Parallel and Distributed Processing, V 1, N 1.

    Google Scholar 

  44. Kung, H. T., Leiserson, C. E.: Systolic Arrays (for VLSI), Sparse Matrix Proceedings, Soc. for Industrial and Applied Mathematics, 256–282.

    Google Scholar 

  45. Kung, S. Y.: On supercomputing with systolic/wavefront array processor. Proceedings IEEE, V 72, pp. 867–884.

    Google Scholar 

  46. Lam, M., Mostow, J.: A Transformational Model of VLSI Systolic Design. Proceedings of the 6th International Symposium on Computer Hardware Description Languages and their Applications, IFIP, 65–67.

    Google Scholar 

  47. Leighton, F. T., Leiserson, C. E.: Wafer-Scale Integration of Systolic Arrays. IEEE Trans.on Comp. VC-34, N 5, 448–461.

    Google Scholar 

  48. Leiserson, C. E., Saxe, J. B.: Optimizing Synchronous Systems, FOCS Symposium, 23–36.

    Google Scholar 

  49. Leiserson, C. E., Rose, F. M., Saxe, J. B.: Optimizing Synchronous Circuitry by Retiming. Proceedings, Caltech Conference on Very Large Scale Integration, 87–116.

    Google Scholar 

  50. Li, G-J., Wah, B. W.: The design of optimal systolic arrays. IEEE Transactions on Computers, V C-34, N 1, 66–77.

    Google Scholar 

  51. Lisper, B.: Description and synthesis of systolic arrays, The Royal Institute of Technology Stockholm, Sweden, Dept. of Numerical Analysis and Computing Science.

    Google Scholar 

  52. Miranker, W. L., Winkler, A.: Space-time representations of computational structures. Computing, V 32, 93–114.

    Google Scholar 

  53. Moldovan, D. I.: On the design of algorithms for VLSI systems. Proceedings of the IEEE, V 71, N 1.

    Google Scholar 

  54. Pardubska, D.: Closure properties of the family of languages defined by systolic tree automata. Computers and Artificial Intelligence, V 7, N 1, 59–64.

    Google Scholar 

  55. Quinton, P.: The systematic design of systolic arrays, IRISA Research Report N 193.

    Google Scholar 

  56. Seduchin, S. G.: Systematic approach to the design of VLSI networks (In Russian). Preprint, Academy of Sciences, Novosibirsk.

    Google Scholar 

  57. Seduchin, S. G.: Personal communication.

    Google Scholar 

  58. Seduchin, S. G.: Design and analysis of systolic algorithms for algebraic path problem, Tech. Rep. Computing Center, Academy of Sciences, Novosibirsk.

    Google Scholar 

  59. Shapiro, E.: Systolic programming: a paradigm of parallel processing. Tech. Rep. CS-84-16, Dept. of Applied Mathematics, Weizmann Institute of Science, Rehovot.

    Google Scholar 

  60. Toffoli, T.: Cellular automata as an alternative to (rather than an approximation of) differential equations in modelling physics. In "Cellular Automata", Proceedings of an Interdisciplinary Workshop, Los Alamos, North-Holland, 117–127.

    Google Scholar 

  61. Varman, P. J., Ramakrishnan, I. V.: A fault-tolerant VLSI matrix multiplier Tech. Rep. 85/29, Dept. of Comp. Sc., SUNY at Stony Brook.

    Google Scholar 

  62. Weisser, U., Davis, A.: A Wavefront Notation Tool for VLSI Array Design. In VLSI Systems and Computations, H. T. Kung, R. F. Sproull and G. L. Steele, Jr. (eds.), Computer Science Press, 226–234.

    Google Scholar 

  63. Wolfram, S.: Statistical mechanics of cellular automata. Review of Modern Physics, V 55, N 3, 601–644.

    Google Scholar 

  64. Wolfram, S.: Universality and complexity in cellular automata. In "Cellular Automata", Proceedings of an Interdisciplinary Workshop, Los Alamos, 1–35.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Timo Lepistö Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gruska, J. (1988). Systolic architectures, systems and computations. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_121

Download citation

  • DOI: https://doi.org/10.1007/3-540-19488-6_121

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19488-0

  • Online ISBN: 978-3-540-39291-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics