Competitive analysis of online paging algorithms may be based on a flawed model assumption

This academic paper argues that the Sleator-Tarjan model underlying competitive analysis of online paging algorithms contains a fundamental flaw: it charges a cost for the first access to newly computed data, whereas in real systems, data begins in the processor and incurs no col