A study of replacement algorithms for a virtual-storage computer

Belady, L. A. (1966). A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2), 78-101.

Type

Journal article

Intellectual base

Primary research

Year

1966

DOI

10.1147/sj.52.0078

Link

https://doi.org/10.1147/sj.52.0078

Cited from

computer_science

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Caching
  • Belady's optimal algorithm (1966) evicts the item whose next reference is furthest in the future — an upper bound for any replacement policy

    This sourceIntroduces the optimal (MIN) replacement algorithm — evict the item whose next reference is furthest in the future — giving the theoretical upper bound against which practical replacement policies are measured.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:7167c61332c6 · see in the full table