Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches

804 indexed citations

Abstract

loading...

About

This paper, published in 2006, received 804 indexed citations. Written by Moinuddin K. Qureshi and Yale N. Patt covering the research area of Hardware and Architecture and Computer Networks and Communications. It is primarily cited by scholars working on Computer Networks and Communications (730 citations), Hardware and Architecture (692 citations) and Information Systems (315 citations). Published in .

Countries where authors are citing Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches

Specialization
Citations

This map shows the geographic impact of Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches more than expected).

Fields of papers citing Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches

Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

This paper is also available at doi.org/10.1109/micro.2006.49.

Explore hit-papers with similar magnitude of impact

Rankless by CCL
2026