Paging for multi-core shared caches
From MaRDI portal
Publication:2826048
DOI10.1145/2090236.2090246zbMath1347.68372MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68N25: Theory of operating systems
68W27: Online algorithms; streaming algorithms
Related Items
Upper bounds for multi-level multi-server paging, Approximation algorithms for scheduling on multi-core processor with shared speedup resources
Cites Work
- 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
- Unnamed Item