The Community for Technology Leaders
2016 International Conference on Parallel Architecture and Compilation Techniques (PACT) (2016)
Haifa, Israel
Sept. 11, 2016 to Sept. 15, 2016
ISBN: 978-1-5090-5308-7
pp: 455
Vicent Selfa , Dept. of Computer Engineering, Universitat Politècnica de València, Spain
Julio Sahuquillo , Dept. of Computer Engineering, Universitat Politècnica de València, Spain
Salvador Petit , Dept. of Computer Engineering, Universitat Politècnica de València, Spain
Maria E. Gomez , Dept. of Computer Engineering, Universitat Politècnica de València, Spain
ABSTRACT
Shared caches have become, de facto, the common design choice in current multi-cores, ranging from embedded devices to high-performance processors. In these systems, requests from multiple applications compete for the cache resources, degrading to different extents their progress, quantified as the performance of individual applications compared to isolated execution. The difference between the progresses of the running applications yields the system to unpredictable behavior and causes a fairness problem. This problem can be addressed by carefully partitioning cache resources among the contending applications, but to be effective, a partitioning approach needs to estimate the per-application progress.
INDEX TERMS
Program processors, Complexity theory, Performance evaluation, Runtime, Binary trees, Computers, Distance measurement
CITATION
Vicent Selfa, Julio Sahuquillo, Salvador Petit, Maria E. Gomez, "Student research poster: A low complexity cache sharing mechanism to address system fairness", 2016 International Conference on Parallel Architecture and Compilation Techniques (PACT), vol. 00, no. , pp. 455, 2016, doi:10.1145/2967938.2971464
80 ms
(Ver 3.3 (11022016))