Branch queue

Branch queue

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

References

  1. ^ 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.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.