Operand History Table
Permalink
Bookmark
Share
Twitter
Digg
Reddit
Facebook
Stumbleupon
Del.icio.us| IP.com Number | IPCOM000044351D |
|
|
|---|---|---|---|
| Dated | Dec 1, 1984 UTC | ||
| Size | 2 page(s) (65.1 KB) | ||
| Disclosed by |
|
||
Publication Summary
Operand pre-fetching for faster instruction executions is described. Trace analysis has shown that many of the instructions that require an operand compute the same operand address each time that the instruction is executed. Consider the instruction format below: (Image Omitted) The operand address is computed by adding the contents of the base register to the contents of the index register to the value of the displacement field supplied by the instruction. That is, operand address = C(B) + C(X) + displacement. This calculation is normally performed at address generation (AGEN) time. The operands are then fetched from the cache or memory. The time needed to fetch the operands depends on the speed of the cache or memory. Fig. 1 represents an idealized, cycle by cycle description of an instruction passing through a pipeline.| Country | United States |
|---|---|
| Language | English (United States) |
| Related Person(s) |
(AUTHOR) Emma, PG (AUTHOR) Pomerene, JH (AUTHOR) Puzak, TR (AUTHOR) Rechtschaffen, RN (AUTHOR) Sparacio, FJ |
About this Publication
This document was submitted to IP.com's Prior Art Database and this preview is designed to provide you with information regarding the contents of this document by displaying up to the first four pages of the document as scaled page renderings and displaying a limited amount of text which was extracted from the document on the Text Preview Tab.
To find out more on how to obtain the entire document, click the Download tab. There is a charge for downloading some Prior Art Database documents; please examine carefully whether you believe this document fills your needs before purchasing.
For more information about the Prior Art Database, visit the Learn section of this website. Thank you for visiting IP.com's Prior Art Database! You may wish to check out our Intellectual Property Library website before you leave.
Operand History Table
Operand pre-fetching for faster instruction executions is described. Trace analysis has shown that many of the instructions that require an operand compute the same operand address each time that the instruction is executed. Consider the instruction format below:
(Image Omitted)
The operand address is computed by adding the contents of the base register to the contents of the index register to the value of the displacement field supplied by the instruction. That is, operand address = C(B) + C(X) + displacement. This calculation is normally performed at address generation (AGEN) time. The operands are then fetched from the cache or memory. The time needed to fetch the operands depends on the speed of the cache or memory. Fig. 1 represents an idealized, cycle by cycle description of an instruction passing through a pipeline. The decode, AGEN, operand fetch (C1,C2), and execution phases are represented. Fig. 2 shows a mechanism that can fetch operands for instructions with constant operand addresses before the instructions are even decoded. The operand history table (O.H.T.) holds the instruction address and operand address of each instruction that computes the same operand address each time it is executed. Each entry in the O.H.T. contains two addresses. The first is the instruction address. The second entry is the address of the operand for that instruction. The mechanism shown in Fig. 2 operates as follows: Each instruction address fetched b...