Improving data cache performance with integrated use of split caches, victim cache and stream buffers

Authors:
Afrin Naz;Mehran Rezaei;Krishna Kavi;Philip Sweany
Affiliations:
The University of North Texas, Denton, Texas;The University of North Texas, Denton, Texas;The University of North Texas, Denton, Texas;The University of North Texas, Denton, Texas
Venue:
MEDEA '04 Proceedings of the 2004 workshop on MEmory performance: DEaling with Applications , systems and architecture
Year:
2004

Citing 19
Cited 3

An effective on-chip preloading scheme to reduce data access penalty

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Column-associative caches: a technique for reducing the miss rate of direct-mapped caches

ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Evaluating stream buffers as a secondary cache replacement

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
A data cache with multiple caching strategies tuned to different types of locality

ICS '95 Proceedings of the 9th international conference on Supercomputing
A victim cache for vector registers

ICS '97 Proceedings of the 11th international conference on Supercomputing
Run-time adaptive cache hierarchy management via reference analysis

Proceedings of the 24th annual international symposium on Computer architecture
Run-time spatial locality detection and optimization

MICRO 30 Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture
A comparison of software code reordering and victim buffers

ACM SIGARCH Computer Architecture News - Special issue on Interact-3 workshop
Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Reconfigurable caches and their application to media processing

Proceedings of the 27th annual international symposium on Computer architecture
Cache Memories

ACM Computing Surveys (CSUR)
A new cache architecture based on temporal and spatial locality

Journal of Systems Architecture: the EUROMICRO Journal
Smarter Memory: Improving Bandwidth for Streamed References

Computer
SPEC CPU2000: Measuring CPU Performance in the New Millennium

Computer
An Asynchronous Victim Cache

DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
Power/Performance Advantages of Victim Buffer in High-Performance Processors

VOLTA '99 Proceedings of the IEEE Alessandro Volta Memorial Workshop on Low-Power Design
Computer Architecture: A Quantitative Approach

Computer Architecture: A Quantitative Approach
The Minimax Cache: An Energy-Efficient Framework for Media Processors

HPCA '02 Proceedings of the 8th International Symposium on High-Performance Computer Architecture
Using a Victim Buffer in an Application-Specific Memory Hierarchy

Proceedings of the conference on Design, automation and test in Europe - Volume 1

Tiny split data-caches make big performance impact for embedded applications

Journal of Embedded Computing - Issues in embedded single-chip multicore architectures
Stream image processing on a dual-core embedded system

SAMOS'07 Proceedings of the 7th international conference on Embedded computer systems: architectures, modeling, and simulation
Redesigning the string hash table, burst trie, and BST to exploit cache

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In our prior work we explored a cache organization providing architectural support for distinguishing between memory references that exhibit spatial and temporal locality and mapping them to separate caches.That work showed that using separate (data) caches for indexed or stream data and scalar data items could lead to substantial improvements in terms of cache misses. In addition, such a separation allowed for the design of caches that could be tailored to meet the properties exhibited by different data items.In this paper, we investigate the interaction between three established methods: split cache, victim cache and stream buffer. Since significant amounts of compulsory and conflict misses are avoided, the size of each cache (i.e., array and scalar), as well as the combined cache capacity can be reduced. Our results show that on average 55% reduction in miss rates over the base configuration.