Answers are grounded in this paper and cite their sources.
In the independent reference model of program behavior, King’s formulas for the expected FIFO (“first-in-first-out”) and expected LRU (“least-recently-used”) miss ratios each contain an exponential number of terms (very roughly n^CAP, where n is the number of pages and CAP is the capacity of main memory). Hence, under the straightforward algorithms, these formulas are computationally intractable. We present an algorithm which is both efficient (there are O(n · CAP) additions, multiplications, and divisions) and provably numerically stable, for calculating the expected FIFO miss ratio. In the case of LRU, we present an efficient method, based on an urn model, for obtaining an unbiased estimate of the expected LRU miss ratio (the method requires O(n · CAP) additions and comparisons, and O(CAP) divisions and random number generations).
No takes yet. Share an insight, caveat, or question.
Fagin et al. (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: