Managing idle time and performing lookup operations to adapt...

Electrical computers and digital processing systems: memory – Storage accessing and control – Specific memory composition

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S105000, C711S106000, C711S111000, C365S049130, C365S222000

Reexamination Certificate

active

07028136

ABSTRACT:
Methods and apparatus are disclosed for, inter alia, managing idle time and performing lookup operations to adapt to refresh requirements and/or operational rates of the particular associative memory or other devices used to implement the system. A system typically a controller coupled to a circuit including includes multiple associative memories. The controller receives performance information from at least one of the associative memories and generates idle time corresponding to the performance information. This performance information may include an actual refresh requirement for each of the associate memories or the worst-case requirement of one of the associative memories, so that the controller can intermittently provide the actual refresh cycles required, if any, by a particular implementation. This performance information may indicate for some or all instructions the actual time required by a particular instruction, so that the controller can operate based on the actual time required, rather than inefficiently operating on a worst-case time defined in a specification or data sheet.

REFERENCES:
patent: 3648254 (1972-03-01), Beausoleil
patent: 4296475 (1981-10-01), Nederlof et al.
patent: 4791606 (1988-12-01), Threewitt et al.
patent: 4996666 (1991-02-01), Duluk, Jr.
patent: 5088032 (1992-02-01), Bosack
patent: 5319763 (1994-06-01), Ho et al.
patent: 5339076 (1994-08-01), Jiang
patent: 5383146 (1995-01-01), Threewitt
patent: 5404482 (1995-04-01), Stamm et al.
patent: 5428565 (1995-06-01), Shaw
patent: 5440715 (1995-08-01), Wyland
patent: 5450351 (1995-09-01), Heddes
patent: 5481540 (1996-01-01), Huang
patent: 5515370 (1996-05-01), Rau
patent: 5684954 (1997-11-01), Kaiserswerth et al.
patent: 5740171 (1998-04-01), Mazzola et al.
patent: 5748905 (1998-05-01), Hauser et al.
patent: 5802567 (1998-09-01), Liu et al.
patent: 5841874 (1998-11-01), Kempke et al.
patent: 5842040 (1998-11-01), Hughes et al.
patent: 5852569 (1998-12-01), Srinivasan et al.
patent: 5856940 (1999-01-01), Rao
patent: 5898689 (1999-04-01), Kumar et al.
patent: 5920886 (1999-07-01), Feldmeier
patent: 5930359 (1999-07-01), Kempke et al.
patent: 5956336 (1999-09-01), Loschke et al.
patent: 5978885 (1999-11-01), Clark, II
patent: 6000008 (1999-12-01), Simcoe
patent: 6041389 (2000-03-01), Rao
patent: 6047369 (2000-04-01), Colwell et al.
patent: 6061368 (2000-05-01), Hitzelberger
patent: 6069573 (2000-05-01), Clark, II et al.
patent: 6081440 (2000-06-01), Washburn et al.
patent: 6091725 (2000-07-01), Cheriton et al.
patent: 6097724 (2000-08-01), Kartalopoulos
patent: 6134135 (2000-10-01), Andersson
patent: 6137707 (2000-10-01), Srinivasan et al.
patent: 6141738 (2000-10-01), Munter et al.
patent: 6148364 (2000-11-01), Srinivasan et al.
patent: 6154384 (2000-11-01), Nataraj et al.
patent: 6175513 (2001-01-01), Khanna
patent: 6181698 (2001-01-01), Hariguchi
patent: 6199140 (2001-03-01), Srinivasan et al.
patent: 6219748 (2001-04-01), Srinivasan et al.
patent: 6236658 (2001-05-01), Essbaum et al.
patent: 6237061 (2001-05-01), Srinivasan et al.
patent: 6240003 (2001-05-01), McElroy
patent: 6240485 (2001-05-01), Srinivasan et al.
patent: 6243667 (2001-06-01), Kerr et al.
patent: 6246601 (2001-06-01), Pereira
patent: 6285378 (2001-09-01), Duluk, Jr.
patent: 6289414 (2001-09-01), Feldmeier et al.
patent: 6295576 (2001-09-01), Ogura et al.
patent: 6307855 (2001-10-01), Hariguchi
patent: 6308219 (2001-10-01), Hughes
patent: 6317350 (2001-11-01), Pereira et al.
patent: 6331961 (2001-12-01), Kengeri et al.
patent: 6374326 (2002-04-01), Kansal et al.
patent: 6377577 (2002-04-01), Bechtolsheim et al.
patent: 6389506 (2002-05-01), Ross et al.
patent: 6430190 (2002-08-01), Essbaum et al.
patent: 6434662 (2002-08-01), Greene et al.
patent: 6467019 (2002-10-01), Washburn
patent: 6526474 (2003-02-01), Ross
patent: 6535951 (2003-03-01), Ross
patent: 6546391 (2003-04-01), Tsuruoka
patent: 6563754 (2003-05-01), Lien et al.
patent: 6597595 (2003-07-01), Ichiriu et al.
patent: 6606681 (2003-08-01), Uzun
patent: 6651096 (2003-11-01), Gai et al.
patent: 6658002 (2003-12-01), Ross et al.
patent: 6707692 (2004-03-01), Hata
patent: 6715029 (2004-03-01), Trainin et al.
patent: 6717946 (2004-04-01), Hariguchi et al.
patent: 6738862 (2004-05-01), Ross et al.
patent: 6775737 (2004-08-01), Warkede et al.
patent: 6848035 (2005-01-01), Akiyama et al.
patent: 2001/0038554 (2001-11-01), Takata et al.
patent: 2002/0056020 (2002-05-01), Sartore et al.
patent: 2003/0005146 (2003-01-01), Miller et al.
patent: 2003/0223259 (2003-12-01), Roth
patent: 2003/0231631 (2003-12-01), Pullela
patent: 2004/0030802 (2004-02-01), Eatherton et al.
patent: 2004/0030803 (2004-02-01), Eatherton et al.
Delgado-Frias et al., Mar. 22-23, 1996, pp. 246-251.
Jon P. Wade and Charles G. Sodini, “A Ternary Content Addressable Search Engine,” IEEE Journal of Solid-State Circuits, vol. 24, No. 4, Aug. 1989, pp. 1003-1013.
Teuvo Kohonen, Content-Addressable Memories, 1987, pp. 128-129 and 142-144, Springer-Verlang, New York.
Brian Dipert, ed., “Special-purpose SRAMs Smooth the Ride,” EDN, Jun. 24, 1999, pp. 93-104.
“What is a CAM (Content-Addressable Memory)?,” Application Brief AB-N6, Rev. 2a, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 4 pages.
“Reading Out the Valid LANCAM Memory Entries,” Application Brief AB-N4, Rev. 1a, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 4 pages.
“Extending the LANCAM Comparand,” Application Brief AB-N3, Rev. 1.0a Draft, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 4 pages.
“Advantages of CAM in ASIC-Based Network Address Processing,” Application Brief AB-N11, Rev. 1.2a Draft, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 4 pages.
“Virtual Memory Applications of the MU9C1480A LANCAM,” Application Note AN-N3, Rev. 1a, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 12 pages.
“Using the MU9C1965A LANCAM MP for Data Wider than 128 Bits,” Application Note AN-N19, Rev. 1a, Music Semiconductors, Milpitas, CA, Sep. 30, 1998, 16 pages.
“Fast IPv4 and IPv4 CIDR Address Translation and Filtering Using the MUAC Routing CoProcessor (RCP),” Application Note AN-N25, Rev. 0a, Music Semiconductors, Milpitas, CA, Oct. 1, 1998, 16 pages.
“Using MUSIC Devices and RCPs for IP Flow Recognition,” Application Note AN-N27, Rev. 0, Music Semiconductors, Milpitas, CA, Oct. 21, 1998, 20 pages.
“Wide Ternary Searches Using Music CAMs and RCPs,” Application Note AN-N31, Rev. 0, Music Semiconductors, Milpitas, CA, Apr. 13, 1999, 8 pages.
Tong-Bi Pei and Charles Zukowski, “VLSI Implementation of Routing Tables: Tries and CAMS,” Networking in the Nineties, Proceedings of the Annual Joint Conference of the Computer and Communications Societies, New York, Apr. 7, 1991, pp. 515-524, vol. 2, Conf. 10.
Anthony McAuley and Paul Francis, “Fast Routing Table Lookup Using CAMs,” Networking: Foundation for the Future, Proceedings of the Annual Joint Conference of the Computer and Communications Societies, Los Alamitos, Mar. 28, 1993, pp. 1382-1391, vol. 2, Conf 12.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Managing idle time and performing lookup operations to adapt... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Managing idle time and performing lookup operations to adapt..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Managing idle time and performing lookup operations to adapt... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3549162

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.