Online paging with arbitrary associativity

Authors:
Enoch Peserico
Affiliations:
M.I.T.
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

Citing 13
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
A note on the server problem and a benevolent adversary

Information Processing Letters
Competitive paging algorithms

Journal of Algorithms
Competitive paging and dual-guided on-line weighted caching and watching algorithms

Competitive paging and dual-guided on-line weighted caching and watching algorithms
A case for two-way skewed-associative caches

ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Competitive paging with locality of reference

Selected papers of the 23rd annual ACM symposium on Theory of computing
Online computation and competitive analysis

Online computation and competitive analysis
On-line file caching

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Towards a theory of cache-efficient algorithms

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On-line restricted caching

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competive Analysis of Randomized Paging Algorithms

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Towards an Optimal Bit-Reversal Permutation Program

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of paging algorithms are not competitive on a wide class of associativities (even with arbitrary resource augmentation) and that although some algorithms designed for full associativity are actually competitive on any two level memory, the myopic behavior of paging algorithms designed for full associativity will generally result in very poor performance at least for some "associativity topologies". At the same time we present a simple and yet powerful technique that allows us to overcome this shortcoming, generalizing algorithms designed for full associativity into practical algorithms which are efficient on two level memories with arbitrary associativity. We identify a simple topological parameter, pseudo associativity, which characterizes the competitive ratio achievble on any two level memory, giving a lower bound on the competitiveness achievable by any paging algorithm and matching it within a factor 4 with a novel algorithm.