poster

Elastic paging

Author:

Enoch PesericoAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 41, Issue 1

Pages 349 - 350

https://doi.org/10.1145/2494232.2479781

Published: 17 June 2013 Publication History

Get Access

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!

References

[1]

A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.

Digital Library

Google Scholar

[2]

R. Dorrigiv and A. López-Ortiz. A survey of performance measures for on-line algorithms. SIGACT News, 36(3):67--81, 2005.

Digital Library

Google Scholar

[3]

D. R. Engler, M. F. Kaashoek, and J. O'Toole. Exokernel: An operating system architecture for application-level resource management. In Proc. SOSP, 1995.

Digital Library

Google Scholar

[4]

J. A. Garay, I. S. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient on-line call control algorithms. Journal of Algorithms, 23(1):180--194, 1997.

Digital Library

Google Scholar

[5]

H. Homayoun, M. Makhzan, and A. Veidenbaum. Multiple sleep mode leakage control for cache peripheral circuits in embedded processors. In Proc. CASES, 2008.

Digital Library

Google Scholar

[6]

D. Lee, J. Choi, J. hun Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. LRFU: A spectrum of policies that subsumes the least recently used and least frequently used policies. In Proc. ACM SIGMETRICS, 1999.

Google Scholar

[7]

E. Peserico. Paging with dynamic memory capacity. CoRR, abs/1304.6007, 2013.

Google Scholar

[8]

K. Pruhs. Competitive online scheduling for server systems. SIGMETRICS Perform. Eval. Rev., 34(4):52--58, 2007.

Digital Library

Google Scholar

[9]

M. K. Qureshi and Y. N. Patt. Utility-based cache partitioning: A low-overhead, high-performance, runtime mechanism to partition shared caches. In Proc. IEEE/ACM MICRO, 2006.

Digital Library

Google Scholar

Cited By

View all

Agrawal KBender MDas RKuszmaul WPeserico EScquizzato MMarx D(2021)Tight bounds for parallel paging and green pagingProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458244(3022-3041)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458244
Even GMedina MRawitz DScheideler CFineman J(2018)Online Generalized Caching with Varying Weights and CostsProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210404(205-212)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210404
Agrawal KBender MDas RKuszmaul WPeserico EScquizzato MScheideler CSpear M(2020)Green Paging and Parallel PagingProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400231(493-495)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400231
Show More Cited By

Index Terms

Elastic paging

Recommendations

Elastic paging
SIGMETRICS '13: Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

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 "...
DR. Swap: energy-efficient paging for smartphones
ISLPED '14: Proceedings of the 2014 international symposium on Low power electronics and design

Smartphones are becoming increasingly energy-hungry to support feature-rich applications, posing a lot of pressure on battery lifetime and making energy consumption a non-negligible issue. In particular, DRAM is among the most demanding components in ...
Speculative paging for future NVM storage
MEMSYS '17: Proceedings of the International Symposium on Memory Systems

The quest for greater performance and efficiency has driven modern cloud applications towards "in-memory" implementations, such as memcached and Apache Spark. Looking forward, however, the costs of DRAM, due to its low area density and high energy ...

Comments

Information & Contributors

Information

Published In

ACM SIGMETRICS Performance Evaluation Review Volume 41, Issue 1

Performance evaluation review

June 2013

385 pages

ISSN:0163-5999

DOI:10.1145/2494232

Issue’s Table of Contents

SIGMETRICS '13: Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
June 2013
406 pages
ISBN:9781450319003
DOI:10.1145/2465529
General Chair:
Mor Harchol-Balter
Carnegie Mellon University, USA
,
Program Chairs:
John Douceur
Microsoft Research, USA
,
Jun Xu
Georgia Institute of Technology, USA

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 June 2013

Published in SIGMETRICS Volume 41, Issue 1

Check for updates

Author Tags

Qualifiers

Poster

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
197
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Agrawal KBender MDas RKuszmaul WPeserico EScquizzato MMarx D(2021)Tight bounds for parallel paging and green pagingProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458244(3022-3041)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458244
Even GMedina MRawitz DScheideler CFineman J(2018)Online Generalized Caching with Varying Weights and CostsProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210404(205-212)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210404
Agrawal KBender MDas RKuszmaul WPeserico EScquizzato MScheideler CSpear M(2020)Green Paging and Parallel PagingProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400231(493-495)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400231
Menache ISingh MBlelloch GAgrawal K(2015)Online Caching with Convex CostsProceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures10.1145/2755573.2755585(46-54)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2755573.2755585

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Elastic paging

DR. Swap: energy-efficient paging for smartphones

Speculative paging for future NVM storage

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations