A Massive Memory Machine

This paper argues the case for a computer with massive amounts of primary storage, on the order of tens of billions of bytes. We argue that such a machine, even with a relatively slow processor, can outperform all other super-computers on memory bound computations. This machine would be simple to program. In addition, it could lead to new and highly efficient programs which traded the available space for running time. We present a novel architecture for such a machine, and show how it can lead to reduced memory access times and higher reliability.

[1]  Michael J. Flynn,et al.  Addressing patterns and memory handling algorithms , 1968, AFIPS '68 (Fall, part II).

[2]  W. A. Martin,et al.  The MACSYMA system , 1971, SYMSAC '71.

[3]  Michael J. Flynn,et al.  Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.

[4]  M.J. Flynn.  B72-3 Computer Structures, Readings and Examples , 1972, IEEE Transactions on Computers.

[5]  Robert O. Winder,et al.  Cache-based Computer Systems , 1973, Computer.

[6]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[7]  Gio Wiederhold,et al.  Database Design , 1977 .

[8]  Bruce G. Buchanan,et al.  Dendral and Meta-Dendral: Their Applications Dimension , 1978, Artif. Intell..

[9]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[10]  Svetlana P. Kartashev,et al.  Supersystems for the 80's , 1980, Computer.

[11]  Jacques Cohen,et al.  Garbage Collection of Linked Data Structures , 1981, CSUR.

[12]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Robert S. Swarz,et al.  The theory and practice of reliable system design , 1982 .

[14]  Alan Jay Smith,et al.  Cache Memories , 1982, CSUR.

[15]  Richard J. Lipton,et al.  ALI: A Procedural Language to Describe VLSI Layouts , 1982, DAC 1982.

[16]  Arthur V. Pohm,et al.  High-Speed Memory Systems , 1984, Computer.