Cache Hit Ratios and the Che Approximation: Optimal Capacity for Caching Computed Charts: chapter answers

Owners of pay-per-computation services commonly believe that doubling a cache doubles its hit ratio. This book overturns that instinct. Under Zipf requests the hit ratio of a least-recently-used (LRU) cache grows slowly with capacity: with illustrative parameters, a hundred-and-twenty-eight-fold increase in capacity raises the hit ratio only 6.80 times. The Che approximation, using nothing but request probabilities and capacity, computes the LRU hit ratio in advance, with a largest gap of 0.0013 from request-by-request simulation. After checking the sources the book corrects the project bluep…

DOI pending · monograph page goes live after publication · 5DL-B-327 · 中文版

Illustrative model calculation, not a live quote