This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
I/O Overhead and Parallel VLSI Architectures for Lattice Computations
July 1991 (vol. 40 no. 7)
pp. 843-852

The authors introduce input/output (I/O) overhead psi as a complexity measure for VLSI implementations of two-dimensional lattice computations of the type arising in the simulation of physical systems. It is shown by pebbling arguments that psi = Omega (n/sup -1/) when there are n/sup 2/ processing elements available. If the results must be observed at every generation and if no on-chip storage is allowed, the lower bound is the constant 2. The authors then examine four VLSI architectures and show that one of them, the multigeneration sweep architecture also has I/O overhead proportional to n/sup -1/. A closed-form for the discrete minimization equation giving the optimal number of generations to compute for the multigeneration sweep architecture is proved.

[1] S. A. Cook, "An observation on time-storage tradeoffs," inProc. 5th Annu. ACM Symp. Theory Comput., May 1973, pp. 29-33.
[2] A. K. Dewdney, "Computer recreations,"Scientif. Amer., vol. 252, no. 5, pp. 18-30, May 1985.
[3] R. L. Graham, D. E. Knuth, and O. Patashnik,Concrete Mathematics: A Foundation for Computer Science, Research Problem 7.56. Reading, MA: Addison-Wesley, 1988, p. 366.
[4] J. W. Hong and H. T. Kung, "I/O complexity: The red-blue pebble game," inProc. 13th Annu. ACM Symp. Theory Comput., May 1981, pp. 326-333.
[5] S. D. Kugelmass, R. Squier, and K. Steiglitz, "Performance of VLSI engines for lattice computations,"Complex Syst., vol. 1, no. 5, pp. 939-965, Oct. 1987.
[6] S. Manohar, "Superconducting with VLSI," Ph.D. dissertation, Brown Univ., 1988.
[7] N. Margolus and T. Toffoli, "Cellular automata machines,"Complex Syst., vol. 1, no. 5, pp. 967-993, Oct. 1987.
[8] W. Poundstone,The Recursive Universe. Chicago, IL: Contemporary Books, 1985.
[9] J. E. Savage and J. S. Vitter, "Parallelism in space-time trade-offs,"Advances Comput. Res., vol. 4, pp. 117-146, 1987.
[10] T. Toffoli and N. Margolus,Cellular Automata Machines: A New Environment for Modeling. Cambridge, MA: MIT Press, 1987.

Index Terms:
input/output overhead; parallel VLSI architectures; complexity measure; VLSI implementations; lattice computations; physical systems; multigeneration sweep architecture; computational complexity; lattice theory and statistics; parallel architectures; physics computing.
Citation:
M.H. Nodine, D.P. Lopresti, J.S. Vitter, "I/O Overhead and Parallel VLSI Architectures for Lattice Computations," IEEE Transactions on Computers, vol. 40, no. 7, pp. 843-852, July 1991, doi:10.1109/12.83622
Usage of this product signifies your acceptance of the Terms of Use.