Electrical computers and digital processing systems: processing – Dynamic instruction dependency checking – monitoring or... – Commitment control or register bypass
Reexamination Certificate
2003-12-29
2008-03-11
Coleman, Eric (Department: 2183)
Electrical computers and digital processing systems: processing
Dynamic instruction dependency checking, monitoring or...
Commitment control or register bypass
Reexamination Certificate
active
07343477
ABSTRACT:
Predicting address matches between a read type operation and a write type operation based on address representations allows for efficient RAW bypass. The spatial locality characteristic of code allows for address match prediction with address representations that are smaller than the actual addresses, thus allowing for faster comparison. Operations for performing the RAW bypass commence upon predicting an address match. While these operations are being performed, other operations for verifying the prediction are performed. If the address match prediction is verified, then the RAW bypass has been performed without hindrance. If the address match is proved incorrect, then the corresponding read type operation is reissued and/or re-executed.
REFERENCES:
patent: 4998221 (1991-03-01), Correale, Jr.
patent: 5724538 (1998-03-01), Morris et al.
patent: 5987595 (1999-11-01), Yoaz et al.
patent: 6058472 (2000-05-01), Panwar et al.
patent: 6263404 (2001-07-01), Borkenhagen et al.
patent: 6349382 (2002-02-01), Feiste et al.
patent: 6938148 (2005-08-01), Moore et al.
patent: 6970996 (2005-11-01), Green
patent: 7028166 (2006-04-01), Pickett
Lennox, Jonathon and Schulzrinne, Henning, “Transporting User Control Information in SIP REGISTER Payloads”, Internet Engineering Task Force Internet Draft, Oct. 31, 2000, pp. 1-12.
Nikolopoulos, Dmitris, “Advanced Computer Architecture Lecture 10 Limits to ILP, Vector Processing,” Lecture Slides, Feb. 22, 2005, <downloaded from http://www.cs.wm.edu/˜dsn/courses/654/lectures/lecture10.pdf on June 25, 2005> 10 pages.
Hennessy, John L. and Patterson, David A., “Computer Architecture A Quantitative Approach”, Third Edition, 2003, pp. 177-178 and 184-189.
Thatipelli Krishna
Venkatrao Balakrishna
Coleman Eric
Dorsey & Whitney LLP
Sun Microsystems Inc.
LandOfFree
Efficient read after write bypass does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Efficient read after write bypass, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient read after write bypass will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3967896