OnlineMin

swMATH12059MaRDI QIDQ23993FDOQ23993

Author name not available (Why is that?)

Described by source

• \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm

Cited In (7)

• On the smoothness of paging algorithms
• OnlineMin: a fast strongly competitive randomized paging algorithm
• Outperforming LRU via competitive analysis on parametrized inputs for paging
• Online file caching with rejection penalties
• Engineering efficient paging algorithms
• The optimal structure of algorithms for \(\alpha\)-paging
• General caching is hard: even with small pages

This page was built for software: OnlineMin