US4853889A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Arrangement and method for speeding the operation of branch instructions
Assignee: Nokia Bell Labs
•
Filing: 1987-05-11
•
Granted: 1989-08-01
•
Expires: 2007-05-11
Abstract
Abstract Arrangement and method for avoiding the processing time associated with executing branch instructions in a computer. An instruction fetch unit appends a next instruction address field to each instruction it passes it via an instruction cache to an instruction execution unit. The fetch unit decodes the present instruction being read and the next sequential instruction in main memory. If neither instruction is a branch instruction, the next address field is set to the address of the next sequential instruction. If the present instruction is a branch, the next instruction address field is set to the branch address contained in the present instruction. If neither of these cases are true and the next sequential instruction from main memory is a branch, the next instruction address field is set to the branch address of this instruction. The execution unit uses the next instruction address to access instructions from the instruction cache. Thus, execution of branch instructions by the execution unit are avoided.
Inventors
- 👤 David R. Ditzel
- 👤 Hubert R. McLellan, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 11:23
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/30; G06F9/38; G06F9/3802; G06F9/3804
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
219 words
A computer for reducing the execution time required for branch instructions, said computer comprising a main memory, an instruction fetch unit for fetching instructions from said main memory, an instruction cache for storing instructions for execution, and an execution unit for executing the instructions stored in the instruction cache, said instruction fetch unit comprising first means for storing a first address of a first instruction, second means for storing said first instruction, third means for storing a second instruction sequentially following the first instruction in the main memory, generating means, responsive to the contents of said first, second and third means, for generating a second address of an instruction to be executed following the first instruction, said second address being that of the second instruction if neither the first and second instructions are branch instructions, a branch address specified by the first instruction if the first instruction is a branch instruction, or a branch address specified by the second instruction if the first instruction is a nonbranch instruction and the second instruction is a branch instruction, means for transferring the first instruction and the second address for storage in said instruction cache, and means in the execution unit for addressing the instruction cache at the second address after addressing the first instruction to obtain the next instruction for execution.
Claim 2
Dependent Claim
219 words
A computer for reducing the execution time required for branch instructions, said computer comprising a main memory, an instruction fetch unit for fetching instructions from said main memory, an instruction cache for storing instructions for execution, and an execution unit for executing the instructions stored in the instruction cache, said instruction fetch unit comprising first means for storing a first address of a first instruction, second means for storing said first instruction, third means for storing a second instruction sequentially following the first instruction in the main memory, generating means, responsive to the contents of said first, second and third means, for generating a second address of an instruction to be executed following the first instruction, said second address being that of the second instruction if neither the first and second instructions are branch instructions, a branch address specified by the first instruction if the first instruction is a branch instruction, or a branch address specified by the second instruction if the first instruction is a nonbranch instruction and the second instruction is a branch instruction, means for transferring the first instruction and the second address for storage in said instruction cache, and means in the execution unit for addressing the instruction cache at the second address after addressing the first instruction to obtain the next instruction for execution.
Claim 3
Dependent Claim
57 words
The computer of claim 1 wherein the execution unit further comprises an instruction register and an address register for receiving the first instruction and the address of the second instruction, respectively, from the instruction cache, wherein the contents of the address register addresses the instruction cache to fetch the next instruction for execution from the instruction cache.
Claim 4
Dependent Claim
35 words
The computer of claim 2 wherein the instruction fetch unit further comprises means for transferring the second address to the first means to maintain address synchronization between the instruction fetch unit and the execution unit.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-07-31 | 1993-01-30 | 1993-08-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-07-31 | 1997-01-30 | 1997-08-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-07-31 | 2001-01-30 | 2001-08-01 | $7700.00 | Window Closed / Lapsed |