16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007) (2007)
Sept. 15, 2007 to Sept. 19, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PACT.2007.60
Sayaka Akioka , The Pennsylvania State University, USA
Feihui Li , The Pennsylvania State University, USA
Mahmut Kandemir , The Pennsylvania State University, USA
Padma Raghavan , The Pennsylvania State University, USA
Mary Jane Irwin , The Pennsylvania State University, USA
Increasing wire delays and memory capacities motivate new ways of designing L2 and L3 caches. NUCA (Non-Uniform Cache Architecture) has received considerable attention in the last few years. While most of the prior NUCA-based efforts have focused on data placement, data replacement, and migration related issues, this paper studies the problem of data search. Specifically, it proposes and experimentally evaluates several data search schemes for NUCA L2 caches that exhibit different performance-power trade-offs. These schemes are based on predicting the next ring (set of banks) to be accessed in a NUCA L2, and checking the banks in that ring first. In this work, we present the details of these prediction schemes, and compare them to two alternate approaches: searching all rings in parallel, and searching rings sequentially, starting with the one that is closest to the CPU.
M. J. Irwin, M. Kandemir, P. Raghavan, S. Akioka and F. Li, "Ring Prediction for Non-Uniform Cache Architectures," 16th International Conference on Parallel Architecture and Compilation Techniques (PACT 2007)(PACT), Brasov, Romania, 2007, pp. 401.