Virtual memory algorithms
- 1 January 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 173-185
- https://doi.org/10.1145/62212.62227
Abstract
Computer programs are usually written with the illusion that they will run on something like a random access machine (RAM) [AHU74], with a large memory, all locations of which are equally fast. In practice, this is far from the truth. In large machines, for example, the range of speeds from the fastest memory (registers at about Ions) to the slowest (disks or mass store at IOms or seconds) can bc a factor of a million or even a billion! Machine dcsigncrs attempt IO smooth out this range. to the ~‘xtcnt lhat is technologically feasible, by providing many levels of memory in hctwccn. ‘l’hcsc memory levels m;ry includes one or Iwo lcvcls of c:rThc. main memory,Keywords
This publication has 0 references indexed in Scilit: