MEMORY MANAGEMENT

Basic Memory Management

[Boyd 1978]

Implementing mass storage facilities in OSs.

[Beck 1982]

Describes the "age-match" and "release-match" storage allocation strategies, which allocate blocks based on coordinating the lifetimes of adjacent ones.

[Oldehoft & Allen 1985]

Presents the adaptive exact-fit algorithm for variable space storage management.

[Stephenson 1983]

Summarizes a fast method of variable block storage allocation which combines the strategies of first or best fit with management techniques like the buddy system.

Virtual Memory Management

[Bensoussan & Clinger 1972] - Multics. [Fogel 1974] - VMOS. [Levy & Lipman 1982] - VMS

[Agrawal 1984]

Discusses methods for tuning the "fair share" scheduling algorithm in VM/370.

[Belady 1966]

An early study of replacement algorithms that established the principle of locality.

[Belady et al 1981]

A history of memory management technology at IBM.

[Babaoglu & Joy 1982]

Describes the technique for implementing an LRU-type page replacement algorithm without reference bits on the VAX in the Berkeley UNIX system.

[Budzinski 1981]

A comparison of dynamic and static allocation algorithms.

[Carr & Hennessey 1981]

Presents a simple algorithm (WSClock) for page replacement which combines a working-set strategy with the well-known CLOCK algorithm. Performance results are analyzed.

[Denning 1970]

An early survey of virtual storage techniques.

[Denning 1980]

A review of the history and present status of the theory of working sets by its principal developer.

[Prieve & Fabry 1974]

Describes VMIN, an (unattainable) optimum local page replacement algorithm.