The Bicameral Cache: a split cache for vector architectures
<|reference_start|>The Bicameral Cache: a split cache for vector architectures: 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.<|reference_end|>
@article{rebolledo2024the,
    title={The Bicameral Cache: a split cache for vector architectures},
    author={Susana Rebolledo, Borja Perez, Jose Luis Bosque, Peter Hsu},
    journal={arXiv preprint arXiv:2407.15440},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.15440},
    primaryClass={cs.AR cs.PF}
}