Branch Predicting with Sparse Distributed Memories
Ilias Vougioukas, Andreas Sandberg, Nikos Nikoleris

TL;DR
This paper introduces a novel branch predictor based on hyperdimensional computing and sparse distributed memory, offering high accuracy with reduced area and increased security against side-channel attacks.
Contribution
It presents a new branch prediction approach using hyperdimensional computing and sparse distributed memory, achieving competitive accuracy with less area and enhanced security.
Findings
Competitive accuracy on benchmark traces
Reduced area compared to traditional predictors
Enhanced resistance to side-channel attacks
Abstract
Modern processors rely heavily on speculation to keep the pipeline filled and consequently execute and commit instructions as close to maximum capacity as possible. To improve instruction-level parallelism, the processor core needs to fetch and decode multiple instructions per cycle and has come to rely on incredibly accurate branch prediction. However, this comes at cost of the increased area and complexity which is needed for modern high accuracy branch predictors. The key idea described in this work is to use hyperdimensional computing and sparse distributed memory principles to create a novel branch predictor that can deliver complex predictions for a fraction of the current area. Sparse distributed memories can store vast amounts of data in a compressed manner, theoretically enabling branch histories larger and more precise than the branch predictors used today to be stored with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFerroelectric and Negative Capacitance Devices · Advanced Memory and Neural Computing · Neurofibromatosis and Schwannoma Cases
