Static information storage and retrieval – Associative memories – Ferroelectric cell
Reexamination Certificate
2005-04-05
2005-04-05
Dinh, Son T. (Department: 2824)
Static information storage and retrieval
Associative memories
Ferroelectric cell
C365S189070, C711S108000
Reexamination Certificate
active
06876559
ABSTRACT:
A content addressable memory device including a memory to store a searchable database, a search circuit, and a first-in-first-out storage circuit. The search circuit generates a plurality of address values that correspond to unoccupied storage locations within the memory, and the plurality of address values are queued within the first-in-first-out storage circuit to enable the address values to be read in succession by an external device.
REFERENCES:
patent: 4152762 (1979-05-01), Bird et al.
patent: 4813002 (1989-03-01), Joyce et al.
patent: 4958377 (1990-09-01), Takahashi
patent: 5129074 (1992-07-01), Kikuchi et al.
patent: 5386413 (1995-01-01), McAuley et al.
patent: 5414704 (1995-05-01), Spinney
patent: 5440715 (1995-08-01), Wyland
patent: 5485418 (1996-01-01), Hiraki et al.
patent: 5515370 (1996-05-01), Rau
patent: 5642322 (1997-06-01), Yoneda
patent: 5818786 (1998-10-01), Yoneda
patent: 5870324 (1999-02-01), Helwig et al.
patent: 5920886 (1999-07-01), Feldmeier
patent: 5999435 (1999-12-01), Henderson et al.
patent: 6006306 (1999-12-01), Haywood et al.
patent: 6011795 (2000-01-01), Varghese et al.
patent: 6098147 (2000-08-01), Mizuhara
patent: 6161144 (2000-12-01), Michels et al.
patent: 6199140 (2001-03-01), Srinivasan et al.
patent: 6226710 (2001-05-01), Melchior
patent: 6289414 (2001-09-01), Feldmeier et al.
patent: 6362992 (2002-03-01), Cheng
patent: 6370613 (2002-04-01), Diede et al.
patent: 6389506 (2002-05-01), Ross et al.
patent: 6499081 (2002-12-01), Nataraj et al.
patent: 6700809 (2004-03-01), Ng et al.
patent: 20030093616 (2003-05-01), Slavin
patent: WO 0111630 (2001-02-01), None
Shah, D. and Gupta, P., “Fast Incremental Updates on Ternary-CAMs for Routing Lookups and Packet Classification,” IEEE Micro, 21(1), Jan. 2001, pp. 1-9.
Waldvogel et al., “Scalable High-Speed Prefix Matching,” ACM Transactions on Computer Systems, vol. 19, No. 4, Nov. 2001, pp. 440-482.
Kobayashi, M. and Murase, T., “A Processor Based High-Speed Longest Prefix Match Search Engine,” IEEE 2001, pp. 233-239.
Huang et al., “A Fast IP Routing Lookup Scheme for Gigabit Switching Routers,” IEEE 1999, pp. 1429-1436.
Huang, Nen-Fu and Zhao, Shi-Ming, “A Novel IP-Routing Lookup Scheme and Hardware Architecture for Multigigabit Switching Routers,” IEEE Journal on Selected Areas in Communications, vol. 17, No. 6, Jun. 1999, pp. 1093-1104.
V. Srinivasan and G. Varghese, “Fast Address Lookups Using Controlled Prefix Expansion,” ACM Transactions on Computer Systems, vol. 17, No. 1, Feb. 1999, pp. 1-40.
Gupta et al., “Routing Lookups in Hardware at Memory Access Speeds,” Proc. Infocom, San Francisco, CA, Apr. 1998, pp. 1-8.
Waldvogel et al., “Scalable High Speed IP Routing Lookups,” SIGCOMM, Cannes, France, 1997, pp. 25-35.
A. Broder and M. Mitzenmacher, “Using Multiple Hash Functions to Improve IP Lookups,” Proceedings of IEEE Infocom, 2001, pp. 1454-1463.
Z. Cao, Z. Wang and E. Zegura, “Performance of Hashing-Based Schemes for Internet Load Balancing,” Proc. IEEE Infocom 2000, Conf. on Computer Comm., vol. 1, 19th Annual Joint Conf. of the IEEE Computer and Comm. Soc., Tel Aviv, Israel, Mar. 26-30, 2000, pp. 1-10.
V. Srinivasan, S. Suri and G. Varghese, “Packet Classification using Tuple Space Search,” Proceedings of SIGCOMM, 1999, pp. 135-146.
D. Knuth, “The Art of Computer Programming, vol. 3, Sorting and Searching, Second Edition,” Addison Wesley Longman, 1998, pp. 541-545.
J. Da Silva and I. Watson, “Pseudo-Associative Store with Hardware Hashing,” IEE Proceedings, Computers and Digital Techniques, vol. 130, Pt. E, No. 1, Jan. 1983, pp. 19-24.
Ng David W.
Pereira Jose P.
Rathnavelu Sunder R.
Dinh Son T.
NetLogic Microsystems, Inc.
Shemwell Gregory & Courtney LLP
LandOfFree
Block-writable content addressable memory device does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Block-writable content addressable memory device, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Block-writable content addressable memory device will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3412856