The Community for Technology Leaders
2014 23rd International Conference on Parallel Architecture and Compilation (PACT) (2014)
Edmonton, Canada
Aug. 23, 2014 to Aug. 27, 2014
ISBN: 978-1-5090-6607-0
pp: 487-488
Raj Parihar , Dept. of Electrical & Computer Engineering, Rochester, NY 14627, USA
Jacob Brock , Dept. of Computer Science, University of Rochester, Rochester, NY 14627, USA
Chen Ding , Dept. of Computer Science, University of Rochester, Rochester, NY 14627, USA
Michael C. Huang , Dept. of Electrical & Computer Engineering, Rochester, NY 14627, USA
ABSTRACT
Shared cache is generally optimized for overall throughput, fairness, or both. Increasingly in shared environments, e.g., compute clouds, users are unrelated to one another. In such circumstances, an overall gain in throughput does not justify an individual loss. This paper explores a new strategy for conservative sharing, which protects the cache occupancy for individual programs, but still enables full cache sharing whenever there is unused space.
INDEX TERMS
Hardware, Radiation detectors, Collaboration, Software, Throughput, Iron, Interference,Rationing, Cache management, Protection
CITATION
Raj Parihar, Jacob Brock, Chen Ding, Michael C. Huang, "Protection and utilization in shared cache through rationing", 2014 23rd International Conference on Parallel Architecture and Compilation (PACT), vol. 00, no. , pp. 487-488, 2014, doi:10.1145/2628071.2628120
89 ms
(Ver 3.3 (11022016))