Issue No.05 - May (1984 vol.33)
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.
supercomputer, Cache, computer architecture, massive memory, memory bound computation, reliability
R.J. Lipton, J. Valdes, "A Massive Memory Machine", IEEE Transactions on Computers, vol.33, no. 5, pp. 391-399, May 1984, doi:10.1109/TC.1984.1676454