Fetch branch architecture for reducing branch penalty...

Electrical computers and digital processing systems: processing – Processing control – Branching

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07010675

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.

REFERENCES:
patent: 5127091 (1992-06-01), Boufarah et al.
patent: 5615386 (1997-03-01), Amerson et al.
patent: 5696958 (1997-12-01), Mowry et al.
patent: 6067644 (2000-05-01), Levine et al.
patent: 6289445 (2001-09-01), Ekner
patent: 0 190 484 (1986-08-01), None
patent: 0 378 425 (1990-07-01), None
patent: 0 851 344 (1998-07-01), None

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Fetch branch architecture for reducing branch penalty... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fetch branch architecture for reducing branch penalty..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fetch branch architecture for reducing branch penalty... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3580983

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.