Electrical computers and digital processing systems: processing – Dynamic instruction dependency checking – monitoring or... – Commitment control or register bypass
Patent
1993-12-30
2000-08-08
Follansbee, John
Electrical computers and digital processing systems: processing
Dynamic instruction dependency checking, monitoring or...
Commitment control or register bypass
G06F 930
Patent
active
061015970
ABSTRACT:
Maximum throughput or "back-to-back" scheduling of dependent instructions in a pipelined processor is achieved by maximizing the efficiency in which the processor determines the availability of the source operands of a dependent instruction and provides those operands to an execution unit executing the dependent instruction. These two operations are implemented through number of mechanisms. One mechanism for determining the availability of source operands, and hence the readiness of a dependent instruction for dispatch to an available execution unit, relies on the prospective determination of the availability of a source operand before the operand itself is actually computed as a result of the execution of another instruction. Storage addresses of the source operands of an instruction are stored in a content addressable memory (CAM). Before an instruction is executed and its result data written back, the storage location address of the result is provided to the CAM and associatively compared with the source operand addresses stored therein. A CAM match and its accompanying match bit indicate that the result of the instruction to be executed will provide a source operand to the dependent instruction waiting in the reservation station. Using a bypass mechanism, if the operand is computed after dispatch of the dependent instruction, then the source operand is provided directly from the execution unit computing the source operand to a source operand input of the execution unit executing the dependent instruction.
REFERENCES:
patent: 4736288 (1988-04-01), Shintani et al.
patent: 4752873 (1988-06-01), Shonai et al.
patent: 5136697 (1992-08-01), Johnson
patent: 5142633 (1992-08-01), Murray et al.
patent: 5222244 (1993-06-01), Carbine et al.
patent: 5313644 (1994-05-01), Matsuo et al.
patent: 5333296 (1994-07-01), Bouchard et al.
patent: 5345569 (1994-09-01), Tran
patent: 5355457 (1994-10-01), Shebanow et al.
Mike Johnson, Superscalar Microprocessor Design, 1991, pp 1-289.
V. Popescu, et al., "The Metaflow Architecture," IEEE Micro, pp. 10-13 and 63-73, Jun. 1991.
Colwell Robert P.
Fetterman Michael A.
Hinton Glenn J.
Martell Robert W.
Papworth David B.
Follansbee John
Intel Corporation
LandOfFree
Method and apparatus for maximum throughput scheduling of depend does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for maximum throughput scheduling of depend, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for maximum throughput scheduling of depend will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1160526