Branch queue
From Wikipedia, the free encyclopedia
This article has multiple issues. Please help improve it or discuss these issues on the talk page . (Learn how and when to remove these messages)
(Learn how and when to remove this message)
This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Branch queue" – news · newspapers · books · scholar · JSTOR (March 2026) (Learn how and when to remove this message)
Find sources: "Branch queue" – news · newspapers · books · scholar · JSTOR (March 2026) (Learn how and when to remove this message)
This article may require cleanup to meet Wikipedia's quality standards. The specific problem is: Grammar. Please help improve this article if you can. (March 2026) (Learn how and when to remove this message)
In computer architecture, while branch predictions occur the branch queue[1] stores data, specifically when the branch predictor predicts if the branch is taken or not, the branch queue stores the predictions to be used later.
A branch queue consists of only two values: taken or not taken.
A branch queue helps other algorithms to increase parallelism and optimization. It is not software implemented or hardware one; it falls under hardware software co-design.
See also
[edit ]References
[edit ]- ^ Sheikh, R.; Tuck, J.; Rotenberg, E. (2015年08月01日). "Control-Flow Decoupling: An Approach for Timely, Non-Speculative Branching" . IEEE Transactions on Computers. 64 (8): 2182–2203. doi:10.1109/TC.2014.2361526. ISSN 0018-9340. S2CID 14134607.