Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,385
Predicting Cache Contention with Setvectors
"... Abstract—In this paper, we present a new method called setvectors to predict cache contention introduced by co-scheduled applications on a multicore processor system. Additionally, we propose a new metric to compare cache contention prediction methods. Applying this metric, we demonstrate that our s ..."
Abstract
- Add to MetaCart
Abstract—In this paper, we present a new method called setvectors to predict cache contention introduced by co-scheduled applications on a multicore processor system. Additionally, we propose a new metric to compare cache contention prediction methods. Applying this metric, we demonstrate that our
Cache memories
- ACM Computing Surveys
, 1982
"... Cache memories are used in modern, medium and high-speed CPUs to hold temporarily those portions of the contents of main memory which are {believed to be) currently in use. Since instructions and data in cache memories can usually be referenced in 10 to 25 percent of the time required to access main ..."
Abstract
-
Cited by 688 (11 self)
- Add to MetaCart
Cache memories are used in modern, medium and high-speed CPUs to hold temporarily those portions of the contents of main memory which are {believed to be) currently in use. Since instructions and data in cache memories can usually be referenced in 10 to 25 percent of the time required to access
Page-Level Behavior of Cache Contention
"... Abstract—Cache misses in small, limited-associativity primary caches very often replace live cache blocks, given the dominance of capacity and conflict misses. Towards motivating novel cache organizations, we study the comparative characteristics of the virtual memory address pairs involved in typic ..."
Abstract
- Add to MetaCart
in typical primary-cache contention (block replacements) for the SPEC2000 integer benchmarks. We focus on the cache tag bits, and results show that (i) often just a few tag bits differ between contending addresses, and (ii) accesses to certain segments or page groups of the virtual address space (i
Cache-Content- Duplication for Valid Blocks
"... Cache-content-duplication (CCD) occurs when there is a miss for a block in a cache and the content of the missed block resides already in the cache but under a different tag. Caches aware of contentduplication can have smaller miss penalty by fetching, on a miss to a duplicate block, directly from t ..."
Abstract
- Add to MetaCart
Cache-content-duplication (CCD) occurs when there is a miss for a block in a cache and the content of the missed block resides already in the cache but under a different tag. Caches aware of contentduplication can have smaller miss penalty by fetching, on a miss to a duplicate block, directly from
Dynamically Detecting Cache-Content-Duplication in Instruction Caches
, 2007
"... Cache-content-duplication (CCD) occurs when there is a miss for a block in a cache and the entire content of the missed block is already in the cache in a block with a different tag. Caches aware of content-duplication can have smaller miss penalty by fetching, on a miss to a duplicate block, direct ..."
Abstract
- Add to MetaCart
Cache-content-duplication (CCD) occurs when there is a miss for a block in a cache and the entire content of the missed block is already in the cache in a block with a different tag. Caches aware of content-duplication can have smaller miss penalty by fetching, on a miss to a duplicate block
Dynamic Cache Contention Detection in Multi-threaded Applications
"... In today’s multi-core systems, cache contention due to true and false sharing can cause unexpected and significant performance degradation. A detailed understanding of a given multi-threaded application’s behavior is required to precisely identify such performance bottlenecks. Traditionally, however ..."
Abstract
-
Cited by 12 (1 self)
- Add to MetaCart
In today’s multi-core systems, cache contention due to true and false sharing can cause unexpected and significant performance degradation. A detailed understanding of a given multi-threaded application’s behavior is required to precisely identify such performance bottlenecks. Traditionally
Cache Content Placement Using Triangular Network Coding
"... Abstract—Video is one of the main causes of the dramatic increase in data traffic over cellular networks. Caching is an effective mechanism that decreases the download rate from base stations and, as a result, the load on the base station, by storing the most popular files or videos on the caches an ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
and providing them to the users. The problem of efficient content placement on the caches is known as an NP-complete problem. In this paper, we study the role of network coding by increasing the amount of available data to the users through the cache nodes. We propose a network coding-based content placement
Cache Contention and Application Performance Prediction for Multi-Core Systems
"... Abstract—The ongoing move to chip multiprocessors (CMPs) permits greater sharing of last-level cache by processor cores but this sharing aggravates the cache contention problem, potentially undermining performance improvements. Accurately modeling the impact of inter-process cache contention on perf ..."
Abstract
-
Cited by 26 (1 self)
- Add to MetaCart
Abstract—The ongoing move to chip multiprocessors (CMPs) permits greater sharing of last-level cache by processor cores but this sharing aggravates the cache contention problem, potentially undermining performance improvements. Accurately modeling the impact of inter-process cache contention
Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors
- ACM Transactions on Computer Systems
, 1991
"... Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract
-
Cited by 573 (32 self)
- Add to MetaCart
Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become
Results 1 - 10
of
2,385
