Electrical computers and digital processing systems: processing – Dynamic instruction dependency checking – monitoring or... – Scoreboarding – reservation station – or aliasing
Reexamination Certificate
2005-02-04
2009-08-04
Coleman, Eric (Department: 2183)
Electrical computers and digital processing systems: processing
Dynamic instruction dependency checking, monitoring or...
Scoreboarding, reservation station, or aliasing
Reexamination Certificate
active
07571302
ABSTRACT:
A data dependence table in RAM relates physical register addresses to instructions such that for each instruction, the registers on whose data the instruction depends are identified. The table is updated for each instruction added to the pipeline. For a branch instruction, the table identifies the registers relevant to the branch instruction for branch prediction.
REFERENCES:
patent: 5201057 (1993-04-01), Uht
patent: 5546597 (1996-08-01), Martell et al.
patent: 5627985 (1997-05-01), Fetterman et al.
patent: 5710902 (1998-01-01), Sheaffer et al.
patent: 5790827 (1998-08-01), Leung
patent: 6334182 (2001-12-01), Merchant et al.
patent: 6493820 (2002-12-01), Akkary et al.
patent: 7093106 (2006-08-01), Ambekar et al.
patent: 7127591 (2006-10-01), Asakawa
patent: 2003/0177337 (2003-09-01), Seki
R. Bahar, et al., “Power and Energy Reduction Via Pipeline Balancing”. Compaq Computer Corporation, pp. 218-229.
P. Bird, et al., “The Effective of Decoupling”, Presented at the Seventh ACM International Conference on Supercomputing, Tokyo, Japan, Jul. 19-23, 1993, pp. 1-10.
D. Burger, et al. “The SimpleScalar Tool Set, Version 2.0”, University of Wisconsin-Madision Computer Sciences Department Technical Report, #1342, Jun. 1997, pp. 1-21.
A. Buyuktosunoglu, et al., “An Oldest-First Selection Logic Implementation for Non-Compacting Issue Queues”, pp. 1-5.
B. Calder, “Selective Value Prediction”, Department of Computer Science and Engineering, University of California, San Diego, pp. 64-74.
V. Agarwal, M. Hrishikesh, S. W. Keckler, and D. Burger. Clock Rate versus IPC: The End of the Road for Conventional Microarchitectures. 27th Annual International Symposium on Computer Architecture, Jun. 2000.
D. M. Tullsen, S. J. Eggers, J.S. Emer, H. M. Levy, J. L. Lo, and R. L. Stamm. Exploiting Choice: Instruction Fetch and Issue on an Implementable Simuntaneous Multithreading Processor. 23rd Annual International Symposium on Computer Architecture, May 1996.
A. Tyagi, H.C. Ng, and P.Mohapatra. Dynamic Branch Decoupled Architecture. 1999 IEEE International Conference on Computer Design, Oct. 1999.
D. W. Wall. Limits of Instruction-Level Parellelism. Technical Report 93/6, Digital Western Research Laboratory, Nov. 1993.
K. C. Yeager. The MIPS R10000 Superscalar Microprocessor. IEEE Micro, Apr. 1996.
T.-Y. Yeh and Y. Patt. A Comparison of Dynamic Branch Predictors that use Two Levels of Branch History. 20th International Symposium on Computer Architecture, May 1993.
L. Carter and B. Calder. Using Predicate Path Information in Hardware to Determine True Dependences. 16th Annual ACM International Conference on Supercomputing, Jun. 2002.
I.C. K. Chen, J. T. Coffey, and T. N. Mudge. Analysis of Branch Prediction via Data Compression. 7th International Conference on Architectural Support for Programming Languages and Operating Systems, Oct. 1996.
A. N. Eden and T. Mudge. The YAGS Branch Prediction Scheme. 31st International Symposium on Microarchitecture, Nov. 1998.
A. Farcy, 0. Temam, R. Espasa, and T. Juan. Dataflow Analysis of Branch Mispredictions and Its Application to Early Resolution of Branch Outcomes. 31st International Symposium on Microarchitecture, Nov. 1998.
B. Fields, S. Rubin, and R. Bodik. Focusing Processor Policies via Critical-Path Prediction. 28th Annual International Symposium on Computer Architecture, Jun. 2001.
D. Folegnani and A. Gonzalez. Energy-Efficient Issue Logic. 28th International Symposium on Computer Architecture, Jun. 2001.
] P. N. Glaskowsky. Pentium 4 (partially) previewed. Microprocessor Report, Aug. 2000.
J. Gonzalez and A. Gonzalez. The Potential of Data Value Speculation to Boosst ILP. 1998 International Conference on Supercomputing, Jul. 1998.
M. Goshima, K. Nishino, Y. Nakashima, S Ichiro Mori, T. Kitamura, and S. Tomita. A High-Speed Dynamic Instruction Scheduling Scheme for Superscalar Processors. IPSJ Transactions on High Performance Computing Systems, Dec. 2001.
A. Hartstein and T. R. Puzak. The Optimum Pipeline Depth for a Microprocessor. Proceedings of the 29th Annual International Symposium on Computer Architecture, May 2002.
T. Heil, Z. Smith, and J. Smith. Improving Branch Predictors by Correlating on Data Values. 32nd International Symposium on Microarchitecture, Nov. 1999.
D. A. Jiminez, S. Keckler, and C. Lin. The Impact of Delay on the Design of Branch Predictors. 33rd Annual International Symposium on Microarchitecture, 2000.
R. E. Kessler, E. J. McLellan, and D. A. Webb. The Alpha 21264 Microprocessor Architecture. 1998 International Conference on Computer Design, Oct. 1998.
A. R. Lebeck, J. Koppanalil, T. Li, J. Patwardhan, and E. Rotenberg. A Large, Fast Instruction Window for Tolerating Cache Misses. 29th Annual International Symposium on Computer Architecture, May 2002.
C.-C. Lee, 1.C. K. Chen, and T. N. Mudge. The Bi-Mode Branch Predictor. 30th International Symposium on Microarchitecture, Dec. 1995.
M. Lipasti and J. Shen. Exceeding the Data-Flow Limit Via Value Prediction. 29th International Symposium onMicroarchitecture, Dec. 1996.
P. Michaud, A. Seznec, and R. Uhlig. Trading Conflict and Capacity Aliasing in Conditional Branch Predictors. 24th International Symposium on Computer Architecture, Jun. 1997.
R. Nair. Dynamic Path-Based Branch Correlation. 28th International Symposium on Microarchitecture, Nov. 1995.
S. Sechrest, C.-C. Lee, and T.Mudge. Correlation and Aliasing in Dynamic Btanch Predictors. 23rd International Symposium on Computer Architecture, May 1996.
A. Seznec, S. Felix, V. Krishnan, and Y. Sazeides. Design Tradeoffs for the Alpha EV8 Conditional Branch Predictor. 29th Annual International Symposium on Computer Architecture, May 2002.
B. Simon, B. Calder, and J. Ferrante. Incorporating Predicate Information into Branch Predictors. To appear in the 9th International Symposium on High Performance Computer Architecture, Feb. 2003.
E. Sprangle and D. Carmean. Increasing Processor Performance by Implementing Deeper Pipelines. Proceedings of 29th Annual International Symposium on Computer Architecture, May 2002.
S. Srinivasan et al. Locality vs Criticality. 28th International Symposium on Computer Architecture, Jun. 2001.
S. Srinivasan and A. Lebeck. Load Latency Tolerance in Dynamically Scheduled Processors. 31st International Symposium on Microarchitecture, Nov. 1998.
J. Stark, M. Evers, and Y. N. Patt. Variable Length Path Branch Prediction. 8th International Conference on Architectural Support for Programming Languages and Operating Systems, Oct. 1998.
R. Bahar, et al., “Power and Energy Reduction Via Pipeline Balancing”, Compaq Computer Corporation, pp. 218-229, 2001, IEEE.
A. Buyuktosunoglu, et al., “An Oldest-First Selection Logic Implementation for Non-Compacting Issue Queues”, pp. 1-5, 15th International ASIC/SOC. Conference, 2002.
B. Calder, “Selective Value Prediction”, Department of Computer Science and Engineering, University of California, San Diego, pp. 64-74, 1999, IEEE.
Albonesi David
Chen Lei
Dropsho Steve
Coleman Eric
Stolowitz Ford Cowger LLP
LandOfFree
Dynamic data dependence tracking and its application to... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Dynamic data dependence tracking and its application to..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic data dependence tracking and its application to... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4090904