An efficient indirect branch predictor

DOI10.1007/3-540-44681-8_58MaRDI QIDQ4791926zbMATH OpenFDO

Authors Yul Chu, M. Robert Ito

Publication date 4 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2150/21500394

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2087755
• scientific article; zbMATH DE number 1955864
• Trace Driven Simulation of Dynamic Branch Prediction Schemes

Cited in

(9)

• Alloyed branch history: Combining global and local branch history for robust performance
• scientific article; zbMATH DE number 1955865 (Why is no real title available?)
• Optimal 2-bit branch predictors
• scientific article; zbMATH DE number 2087299 (Why is no real title available?)
• scientific article; zbMATH DE number 2087754 (Why is no real title available?)
• scientific article; zbMATH DE number 2087755 (Why is no real title available?)
• scientific article; zbMATH DE number 2090628 (Why is no real title available?)
• Virtual Program Counter (VPC) Prediction: Very Low Cost Indirect Branch Prediction Using Conditional Branch Prediction Hardware
• An efficient value predictor dynamically using loop and locality properties

This page was built for publication: An efficient indirect branch predictor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791926)