Elastic paging

Authors:
Enoch Peserico
Affiliations:
Univ. Padova, Dip. Ing. Informazione, Padova, Italy
Venue:
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Year:
2013

Citing 6
Cited 0

Exokernel: an operating system architecture for application-level resource management

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Efficient on-line call control algorithms

Journal of Algorithms
Online computation and competitive analysis

Online computation and competitive analysis
Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches

Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture
Competitive online scheduling for server systems

ACM SIGMETRICS Performance Evaluation Review
Multiple sleep mode leakage control for cache peripheral circuits in embedded processors

CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a generalization of the classic paging problem where memory capacity can vary over time - a property of many modern computing realities, from cloud computing to multi-core and energy-optimized processors. We show that good performance in the "classic" case provides no performance guarantees when memory capacity fluctuates: roughly speaking, moving from static to dynamic capacity can mean the difference between optimality within a factor 2 in space, time and energy, and suboptimality by an arbitrarily large factor. Surprisingly, several classic paging algorithms still perform remarkably well, maintaining that factor 2 optimality even if faced with adversarial capacity fluctuations - without taking those fluctuations into explicit account!