This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
October 1986 (vol. 35 no. 10)
pp. 907-910
J.R. Goodman, Department of computer Science, University of Wisconsin
Garcia-Molina, Lipton, and Valdes [1] introduced a new machine architecture called "massive memory machines" (MMM). The primary application of their proposed architecture was for so-called memory bound computations. In this correspondence we argue: 1) that massive memories will likely become feasible, but will be most effective with much more powerful processors, and 2) that a massive memory on the proposed machine will perform poorly in the same cases that virtual memory performs poorly: whenever there is poor locality of memory reference. Other problems with the architecture are also discussed. These related issues include: 1) the infeasibility of large on-chip dual port memory, 2) the support of multiprocessing on an ESP, 3) the possibility of memory prerequest, 4) the potential of trading program size for execution time, and 5) the time required for clearing the entire memory.
Index Terms:
virtual memory, Cache, computer architecture, massive memory, memmory bound computation, supercomputer
Citation:
J.R. Goodman, H.C. Young, "Comments on "A Massive Memory Machine"," IEEE Transactions on Computers, vol. 35, no. 10, pp. 907-910, Oct. 1986, doi:10.1109/TC.1986.1676682
Usage of this product signifies your acceptance of the Terms of Use.