Static information storage and retrieval – Addressing – Particular decoder or driver circuit
Reexamination Certificate
2001-06-22
2004-03-16
Nelms, David (Department: 2818)
Static information storage and retrieval
Addressing
Particular decoder or driver circuit
C365S230030, C365S230040, C365S200000
Reexamination Certificate
active
06707752
ABSTRACT:
FIELD OF THE INVENTION
The invention relates to field of memories particularly those using redundant-form addresses.
PRIOR ART AND RELATED ART
The latency of on-chip caching has become more and more important to the overall performance of microprocessors. To speed up cache access, a redundant-form addressing system is known which permits cache access before the final complete address becomes available. In general, the ordinary binary address is replaced with a more complex address (redundant-form). In effect, address components from an adder are used since these are more quickly available. For instance, these components are not delayed by the carry chain needed to complete the ordinary address. Aspects of this technology are described in PCT Application WO 99/64953; co-pending application Ser. No. 09/532,411 entitled “Shared Cache Word Line Decoder For Redundant And Regular Addresses” filed Mar. 22, 2000; and application Ser. No. 09/538,553 entitled “Cache Column Multiplexing Using Redundant Form Addresses” filed Mar. 29, 2000.
One problem associated with using redundant-form addresses is that it is costly to do redundant-form tag compares. Substantial additional circuitry is required to handle the redundant-form tag comparison.
As will be seen, the present invention solves this problem.
REFERENCES:
patent: 4804871 (1989-02-01), Walters, Jr.
patent: 4905189 (1990-02-01), Brunolli
patent: 4926385 (1990-05-01), Fujishima et al.
patent: 5179536 (1993-01-01), Kasa et al.
patent: 5227997 (1993-07-01), Kikuda et al.
patent: 5253203 (1993-10-01), Partovi et al.
patent: 5257236 (1993-10-01), Sharp
patent: 5315558 (1994-05-01), Hag
patent: 5353424 (1994-10-01), Partovi et al.
patent: 5488583 (1996-01-01), Ong et al.
patent: 5523974 (1996-06-01), Hirano et al.
patent: 5532947 (1996-07-01), Potter et al.
patent: 5542062 (1996-07-01), Taylor et al.
patent: 5555529 (1996-09-01), Hose, Jr. et al.
patent: 5568442 (1996-10-01), Kowalczyk et al.
patent: 5577223 (1996-11-01), Tanoi et al.
patent: 5583806 (1996-12-01), Widigen et al.
patent: 5640339 (1997-06-01), Davis et al.
patent: 5657281 (1997-08-01), Rao
patent: 5657469 (1997-08-01), Shimizu
patent: 5680569 (1997-10-01), Correll
patent: 5710731 (1998-01-01), Ciraula et al.
patent: 5717648 (1998-02-01), Davis et al.
patent: 5754819 (1998-05-01), Lynch et al.
patent: 5758178 (1998-05-01), Lesartre
patent: 5822257 (1998-10-01), Ogawa
patent: 5841687 (1998-11-01), Rees
patent: 5841961 (1998-11-01), Kozaru et al.
patent: 5854761 (1998-12-01), Patel et al.
patent: 5860092 (1999-01-01), Breid et al.
patent: 5890201 (1999-03-01), McLellan et al.
patent: 5920515 (1999-07-01), Shaik et al.
patent: 5933376 (1999-08-01), Lee
patent: 5956274 (1999-09-01), Elliott et al.
patent: 6058053 (2000-05-01), Tsuji et al.
patent: 6098150 (2000-08-01), Brethour et al.
patent: 6144592 (2000-11-01), Kanda
patent: 6166973 (2000-12-01), Shinozaki
patent: 6172933 (2001-01-01), Sager
patent: 6181612 (2001-01-01), Wada
patent: 6209076 (2001-03-01), Blomgren
patent: 6212109 (2001-04-01), Proebsting
patent: 6256238 (2001-07-01), Nagasawa et al.
patent: 6256709 (2001-07-01), Patel
patent: 6341327 (2002-01-01), Sager
patent: 6356485 (2002-03-01), Proebsting
patent: 6363020 (2002-03-01), Shubat
patent: 6373753 (2002-04-01), Proebsting
patent: 6373758 (2002-04-01), Hughes et al.
patent: WO 99/64 953 (1999-12-01), None
patent: US 02/18 181 (2002-10-01), None
Cortadella, J., et al., “Evaluation of A+B=K Conditions Without Carry Propagation,” IEEE Transactions on Computers, vol. 41, No. 11, pp. 1484-1488, Nov. 1992.
Heald, R., et al., “Sum-Addressed-Memory Cache with 1.6ns Latency,” IEEE ISSCC, Paper SP22.2, 2 pages, Feb. 7, 1998.
Cortadella, J., et al., “Evaluating “A+B=K” Conditions in Constant Time,” IEEE Proceedings, vol. 1, CH2458-8, Jun. 7-9, 1988.
Lutz, D., et al., “The Half-Adder Form and Early Branch Condition Resolution,” IEEE ARITH'97, pp. 266-273, Jul. 6-9, 1997.
Lutz, D., et al., “Early Zero Detection,” IEEE ICCD'96, pp. 545-550, Oct. 7-9, 1996.
Nelms David
Pham Ly Duy
LandOfFree
Tag design for cache access with redundant-form address does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Tag design for cache access with redundant-form address, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tag design for cache access with redundant-form address will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3207083