or
Bookmark and Share
Fetch branch architecture for reducing branch penalty without branch prediction
   
Document Number
US Patent 7010675
Issued Date
March 7, 2006
Link
Inventors
Map
Abstract
In lieu of branch prediction, a merged fetch-branch unit operates in parallel with the decode unit within a processor. Upon detection of a branch instruction within a group of one or more fetched instructions, any instructions preceding the branch are marked regular instructions, the branch instruction is marked as such, and any instructions following branch are marked sequential instructions. Within two cycles, sequential instructions following the last fetched instruction are retrieved and marked, target instructions beginning at the branch target address are retrieved and marked, and the branch is resolved. Either the sequential or target instructions are then dropped depending on the branch resolution, incurring a fixed, 1 cycle branch penalty.
Tags:
Description:
Amusing 0%
Clever 0%
Complex 0%
Efficient 0%
Historic 0%
Important 0%
Innovative 0%
Interesting 0%
Practical 0%
Simple 0%
Number of Claims:
20
Comments:
no comments yet
Owner
STMicroelectronics, Inc. (Carrollton, TX)
Published
March 7, 2006
Application Number
09/917,290
Filed
July 27, 2001
US Classification
712/235  
Int'l Classification
G06F   9/30   (20060101)  
Examiner
Assistant Examiner
USPTO Field of Search
712/235   712/237  
Related Patents
7487334 - Branch encoding before instruction cache write - Owned by International Business Machines Corporation (Armonk, NY)

Method, system and computer program product for determining the targets of branches in a data processing system. A method for determining the target of a branch in a data processing system includes performing at least one pre-calculation relating to determining the target of the branch prior to writing the branch into a Level 1 (L1) cache to provide a pre-decoded branch, and then writing the pre-decoded branch into the L1 cache. By pre-calculating matters relating to the targets of branches before the branches are written into the L1 cache, for example, by re-encoding relative branches as absolute branches, a reduction in branch redirect delay can be achieved, thus providing a substantial improvement in overall processor performance.

Claims
Description
About| FAQs| Terms & Disclaimer| Link to Us| Contact Us