Construct · 1 fields · 1 citations

Belady's optimal replacement: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Operating systems

the replacement policy that evicts the block whose next use lies farthest in the future, an upper bound for real policies.

In operating systems, Belady's optimal replacement refers to the replacement policy that evicts the block whose next use lies farthest in the future, an upper bound for real policies. This meaning comes from Belady (1966) in IBM Systems Journal.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Belady's optimal replacement sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

replacement3 fields · 3 citationsjingle · one word, three constructs block3 fields · 6 citationsjingle · one word, three constructs future3 fields · 6 citationsjingle · one word, three constructs

References

Belady, L. A. (1966). A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2), 78-101. https://doi.org/10.1147/sj.52.0078

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct