The Bicameral Cache: a split cache for vector architectures
arxiv(2024)
Abstract
The Bicameral Cache is a cache organization proposal for a vector
architecture that segregates data according to their access type,
distinguishing scalar from vector references. Its aim is to avoid both types of
references from interfering in each other's data locality, with a special focus
on prioritizing the performance on vector references. The proposed system
incorporates an additional, non-polluting prefetching mechanism to help
populate the long vector cache lines in advance to increase the hit rate by
further exploiting the spatial locality on vector data. Its evaluation was
conducted on the Cavatools simulator, comparing the performance to a standard
conventional cache, over different typical vector benchmarks for several vector
lengths. The results proved the proposed cache speeds up performance on
stride-1 vector benchmarks, while hardly impacting non-stride-1's. In addition,
the prefetching feature consistently provided an additional value.
MoreTranslated text
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined