abstract

Brief announcement: paging for multicore processors

Authors:

Alejandro López-Ortiz,

Alejandro SalingerAuthors Info & Claims

SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

Pages 137 - 138

https://doi.org/10.1145/1989493.1989513

Published: 04 June 2011 Publication History

Get Access

Abstract

Paging for multicore processors extends the classical paging problem to a setting in which several processes simultaneously share the cache. Recently, Hassidim [6] studied cache eviction policies for multicores under the traditional competitive analysis metric, showing that LRU is not competitive against an offline policy that has the power of arbitrarily delaying request sequences to its advantage. In this paper we study caching under the more conservative model in which requests must be served as they arrive. We derive bounds on the competitive ratios of natural strategies to manage the cache, and we show that the offline problem is NP-complete, but that it admits an algorithm that runs in polynomial time in the length of the request sequences.

References

[1]

R. D. Barve, E. F. Grove, and J. S. Vitter. Application-controlled paging for a shared cache. SIAM J. Comput., 29:1290--1303, February 2000.

Digital Library

Google Scholar

[2]

G. E. Blelloch and P. B. Gibbons. Effectively sharing a cache among threads. In SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 235--244, New York, NY, USA, 2004. ACM.

Digital Library

Google Scholar

[3]

G. E. Blelloch, P. B. Gibbons, and H. V. Simhadri. Low depth cache-oblivious algorithms. In F. M. auf der Heide and C. A. Phillips, editors, SPAA, pages 189--199. ACM, 2010.

Digital Library

Google Scholar

[4]

R. A. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandran. Oblivious algorithms for multicores and network of processors. In IPDPS, pages 1--12. IEEE, 2010.

Crossref

Google Scholar

[5]

F. Guo and Y. Solihin. An analytical model for cache replacement policy performance. In SIGMETRICS '06/Performance '06: Proceedings of the joint international conference on Measurement and modeling of computer systems, pages 228--239, New York, NY, USA, 2006. ACM.

Digital Library

Google Scholar

[6]

A. Hassidim. Cache replacement policies for multicore processors. In Proceedings of The First Symposium on Innovations in Computer Science. Tsinghua University Press, 2010.

Google Scholar

[7]

A. López-Ortiz and A. Salinger. Paging for multicore processors. Technical Report CS-2011-12, University of Waterloo, 2011.

Google Scholar

Cited By

View all

López-Ortiz ASalinger AGoldwasser S(2012)Paging for multi-core shared cachesProceedings of the 3rd Innovations in Theoretical Computer Science Conference10.1145/2090236.2090246(113-127)Online publication date: 8-Jan-2012
https://dl.acm.org/doi/10.1145/2090236.2090246
Katti ARamachandran V(2012)Competitive Cache Replacement Strategies for Shared Cache EnvironmentsProceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium10.1109/IPDPS.2012.29(215-226)Online publication date: 21-May-2012
https://dl.acm.org/doi/10.1109/IPDPS.2012.29

Index Terms

Brief announcement: paging for multicore processors
1. Theory of computation

Recommendations

Paging for multi-core shared caches
ITCS '12: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference

Paging for multi-core processors extends the classical paging problem to a setting in which several processes simultaneously share the cache. Recently, Hassidim proposed a model for multi-core paging [25], studying cache eviction policies for multi-...
Reactive NUCA: near-optimal block placement and replication in distributed caches
ISCA '09: Proceedings of the 36th annual international symposium on Computer architecture

Increases in on-chip communication delay and the large working sets of server and scientific workloads complicate the design of the on-chip last-level cache for multicore processors. The large working sets favor a shared cache design that maximizes the ...
Reactive NUCA: near-optimal block placement and replication in distributed caches

Increases in on-chip communication delay and the large working sets of server and scientific workloads complicate the design of the on-chip last-level cache for multicore processors. The large working sets favor a shared cache design that maximizes the ...

Comments

Information & Contributors

Information

Published In

SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

June 2011

404 pages

ISBN:9781450307437

DOI:10.1145/1989493

Co-chairs:
Friedhelm Meyer auf der Heide
University of Paderborn, Germany
,
Rajmohan Rajaraman
Northeastern University, USA

In-Cooperation

EATCS: European Association for Theoretical Computer Science

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Abstract

Conference

SPAA '11

Sponsor:

SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures

June 4 - 6, 2011

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
171
Total Downloads

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

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

López-Ortiz ASalinger AGoldwasser S(2012)Paging for multi-core shared cachesProceedings of the 3rd Innovations in Theoretical Computer Science Conference10.1145/2090236.2090246(113-127)Online publication date: 8-Jan-2012
https://dl.acm.org/doi/10.1145/2090236.2090246
Katti ARamachandran V(2012)Competitive Cache Replacement Strategies for Shared Cache EnvironmentsProceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium10.1109/IPDPS.2012.29(215-226)Online publication date: 21-May-2012
https://dl.acm.org/doi/10.1109/IPDPS.2012.29

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

Paging for multi-core shared caches

Reactive NUCA: near-optimal block placement and replication in distributed caches

Reactive NUCA: near-optimal block placement and replication in distributed caches

Comments

Information

Published In

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

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