Paging for multi-core shared caches

DOI10.1145/2090236.2090246zbMath1347.68372OpenAlexW1983997639MaRDI QIDQ2826048

Alejandro Salinger, Alejandro López-Ortiz

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2090236.2090246

zbMATH Keywords

cacheonline algorithmspagingmulti-corechip multiprocessor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of operating systems (68N25) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Upper bounds for multi-level multi-server paging ⋮ Approximation algorithms for scheduling on multi-core processor with shared speedup resources

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

This page was built for publication: Paging for multi-core shared caches