Skip to main content

I/O overhead and parallel VLSI architectures for lattice computations

  • Computer Architecture, Concurrency, Parallelism, Communication And Networking
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '90 (ICCI 1990)

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

Included in the following conference series:

Abstract

In this paper we introduce input/output (I/O) overhead ψ as a complexity measure for VLSI implementations of two-dimensional lattice computations of the type arising in the simulation of physical systems. We show by pebbling arguments that ψ = Ω(n −1) when there are n 2 processing elements available. If the results are required to be observed at every generation, and no on-chip storage is allowed, we show the lower bound is the constant 2. We then examine four VLSI architectures and show that one of them, the multi-generation sweep architecture, also has I/O overhead proportional to n −1. We compare the constants of proportionality between the lower bound and the architecture.

(Extended Abstract)

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. Cook, S.A. An Observation on Time-Storage Tradeoffs. In Proceedings of the 5th Annual ACM Symposium on the Theory of Computing, May 1973, pp. 29–33.

    Google Scholar 

  2. Dewdney, A.K. Computer Recreations. Scientific American 252, 5 (May 1985), 18–30.

    Google Scholar 

  3. Hong, J.W., and Kung, H.T. I/O Complexity: The Red-Blue Pebble Game. In Proceedings of the 13th Annual ACM Symposium on the Theory of Computing, May 1981, pp. 326–333.

    Google Scholar 

  4. Kugelmass, S.D., Squier, R., and Steiglitz, K. Performance of VLSI Engines for Lattice Computations. Complex Systems 1, 5 (Oct. 1987), 939–965.

    Google Scholar 

  5. Manohar, S. Supercomputing with VLSI, Ph.D. dissertation, Brown University, 1988.

    Google Scholar 

  6. Margolus, N., and Toffoli, T. Cellular Automata Machines. Complex Systems 1, 5 (Oct. 1987), 967–993.

    Google Scholar 

  7. Nodine, M.H., Lopresti, D.P., and Vitter, J.S. I/O Overhead and Parallel VLSI Architectures for Lattice Computations. IEEE Trans. on Computers (1990), to appear.

    Google Scholar 

  8. Poundstone, W. The Recursive Universe, Contemporary Books, Inc., Chicago (1985).

    Google Scholar 

  9. Savage, J.E., and Vitter, J.S. Parallelism in Space-Time Trade-offs. Advances in Computing Research 4(1987), 117–146.

    Google Scholar 

  10. Toffoli, T., and Margolus, N. Cellular Automata Machines: A New Environment for Modeling, MIT Press, Cambridge, MA (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nodine, M.H., Lopresti, D.P., Vitter, J.S. (1991). I/O overhead and parallel VLSI architectures for lattice computations. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_108

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_108

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics