Search coprocessor subsystem having multiple search engines and dedicated key-table memory for connection to a computer system

• US 6,640,220 B1
• Filed: 03/14/2000
• Issued: 10/28/2003
• Est. Priority Date: 03/14/2000
• Status: Expired due to Term

• Current Assignee: Aeroflex Colorado Springs Incorporated (Cobham PLC)
• Original Assignee: Aeroflex UTMC Microelectronics Systems Incorporated
• Inventors: Webster, James Rodney, Melchior, Timothy Allan, Firlit, Thaddeus Michael
• Primary Examiner(s): Popovici, Dov
• Assistant Examiner(s): ABEL JALIL, NEVEEN
• Application Number:
  US09/526,069
• Time in Patent Office: 1,323 Days
• Field of Search: 707/1, 707/104, 707/3, 707/100, 707/205, 707/2, 707/4, 707/10, 707/5, 707/103, 711/108, 711/164, 382/284, 370/400, 370/351, 370/389, 370/392, 370/224, 709/249, 709/228, 771/5, 771/208, 771/216, 771/221
• US Class Current: 1/1
• CPC Class Codes: G06F 16/90339 by using parallel associative memories or content-addressable memories
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation

Abstract

A search coprocessor card for attachment to a computer system has an interface to a host processor of the computer system and a processor. The processor has memory for its program and data, and is coupled to one or more search engine devices. Each of the search engine devices is in turn coupled to a memory for holding key tables, and is capable of searching the key tables for matching entries.

Claims

1. A method of searching, the method comprising the steps of:

generating a high-level search request in a first processor;

determining a coprocessor for handling a distributed search request from a plurality of coprocessors, and transferring the distributed search request to the determined coprocessor using an interface that couples the first processor to the plurality of coprocessors;

receiving the distributed search request on a general purpose processor located on one of the plurality of coprocessors and parsing the distributed search request into at least one atomic search command;

determining at least one search engine device, located on the determined coprocessor and containing at least one table memory, to perform the atomic search command;

wherein the at least one search engine device is capable of searching a key table located in the at least one table memory coupled to the at least one search engine for any matching entries of the key table;

submitting the at least one atomic search command from the general purpose processor located on one of the plurality of coprocessors to the at least one search engine device located on the coprocessor, and receiving at the general Purpose processor at least one atomic search result from the search engine device;

combining, on the general purpose processor located on one of the plurality of coprocessors, at least one atomic search result from the at least one search engine device into a composite result for the distributed search request;

returning the composite result for the distributed search request to the first processor; and

collecting, in the first processor, one or more distributed search results from one or more coprocessors to produce the final desired high-level search result.

2. The method of claim 1, wherein the atomic search command includes searches for a closest match to a group of pixels of an image.