The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jun. 26, 2007
Filed:
Dec. 28, 2005
William N. Eatherton, San Jose, CA (US);
Jaushin Lee, Saratoga, CA (US);
Bangalore L. Priyadarshan, Fremont, CA (US);
Priyank Ramesh Warkhede, San Jose, CA (US);
Fusun Ertemalp, Menlo Park, CA (US);
Hugh Weber Holbrook, San Francisco, CA (US);
Dileep Kumar Devireddy, San Jose, CA (US);
Bhushan Mangesh Kanekar, San Jose, CA (US);
Venkateshwar Rao Pullela, San Jose, CA (US);
William N. Eatherton, San Jose, CA (US);
Jaushin Lee, Saratoga, CA (US);
Bangalore L. Priyadarshan, Fremont, CA (US);
Priyank Ramesh Warkhede, San Jose, CA (US);
Fusun Ertemalp, Menlo Park, CA (US);
Hugh Weber Holbrook, San Francisco, CA (US);
Dileep Kumar Devireddy, San Jose, CA (US);
Bhushan Mangesh Kanekar, San Jose, CA (US);
Venkateshwar Rao Pullela, San Jose, CA (US);
Cisco Technology, Inc, San Jose, CA (US);
Abstract
Methods and apparatus are disclosed for performing lookup operations using associative memories, including, but not limited to modifying search keys within an associative memory based on modification mappings, forcing a no-hit condition in response to a highest-priority matching entry including a force no-hit indication, selecting among various sets or banks of associative memory entries in determining a lookup result, and detecting and propagating error conditions. In one implementation, each block retrieves a modification mapping from a local memory and modifies a received search key based on the mapping and received modification data. In one implementation, each of the associative memory entries includes a field for indicating that a successful match on the entry should or should not force a no-hit result. In one implementation, an indication of which associative memory blocks or sets of entries to use in a particular lookup operation is retrieved from a memory.