Patent Grant
10846624
Indications are that the average database size and associated software support systems are growing at rates that are greater than the increase in processor performance (i.e., more than doubling roughly every 18 months). This is due to a number of factors including without limitation the desire to store more detailed information, to store information over longer periods of time, to merge databases from disparate organizations, and to deal with the large new databases which have arisen from emerging and important applications. For example, two emerging applications having large and rapidly growing databases are those connected with the genetics revolution and those associated with cataloging and accessing information on the Internet. In the case of the Internet, current industry estimates are that in excess of 1.5 million pages are added to the Internet each day. At the physical level this has been made possible by the remarkable growth in disk storage performance where magnetic storage density has been doubling every year or so for the past five years.
Search and retrieval functions are more easily performed on information when it is indexed. For example, with respect to financial information, it can be indexed by company name, stock symbol and price. Oftentimes, however, the information being searched is of a type that is either hard to categorize or index or which falls into multiple categories. As a result, the accuracy of a search for information is only as good as the accuracy and comprehensiveness of the index created therefor. In the case of the Internet, however, the information is not indexed. The bottleneck for indexing is the time taken to develop the reverse index needed to access web pages in reasonable time. For example, while there are search engines available, designing a search which will yield a manageable result is becoming increasingly difficult due to the large number of “hits” generated by less than a very detailed set of search instructions. For this reason, several “intelligent” search engines have been offered on the web, such as Google, which are intended to whittle down the search result using logic to eliminate presumed undesired “hits”.
With the next-generation Internet, ever-faster networks, and expansion of the Internet content, this bottleneck is becoming a critical concern. Further, it is becomingly exceedingly difficult to index information on a timely basis. In the case of the Internet, current industry estimates are that in excess of 1.5 million pages are added to the Internet each day. As a result, maintaining and updating a reverse index has become an enormous and continuous task and the bottleneck it causes is becoming a major impediment to the speed and accuracy of existing search and retrieval systems. Given the ever increasing amounts of information available, however, the ability to accurately and quickly search and retrieve desired information has become critical.
Associative memory devices for dealing with large databases are known in the prior art. Generally, these associative memory devices comprise peripheral memories for computers, computer networks, and the like, which operate asynchronously to the computer, network, etc. and provide increased efficiency for specialized searches. Additionally, it is also known in the prior art that these memory devices can include certain limited decision-making logic as an aid to a main CPU in accessing the peripheral memory. An example of such an associative memory device particularly adapted for use with a rotating memory such as a high speed disk or drum can be found in U.S. Pat. No. 3,906,455, the disclosure of which is incorporated herein by reference. This particular device provides a scheme for use with a rotating memory and teaches that two passes over a memory sector is necessary to presort and then sort the memory prior to performing any logical operations thereon. Thus, this device is taught as not being suitable for use with any linear or serial memory such as magnetic tape or the like.
Other examples of prior art devices may also be found in U.S. Pat. Nos. 3,729,712; 4,464,718; 5,050,075; 5,140,692; and 5,721,898; the disclosures of which are incorporated herein by reference.
As an example, in U.S. Pat. No. 4,464,718, Dixon performs fixed comparisons on a fixed number of bytes. They don't have the ability to scan and correlate arbitrarily over the data. They search serially along the tracks in a given disk cylinder but there is no provision for parallel searching across disks. Dixon's comparisons are limited by a fixed rigid number of standard logical operation types. Additionally, the circuitry presented supports only these single logical operations. There is no support for approximate or fuzzy matching.
While these prior art associative memory devices represent an attempt to speed the input and output of information to and from a peripheral memory, which in many cases is a mass storage memory device, all rely on the classic accessing of data stored in digital form by reading and interpreting the digital either address or content of the memory location. In other words, most such devices access data by its address but there are some devices that take advantage of the power of content addressing as is well known in the art. Nevertheless, in all of the prior art known to the inventors, the digital value of the address or data contained in the addressed location must be read and interpreted in its digital form in order to identify the data and then select it for processing. Not only does it take processing time to read and interpret the digital data represented by the address or content, this necessarily requires that the accessing circuit process the memory according to the structure of the data stored. In other words, if the data is stored in octets, then the accessing circuitry must access the data in octets and process it in an incremental manner. This “start and stop” processing serves to increase the input/output time required to access data. As is also well known in the art, this input/output time typically represents the bottleneck and effective limitation of processing power in any computer or computer network.
Furthermore, given the vast amount of information available to be searched, data reduction and classification operations (e.g., the ability to summarize data in some aggregate form) has become critical. Oftentimes, the ability to quickly perform data reduction functions can provide a company with a significant competitive advantage.
Likewise, with the improvements in digital imaging technology, the ability to perform two dimensional matching such as on images has become necessary. For example, the ability to conduct matches on a particular image of an individual, such as his or her face or retina, or on a fingerprint, is becoming critical to law enforcement as it steps up its efforts on security in light of the Sep. 11, 2001 terrorist attacks. Image matching is also of importance to the military in the area of automatic target recognition.
Finally, existing searching devices cannot currently be quickly and easily reconfigured in response to changing application demands.
Accordingly, there is a need for an improved information search and retrieval system and method which overcomes these and other problems in the prior art.
As described in U.S. Pat. No. 7,139,743, in order to solve these and other problems in the prior art, inventors have previously succeeded in designing and developing a method and apparatus for an associative memory using Field Programmable Gate Arrays (FPGA) in several embodiments which provide an elegantly simple solution to these prior art limitations as well as dramatically decreased access times for data stored in mass storage memories. The '743 patent describes several embodiments each of which has its own advantages. U.S. Pat. No. 6,711,558 discloses and claims the use of programmable logic and circuitry generally without being specific as to any choice between the various kinds of devices available for this part of the invention disclosed in the '558 patent. In the '743 patent, the inventors disclosed more specifically the use of FPGA's as part of the circuitry for various reasons as their best mode. An important reason amongst others is speed. And, there are two different aspects of operation in which speed plays a part. The first of these is the speed of reconfiguration. It is known in the art that FPGA's may be quickly programmed in the field to optimize the search methodology using a template, the template having been prepared in advance and merely communicated to the FPGA's over a connecting bus. Should it then be desired to search using a different methodology, the FPGA's may then be quickly and conveniently re-programmed with another prepared template in a minimal number of clock cycles and the second search started immediately. Thus, with FPGA's as the re-configurable logic, shifting from one search to another is quite easy and quick, relative to other types of re-programmable logic devices.
A second aspect of speed is the amount of time, once programmed, that a search requires. As FPGA's are hardware devices, searching is done at hardware processing speeds which is orders of magnitude faster than at software processing speeds as would be experienced with a microprocessor, for example. Thus, FPGA's are desirable over other software implementations where speed is a consideration as it most often is.
In considering the use of templates, the '743 patent discloses that at least several “generic” templates can be prepared in advance and made available for use in performing text searching in either an absolute search, an approximate search, or a higher or advanced search mode incorporating a Boolean algebra logic capability, or a graphics search mode. These could then be stored in a CPU memory and be available either on command or loaded in automatically in response to a software queue indicating one of these searches.
Still another factor to consider is cost, and the recent price reductions in FPGA's have made them more feasible for implementation as a preferred embodiment for this application, especially as part of a hard disk drive accelerator as would be targeted for a PC market. It is fully expected that further cost reductions will add to the desirability of these for this implementation, as well as others as discussed in greater detail below.
Generally, the '743 patent describes a technique for data retrieval through approximate matching of a data key with a continuous reading of data as stored on a mass storage medium, using FPGA's to contain the template for the search and do the comparison, all in hardware and at essentially line speed. By utilizing FPGA's, the many advantages and features commonly known are made available. These include the ability to arrange the FPGA's in a “pipeline” orientation, in a “parallel” orientation, or even in an array incorporating a complex web overlay of interconnecting data paths allowing for complex searching algorithms. In its broadest, and perhaps most powerful, embodiment, the data key may be an analog signal and it is matched with an analog signal generated by a typical read/write device as it clews across the mass storage medium. In other words, the steps taught to be required in the prior art of not only reading the analog representation of digital data stored on the mass storage medium but also the conversion of that signal to its digital format prior to being compared are eliminated. Furthermore, there is no requirement that the data be “framed” or compared utilizing the structure or format in which the data has been organized and stored. For an analog signal, all that need be specified is the elapsed time of that signal which is used for comparison with a corresponding and continuously changing selected time portion of the “read” signal. Using any one of many standard correlation techniques as known in the prior art, the data “key” may then be approximately matched to the sliding “window” of data signal to determine a match. Significantly, the same amount of data may be scanned much more quickly and data matching the search request may be determined much more quickly as well. For example, the inventors have found that CPU based approximate searches of 200 megabytes of DNA sequences can take up to 10 seconds on a typical present day “high end” system, assuming the offline processing to index the database has already been completed. In that same 10 seconds, the inventors have found that a 10-gigabyte disk could be searched for approximate matches using the technology described in the '558 patent. This represents a 50:1 improvement in performance. Furthermore, in a typical hard disk drive there are four surfaces and corresponding read/write heads, which may be all searched in parallel should each head be equipped with the technology described in the '558 patent. As these searches can proceed in parallel, the total increase in speed or improvement represents a 200:1 advantage. Furthermore, additional hard disk drives may be accessed in parallel and scaled to further increase this speed advantage over conventional systems.
By choosing an appropriate correlation or matching technique, and by setting an appropriate threshold, the search may be conducted to exactly match the desired signal, or more importantly and perhaps more powerfully, the threshold may be lowered to provide for approximate matching searches. This is generally considered a more powerful search mode in that databases may be scanned to find “hits” which may be valid even though the data may be only approximately that which is being sought. This allows searching to find data that has been corrupted, incorrectly entered data, data which only generally corresponds to a category, as well as other kinds of data searches that are highly desired in many applications. For example, a library of DNA sequences may be desired to be searched and hits found which represent an approximate match to a desired sequence of residues. This ensures that sequences which are close to the desired sequence are found and not discarded but for the difference in a forgivable number of residue mismatches. Given the ever-increasing volume and type of information desired to be searched, more complex searching techniques are needed. This is especially true in the area of molecular biology, “[O]ne of the most powerful methods for inferring the biological function of a gene (or the protein that it encodes) is by sequence similarity searching on protein and DNA sequence databases.” Garfield, “The Importance of (Sub)sequence Comparison in Molecular Biology,” pgs. 212-217, the disclosure of which is incorporated herein by reference. Current solutions for sequence matching are only available in software or non-reconfigurable hardware.
Still another application involves Internet searches provided by Internet search engines. In such a search, approximate matching allows for misspelled words, differently spelled words, and other variations to be accommodated without defeating a search or requiring a combinatorial number of specialized searches. This technique permits a search engine to provide a greater number of hits for any given search and ensure that a greater number of relevant web pages are found and cataloged in the search. Although, as mentioned above, this approximate matching casts a wider net which produces a greater number of “hits” which itself creates its own problems.
Still another possible application for this inventive technology is for accessing databases which may be enormous in size or which may be stored as analog representations. For example, our society has seen the implementation of sound recording devices and their use in many forums including judicial proceedings. In recent history, tape recordings made in the President's oval office have risen in importance with respect to impeachment hearings. As can be appreciated, tape recordings made over the years of a presidency can accumulate into a huge database which might require a number of persons to actually listen to them in order to find instances where particular words are spoken that might be of interest. Utilizing this inventive technology, an analog representation of that spoken word can be used as a key and sought to be matched while the database is scanned in a continuous manner and at rapid speed. Thus, the technology described in the '558 and '743 patents provide a powerful search tool for massive analog databases as well as massive digital databases.
While text-based searches are accommodated by the '558 and '743 patents, storage media containing images, sound, and other representations have traditionally been more difficult to search than text. The technology described in the '558 and '743 patents allow searching a large data base for the presence of such content or fragments thereof. For example, the key in this case could be a row or quadrant of pixels that represent the image being sought. Approximate matching of the key's signal can then allow identification of matches or near matches to the key. In still another image application, differences in pixels or groups of pixels can be searched and noted as results which can be important for satellite imaging where comparisons between images of the same geographic location are of interest as indicative of movement of equipment or troops.
The inventive technology of the '558 and '743 patents may be embodied in any of several configurations, as is noted more particularly below. However, one important embodiment is perhaps in the form of a disk drive accelerator which would be readily installed in any PC as an interface between the hard disk drive and the system bus. This disk drive accelerator could be provided with a set of standardized templates and would provide a “plug and play” solution for dramatically increasing the speed at which data could be accessed from the drive by the CPU. This would be an after market or retrofit device to be sold to the large installed base of PC's. It could also be provided as part of a new disk drive, packaged within the envelope of the drive case or enclosure for an external drive or provided as an additional plug in pc card as an adapter for an internal drive. Additional templates for various kinds of searches on various kinds of databases could be made available either with the purchase of the accelerator, such as by being encoded on a CD, or even over the Internet for download, as desired.
U.S. Pat. No. 8,095,508 extends the novel groundbreaking technology disclosed in the '558 and '743 patents such that a programmable logic device (PLD) such as an FPGA performs any of a variety of additional processing operations including but not limited to operations such as encryption, decryption, compression, and decompression. Thus, the '508 patent extends the technology of the '558 and '743 patents such that PLDs perform data manipulation operations. As used herein, the term “manipulating” or “manipulation” refers to the performance of a search operation, a reduction operation, or a classification operation on data in combination with any or all of a compression operation, a decompression operation, an encryption operation, and a decryption operation also performed on the data, or the performance of a compression operation or a decompression operation on data alone or in combination with any or all of a search operation, a reduction operation, a classification operation, an encryption operation, and a decryption operation also performed on the data. Not only can these manipulation operations be performed at very high speeds due to the inventive techniques disclosed herein, but these operations, when implemented on a PLD such as an FPGA as disclosed in the '508 patent, also enhance data security by protecting the unencrypted and/or decompressed data from being accessed or read by any viruses or malware that may be running in the software of the computer system and using the re-configurable logic to process stored data. Among the more powerful applications for the technology described in the '508 patent is to perform high speed searches within encrypted data, which can be referred to as crypto-searching. With crypto-searching, the stream of encrypted data is processed to first decrypt the data stream and then perform a search operation within the decrpyted data.
The value of data security to data owners cannot be underestimated and is ever-increasing in importance, and the ability to control who has access to what data and when lies at the heart of data security. Among its many unique applications, the technology described in the '508 patent provides flexibility to data owners in controlling who has access to their data, and speed in providing authorized users with access to that data (or targeted access to a portion of that data through scanning capabilities).
Further still, the use of compression and/or decompression as described in the '508 patent allows data to be stored in a manner that takes up less space in the mass storage medium, while still retaining the ability to search through the data at high speeds.
Preferably, these manipulation operations, when implemented with multiple stages, are implemented in a pipelined manner. In particular, the combination of one or more stages dedicated to encryption/decryption or compression/decompression with one or more stages dedicated to data searching or data reduction synergistically produces an intelligent, flexible, high speed, and secure design technique for data storage and retrieval.
The inventors also disclose that hardware acceleration via highly parallelizable compute resources such as reconfigurable logic, graphics processing units (GPUs), and/or chip multi-processors (CMPs) can be used to provide intelligent pipelining for machine learning operations. For example, a multi-functional pipeline can be deployed on highly parallelized compute resources such as reconfigurable logic, GPUs, and/or CMPs, where the multi-functional pipeline may comprise a plurality of pipelined data processing engines, the plurality of pipelined data processing engines being configured to perform processing operations. The multi-functional pipeline can be configured to controllably activate or deactivate each of the pipelined data processing engines in the pipeline in response to control instructions and thereby define a function for the pipeline, each pipeline function being the combined functionality of each activated pipelined data processing engine in the pipeline. In example embodiments disclosed herein, the pipelined data processing engines can include correlation logic, and such pipelines can be used to accelerate convolutional layers in machine learning technology such as convolutional neural networks. Such pipelines can, for example, be used for feature extraction in convolutional neural networks.
While the principal advantages and features of the present invention have been briefly explained above, a more thorough understanding of the invention may be attained by referring to the drawings and description of the preferred embodiment which follow.
As shown in
The re-configurable logic device 21 interfaces with the system or input/output bus 34 and, in one configuration, also interfaces with any disk caches 30 which may be present. It receives and processes search requests or inquires from the CPU 32 or network interface 36. Additionally, the device may aid in passing the results of the inquiries to either or both the disk cache 30 and/or the CPU 32 (by way of the bus 34).
The mass storage medium 26 provides the medium for storing large amounts of information which will hereafter be referred to as target data. The term “mass storage medium” should be understood as meaning any device used to store large amounts of data, and which is typically designated for use in a computer or computer network. Examples include without limitation hard disk drives, optical storage media, or sub-units such as a single disk surface, and these systems may be rotating, linear, serial, parallel, or various combinations of each. For example, a rack of hard disk drive units could be connected in parallel and their parallel output provided at the transducer level to one or more re-configurable logic devices 21. Similarly, a bank of magnetic tape drives could be used, and their serial outputs each provided in parallel to one or more re-configurable logic devices 21. The data stored on the medium may be in analog or in digital form. For example, the data could be voice recordings. The invention is thus scalable, permitting an increase in the amount of data stored by increasing the number of parallel mass storage media, while preserving the performance by increasing the number of parallel re-configurable logic devices or replicating the re-configurable logic device.
In the prior art as shown in the upper portion of
As has been explained above, the invention may be used to perform a variety of different types of matching or data reduction operations on the target data. Each one of these operations will now be discussed in detail below. For all operations, however, it will be assumed that the target data is written onto the magnetic mass storage medium 26 with sufficient formatting information attached so that the logical structure of the target data can be extracted. Exact and approximate string matching will be described with reference to
More particularly, a conventional rigid disk drive may have a plurality of rotating disks with multiple transducers accessing each disk. Each of these transducers typically has its output feeding analog signal circuitry 18, such as amplifiers. This is represented at point A. As further shown in
The results may be sent to a control microprocessor 22, which may or may not be configured as part of an FPGA, to execute logic associated with a compound or complex search inquiry. In the most general case, a compound search inquiry 40 will go through the transformation process illustrated in
While the path shown in
One embodiment of such a hardware template 29 is illustrated in
One embodiment of a hardware template for conducting approximate matching is illustrated in
The actual configuration of the hardware template will of course vary with the search inquiry type. By providing a small amount of flexibility in the hardware templates (e.g., the target data stored in the compare registers, the routing of signals from the data shift registers and compare register elements to the cells of the fine-grained comparison logic device, and the width of the word-level comparison logic), such a template can support a wide range of word matches. As a result, this diminishes the frequency with which the full search inquiry transformation represented in
It should be noted that the data entries identified in an “approximate” match search will include the “exact” hits that would result from an “exact” search. For clarity, when the word “match” is used, it should be understood that it includes a search or a data result found through either of an approximate search or an exact search. When the phrase “approximate match” or even just “approximate” is used, it should be understood that it could be either of the two searches described above as approximate searches, or for that matter any other kind of “fuzzy” search that has a big enough net to gather target data that are loosely related to the search inquiry or in particular, data key. Of course, an exact match is just that, and does not include any result other than an exact match of the search inquiry with a high degree of correlation.
Also shown in
As shown in
As shown in
As shown in
The configurations as exemplified by those shown in
As shown in
Referring back to
At this point, depending upon the particular methodology desired to be implemented in the particular embodiment of the invention, it would be necessary that an analog or digital data key is determined. This data key, which can be either exact or approximate for a text search, corresponds to the data being searched for. For an analog data key, it may either be pre-stored such as in the mass storage medium, developed using dedicated circuitry, or required to be generated. Should the analog data key be pre-stored, a send pre-stored data key step 68 would be performed by the microprocessor 22 (see
Next, after the mass storage medium 26 reaches its starting location as at 79, the target data stored on the mass storage medium is continuously read as at step 78 to generate a continuous stream signal representative of the target data. Should an analog data key have been used, this analog data key may then be correlated with an analog read of the target data from the mass storage medium 26 as at step 80.
While the inventors contemplate that any of many prior art comparators and correlation circuitry could be used, for present purposes the inventors suggest that a digital sampling of the analog signal and data key could be quite useful for performing such comparison and calculating the correlation coefficient, as explained below. It is noted that this analog signal generated from reading the target data from mass storage medium 26 may be conveniently generated by devices in the prior art from the reading of either analog or digital data, it not being necessary that a digital data key be used to match digital target data as stored in mass storage medium 26. Alternatively, a correlation step 82 may be performed by matching the digital data key with a stream of digital target data as read from the mass storage medium 26. It should be noted that the data key may reflect the inclusion of approximate information or the re-configurable logic device 21 may be programmed to allow for same. Thus, correlating this with target data read from the mass storage medium enables approximate matching capabilities.
Referring back to
The inventors herein have preliminarily tested the present invention in the analog domain and have generated preliminary data demonstrate its operability and effectiveness. In particular,
A prior example of a reading, comparison, and coefficient calculation method and apparatus may be found in one or more of one of the co-inventor's prior patents, such as U.S. Pat. No. 5,740,244, the disclosure of which is incorporated herein by reference. The foregoing represent examples of devices and methods which may be used to implement the present invention, however, as mentioned elsewhere herein, other similar devices and methods may be likewise used and the purposes of the invention fulfilled.
As shown in
As previously mentioned, the invention is also capable of performing sequence matching searches. With reference to
The values for di,j are computed by the re-configurable logic device 20 using the fact that di,j is only a function of the following characters: (1) pi, (2) tj, (3) di−1,j−1, (4) di−1,j, and (5) dij−1. This is illustrated in
di,j=max[dij−1+A;di−1j+A;di−1,j−1+Bi,j],
where A is a constant and Bi,j is a tabular function of pi and tj. The form of the function, however, can be quite arbitrary. In the biological literature, B is referred to as the scoring function. In the popular database searching program BLAST, scores are only a function of whether or not pi=tj. In other contexts, such as for amino acid sequences, the value of B is dependent upon the specific characters in p and t.
The operation of the array of
The sequence matching operation will now be described with reference to
key=axbacs
target data=pqraxabcstvq
A=1
B=2, if i=j
B=−2 if i=j
From these variables, the table of
A portion of the synthesis arrays representing the values present in
Many matching applications operate on data representing a two dimensional entity, such as an image.
Loading of the target image into the array 120 is explained using
Although for simplicity purposes the individual bi-directional links 126 and 128 are shown simply in
One embodiment for the individual cells of array 120 is illustrated in
Another embodiment for the individual cells of array 120 of
The operation performed within the compare logic block can be any function that provides a judgment as to whether or not there are significant differences between the target image and the image key. An example includes cross-correlations across the entire image or sub-regions of the image as described in John C. Russ, The Image Processing Handbook, 3rd edition, CRC Press 1999, which is incorporated herein by reference.
The invention is also capable of performing data reduction searching. Such searching involves matching as previously described herein, but includes summarizing the matched data in some aggregate form. For example, in the financial industry, one might want to search financial information to identify a minimum, maximum, and latest price of a stock. A re-configurable logic device for computing such aggregate data reductions is illustrated as 100 in
While data reduction searching has been described with respect to the very simple financial example shown in
The ability to perform data reduction searching at disk rotational speeds cannot be under-estimated. One of the most valuable aspects of information is its timeliness. People are growing to expect things at Internet speed. Companies that can quickly compute aggregate data reductions will clearly have a competitive advantage over those that cannot.
Additionally, data processing operations other than searching and reduction may also be implemented on the re-configurable logic device 21. As mentioned above, these operations are referred to herein as data manipulation operations. Examples of data manipulation operations or suboperations thereof that can be performed on a PLD 20 include encryption, decryption, compression, and decompression operations. The preferred PLD 20 is an FPGA, which may take the form of any suitable FPGA from a variety of manufacturers (e.g., an Altera FPGA, a Xilinx FPGA, etc.). Further, still, any of these additional operations can be combined with searching and/or reduction operations in virtually any manner to form a multi-stage data processing pipeline that provides additional speed, flexibility, and security. The complexity of each operation is also virtually limitless, bounded only by the resources of the re-configurable logic device 21 and the performance requirements of a practitioner of the invention. Each processing operation can be implemented in a single stage or in multiple stages, as may be necessary.
This exemplary pipeline 200 of
It should be noted that each stage need not necessarily be implemented on a PLD 20 within the re-configurable logic device 21. For example, some stages may be implemented in software on a processor (not shown) or dedicated hardware (not shown) accessible to the PLD 20. The exact design of each stage and the decision to implement each stage on a PLD 20, in software, or in dedicated hardware such as an ASIC, will be dependent upon the associated cost, performance, and resources constraints applicable to each practitioner's plans. However, by employing pipelining entirely within a PLD 20 such as an FPGA, the processing throughput can be greatly increased. Thus, for a balanced pipeline (i.e., a pipeline where each stage has the same execution time) having no feedback paths, the increase in data throughput is directly proportional to the number of stages. Assuming no other bottlenecks, as mentioned above, then with N stages, one can expect a throughput increase of N. However, it should be noted that the multi-stage pipeline may also utilize feedback between stages, which may be desirable for certain operations (e.g., some encryption operations) to reduce implementation cost or increase efficiency.
Advanced encryption/decryption algorithms require a complex set of calculations. Depending on the particular algorithm employed, performing encryption/decryption at disk speed requires that one employ advanced techniques to keep up with the streaming data arriving at the encryption/decryption engine. The PLD-based architecture of the present invention supports the implementation of not only relatively simple encryption/decryption algorithms, but also complex ones. Virtually any known encryption/decryption technique can be used in the practice of the present invention, including but not limited to DES, Triple DES, AES, etc. See Chodowiec et al., “Fast Implementations of Secret-Key Block Ciphers Using Mixed Inter- and Outer-Round Pipelining”, Proceedings of International Symposium on FPGAs, pp. 94-102 (February 2001); FIPS 46-2, “Data Encryption Standard”, revised version issued as FIPS 46-3, National Institute of Standards and Technology (1999); ANSI x9.52-1998, “Triple Data Encryption Algorithm Modes of Operation”, American National Standards Institute (1998); FIPS 197, “Advanced Encryption Standard”, National Institute of Standards and Technology (2001), the entire disclosures of all of which are incorporated herein by reference.
The throughput of the encryption engine shown in
In many situations, data is retained in a data warehouse, as shown in
If the data owner wishes to communicate all or a portion of its stored encrypted data from the data warehouse to Party C via a network such as the Internet, that data can be protected during delivery over the network via another form of encryption (e.g., different algorithm(s) and/or different decryption key(s)). The data owner can then provide Party C with the appropriate algorithm(s) and/or key(s) to decrypt the data. In this manner, the data owner and the authorized third party are the only two parties who have access to the decrypted (plain text) data. However, the authorized third party will not be able to decrypt the data owner's data that is still stored in the data warehouse because that data will possess a different mode of encryption than the data received.
Conventionally, the computations required to perform encryption/decryption in data warehousing scenarios are performed in software on computers owned and under the direct control of the data warehouser. In such a situation, as shown in
To improve upon this security shortcoming, the present invention can be used to implement encryption and decryption on re-configurable logic device 21 (preferably within a PLD 20) over which only the data owner has control, as shown in
To support normal read/write access to the mass storage medium 26, the FPGA is preferably configured as a PCI-X to PCI-X bridge that links the PCI-X connector 3916 with the internal PCI-X bus 3910. These bridging operations are performed within firmware socket 3908, the functionality of which is known in the art. Communication pathways other than PCI-X may be used, including but not limited to PCI-Express, PCI, Infiniband, and IP.
To support the encryption/decryption functionality, data streaming into the board 3900 from the mass storage medium 26 is fed into the decryption engine 3904. The plain text output of the decryption engine 3904 can be stored in on-board memory 3906 (
During the time that the plain text is resident in the on-board memory 3906 or in the internal FPGA memory, this plain text data is not accessible to a processor accessing motherboard bus 34 because there is no direct connection between memory 3906 or internal FPGA memory and the PCI-X connector 3916. Accordingly, memory 3906 and the internal FPGA memory are not in the address space of such a processor, meaning, by derivation, that memory 3906 and the internal FPGA memory are not accessible by any malware that may be present on that processor.
Moreover, it should be noted that the embodiments of
As discussed above, compression and decompression are also valuable operations that can be performed in a PLD in accordance with the techniques of the present invention. It is common to compress data prior to storage in a mass storage medium 26 (thereby conserving storage space), and then decompress that data when reading it from the mass storage medium for use by a processor. These conventional compression and decompression operations are typically performed in software. A compression technique that is prevalently used is the well-known Lempel-Ziv (LZ) compression. See Ziv et al., “A Universal Algorithm for Sequential Data Compression”, IEEE Trans. Inform. Theory, IT-23(3): 337-343 (1977); Ziv et al., “Compression of Individual Sequence via Variable Rate Coding”, IEEE Trans. Inform. Theory, IT-24: 530-536 (1978), the entire disclosures of both of which are incorporated by reference herein. Furthermore, the PLD-based architecture of the present invention supports the deployment of not only LZ compression but also other compression techniques. See Jung et al., “Efficient VLSI for Lempel-Ziv Compression in Wireless Data Communication Networks”, IEEE Trans. on VLSI Systems, 6(3): 475-483 (September 1998); Ranganathan et al., “High-speed VLSI design for Lempel-Ziv-based data compression”, IEEE Trans. Circuits Syst., 40: 96-106 (February 1993); Pirsch et al, “VLSI Architectures for Video Compression—A Survey”, Proceedings of the IEEE, 83(2): 220-246 (February 1995), the entire disclosures of all of which are incorporated herein by reference. Examples of compression techniques other than LZ compression that can be deployed with the present invention include, but are not limited to, various lossless compression types such as Huffman encoding, dictionary techniques, and arithmetic compression, and various known lossy compression techniques.
To improve the speed at which compressed data can be searched, it will be valuable to also import the decompression operation onto the PLD 20 that performs the searching, thereby providing the decompression with the same speed advantages as the PLD-based search operation.
Furthermore, the inventors disclose that the multi-functional pipelines disclosed herein, where data processing engines within the pipeline can be selectively enabled and disabled to alter the pipeline's aggregated functionality, can also be used to accelerate machine-learning operations (such as deep learning). For example, convolutional deep learning involves a series of processing operations that are performed on data to learn how input data should be classified. Convolutional neural networks (CNNs) serve as an example of convolutional deep learning (see, e.g., Krishevsky, et al., “ImageNet Classification with Deep Convolutional Neural Networks”, published in Pereira et al. (ed), Advances in Neural Information Processing Systems 25, pages 1097-1105, Curran Associates, Inc. 2012 (NIPS 2012), the entire disclosure of which is incorporated herein by reference).
Among the processing operations that are performed by CNNs are convolutions. Convolutions, like the correlation processing described above, are sliding window computations. In fact, convolutions and correlations are virtually identical mathematically as discussed below. Importantly, in terms of deployment in computer logic such as hardware logic on a reconfigurable logic device, the same correlation logic that performs the sliding window computations to support correlation can also be used for the sliding window computations that support convolution, as shown by
While the examples of
It should further be understood that in instances where B is symmetrical, correlation of A with B will produce the same results as convolution of A with B. An example of this is demonstrated in
Thus, because correlation and convolution leverage the same underlying logic, the inventors note that convolution processing as would be needed for CNNs is also highly amenable to pipeline deployment using the techniques described herein.
CNNs are a type of supervised learning, and CNNs may employ a training path that operates on training data and a trained feed forward processing path that operates on input data to perform classification/recognition. The feed forward processing path performs feature extraction on the input data followed by classification performed on the extracted features. For example, the input data may take the form of an image, and the feature extraction will operate to compute data representative of various image features such as corners, edges, etc. Thus, the image can be represented by a feature vector or feature map that serves to describe the image in terms of such features. The feature extraction may employ several convolutional layers in series as well as optional sub-sampling layers. Examples of sub-sampling that may be employed in CNNs include max pooling, averaging, and sampling.
While
The convolution logic stage 5402 can include the correlation logic circuit 5104 as shown by
As indicated above, the data reduction logic stage 5404 can be configured to receive an input and perform an aggregated summarization on the input to generate an output. Thus, by way of example, a data reduction logic stage 5404 can be configured to summarize the output of a convolution logic stage 5402 in an aggregated manner. Examples of data reduction operations than can be used in CNN applications include max pooling, averaging, and sampling.
As noted, other data reduction operations can be performed by data reduction logic stage 5404—such as sampling. With a sampling circuit, selection logic can be included to select which samples of the values within sliding window 5510 would be selected for inclusion in the output.
Due to the pipelining of stages within pipeline 200, a high throughput and reduced processing latency can be achieved for the convolutional layers because all of the enabled/activated convolution logic stages 5402 and data reduction logic stages 5404 can operate simultaneously. Thus, assuming all stages are enabled/activated, convolution logic stage 5402c can be operating on the output of data reduction logic stage 5404b while data reduction logic stage is operating on the output of convolution logic stage 5402b and so on. Given that the convolution layers are typically the performance bottlenecks in CNNs, this pipelining can yield significant improvements in performance for CNNs. However, as noted above, it is often desirable to tailor the specific layout of the convolutional layers differently depending on how the CNN is being used. For example, it may be desirable to enable/activate and disable/deactivate different mixes of stages within the convolutional layers based on whether the deep-learning pipeline is operating in a training mode (e.g., a learning or data discovery mode for a deep-learning classifier) or a testing/scoring/classification mode (e.g., classifying new input data in real-time based on the training of the classifier). It may also be desirable to tailor the layout of the convolutional layers to achieve a desired target for latency, throughput, and/or power consumption. To provide this flexibility for pipeline 200 while avoiding a need to reconfigure the reconfigurable logic device 21, selective enabling and disabling of the pipelined stages within pipeline 200 can be employed as discussed below.
By selectively enabling/activating and disabling/deactivating various stages within pipeline 200, a practitioner can configure the pipeline 200 to implement a series of convolutional layers 5350 in a CNN such that the convolutional layers operate in a desired manner with a desired performance characteristic. Moreover, because the disabled processing stages remain instantiated within the pipeline 200, the practitioner can tailor the pipeline's operation without needing to reconfigure the reconfigurable logic 21, thereby achieving a significant performance benefit. To enable a disabled stage, a control signal can be sent to the pipeline 200 to effectively turn that stage back “on” without needing to re-load a new hardware template onto the reconfigurable logic 21, thereby saving time. Thus, a practitioner can design the hardware template for pipeline 200 such that the pipeline 200 includes a sufficient number of convolutional logic stages 5402 and data reduction logic stages 5404 to achieve a desired performance characteristic if all stages are enabled/activated. Then, should the practitioner desire to use less than all of the available stages, control signals can be used to disable/deactivate the stages not needed for a given run of the CNN.
The same pipeline 200 of
Thus, it should be appreciated that the hardware-accelerated multi-functional pipeline 200 shown by
A data path for the stage includes a selector circuit 5808 (e.g., a demultiplexer) that receives input data 5806. In the case of a convolution logic stage 5402, this input data could be the values for A and B. In the case of a data reduction logic stage 5404, this input data could be the values for C. The selector circuit 5808 routes the input data 5806 to one of its outputs based on the output of comparator 5802. Thus, if comparator 5802 determines that the control signal 5800 includes an “on” (enable) instruction for this processing stage, the selector circuit 5808 can pass the input data 5806 to the stage logic 5104/5502/5600 so that appropriate convolution/data reduction can be performed on the input data. This would correspond to operation in a “live” activated mode because the stage logic would operate on the input data to produce a convolved output or summarized output. If the stage is a convolution logic stage 5402, the stage logic can take the form of correlation logic circuit 5104—an example of which is shown by
If comparator 5802 determines that the control signal 5800 includes an “off” (disable) instruction for this processing stage, the selector circuit 5808 can pass the input data 5806 to the pass through path 5810 where no processing is performed on the input data. Accordingly, when the stage is turned “off” by a disable control signal, the stage 5402/5404 simply passes its input data 5806 to the output as output data 5814. The circuit can also be configured to remove power from the stage logic (5104/5502/5600) in the event of being turned “off” to thereby reduce the power consumption by the disabled stage 5402/5404.
Selector circuit 5812 (e.g., a multiplexer) is positioned to receive the pass through path 5810 and the output of stage logic 5104/5502/5600 as inputs. Selector circuit 5812 passes one of these inputs as output data 5814 based on the output of comparator 5802. Thus, if comparator 5802 determines that the control signal 5800 includes an “on” (enable) instruction for this processing stage, the selector circuit 5812 passes the output from stage logic 5104/5502/5600 as the output data 5814. If comparator 5802 determines that the control signal 5800 includes an “off” (disable) instruction for this processing stage, the selector circuit 5812 passes the input data 5806 in pass through path 5810 as the output data 5814.
It should be understood that
Also, to provide still more flexibility, a data reduction logic stage 5404 can be deployed in a manner where a control signal can be used to control whether the data reduction logic stage 5404 operates in any of a number of modes, such as a max pooling operating mode, an averaging operating mode, or a sampling operating mode.
Also, to allow for flexibility in terms of operating parameters, the logic circuits for stages 5402 and 5404 can be designed to accommodate a number of different sizes for B and for the sliding windows.
For example, for convolution logic stage 5402, register 5102 can be sized to accommodate the largest expected size for B. As part of this, the size of sliding window 5106 and number of multiplier logic units 5108 would be commensurately adjusted such that there is a multiplier 5108 for each pair of cells in data shift register 5100 and register 5102. If during operation the size of B is less than the maximum size possible for B, padding zeros can be added around B to fill out the register 5102 while not influencing the output (due to multiplications with zero producing a zero product).
As another example, for a data reduction logic stage 5404 that performs max pooling, the maximum detection logic 5502 can include a number of maximum detectors 5504, 5506, . . . sufficient to perform maximum detection across the largest possible size for window 5510. Masking can then be used to control which of the cells in window 5510 are passed to the maximum detectors 5504, 5506, . . . . For example, a control signal for stage 5404 can include a mask pattern that defines a size for the sliding window (e.g., where bits in the mask pattern are 0 for cell positions that fall outside window 5510 and 1 for cell positions that fall inside window 5510, and the max logic is designed to respect and propagate the mask information).
As still another example, for a data reduction logic stage 5404 that performs averaging, the summation logic 5502 can include can be configured to receive inputs from cells in shift register 5500 sufficient to accommodate the largest possible size for window 5510. Masking can then be used to control which of the cells in window 5510 are passed to the summation logic 5602. For example, a control signal for stage 5404 can include a mask pattern that defines a size for the sliding window (e.g., where bits in the mask pattern are zero for cell positions that are fall outside window 5510 and one for cell positions that fall inside window 5510. This mask pattern can be ANDed with the values of cells within the maximum window size to produce the values that are provided to summation logic 5602.
The inventors further note that while
Thus, it can be seen that the examples of
Also, while the examples of
Furthermore, while the examples of
Also, it should be understood that the machine-learning pipeline, whether implementing CNNs or other machine-learning techniques, can include other processing stages in the pipeline 200 if desired by a practitioner. For example, if the source data being subjected to machine-learning operations is encrypted, a practitioner may want to deploy a decryption engine in the pipeline 200 upstream from the convolutional layers or other machine-learning specific stages. As another example, it may be desirable to deploy a decompression engine in the pipeline 200 upstream from the convolutional layers or other machine-learning specific stages (e.g., in instances where the input data is a compressed stream such as a compressed video stream).
To configure FPGA 20 with the functionality of the present invention, the flowchart of
As mentioned above, templates 4308 for different processing functionalities desired for the system can be pre-generated and stored for selective implementation on the FPGA. For example, templates for different types of compression/decompression, different types of encryption/decryption, different types of search operations, different types of data reduction operations, or different combinations of the foregoing can be pre-generated and stored by a computer system for subsequent loading into the FPGA 20 when that functionality is needed.
Further still, performance characteristics such as throughout and consumed chip resources can be pre-determined and associated with each processing operation. Using these associated parameters, an algorithm can be used to intelligently select which template is optimal for a particular desired functionality.
For example, such an algorithm could provide guidance as to which of the encryption engines of
The values for each of these parameters are readily known or can be readily measured, as known in the art. If R=IL for an integer I, the iterations for the encryption/decryption have been evenly unrolled. If this is not the case, later pipeline stages must have a pass-through capability, as the final result would be computed inside the pipeline rather than at the end.
The throughput of a pipelined cipher engine is given by the following expression:
The chip resources for an FPGA are typically measured in CLBs or slices, as is well-known. With re-configurable logic other than FPGAs, the resources might be measured in other units (e.g., chip area). In either event, the resources required will be linear in the number of rounds supported in parallel. Hence, the chip resources required for the engine is as follows:
Resources=A0+LAR(p)
The values for the parameters Throughput and Resources can be determined in advance for each stored processing operation (or function fi) that may be implemented in a stage of a pipeline. Accordingly, a table can be created that relates each processing operation or function with its corresponding values for Throughput and Resources.
Accordingly, the specific template (which defines one or more different processing operations) to be deployed on a PLD can be tailored to the particular query or command issued. An algorithm that balances Throughput and Resources in a manner desired by a practitioner of the present invention can be created to decide which candidate template is best-suited for an application. Thus, a control processor 32 can compute the overall throughput and resources for a set of functions as follows. The throughput for a set of functions is the minimum throughput for each of the functions:
Throughput=Min(ThroughputF1,ThroughputF2, . . . ,ThroughputFn)
The resources required to deploy a set of functions is the sum of the resources required for each of the functions:
Resources=ResourcesF1+ResourcesF2+ . . . +ResourcesFn
Given several options for each function, the control processor can then solve an optimization problem (or if desired a “near optimization” problem). The optimization can be to deploy the set of options for each function that maximizes the overall throughput under the constraint that the required resources be less than or equal to the available resources on the re-configurable logic, or the optimization can be to deploy the set of options for each function that minimizes the required resources under the constraint the that overall throughput not fall below some specified minimum threshold. Techniques for solving such optimization problems or near optimization problems are well known in the art. Examples of such techniques include, but are not limited to complete enumeration, bounded search, genetic algorithms, greedy algorithms, simulated annealing, etc.
The use of the inventive system to process data streaming from a mass storage medium such as a disk drive system is a powerful technique for processing stored data at high speeds. Very large databases, however, typically span many disk cylinders. Accordingly, delays may be encountered when database files are written on tracks that have been placed on non-contiguous disk cylinders. These delays are associated with having to move the disk read/write head from its current position over a data cylinder to a new data cylinder where the file to be read from the disk continues. These delays increase as the distance that the head must travel increases. Therefore, for reading data that spans multiple data cylinders on the disk, the flow of the data stream from the disk will be interrupted as the head moves from cylinder to cylinder. With today's disk drives, these delays may be in the millisecond range. Thus, these head movement delays (known in the art as “seek” times) represent a potential performance bottleneck.
With standard contemporary disk systems, tracks 4400 are laid out on the disk or sets of disk platters as cylinders 4402 that are concentric around central origin 4406, as shown in
Disk drives typically utilize a direct overwrite approach, so accurate radial placement of the head 4404 over the medium 4450 is critical for sustained error free use. In general, each circular track 4400i is divided into about 150 roughly equal contiguous arcs.
These arcs 4460 contain several data sets 4464 (logical blocks and physical sectors) that can be altered (rewritten). Additionally, these arcs 4460 contain unalterable (fixed) magnetically written markings 4466 (such as ABCD servo bursts) that are used as a guide to place the head 4404 over the data regions so that the signal strength from the magnetic recording is maximized.
Having separate cylinders 4402 requires the movement of the disk head 4404 when going between cylinders 4402. To move between cylinders 4402, the positioning system 4474 must appropriately move heads 4404 along line 4476, typically in increments of T. As one moves from inner cylinders to outer cylinders, the circumference of the written track increases. For example, with reference to
To write data spanning one or more tracks 4400, the head 4404 must be repositioned by the positioning system 4474 to another radius by at least the center-to-center distance of adjacent tracks 4400. This motion requires mechanical settling time (repositioning of the head 4404) and resynchronization time of the head 4404 to the cylinder 4402 (in time, downtrack). When moving the head a relatively long distance such as T, this settling time is significant. Together, these times may take, on average, half the revolution of the cylinder 4402, which is typically several milliseconds when moving from cylinder to cylinder. As mentioned above, this time duration is often referred to as the “seek” time, and it can be a major performance bottleneck. Due to this bottleneck, data write/read bursts are generally limited to single tracks or cylinders.
According to a novel and unique feature of the preferred embodiment, a technique is used to reposition the head 4404 to accommodate tracks laid out as discontiguous arcs. In a preferred embodiment, these discontiguous arcs are discontiguous circular arcs arranged in a generally helical tracking pattern on the disk 4450, and the head positioning system uses servo patterns, such as ABCD servo bursts, already present in conventional systems to appropriately position the head. This technique can provide for written bursts in excess of a track and up to an entire zone, wherein a single zone may encompass the entire disk. While other servo patterns are possible, and are not excluded from the scope of this feature of the invention, an example will be given using the conventional ABCD system for servo patterns.
In contrast to conventional head motion where the goal of the servo system is to position the head 4404 on a single radius to provide a circular track 4400, this novel and unique positioning method, as shown in
With reference to
As shown in
It should be noted that each radius Ri can have its own W value. In such cases, the discontiguous arcs 4500 may have different circumferences and may span multiple angles from the origin.
Each discontiguous arc 4500 will include an ABCD servo pattern thereon like that shown in
As part of this process, consider an example where the read/write head 4404 is initially placed at position d0 relative to central origin 4406 for the disk of
wherein T is the conventional track-to-track (or cylinder-to-cylinder) distance. In one full revolution, the head 4404 will have radially moved exactly one full track-to-track distance T. When r reaches 2, the head 4404 will have radially moved exactly 2T.
This feature of the invention allows for the seamless and continuous operation of the head in read or write mode over an entire zone, thus permitting the reading or writing of an entire disk without incurring the delays associated with normal seek times. Thus, when used in combination with the searching and processing techniques described above, a searching/processing system can operate more efficiently, without being stalled by seek time delays. However, it is worth noting that this feature of the invention need not be used in combination with the searching/processing techniques described above. That is, this technique of using a helical pattern to read and write data to and from magnetic data storage disks can be used independently of the above-described searching and processing features.
Another performance bottleneck occurs when a disk upon which data is stored becomes fragmented. In general file systems, the files are divided into number of fixed size segments (blocks) and these segments are stored on the disk. If the file is very long, the segments might be stored at various locations on the disk. As noted above, to access such a file the disk head has to move from cylinder to cylinder slowing down the file access. It would be better if the entire file is stored as a single object, in a single cylinder or immediately adjacent cylinders. However, this might not always be possible because of the fragmentation of the disk over time. The defragmentation of the disk usually involves moving all the files to one end of the disk so that the new files can be allocated contiguously on the other free end. Typically, such a defragmentation takes a long time. Many attempts have been made in the prior art to solve this problem. One well-known technique is known as the binary buddy system. With the binary buddy system, every request size for disk space is rounded to the next power of 2. Thus, for a 2000 byte file, an allocation request of 2048 (211) is made. This process leads to internal fragmentation.
In an effort to minimize these problems, disclosed herein is a technique where a file is divided into one or more segments, wherein each segment is a power of 2. Thus, each file that is not sized as an even power of 2 is represented as the sum of a series of power of 2 segments.
In an embodiment wherein a minimum segment size is not set, this technique for segmenting a file into blocks of memory comprises: (1) if the file size is an even power of 2, requesting a block of storage space on the storage medium equal to the file size, (2) if the file size is not an even power of 2, requesting a plurality of blocks of storage space on the storage medium, each block having a size that is equal to a power of 2, and (3) if the request is accepted, storing the data file in a storage medium such as on a disk or in memory as one or more data file segments in accordance with the request. In a preferred version of this technique, the file size F can be thought of in binary terms as F equals Fk . . . F2 F1. When the file size is not an even power of 2, requesting blocks in storage comprises requesting a total number n of blocks B1, . . . , Bn equal to a total number of bits in F equal to 1, each block Bi corresponding to a different bit Fi in F equal to 1 and having a size of 2′.
To avoid generating overly small segments, it is preferred that a minimum segment size 2m be used. For example, the minimum segment size can be 512 bytes (29) (thus m is 2). With this technique, when a minimum segment size is used, dividing a file into a sum of powers of 2 size will result in the smallest segment being at least equal to the minimum segment size. Accordingly, (1) if the file size is an even power of 2 and greater than or equal to 2m, then a block of storage space is requested such that the block is equal to the file size, (2) if the file size is less than 2m, then a block of storage space is requested such that the block is equal to 2m, and (3) if the file size is not an even power of 2 and greater than 2m, then a plurality of blocks of storage space on the storage medium are requested, each block having a size that is equal to a power of 2 and equal to or greater than 2m.
As would be understood by those of ordinary skill in the art upon reviewing the teachings herein, program logic to implement such a sum of powers of 2 file system, with either a minimum segment size or without, can be readily developed.
With a sum of powers of 2 file system, the internal fragmentation is equal to conventional (usual) file systems, which divide a file into segments of equal size, with the same minimum segment size.
As such, the sum of powers of 2 file system is a good trade off between the buddy system (where there is a lot of internal fragmentation) and the usual file system (where there is less internal fragmentation but potentially poor contiguity).
As a further refinement, it is preferred that a defragmentation algorithm be used with the sum of powers of 2 file system to more greatly ensure contiguous space on the disk for an allocation request. If a contiguous allocation cannot be satisfied, the defragmentation algorithm tries to free space so as to satisfy the allocation request. This defragmentation algorithm does not defragment the entire disk. Instead, it incrementally defragments a portion of the disk to enable the new allocation request to be satisfied in an incremental manner. A preferred defragmentation algorithm for use with the sum of powers of 2 file system is disclosed on pages 26-30 of the paper Cholleti, Sharath, “Storage Allocation in Bounded Time”, MS Thesis, Dept. of Computer Science and Engineering, Washington University, St. Louis, Mo. (December 2002), available as Washington University technical report WUCSE-2003-2, the entire disclosure of which is incorporated herein by reference.
Pseudo code for the preferred partial defragmentation algorithm, referred to herein as a “heap manager partial defragmentation algorithm” is reproduced below:
Various changes and modifications to the present invention would be apparent to those skilled in the art but yet which would not depart from the spirit of the invention. The preferred embodiment describes an implementation of the invention but this description is intended to be merely illustrative. Several alternatives have been also been above. For example, all of the operations exemplified by the analog processing have their equivalent counterparts in the digital domain. Thus, approximate matching and correlation types of processing can be done on the standard digital representation of the analog bit patterns. This can also be achieved in a continuous fashion using tailored digital logic, microprocessors and digital signal processors, or alternative combinations. It is therefore the inventors' intention that the present invention be limited solely by the scope of the claims appended hereto, and their legal equivalents.
This application is a divisional of U.S. patent application Ser. No. 15/388,498, filed Dec. 22, 2016, entitled “System and Method for Low Latency Multi-Functional Pipeline with Correlation Logic and Selectively Activated/Deactivated Pipelined Processing Engines”, now U.S. Pat. No. 10,572,824, the entire disclosure of which is incorporated herein by reference. This application is also related to U.S. patent application Ser. No. 14/929,791, filed Nov. 2, 2015, entitled “Intelligent Data Storage and Processing Using FPGA Devices”, now U.S. Pat. No. 9,898,312, which is a continuation of patent application Ser. No. 14/315,560, filed Jun. 26, 2014, entitled “Intelligent Data Storage and Processing Using FPGA Devices”, now U.S. Pat. No. 9,176,775, which is a continuation of patent application Ser. No. 13/344,986, filed Jan. 6, 2012, entitled “Intelligent Data Storage and Processing Using FPGA Devices”, now U.S. Pat. No. 8,768,888, which is a continuation of patent application Ser. No. 10/550,323, entitled “Intelligent Data Storage and Processing Using FPGA Devices”, now U.S. Pat. No. 8,095,508, which is a national stage entry of PCT patent application PCT/US04/16398, entitled “Intelligent Data Storage and Processing Using FPGA Devices”, filed May 21, 2004, which claims the benefit of provisional patent application Ser. No. 60/473,077 entitled “Intelligent Data Storage and Processing”, filed May 23, 2003, the entire disclosures of each of which are incorporated herein by reference. This application is also related to patent application Ser. No. 13/165,155 and patent application Ser. No. 10/550,326, both entitled “Intelligent Data Storage and Processing Using FPGA Devices”, where the Ser. No. 13/165,155 patent application is a divisional of the Ser. No. 10/550,326 patent application and where the Ser. No. 10/550,326 patent application is a national stage entry of PCT patent application PCT/US04/16021, entitled “Intelligent Data Storage and Processing Using FPGA Devices”, filed May 21, 2004, which claims the benefit of provisional patent application Ser. No. 60/473,077 entitled “Intelligent Data Storage and Processing”, filed May 23, 2003. This application is also related to patent application Ser. No. 10/153,151 entitled “Associative Database Scanning and Information Retrieval Using FPGA Devices”, filed May 21, 2002, now U.S. Pat. No. 7,139,743, which is a continuation-in-part of patent application Ser. No. 09/545,472 entitled “Associative Database Scanning and Information Retrieval”, filed Apr. 7, 2000, now U.S. Pat. No. 6,711,558, the entire disclosures of both of which are incorporated herein by reference. This patent application is also related to patent application Ser. No. 13/345,011, entitled “Intelligent Data Storage and Processing Using FPGA Devices”, filed Jan. 6, 2012, now U.S. Pat. No. 8,751,452.
| Number | Name | Date | Kind |
|---|---|---|---|
| 2046381 | Hicks et al. | Jul 1936 | A |
| 3082402 | Scantlin | Mar 1963 | A |
| 3296597 | Scantlin | Jan 1967 | A |
| 3501808 | Meier | Mar 1970 | A |
| 3573747 | Adams et al. | Apr 1971 | A |
| 3581072 | Nymeyer | May 1971 | A |
| 3601808 | Vlack | Aug 1971 | A |
| 3611314 | Pritchard, Jr. et al. | Oct 1971 | A |
| 3729712 | Glassman | Apr 1973 | A |
| 3824375 | Gross et al. | Jul 1974 | A |
| 3848235 | Lewis et al. | Nov 1974 | A |
| 3906455 | Houston et al. | Sep 1975 | A |
| 4081607 | Vitols et al. | Mar 1978 | A |
| 4298898 | Cardot | Nov 1981 | A |
| 4300193 | Bradley et al. | Nov 1981 | A |
| 4314356 | Scarbrough | Feb 1982 | A |
| 4385393 | Chaure et al. | May 1983 | A |
| 4412287 | Braddock, II | Oct 1983 | A |
| 4464718 | Dixon | Aug 1984 | A |
| 4550436 | Freeman et al. | Oct 1985 | A |
| 4674044 | Kalmus et al. | Jun 1987 | A |
| 4811210 | McAulay | Mar 1989 | A |
| 4823306 | Barbic et al. | Apr 1989 | A |
| 4868866 | Williams, Jr. | Sep 1989 | A |
| 4903201 | Wagner | Feb 1990 | A |
| 4941178 | Chuang | Jul 1990 | A |
| 5023910 | Thomson | Jun 1991 | A |
| 5038284 | Kramer | Aug 1991 | A |
| 5050075 | Herman et al. | Sep 1991 | A |
| 5063507 | Lindsey et al. | Nov 1991 | A |
| 5077665 | Silverman et al. | Dec 1991 | A |
| 5101353 | Lupien et al. | Mar 1992 | A |
| 5101424 | Clayton et al. | Mar 1992 | A |
| 5126936 | Champion et al. | Jun 1992 | A |
| 5140692 | Morita | Aug 1992 | A |
| 5161103 | Kosaka et al. | Nov 1992 | A |
| 5163131 | Row et al. | Nov 1992 | A |
| 5179626 | Thomson | Jan 1993 | A |
| 5226165 | Martin | Jul 1993 | A |
| 5243655 | Wang | Sep 1993 | A |
| 5249292 | Chiappa | Sep 1993 | A |
| 5255136 | Machado et al. | Oct 1993 | A |
| 5258908 | Hartheimer et al. | Nov 1993 | A |
| 5263156 | Bowen et al. | Nov 1993 | A |
| 5265065 | Turtle | Nov 1993 | A |
| 5267148 | Kosaka et al. | Nov 1993 | A |
| 5270922 | Higgins | Dec 1993 | A |
| 5297032 | Trojan et al. | Mar 1994 | A |
| 5313560 | Maruoka et al. | May 1994 | A |
| 5315634 | Tanaka et al. | May 1994 | A |
| 5319776 | Rile et al. | Jun 1994 | A |
| 5327521 | Savic et al. | Jul 1994 | A |
| 5339411 | Heaton, Jr. | Aug 1994 | A |
| 5347634 | Herrell et al. | Sep 1994 | A |
| 5371794 | Diffie et al. | Dec 1994 | A |
| 5375055 | Togher et al. | Dec 1994 | A |
| 5388259 | Fleischman et al. | Feb 1995 | A |
| 5396253 | Chia | Mar 1995 | A |
| 5404411 | Banton et al. | Apr 1995 | A |
| 5404488 | Kerrigan et al. | Apr 1995 | A |
| 5418951 | Damashek | May 1995 | A |
| 5421028 | Swanson | May 1995 | A |
| 5432822 | Kaewell, Jr. | Jul 1995 | A |
| 5440723 | Arnold et al. | Aug 1995 | A |
| 5461712 | Chelstowski et al. | Oct 1995 | A |
| 5463701 | Kantner, Jr. et al. | Oct 1995 | A |
| 5465353 | Hull et al. | Nov 1995 | A |
| 5481735 | Mortensen et al. | Jan 1996 | A |
| 5488725 | Turtle et al. | Jan 1996 | A |
| 5497317 | Hawkins et al. | Mar 1996 | A |
| 5497488 | Akizawa et al. | Mar 1996 | A |
| 5500793 | Deming, Jr. et al. | Mar 1996 | A |
| 5517642 | Bezek et al. | May 1996 | A |
| 5544352 | Egger | Aug 1996 | A |
| 5546578 | Takada et al. | Aug 1996 | A |
| 5596569 | Madonna et al. | Jan 1997 | A |
| 5619574 | Johnson et al. | Apr 1997 | A |
| 5651125 | Witt et al. | Jul 1997 | A |
| 5680634 | Estes | Oct 1997 | A |
| 5684980 | Casselman | Nov 1997 | A |
| 5687297 | Coonan et al. | Nov 1997 | A |
| 5701464 | Aucsmith | Dec 1997 | A |
| 5704060 | Del Monte | Dec 1997 | A |
| 5712942 | Jennings et al. | Jan 1998 | A |
| 5721898 | Beardsley et al. | Feb 1998 | A |
| 5740244 | Indeck et al. | Apr 1998 | A |
| 5740466 | Geldman et al. | Apr 1998 | A |
| 5774835 | Ozawa et al. | Jun 1998 | A |
| 5774839 | Shlomot | Jun 1998 | A |
| 5781772 | Wilkinson, III et al. | Jul 1998 | A |
| 5781921 | Nichols | Jul 1998 | A |
| 5802290 | Casselman | Sep 1998 | A |
| 5805832 | Brown | Sep 1998 | A |
| 5809483 | Broka et al. | Sep 1998 | A |
| 5813000 | Furlani | Sep 1998 | A |
| 5819273 | Vora et al. | Oct 1998 | A |
| 5819290 | Fujita et al. | Oct 1998 | A |
| 5826075 | Bealkowski et al. | Oct 1998 | A |
| 5845266 | Lupien et al. | Dec 1998 | A |
| 5857176 | Ginsberg | Jan 1999 | A |
| 5864738 | Kessler et al. | Jan 1999 | A |
| 5870730 | Furuya et al. | Feb 1999 | A |
| 5873071 | Ferstenberg et al. | Feb 1999 | A |
| 5884286 | Daughtery | Mar 1999 | A |
| 5886701 | Chauvin et al. | Mar 1999 | A |
| 5905974 | Fraser et al. | May 1999 | A |
| 5913211 | Nitta | Jun 1999 | A |
| 5930753 | Potamianos et al. | Jul 1999 | A |
| 5943421 | Grabon | Aug 1999 | A |
| 5943429 | Händel | Aug 1999 | A |
| 5950006 | Crater et al. | Sep 1999 | A |
| 5963923 | Garber | Oct 1999 | A |
| 5978801 | Yuasa | Nov 1999 | A |
| 5987432 | Zusman et al. | Nov 1999 | A |
| 5991881 | Conklin et al. | Nov 1999 | A |
| 5995963 | Nanba et al. | Nov 1999 | A |
| 6006264 | Colby et al. | Dec 1999 | A |
| 6016483 | Rickard et al. | Jan 2000 | A |
| 6023755 | Casselman | Feb 2000 | A |
| 6023760 | Karttunen | Feb 2000 | A |
| 6028939 | Yin | Feb 2000 | A |
| 6044407 | Jones et al. | Mar 2000 | A |
| 6058391 | Gardner | May 2000 | A |
| 6061662 | Makivic | May 2000 | A |
| 6064739 | Davis | May 2000 | A |
| 6067569 | Khaki et al. | May 2000 | A |
| 6070172 | Lowe | May 2000 | A |
| 6073160 | Grantham et al. | Jun 2000 | A |
| 6084584 | Nahi et al. | Jul 2000 | A |
| 6105067 | Batra | Aug 2000 | A |
| 6134551 | Aucsmith | Oct 2000 | A |
| 6138176 | McDonald et al. | Oct 2000 | A |
| 6147890 | Kawana et al. | Nov 2000 | A |
| 6147976 | Shand et al. | Nov 2000 | A |
| 6169969 | Cohen | Jan 2001 | B1 |
| 6173270 | Cristofich et al. | Jan 2001 | B1 |
| 6173276 | Kant et al. | Jan 2001 | B1 |
| 6175874 | Imai et al. | Jan 2001 | B1 |
| 6178494 | Casselman | Jan 2001 | B1 |
| 6195024 | Fallon | Feb 2001 | B1 |
| 6226676 | Crump et al. | May 2001 | B1 |
| 6236980 | Reese | May 2001 | B1 |
| 6243753 | Machin et al. | Jun 2001 | B1 |
| 6263321 | Daughtery, III | Jul 2001 | B1 |
| 6272616 | Fernando et al. | Aug 2001 | B1 |
| 6279113 | Vaidya | Aug 2001 | B1 |
| 6279140 | Slane | Aug 2001 | B1 |
| 6289440 | Casselman | Sep 2001 | B1 |
| 6295530 | Ritchie et al. | Sep 2001 | B1 |
| 6304858 | Mosier et al. | Oct 2001 | B1 |
| 6307936 | Ober et al. | Oct 2001 | B1 |
| 6309424 | Fallon | Oct 2001 | B1 |
| 6317728 | Kane | Nov 2001 | B1 |
| 6317795 | Malkin et al. | Nov 2001 | B1 |
| 6321258 | Stollfus et al. | Nov 2001 | B1 |
| 6336150 | Ellis et al. | Jan 2002 | B1 |
| 6339819 | Huppenthal et al. | Jan 2002 | B1 |
| 6370592 | Kumpf | Apr 2002 | B1 |
| 6370645 | Lee et al. | Apr 2002 | B1 |
| 6377942 | Hinsley et al. | Apr 2002 | B1 |
| 6381242 | Maher, III et al. | Apr 2002 | B1 |
| 6388584 | Dorward et al. | May 2002 | B1 |
| 6389532 | Gupta et al. | May 2002 | B1 |
| 6397259 | Lincke et al. | May 2002 | B1 |
| 6397335 | Franczek et al. | May 2002 | B1 |
| 6412000 | Riddle et al. | Jun 2002 | B1 |
| 6415269 | Dinwoodie | Jul 2002 | B1 |
| 6418419 | Nieboer et al. | Jul 2002 | B1 |
| 6430272 | Maruyama et al. | Aug 2002 | B1 |
| 6456632 | Baum et al. | Sep 2002 | B1 |
| 6456982 | Pilipovic | Sep 2002 | B1 |
| 6463474 | Fuh et al. | Oct 2002 | B1 |
| 6499107 | Gleichauf et al. | Dec 2002 | B1 |
| 6535868 | Galeazzi et al. | Mar 2003 | B1 |
| 6546375 | Pang et al. | Apr 2003 | B1 |
| 6564263 | Bergman et al. | May 2003 | B1 |
| 6578147 | Shanklin et al. | Jun 2003 | B1 |
| 6581098 | Kumpf | Jun 2003 | B1 |
| 6594643 | Freeny, Jr. | Jul 2003 | B1 |
| 6597812 | Fallon et al. | Jul 2003 | B1 |
| 6601094 | Mentze et al. | Jul 2003 | B1 |
| 6601104 | Fallon | Jul 2003 | B1 |
| 6604158 | Fallon | Aug 2003 | B1 |
| 6624761 | Fallon | Sep 2003 | B2 |
| 6625150 | Yu | Sep 2003 | B1 |
| 6691301 | Bowen | Feb 2004 | B2 |
| 6704816 | Burke | Mar 2004 | B1 |
| 6711558 | Indeck et al. | Mar 2004 | B1 |
| 6760439 | Windirsch | Jul 2004 | B1 |
| 6765918 | Dixon et al. | Jul 2004 | B1 |
| 6766304 | Kemp, II et al. | Jul 2004 | B2 |
| 6772132 | Kemp, II et al. | Aug 2004 | B1 |
| 6772136 | Kant et al. | Aug 2004 | B2 |
| 6772345 | Shetty | Aug 2004 | B1 |
| 6778968 | Gulati | Aug 2004 | B1 |
| 6785677 | Fritchman | Aug 2004 | B1 |
| 6804667 | Martin | Oct 2004 | B1 |
| 6807156 | Veres et al. | Oct 2004 | B1 |
| 6820129 | Courey, Jr. | Nov 2004 | B1 |
| 6839686 | Galant | Jan 2005 | B1 |
| 6847645 | Potter et al. | Jan 2005 | B1 |
| 6850906 | Chadha | Feb 2005 | B1 |
| 6870837 | Ho et al. | Mar 2005 | B2 |
| 6870929 | Greene | Mar 2005 | B1 |
| 6877044 | Lo et al. | Apr 2005 | B2 |
| 6882747 | Thawonmas et al. | Apr 2005 | B2 |
| 6886103 | Brustoloni et al. | Apr 2005 | B1 |
| 6901461 | Bennett | May 2005 | B2 |
| 6931408 | Adams et al. | Aug 2005 | B2 |
| 6931545 | Ta et al. | Aug 2005 | B1 |
| 6941312 | Hoffman et al. | Sep 2005 | B1 |
| 6944168 | Paatela et al. | Sep 2005 | B2 |
| 6978223 | Milliken | Dec 2005 | B2 |
| 6980976 | Alpha et al. | Dec 2005 | B2 |
| 6981054 | Krishna | Dec 2005 | B1 |
| 7003488 | Dunne et al. | Feb 2006 | B2 |
| 7019674 | Cadambi et al. | Mar 2006 | B2 |
| 7024384 | Daughtery, III | Apr 2006 | B2 |
| 7046848 | Olcott | May 2006 | B1 |
| 7065475 | Brundobler | Jun 2006 | B1 |
| 7065482 | Shorey et al. | Jun 2006 | B2 |
| 7089206 | Martin | Aug 2006 | B2 |
| 7093023 | Lockwood et al. | Aug 2006 | B2 |
| 7099838 | Gastineau et al. | Aug 2006 | B1 |
| 7101188 | Summers et al. | Sep 2006 | B1 |
| 7103569 | Groveman et al. | Sep 2006 | B1 |
| 7117280 | Vasudevan | Oct 2006 | B2 |
| 7124106 | Stallaert et al. | Oct 2006 | B1 |
| 7127424 | Kemp, II et al. | Oct 2006 | B2 |
| 7127510 | Yoda et al. | Oct 2006 | B2 |
| 7130913 | Fallon | Oct 2006 | B2 |
| 7139743 | Indeck | Nov 2006 | B2 |
| 7149715 | Browne et al. | Dec 2006 | B2 |
| 7161506 | Fallon | Jan 2007 | B2 |
| 7167980 | Chiu | Jan 2007 | B2 |
| 7177833 | Marynowski et al. | Feb 2007 | B1 |
| 7181437 | Lndeck et al. | Feb 2007 | B2 |
| 7181608 | Fallon et al. | Feb 2007 | B2 |
| 7191233 | Miller | Mar 2007 | B2 |
| 7222114 | Chan et al. | May 2007 | B1 |
| 7224185 | Campbell et al. | May 2007 | B2 |
| 7225188 | Gai et al. | May 2007 | B1 |
| 7228289 | Brumfield et al. | Jun 2007 | B2 |
| 7249118 | Sandler et al. | Jul 2007 | B2 |
| 7251629 | Marynowski et al. | Jul 2007 | B1 |
| 7257842 | Barton et al. | Aug 2007 | B2 |
| 7277887 | Burrows et al. | Oct 2007 | B1 |
| 7286564 | Roberts | Oct 2007 | B2 |
| 7287037 | An et al. | Oct 2007 | B2 |
| 7305383 | Kubesh et al. | Dec 2007 | B1 |
| 7305391 | Wyschogrod et al. | Dec 2007 | B2 |
| 7321937 | Fallon | Jan 2008 | B2 |
| 7353267 | Cunningham et al. | Apr 2008 | B1 |
| 7356498 | Kaminsky et al. | Apr 2008 | B2 |
| 7362859 | Robertson et al. | Apr 2008 | B1 |
| 7363277 | Dutta et al. | Apr 2008 | B1 |
| 7376755 | Pandya | May 2008 | B2 |
| 7378992 | Fallon | May 2008 | B2 |
| 7386046 | Fallon et al. | Jun 2008 | B2 |
| 7386564 | Abdo et al. | Jun 2008 | B2 |
| 7406444 | Eng et al. | Jul 2008 | B2 |
| 7408932 | Kounavis et al. | Aug 2008 | B2 |
| 7411957 | Stacy et al. | Aug 2008 | B2 |
| 7415723 | Pandya | Aug 2008 | B2 |
| 7417568 | Fallon et al. | Aug 2008 | B2 |
| 7420931 | Nanda et al. | Sep 2008 | B2 |
| 7444515 | Dharmapurikar et al. | Oct 2008 | B2 |
| 7454418 | Wang | Nov 2008 | B1 |
| 7478431 | Nachenberg | Jan 2009 | B1 |
| 7480253 | Allan | Jan 2009 | B1 |
| 7487264 | Pandya | Feb 2009 | B2 |
| 7496108 | Biran et al. | Feb 2009 | B2 |
| 7536462 | Pandya | May 2009 | B2 |
| 7552107 | Indeck | Jun 2009 | B2 |
| 7558753 | Neubert et al. | Jul 2009 | B2 |
| 7558925 | Bouchard et al. | Jul 2009 | B2 |
| 7565525 | Vorbach et al. | Jul 2009 | B2 |
| 7587476 | Sato | Sep 2009 | B2 |
| 7603303 | Kraus et al. | Oct 2009 | B1 |
| 7606267 | Ho et al. | Oct 2009 | B2 |
| 7617291 | Fan et al. | Nov 2009 | B2 |
| 7623660 | Cory | Nov 2009 | B1 |
| 7627693 | Pandya | Dec 2009 | B2 |
| 7631107 | Pandya | Dec 2009 | B2 |
| 7660761 | Zhou et al. | Feb 2010 | B2 |
| 7660793 | Indeck et al. | Feb 2010 | B2 |
| 7680790 | Indeck et al. | Mar 2010 | B2 |
| 7685121 | Brown et al. | Mar 2010 | B2 |
| 7714747 | Fallon | May 2010 | B2 |
| 7761459 | Zhang et al. | Jul 2010 | B1 |
| 7827190 | Pandya | Nov 2010 | B2 |
| 7831606 | Pandya | Nov 2010 | B2 |
| 7831607 | Pandya | Nov 2010 | B2 |
| 7840482 | Singla et al. | Nov 2010 | B2 |
| 7870217 | Pandya | Jan 2011 | B2 |
| 7890692 | Pandya | Feb 2011 | B2 |
| 7899976 | Pandya | Mar 2011 | B2 |
| 7899977 | Pandya | Mar 2011 | B2 |
| 7899978 | Pandya | Mar 2011 | B2 |
| 7908213 | Monroe et al. | Mar 2011 | B2 |
| 7912808 | Pandya | Mar 2011 | B2 |
| 7917299 | Buhler et al. | Mar 2011 | B2 |
| 7921046 | Parsons et al. | Apr 2011 | B2 |
| 7944920 | Pandya | May 2011 | B2 |
| 7949650 | Indeck et al. | May 2011 | B2 |
| 7953743 | Indeck et al. | May 2011 | B2 |
| 7954114 | Chamberlain et al. | May 2011 | B2 |
| 7991667 | Kraus et al. | Aug 2011 | B2 |
| 7996348 | Pandya | Aug 2011 | B2 |
| 8005966 | Pandya | Aug 2011 | B2 |
| 8027893 | Burrows et al. | Sep 2011 | B1 |
| 8030888 | Pandya et al. | Oct 2011 | B2 |
| 8046283 | Bums et al. | Oct 2011 | B2 |
| 8051022 | Pandya | Nov 2011 | B2 |
| 8055601 | Pandya | Nov 2011 | B2 |
| 8069102 | Indeck et al. | Nov 2011 | B2 |
| 8095508 | Chamberlain | Jan 2012 | B2 |
| 8131697 | Indeck et al. | Mar 2012 | B2 |
| 8156101 | Indeck et al. | Apr 2012 | B2 |
| 8181239 | Pandya | May 2012 | B2 |
| 8200599 | Pandya | Jun 2012 | B2 |
| 8326819 | Indeck et al. | Dec 2012 | B2 |
| 8374986 | Indeck et al. | Feb 2013 | B2 |
| 8379841 | Taylor et al. | Feb 2013 | B2 |
| 8407122 | Parsons et al. | Mar 2013 | B2 |
| 8601086 | Pandya | Dec 2013 | B2 |
| 8620881 | Chamberlain et al. | Dec 2013 | B2 |
| 8751452 | Chamberlain | Jun 2014 | B2 |
| 8762249 | Taylor et al. | Jun 2014 | B2 |
| 8768805 | Taylor et al. | Jul 2014 | B2 |
| 8768888 | Chamberlain et al. | Jul 2014 | B2 |
| 8843408 | Singla et al. | Sep 2014 | B2 |
| 8879727 | Taylor et al. | Nov 2014 | B2 |
| 8880501 | Indeck et al. | Nov 2014 | B2 |
| 8983063 | Taylor et al. | Mar 2015 | B1 |
| 9014989 | McMillen et al. | Apr 2015 | B2 |
| 9020928 | Indeck et al. | Apr 2015 | B2 |
| 9176775 | Chamberlain et al. | Nov 2015 | B2 |
| 9483610 | McMillen et al. | Nov 2016 | B2 |
| 9519752 | Rooyen et al. | Dec 2016 | B2 |
| 9529967 | Rooyen et al. | Dec 2016 | B2 |
| 9576103 | McMillen et al. | Feb 2017 | B2 |
| 9576104 | van Rooyen et al. | Feb 2017 | B2 |
| 9679104 | van Rooyen et al. | Jun 2017 | B2 |
| 9697327 | McMillen et al. | Jul 2017 | B2 |
| 9792405 | van Rooyen et al. | Oct 2017 | B2 |
| 9813976 | Velusamy et al. | Nov 2017 | B2 |
| 9858384 | Rooyen et al. | Jan 2018 | B2 |
| 9898312 | Chamberlain et al. | Feb 2018 | B2 |
| 9898424 | van Rooyen et al. | Feb 2018 | B2 |
| 9953132 | van Rooyen et al. | Apr 2018 | B2 |
| 9953134 | van Rooyen et al. | Apr 2018 | B2 |
| 9953135 | van Rooyen et al. | Apr 2018 | B2 |
| 9961006 | Sutardja et al. | May 2018 | B1 |
| 10048179 | Lai et al. | Aug 2018 | B2 |
| 10068054 | Van Rooyen et al. | Sep 2018 | B2 |
| 10083276 | van Rooyen et al. | Sep 2018 | B2 |
| 10210308 | van Rooyen et al. | Feb 2019 | B2 |
| 10216898 | McMillen et al. | Feb 2019 | B2 |
| 10262105 | van Rooyen et al. | Apr 2019 | B2 |
| 10572824 | Chamberlain et al. | Feb 2020 | B2 |
| 10622096 | van Rooyen et al. | Apr 2020 | B2 |
| 10691775 | van Rooyen et al. | Jun 2020 | B2 |
| 20010003193 | Woodring et al. | Jun 2001 | A1 |
| 20010005314 | Farooq et al. | Jun 2001 | A1 |
| 20010007127 | Staring | Jul 2001 | A1 |
| 20010013048 | Imbert de Tremiolles et al. | Aug 2001 | A1 |
| 20010014093 | Yoda et al. | Aug 2001 | A1 |
| 20010015753 | Myers | Aug 2001 | A1 |
| 20010015919 | Kean | Aug 2001 | A1 |
| 20010033656 | Gligor et al. | Oct 2001 | A1 |
| 20010041012 | Hsieh et al. | Nov 2001 | A1 |
| 20010042040 | Keith | Nov 2001 | A1 |
| 20010047473 | Fallon | Nov 2001 | A1 |
| 20010052038 | Fallon et al. | Dec 2001 | A1 |
| 20010056547 | Dixon | Dec 2001 | A1 |
| 20020005314 | Takehara | Jan 2002 | A1 |
| 20020006196 | Shimoyama et al. | Jan 2002 | A1 |
| 20020010825 | Wilson | Jan 2002 | A1 |
| 20020016773 | Ohkuma et al. | Feb 2002 | A1 |
| 20020019812 | Board et al. | Feb 2002 | A1 |
| 20020021802 | Muratani et al. | Feb 2002 | A1 |
| 20020023010 | Rittmaster et al. | Feb 2002 | A1 |
| 20020031125 | Sato | Mar 2002 | A1 |
| 20020041685 | McLoone et al. | Apr 2002 | A1 |
| 20020054604 | Kadambi et al. | May 2002 | A1 |
| 20020069370 | Mack | Jun 2002 | A1 |
| 20020069375 | Bowen | Jun 2002 | A1 |
| 20020072893 | Wilson | Jun 2002 | A1 |
| 20020080871 | Fallon et al. | Jun 2002 | A1 |
| 20020082967 | Kaminsky et al. | Jun 2002 | A1 |
| 20020095512 | Rana et al. | Jul 2002 | A1 |
| 20020100029 | Bowen | Jul 2002 | A1 |
| 20020101425 | Hamid | Aug 2002 | A1 |
| 20020103663 | Bankier et al. | Aug 2002 | A1 |
| 20020105911 | Pruthi et al. | Aug 2002 | A1 |
| 20020106078 | Qi et al. | Aug 2002 | A1 |
| 20020112167 | Boneh et al. | Aug 2002 | A1 |
| 20020116508 | Khan et al. | Aug 2002 | A1 |
| 20020119803 | Bitterlich et al. | Aug 2002 | A1 |
| 20020129140 | Peled et al. | Sep 2002 | A1 |
| 20020138376 | Hinkle | Sep 2002 | A1 |
| 20020143521 | Call | Oct 2002 | A1 |
| 20020147670 | Lange | Oct 2002 | A1 |
| 20020150248 | Kovacevic | Oct 2002 | A1 |
| 20020156998 | Casselman | Oct 2002 | A1 |
| 20020159530 | Olson et al. | Oct 2002 | A1 |
| 20020162025 | Sutton et al. | Oct 2002 | A1 |
| 20020166063 | Lachman et al. | Nov 2002 | A1 |
| 20020169873 | Zodnik | Nov 2002 | A1 |
| 20020180742 | Hamid | Dec 2002 | A1 |
| 20020181709 | Sorimachi et al. | Dec 2002 | A1 |
| 20020191784 | Yup et al. | Dec 2002 | A1 |
| 20020199173 | Bowen | Dec 2002 | A1 |
| 20030009411 | Ram et al. | Jan 2003 | A1 |
| 20030009693 | Brock et al. | Jan 2003 | A1 |
| 20030014521 | Elson et al. | Jan 2003 | A1 |
| 20030014662 | Gupta et al. | Jan 2003 | A1 |
| 20030018630 | Indeck et al. | Jan 2003 | A1 |
| 20030023653 | Dunlop et al. | Jan 2003 | A1 |
| 20030023876 | Bardsley et al. | Jan 2003 | A1 |
| 20030028408 | RuDusky | Feb 2003 | A1 |
| 20030028690 | Appleby-Alis et al. | Feb 2003 | A1 |
| 20030028864 | Bowen | Feb 2003 | A1 |
| 20030033234 | RuDusky | Feb 2003 | A1 |
| 20030033240 | Balson et al. | Feb 2003 | A1 |
| 20030033450 | Appleby-Alis | Feb 2003 | A1 |
| 20030033514 | Appleby-Allis et al. | Feb 2003 | A1 |
| 20030033588 | Alexander | Feb 2003 | A1 |
| 20030033594 | Bowen | Feb 2003 | A1 |
| 20030035547 | Newton | Feb 2003 | A1 |
| 20030037037 | Adams et al. | Feb 2003 | A1 |
| 20030037321 | Bowen | Feb 2003 | A1 |
| 20030039355 | McCanny et al. | Feb 2003 | A1 |
| 20030041129 | Appleby-Allis | Feb 2003 | A1 |
| 20030043805 | Graham et al. | Mar 2003 | A1 |
| 20030046668 | Bowen | Mar 2003 | A1 |
| 20030051043 | Wyschogrod et al. | Mar 2003 | A1 |
| 20030055658 | RuDusky | Mar 2003 | A1 |
| 20030055769 | RuDusky | Mar 2003 | A1 |
| 20030055770 | RuDusky | Mar 2003 | A1 |
| 20030055771 | RuDusky | Mar 2003 | A1 |
| 20030055777 | Ginsberg | Mar 2003 | A1 |
| 20030059054 | Hu et al. | Mar 2003 | A1 |
| 20030061409 | RuDusky | Mar 2003 | A1 |
| 20030065607 | Satchwell | Apr 2003 | A1 |
| 20030065943 | Geis et al. | Apr 2003 | A1 |
| 20030068036 | Macchetti | Apr 2003 | A1 |
| 20030069723 | Klegde | Apr 2003 | A1 |
| 20030074177 | Bowen | Apr 2003 | A1 |
| 20030074489 | Steger et al. | Apr 2003 | A1 |
| 20030074582 | Patel et al. | Apr 2003 | A1 |
| 20030078865 | Lee | Apr 2003 | A1 |
| 20030079060 | Dunlop | Apr 2003 | A1 |
| 20030086300 | Noyes et al. | May 2003 | A1 |
| 20030090397 | Rasmussen | May 2003 | A1 |
| 20030093347 | Gray | May 2003 | A1 |
| 20030097481 | Richter | May 2003 | A1 |
| 20030099254 | Richter | May 2003 | A1 |
| 20030099352 | Lu et al. | May 2003 | A1 |
| 20030105620 | Bowen | Jun 2003 | A1 |
| 20030105721 | Ginter et al. | Jun 2003 | A1 |
| 20030108195 | Okada et al. | Jun 2003 | A1 |
| 20030110229 | Kulig et al. | Jun 2003 | A1 |
| 20030115485 | Milliken | Jun 2003 | A1 |
| 20030117971 | Aubury | Jun 2003 | A1 |
| 20030120460 | Aubury | Jun 2003 | A1 |
| 20030121010 | Aubury | Jun 2003 | A1 |
| 20030126065 | Eng et al. | Jul 2003 | A1 |
| 20030140337 | Aubury | Jul 2003 | A1 |
| 20030149869 | Gleichauf | Aug 2003 | A1 |
| 20030163715 | Wong | Aug 2003 | A1 |
| 20030167348 | Greenblat | Sep 2003 | A1 |
| 20030169877 | Liu et al. | Sep 2003 | A1 |
| 20030172017 | Feingold et al. | Sep 2003 | A1 |
| 20030177253 | Schuehler et al. | Sep 2003 | A1 |
| 20030184593 | Dunlop | Oct 2003 | A1 |
| 20030187662 | Wilson | Oct 2003 | A1 |
| 20030191876 | Fallon | Oct 2003 | A1 |
| 20030198345 | Van Buer | Oct 2003 | A1 |
| 20030208430 | Gershon | Nov 2003 | A1 |
| 20030217306 | Harthcock et al. | Nov 2003 | A1 |
| 20030221013 | Lockwood et al. | Nov 2003 | A1 |
| 20030233302 | Weber et al. | Dec 2003 | A1 |
| 20040006433 | Robson et al. | Jan 2004 | A1 |
| 20040010612 | Pandya | Jan 2004 | A1 |
| 20040015502 | Alexander et al. | Jan 2004 | A1 |
| 20040015633 | Smith | Jan 2004 | A1 |
| 20040019703 | Burton | Jan 2004 | A1 |
| 20040028047 | Hou et al. | Feb 2004 | A1 |
| 20040034587 | Amberson et al. | Feb 2004 | A1 |
| 20040049596 | Schuehler et al. | Mar 2004 | A1 |
| 20040054924 | Chuah et al. | Mar 2004 | A1 |
| 20040059666 | Waelbroeck et al. | Mar 2004 | A1 |
| 20040064737 | Milliken et al. | Apr 2004 | A1 |
| 20040100977 | Suzuki et al. | May 2004 | A1 |
| 20040105458 | Ishizuka | Jun 2004 | A1 |
| 20040111632 | Halperin | Jun 2004 | A1 |
| 20040117645 | Okuda et al. | Jun 2004 | A1 |
| 20040123258 | Butts | Jun 2004 | A1 |
| 20040146164 | Jonas et al. | Jul 2004 | A1 |
| 20040162826 | Wyschogrod et al. | Aug 2004 | A1 |
| 20040165721 | Sano et al. | Aug 2004 | A1 |
| 20040177340 | Hsu et al. | Sep 2004 | A1 |
| 20040186804 | Chakraborty et al. | Sep 2004 | A1 |
| 20040186814 | Chalermkraivuth et al. | Sep 2004 | A1 |
| 20040196905 | Yamane et al. | Oct 2004 | A1 |
| 20040199448 | Chalermkraivuth et al. | Oct 2004 | A1 |
| 20040205149 | Dillon et al. | Oct 2004 | A1 |
| 20040208318 | Henry et al. | Oct 2004 | A1 |
| 20040218762 | Le Saint et al. | Nov 2004 | A1 |
| 20040228479 | Crispin et al. | Nov 2004 | A1 |
| 20040255130 | Henry et al. | Dec 2004 | A1 |
| 20050005145 | Teixeira | Jan 2005 | A1 |
| 20050033672 | Lasry et al. | Feb 2005 | A1 |
| 20050044344 | Stevens | Feb 2005 | A1 |
| 20050080649 | Alvarez et al. | Apr 2005 | A1 |
| 20050086520 | Dharmapurikar et al. | Apr 2005 | A1 |
| 20050091142 | Renton et al. | Apr 2005 | A1 |
| 20050097027 | Kavanaugh | May 2005 | A1 |
| 20050108518 | Pandya | May 2005 | A1 |
| 20050131790 | Benzschawel et al. | Jun 2005 | A1 |
| 20050135608 | Zheng | Jun 2005 | A1 |
| 20050175010 | Wilson et al. | Aug 2005 | A1 |
| 20050175175 | Leech | Aug 2005 | A1 |
| 20050187844 | Chalermkraivuth et al. | Aug 2005 | A1 |
| 20050187845 | Eklund et al. | Aug 2005 | A1 |
| 20050187846 | Subbu et al. | Aug 2005 | A1 |
| 20050187847 | Bonissone et al. | Aug 2005 | A1 |
| 20050187848 | Bonissone et al. | Aug 2005 | A1 |
| 20050187849 | Bollapragada et al. | Aug 2005 | A1 |
| 20050187974 | Gong | Aug 2005 | A1 |
| 20050195832 | Dharmapurikar et al. | Sep 2005 | A1 |
| 20050197938 | Davie et al. | Sep 2005 | A1 |
| 20050197939 | Davie et al. | Sep 2005 | A1 |
| 20050197948 | Davie et al. | Sep 2005 | A1 |
| 20050216384 | Partlow et al. | Sep 2005 | A1 |
| 20050229254 | Singh et al. | Oct 2005 | A1 |
| 20050243824 | Abbazia et al. | Nov 2005 | A1 |
| 20050267836 | Crosthwaite et al. | Dec 2005 | A1 |
| 20050283423 | Moser et al. | Dec 2005 | A1 |
| 20060020536 | Renton et al. | Jan 2006 | A1 |
| 20060020715 | Jungck | Jan 2006 | A1 |
| 20060031154 | Noviello et al. | Feb 2006 | A1 |
| 20060031156 | Noviello et al. | Feb 2006 | A1 |
| 20060031263 | Arrouye et al. | Feb 2006 | A1 |
| 20060036693 | Hulten et al. | Feb 2006 | A1 |
| 20060053295 | Madhusudan et al. | Mar 2006 | A1 |
| 20060059064 | Glinberg et al. | Mar 2006 | A1 |
| 20060059065 | Glinberg et al. | Mar 2006 | A1 |
| 20060059066 | Glinberg et al. | Mar 2006 | A1 |
| 20060059067 | Glinberg et al. | Mar 2006 | A1 |
| 20060059068 | Glinberg et al. | Mar 2006 | A1 |
| 20060059069 | Glinberg et al. | Mar 2006 | A1 |
| 20060059083 | Friesen et al. | Mar 2006 | A1 |
| 20060059213 | Evoy | Mar 2006 | A1 |
| 20060123425 | Ramarao et al. | Jun 2006 | A1 |
| 20060143099 | Partlow et al. | Jun 2006 | A1 |
| 20060259417 | Marynowski et al. | Nov 2006 | A1 |
| 20060294059 | Chamberlain et al. | Dec 2006 | A1 |
| 20070061594 | Ginter et al. | Mar 2007 | A1 |
| 20070067108 | Buhler et al. | Mar 2007 | A1 |
| 20070078837 | Indeck et al. | Apr 2007 | A1 |
| 20070118453 | Bauerschmidt et al. | May 2007 | A1 |
| 20070118494 | Jannarone | May 2007 | A1 |
| 20070118500 | Indeck et al. | May 2007 | A1 |
| 20070156574 | Marynowski et al. | Jul 2007 | A1 |
| 20070174841 | Chamberlain et al. | Jul 2007 | A1 |
| 20070198523 | Hayim | Aug 2007 | A1 |
| 20070237327 | Taylor et al. | Oct 2007 | A1 |
| 20070277036 | Chamberlain et al. | Nov 2007 | A1 |
| 20070294157 | Singla et al. | Dec 2007 | A1 |
| 20070297608 | Jonas et al. | Dec 2007 | A1 |
| 20080086274 | Chamberlain et al. | Apr 2008 | A1 |
| 20080109413 | Indeck et al. | May 2008 | A1 |
| 20080114724 | Indeck et al. | May 2008 | A1 |
| 20080114725 | Indeck et al. | May 2008 | A1 |
| 20080114760 | Indeck et al. | May 2008 | A1 |
| 20080126274 | Jannarone | May 2008 | A1 |
| 20080126320 | Indeck et al. | May 2008 | A1 |
| 20080133453 | Indeck et al. | Jun 2008 | A1 |
| 20080133519 | Indeck et al. | Jun 2008 | A1 |
| 20080243675 | Parsons et al. | Oct 2008 | A1 |
| 20080253395 | Pandya | Oct 2008 | A1 |
| 20080260158 | Chin et al. | Oct 2008 | A1 |
| 20080275805 | Hecht | Nov 2008 | A1 |
| 20090060197 | Taylor et al. | Mar 2009 | A1 |
| 20090182683 | Taylor et al. | Jul 2009 | A1 |
| 20090262741 | Jungck et al. | Oct 2009 | A1 |
| 20090287628 | Lndeck et al. | Nov 2009 | A1 |
| 20100005036 | Kraus et al. | Jan 2010 | A1 |
| 20100027545 | Gomes et al. | Feb 2010 | A1 |
| 20100094858 | Lndeck et al. | Apr 2010 | A1 |
| 20100174770 | Pandya | Jul 2010 | A1 |
| 20110029471 | Chakradhar et al. | Feb 2011 | A1 |
| 20110040701 | Singla et al. | Feb 2011 | A1 |
| 20110178911 | Parsons et al. | Jul 2011 | A1 |
| 20110178912 | Parsons et al. | Jul 2011 | A1 |
| 20110178917 | Parsons et al. | Jul 2011 | A1 |
| 20110178918 | Parsons et al. | Jul 2011 | A1 |
| 20110178919 | Parsons et al. | Jul 2011 | A1 |
| 20110178957 | Parsons et al. | Jul 2011 | A1 |
| 20110179050 | Parsons et al. | Jul 2011 | A1 |
| 20110184844 | Parsons et al. | Jul 2011 | A1 |
| 20110199243 | Fallon et al. | Aug 2011 | A1 |
| 20110231446 | Buhler et al. | Sep 2011 | A1 |
| 20110246353 | Kraus et al. | Oct 2011 | A1 |
| 20110252008 | Chamberlain et al. | Oct 2011 | A1 |
| 20110291615 | Pandya et al. | Dec 2011 | A1 |
| 20120065956 | Irturk et al. | Mar 2012 | A1 |
| 20120109849 | Chamberlain | May 2012 | A1 |
| 20120110316 | Chamberlain et al. | May 2012 | A1 |
| 20120116998 | Lndeck et al. | May 2012 | A1 |
| 20120117610 | Pandya | May 2012 | A1 |
| 20120130922 | Indeck et al. | May 2012 | A1 |
| 20120215801 | Indeck et al. | Aug 2012 | A1 |
| 20130007000 | Indeck et al. | Jan 2013 | A1 |
| 20130018835 | Pandya | Jan 2013 | A1 |
| 20130151458 | Indeck et al. | Jun 2013 | A1 |
| 20140180903 | Parsons et al. | Jun 2014 | A1 |
| 20140180904 | Parsons et al. | Jun 2014 | A1 |
| 20140180905 | Parsons et al. | Jun 2014 | A1 |
| 20140181133 | Parsons et al. | Jun 2014 | A1 |
| 20140310148 | Taylor et al. | Oct 2014 | A1 |
| 20140310717 | Chamberlain et al. | Oct 2014 | A1 |
| 20150023501 | Taylor et al. | Jan 2015 | A1 |
| 20150052148 | Indeck et al. | Feb 2015 | A1 |
| 20150055776 | Taylor et al. | Feb 2015 | A1 |
| 20150199963 | Maaninen | Jul 2015 | A1 |
| 20160070583 | Chamberlain et al. | Mar 2016 | A1 |
| 20160099010 | Sainath et al. | Apr 2016 | A1 |
| 20170124255 | Buhler et al. | May 2017 | A1 |
| 20170364792 | Chai | Dec 2017 | A1 |
| 20180046898 | Lo | Feb 2018 | A1 |
| 20180157504 | Chamberlain et al. | Jun 2018 | A1 |
| Number | Date | Country |
|---|---|---|
| 0573991 | Dec 1993 | EP |
| 0880088 | Nov 1996 | EP |
| 0851358 | Jul 1998 | EP |
| 0887723 | Dec 1998 | EP |
| 0911738 | Apr 1999 | EP |
| 0989754 | Mar 2000 | EP |
| 57-137978 | Aug 1982 | JP |
| 58-102378 | Jun 1983 | JP |
| 61-107596 | May 1986 | JP |
| 63-143668 | Jun 1988 | JP |
| 02136900 | May 1990 | JP |
| 03014075 | Jan 1991 | JP |
| 04-205174 | Jul 1992 | JP |
| 05-101102 | Apr 1993 | JP |
| 05-217289 | Aug 1993 | JP |
| 09-054797 | Feb 1997 | JP |
| 09145544 | Jun 1997 | JP |
| 9-269930 | Oct 1997 | JP |
| 10313341 | Nov 1998 | JP |
| 11306268 | Nov 1999 | JP |
| 11316765 | Nov 1999 | JP |
| 2000-076270 | Mar 2000 | JP |
| 2000285134 | Oct 2000 | JP |
| 2000286715 | Oct 2000 | JP |
| 2000357176 | Dec 2000 | JP |
| 2001014239 | Jan 2001 | JP |
| 2001217834 | Aug 2001 | JP |
| 2001268071 | Sep 2001 | JP |
| 2001285283 | Oct 2001 | JP |
| 2001518724 | Oct 2001 | JP |
| 2001357048 | Dec 2001 | JP |
| 2002101089 | Apr 2002 | JP |
| 2002108910 | Apr 2002 | JP |
| 2003122442 | Apr 2003 | JP |
| 199010910 | Sep 1990 | WO |
| 199409443 | Apr 1994 | WO |
| 199737735 | Oct 1997 | WO |
| 199905814 | Feb 1999 | WO |
| 1999055052 | Oct 1999 | WO |
| 2000041136 | Jul 2000 | WO |
| 2001022425 | Mar 2001 | WO |
| 2001039577 | Jun 2001 | WO |
| 2001061913 | Aug 2001 | WO |
| 2001080082 | Oct 2001 | WO |
| 2001080558 | Oct 2001 | WO |
| 2002061525 | Aug 2002 | WO |
| 2002082271 | Oct 2002 | WO |
| 2003100650 | Apr 2003 | WO |
| 2003036845 | May 2003 | WO |
| 2003100662 | Dec 2003 | WO |
| 2003104943 | Dec 2003 | WO |
| 2004014065 | Feb 2004 | WO |
| 2004017604 | Feb 2004 | WO |
| 2004042560 | May 2004 | WO |
| 2004042561 | May 2004 | WO |
| 2004042562 | May 2004 | WO |
| 2004042574 | May 2004 | WO |
| 2005017708 | Feb 2005 | WO |
| 2005026925 | Mar 2005 | WO |
| 2005048134 | May 2005 | WO |
| 2005081855 | Sep 2005 | WO |
| 2005114339 | Dec 2005 | WO |
| 2006023948 | Mar 2006 | WO |
| 2006060571 | Jun 2006 | WO |
| 2007079095 | Jul 2007 | WO |
| 2008073824 | Jun 2008 | WO |
| Entry |
|---|
| Taylor et al., “Modular Design Techniques for the FPX”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002. |
| Taylor et al., “Scalable Packet Classification using Distributed Crossproducting of Field Labels”, Proceedings of IEEE Infocom, Mar. 2005, pp. 1-12, vol. 20, No. 1. |
| Taylor, “Models, Algorithms, and Architectures for Scalable Packet Classification”, doctoral thesis, Department of Computer Science and Engineering, Washington University, St. Louis, MO, Aug. 2004, pp. 1-201. |
| Thompson et al., “The CLUSTAL_X Windows Interface: Flexible Strategies for Multiple Sequence Alignment Aided by Quality Analysis Tools”, Nucleic Acids Research, 1997, vol. 25, No. 24, pp. 4876-4882. |
| U.S. Appl. No. 61/570,670, filed Dec. 14, 2011 (Taylor et al.). |
| U.S. Appl. No. 61/421,545, filed Dec. 9, 2010 (Taylor et al.). |
| Villasenor et al., “Configurable Computing Solutions for Automatic Target Recognition”, FPGAS for Custom Computing Machines, 1996, Proceedings, IEEE Symposium on Napa Valley, CA, Apr. 17-19, 1996, pp. 70-79, 1996 IEEE, Napa Valley, CA, Los Alamitos, CA, USA. |
| Waldvogel et al., “Scalable High-Speed Prefix Matching”, ACM Transactions on Computer Systems, Nov. 2001, pp. 440-482, vol. 19, No. 4. |
| Ward et al., “Dynamically Reconfigurable Computing: A Novel Computation Technology with Potential to Improve National Security Capabilities”, May 15, 2003, A White Paper Prepared by Star Bridge Systems, Inc. [retrieved Dec. 12, 2006]. Retrieved from the Internet: <URL: http://www_starbridgesystems_com/resources/whitepapers/Dynamically%20Reconfigurable%20Computing.pdf. |
| Weaver et al., “Very Fast Containment of Scanning Worms”, Proc. USENIX Security Symposium 2004, San Diego, CA, Aug. 2004, located at http://www.icsi.berkely.edu/˜nweaver/containment/containment.pdf. |
| West et al., “An FPGA-Based Search Engine for Unstructured Database”, Proc. of 2nd Workshop on Application Specific Processors, Dec. 2003, San Diego, CA. |
| Wooster et al., “HTTPDUMP Network HTTP Packet Snooper”, Apr. 25, 1996. |
| Written Opinion for PCT/US2004/016021 dated Aug. 31, 2005. |
| Written Opinion for PCT/US2004/016398 dated Jun. 9, 2005. |
| Yamaguchi et al, “An Approach for Homology Search with Reconfigurable Hardware”, Google, 2001, pp. 374-375. |
| Yamaguchi et al, “High Speed Homology Search with FPGAs”, Proceedings Pacific Symposium on Biocomputing, Jan. 3-7, 2002, pp. 271-282, vol. 7, Online, Lihue, Hawaii, USA. |
| Yan et al., “Enhancing Collaborative Spam Detection with Bloom Filters”, 2006, IEEE, pp. 414-425. |
| Yoshitani et al., “Performance Evaluation of Parallel Volume Rendering Machine Re Volver/C40”, Study Report of Information Processing Society, Mar. 5, 1999, pp. 79-84, vol. 99, No. 21. |
| Ziv et al., “A Universal Algorithm for Sequential Data Compression”, IEEE Trans. Inform. Theory, IT-23(3): 337-343 (1997). |
| Ziv et al., “Compression of Individual Sequence via Variable-Rate Coding”, IEEE Transactions on Information Theory, Sep. 1978, pp. 530-536, vol. IT-24, No. 5, Institute of Electrical and Electronics Engineers, Washington, DC, USA. |
| Keutzer et al., “A Survey of Programmable Platforms—Network Proc”, University of California-Berkeley, pp. 1-29. |
| Koloniari et al., “Content-Based Routing of Path Queries in Peer-to-Peer Systems”, pp. 1-19, E. Bertino et al. (Eds.): EDBT 2004, LNCS 2992, pp. 29-47, 2004, copyright by Springer-Verlag, Germany. |
| Kulig et al., “System and Method for Controlling Transmission of Data Packets Over an Information Network”, pending U.S. Patent Application. |
| Li et al., “Large-Scale IP Traceback in High-Speed Internet: Practical Techniques and Theoretical Foundation”, Proceedings of the 2004 IEEE Symposium on Security and Privacy, 2004, pp. 1-15. |
| Lin et al., “Real-Time Image Template Matching Based on Systolic Array Processor”, International Journal of Electronics; Dec. 1, 1992; pp. 1165-1176; vol. 73, No. 6; London, Great Britain. |
| Lockwood et al., “Field Programmable Port Extender (FPX) for Distributed Routing and Queuing”, ACM International Symposium on Field Programmable Gate Arrays (FPGA 2000), Monterey, CA, Feb. 2000, pp. 137-144. |
| Lockwood et al., “Hello, World: A Simple Application for the Field Programmable Port Extender (FPX)”, Washington University, Department of Computer Science, Technical Report WUCS-00-12, Jul. 11, 2000. |
| Lockwood et al., “Parallel FPGA Programming over Backplane Chassis”, Washington University, Department of Computer Science, Technical Report WUCS-00-11, Jun. 12, 2000. |
| Lockwood et al., “Reprogrammable Network Packet Processing on the Field Programmable Port Extender (FPX)”, ACM International Symposium on Field Programmable Gate Arrays (FPGA 2001), Monterey, CA, Feb. 2001, pp. 87-93. |
| Lockwood, “An Open Platform for Development of Network Processing Modules in Reprogrammable Hardware”, IEC DesignCon 2001, Santa Clara, CA, Jan. 2001, Paper WB-19. |
| Lockwood, “Building Networks with Reprogrammable Hardware”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002. |
| Lockwood, “Evolvable Internet Hardware Platforms”, Nasa/DoD Workshop on Evolvable Hardware (EHW'01), Long Beach, CA, Jul. 12-14, 2001, pp. 271-279. |
| Lockwood, “Hardware Laboratory Configuration”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002. |
| Lockwood, “Introduction”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002. |
| Lockwood, “Platform and Methodology for Teaching Design of Hardware Modules in Internet Routers and Firewalls”, IEEE Computer Society International Conference on Microelectronic Systems Education (MSE'2001), Las Vegas, NV, Jun. 17-18, 2001, pp. 56-57. |
| Lockwood, “Protocol Processing on the FPX”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002. |
| Lockwood, “Simulation and Synthesis”, Field Programmable Port Extender: Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002. |
| Lockwood, “Simulation of the Hello World Application for the Field-Programmable Port Extender (FPX)”, Washington University, Applied Research Lab, Spring 2001 Gigabits Kits Workshop. |
| Madhusudan, “Design of a System for Real-Time Worm Detection”, Hot Interconnects, pp. 77-83, Stanford, CA, Aug. 2004, found at http://www.hoti.org/hoti12/program/papers/2004/paper4.2.pdf. |
| Madhusudan, “Design of a System for Real-Time Worm Detection”, Power Point Presentation in Support of Master's Thesis, Washington Univ., Dept. of Computer Science and Engineering, St. Louis, MO, Aug. 2004. |
| Mao et al., “Cluster-based Online Monitoring System of Web Traffic”, Dept. of Computer Science and Technology, Tsinghua Univ., Bejing, 100084 P.R. China. |
| Minutes of the Oral Proceedings for EP Patent Application No. 03729000.4 dated Jul. 12, 2010. |
| Mitra, et al., “An FPGA Implementation of Triangle Mesh Decompression”, Proceedings of the 10th Annual Symposium on Field-Programmable Custom Computing Machines, 2002, pp. 1-10. |
| Mitzenmacher, “Compressed Bloom Filters”, IEEE/ACM Transactions on Networking, Oct. 2002 (manuscript received Aug. 1, 2001 and revised Dec. 5, 2001), pp. 604-612, vol. 10, No. 5, U.S.A. |
| Mosanya et al., “A FPGA-Based Hardware Implementation of Generalized Profile Search Using Online Arithmetic”, ACM/Sigda International Symposium on Field Programmable Gate Arrays (FPGA '99), Feb. 21-23, 1999, pp. 101-111, Monterey, CA, USA. |
| Moscola et al., “FPGrep and FPSed: Regular Expression Search and Substitution for Packet Streaming in Field Programmable Hardware”, Dept. of Computer Science, Applied Research Lab, Washington University, Jan. 8, 2002, unpublished, pp. 1-19, St. Louis, MO. |
| Moscola et al, “FPSed: A Streaming Content Search-and-Replace Module for an Internet Firewall”, Proc. of Hot Interconnects, 11th Symposium on High Performance Interconnects, pp. 122-129, Aug. 20, 2003. |
| Moscola, “FPGrep and FPSed: Packet Payload Processors for Managing the Flow of Digital Content on Local Area Networks and the Internet”, Master's Thesis, Sever Institute of Technology, Washington University, St. Louis, MO, Aug. 2003. |
| Navarro, “A Guided Tour to Approximate String Matching”, ACM Computing Surveys, vol. 33, No. 1, Mar. 2001, pp. 31-88. |
| Necker et al., “TCP-Stream Reassembly and State Tracking in Hardware”, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA. |
| Niewczas et al., “A Pattern Matching Algorithm for Verification and Analysis of Very Large IC Layouts”, ACM, Apr. 1998, pp. 129-134. |
| Notice of Allowance for U.S. Appl. No. 11/339,892 dated Jan. 20, 2011. |
| Notice of Allowance for U.S. Appl. No. 11/359,285 dated Dec. 8, 2010. |
| Notice of Allowance for U.S. Appl. No. 11/561,615 dated Sep. 12, 2011. |
| Notice of Allowance for U.S. Appl. No. 11/765,306 dated Jan. 25, 2011. |
| Notice of Allowance for U.S. Appl. No. 11/932,391 dated Jan. 19, 2011. |
| Notice of Allowance for U.S. Appl. No. 11/932,652 dated Jan. 19, 2011. |
| Notice of Allowance for U.S. Appl. No. 12/703,388 dated Jan. 3, 2011. |
| Nunez et al., “The X-MatchLlTE FPGA-Based Data Compressor”, Euromicro Conference 1999, Proceedings, Italy, Sep. 8-10, 1999, pp. 126-132, Los Alamitos, CA. |
| Nunez, et al., “Lossless Data Compression Programmable Hardware for High-Speed Data Networks”, IEEE International Conference on Field-Programmable Technology, 2002, pp. 290-293, Dept. of Electronic and Electrical Engineering, Loughborough University, Longhborough, UK. |
| Nwodoh et al., “A Processing System for Real-Time Holographic Video Computation”, Reconfigurable Technology: FPGAs for Computing and Application, Proceedings for the SPIE, Sep. 1999, Boston, pp. 129-140, vol. 3844. |
| Office Action for CA Application 2522862 dated May 17, 2011. |
| Office Action for CA Application 2522862 dated May 3, 2010. |
| Office Action for CA Application 2523548 dated Aug. 31, 2012. |
| Office Action for CA Application 2523548 dated Jan. 19, 2012. |
| Office Action for CA Application 2523548 dated Mar. 31, 2011. |
| Office Action for CA Application 2759064 dated Oct. 10, 2014. |
| Office Action for CA Application 2836758 dated Oct. 21, 2015. |
| Office Action for CA Application 2836758 dated Sep. 18, 2014. |
| Office Action for EP Application 04752943.3 dated Apr. 26, 2010. |
| Notice of Allowance for U.S. Appl. No. 16/503,244 dated Feb. 20, 2020, 13 pages. |
| Prosecution History for U.S. Appl. No. 15/388,498, filed Dec. 22, 2016, now U.S. Pat. No. 10,572,824, Granted Feb. 25, 2020, (Chamberlain et al.), 669 pages. |
| “A Reconfigurable Computing Model for Biological Research Application of Smith-Waterman Analysis to Bacterial Genomes” A White Paper Prepared by Star Bridge Systems, Inc. [retrieved Dec. 12, 2006]. Retrieved from the Internet: <URL: http://www.starbridgesystems.com/resources/whitepapers/Smith%20 Waterman%20Whitepaper.pdf. |
| “Lucent Technologies Delivers “PayloadPlus” Network Processors for Programmable, MultiProtocol, OC-48c Processing”, Lucent Technologies Press Release, downloaded from http://www.lucent.com/press/1000/0010320.meb.html on Mar. 21, 2002. |
| “Overview, Field Programmable Port Extender”, Jan. 2002 Gigabit Workshop Tutorial, Washington University, St. Louis, MO, Jan. 3-4, 2002, pp. 1-4. |
| “Payload Plus™ Agere System Interface”, Agere Systems Product Brief, Jun. 2001, downloaded from Internet, Jan. 2002, pp. 1-6. |
| “RFC793: Transmission Control Protocol, Darpa Internet Program, Protocol Specification”, Sep. 1981. |
| “Technology Overview”, Data Search Systems Incorporated, downloaded from the http://www.datasearchsystems.com/tech.htm on Apr. 19, 2004. |
| “The Field-Programmable Port Extender (FPX)”, downloaded from http://www.arl.wustl.edu/arl/ in Mar. 2002. |
| Altschul et al., “Basic Local Alignment Search Tool”, J. Mol. Biol., Oct. 5, 1990, 215, pp. 403-410. |
| Amanuma et al., “A FPGA Architecture for High Speed Computation”, Proceedings of 60th Convention Architecture, Software Science, Engineering, Mar. 14, 2000, pp. 1-163-1-164, Information Processing Society, Japan. |
| Anerousis et al., “Using the AT&T Labs PacketScope for Internet Measurement, Design, and Performance Analysis”, Network and Distributed Systems Research Laboratory, AT&T Labs—Research, Florham, Park, NJ, Oct. 1997. |
| Anonymous, “Method for Allocating Computer Disk Space to a File of Known Size”, IBM Technical Disclosure Bulletin, vol. 27, No. 10B, Mar. 1, 1985, New York. |
| ANSI X9.52/1998, “Triple Data Encryption Algorithm Modes of Operation”, American National Standards Institute, Approved: Jul. 29, 1998. |
| Arnold et al., “The Splash 2 Processor and Applications”, Proceedings 1993 IEEE International Conference on computer Design: VLSI in Computers and Processors (ICCD '93), Oct. 3, 1993, pp. 482-485, IEEE Computer Society, Cambridge, MA USA. |
| Artan et al., “Multi-packet Signature Detection using Prefix Bloom Filters”, 2005, IEEE, pp. 1811-1816. |
| Asami et al., “Improvement of DES Key Search on FPGA-Based Parallel Machine “RASH””, Proceedings of Information Processing Society, Aug. 15, 2000, pp. 50-57, vol. 41, No. SIG5 (HPS1), Japan. |
| Baboescu et al., “Scalable Packet Classification,” SIGCOMM'01, Aug. 27-31, 2001, pp. 199-210, San Diego, California, USA; http://www.ecse.rpi.edu/homepages/shivkuma/teaching/sp2001/readings/baboescu-pkt-classitication.pdf. |
| Baer, “Computer Systems Architecture”, 1980, pp. 262-265; Computer Science Press, Potomac, Maryland. |
| Baeza-Yates et al., “New and Faster Filters for Multiple Approximate String Matching”, Random Structures and Algorithms (RSA), Jan. 2002, pp. 23-49, vol. 20, No. 1. |
| Baker et al., “Time and Area Efficient Pattern Matching on FPGAs”, ACM, Feb. 22-24, 2004, pp. 223-232. |
| Barone-Adesi et al., “Efficient Analytic Approximation of American Option Values”, Journal of Finance, vol. 42, No. 2 (Jun. 1987), pp. 301-320. |
| Behrens et al., “BLASTN Redundancy Filter in Reprogrammable Hardware,” Final Project Submission, Fall 2003, Department of Computer Science and Engineering, Washington University. |
| Berk, “JLex: A lexical analyzer generator for Java™”, downloaded from http://www.cs.princeton.edu/˜appel/modern/java/Jlex/ in Jan. 2002, pp. 1-18. |
| Bianchi et al., “Improved Queueing Analysis of Shared Buffer Switching Networks”, ACM, Aug. 1993, pp. 482-490. |
| Black, “Dictionary of Algorithms and Data Structures”, NIST 2004, downloaded from http://www.nist.gov/dads/HTML/fractionalKnapsack.html. |
| Bloom, “Space/Time Trade-offs in Flash Coding With Allowable Errors”, Communications of the ACM, Jul. 1970, pp. 122-426, vol. 13, No. 7, Computer Usage Company, Newton Upper Falls, Massachusetts, USA. |
| Braun et al., “Layered Protocol Wrappers for Internet Packet Processing in Reconfigurable Hardware”, Proceedings of Hot Interconnects 9 (Hotl-9) Stanford, CA, Aug. 22-24, 2001, pp. 93-98. |
| Braun et al., “Protocol Wrappers for Layered Network Packet Processing in Reconfigurable Hardware”, IEEE Micro, Jan.-Feb. 2002, pp. 66-74. |
| Cavnar et al., “N-Gram-Based Text Categorization”, Proceedings of SDAIR-94, 3rd Annual Symposium on Document Analysis and Information Retrieval, Las Vegas, pp. 161-175, 1994. |
| Celko, “Joe Celko's Data & Databases: Concepts in Practice”, 1999, pp. 72-74, Morgan Kaufmann Publishers. |
| Chamberlain et al., “The Mercury System: Embedding Computation Into Disk Drives”, 7th High Performance Embedded Computing Workshop, Sep. 2003, Boston, MA. |
| Chamberlain et al., “The Mercury System: Exploiting Truly Fast Hardware for Data Search”, Proc. of Workshop on Storage Network Architecture and Parallel I/Os, Sep. 2003, New Orleans, LA. |
| Chaney et al., “Design of a Gigabit ATM Switch”, Washington University, St. Louis. |
| Chenna et al., “Multiple Sequence Alignment with the Clustal Series of Programs”, Nucleic Acids Research, 2003, vol. 31, No. 13, pp. 3497-3500. |
| Cho et al., “Deep Packet Filter with Dedicated Logic and Read Only Memories”, 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, Apr. 2004. |
| Cho, “A Fast Regular Expression Indexing Engine”, Proc. of 18th Int'l Conv. on Data Engineering, 2001, pp. 1-12. |
| Chodowiec et al., “Fast Implementations of Secret-Key Block Ciphers Using Mixed Inter- and Outer-Round Pipelining”, Proceedings of International Symposium on FPGAs, pp. 94-102 (Feb. 2001). |
| Choi et al., “Design of a Flexible Open Platform for High Performance Active Networks”, Allerton Conference, 1999, Champaign, IL. |
| Cholleti, “Storage Allocation in Bounded Time”, MS Thesis, Dept. of Computer Science and Engineering, Washington Univeristy, St. Louis, MO (Dec. 2002). Available as Washington University Technical Report WUCSE-2003-2. |
| Clark et al., “Scalable Pattern Matching for High Speed Networks”, Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2004; FCCM 2004, Apr. 20-23, 2004; pp. 249-257; IEEE Computer Society; Cambridge, MA USA. |
| Cloutier et al., “VIP: An FPGA-Based Processor for Image Processing and Neural Networks”, Proceedings of Fifth International Conference on Microelectronics for Neural Networks, Feb. 12, 1996, pp. 330-336, Los Alamitos, California. |
| Cole, “Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines”, Switching and Automata Theory, IEEE Conference Record of Seventh Annual Symposium, 1996, Digital Object Identifier: 10.1109/SWAT.1966.17, pp. 53-77. |
| Compton et al., “Configurable Computing: A Survey of Systems and Software”, Technical Report, Northwestern University, Dept. of ECE, 1999. |
| Compton et al., “Reconfigurable Computing: A Survey of Systems and Software”, Technical Report, Northwestern University, Dept. of ECE, 1999, presented by Yi-Gang Tai. |
| Compton et al., “Reconfigurable Computing: A Survey of Systems and Software”, University of Washington, ACM Computing Surveys, Jun. 2, 2002, pp. 171-210, vol. 34 No. 2, <http://www.idi.ntnu.no/emner/tdt22/2011/reconfig.pdf>. |
| Cong et al., “An Optional Technology Mapping Algorithm for Delay Optimization in Lookup-Table Based FPGA Designs”, IEEE, 1992, pp. 48-53. |
| Cuppu and Jacob, “Organizational Design Trade-Offs at the DRAM, Memory Bus and Memory Controller Level: Initial Results,” Technical Report UMB-SCA-1999-2, Univ. of Maryland Systems & Computer Architecture Group, Nov. 1999, pp. 1-10. |
| Dehon, “DPGA-coupled Microprocessors Commodity ICs for the Early 21st Century”, Institute of Electrical and Electronics Engineers, 1994, pp. 31-39. |
| Denoyer et al., “HMM-based Passage Models for Document Classification and Ranking”, Proceedings of ECIR-01, 23rd European Colloquim Information Retrieval Research, Darmstatd, DE, pp. 126-135, 2001. |
| Dharmapurikar et al., “Deep Packet Inspection Using Parallel Bloom Filters,” IEEE Micro, Jan.-Feb. 2004, vol. 24, Issue: 1, pp. 52-61. |
| Dharmapurikar et al., “Deep Packet Inspection Using Parallel Bloom Filters,” Symposium on High Performance Interconnects (Hotl), Stanford, California, 2003, pp. 44-51. |
| Dharmapurikar et al., “Design and Implementation of a String Matching System for Network Intrusion Detection using FPGA-based Bloom Filters”, Proc. of 12th Annual IEEE Symposium on Field Programmable Custom Computing Machines, 2004, pp. 1-10. |
| Dharmapurikar et al., “Longest Prefix Matching Using Bloom Filters,” SIGCOMM, 2003, pp. 201-212. |
| Dharmapurikar et al., “Robust TCP Stream Reassembly in the Presence of Adversaries”, Proc. of the 14th Conference on USENIX Security Symposium—vol. 14, 16 pages, Baltimore, MD, 2005; http://www.icir.org/vern/papers/TcpReassembly/TCPReassembly.pdf. |
| Dharmapurikar, “Fast and Scalable Pattern Matching for Content Filtering”, ACM, ANCS 05, 2005, pp. 183-192. |
| Ebeling et al., “RaPiD—Reconfigurable Pipelined Datapath”, University of Washington, Dept. of Computer Science and Engineering, Sep. 23, 1996, Seattle, WA. |
| Edgar, “MUSCLE: Multiple Sequence Alignment with High Accuracy and High Throughput”, Nucleic Acids Research, 2004, vol. 32, No. 5, pp. 1792-1797. |
| English Translation of Office Action and Claims for JP Application 2006-533393 dated Mar. 15, 2011. |
| Extended European Search Report for EP Application 12165559.1 dated Oct. 29, 2012. |
| Extended European Search Report for EP Application 12165819.9 dated Sep. 17, 2012. |
| Farabet et al., “Large-Scale FPGA-Based Convolutional Networks”, Chapter in Machine Learning on Very Large Data Sets, May 2, 2011, Cambridge University Press 2011, retreived from Internet on Feb. 23, 2018 <URL:https://nyuscholars.nyu.edu/en/publications/large-scale-fpga-based-convolutional-networks> entire document, 34 pages. |
| Feldmann, “BLT: Bi-Layer Tracing of HTTP and TCP/IP”, AT&T Labs-Research, Florham Park, NJ, USA. |
| Fernandez, “Template Matching of Binary Targets in Grey-Scale Images: A Nonparametric Approach”, Pattern Recognition, 1997, pp. 1175-1182, vol. 30, No. 7. |
| FIPS 197, “Advanced Encryption Standard”, National Institute of Standards and Technology (2001). |
| FIPS 46-2, “Data Encryption Standard”, revised version issued as FIPS 46-3, National Institute of Standards Technology, Dec. 30, 1993. |
| FIPS Pub. 46-3. Data Encryption Standard (DES). Revised version of 46-2. Reaffirmed Oct. 25, 1999. |
| Forgy, “RETE: A Fast Algorithm for the Many Pattern/Many Object Pattern Matching Problem”, Artificial Intelligence, 1982, pp. 17-37, vol. 19. |
| Franklin et al., “Assisting Network Intrusion Detection with Reconfigurable Hardware”, Symposium on Field-Programmable Custom Computing Machines (FCCM 2002), Apr. 2002, Napa, California. |
| Fu et al., “The FPX KCPSM Module: An Embedded, Reconfigurable Active Processing Module for the Field Programmable Port Extender (FPX)”, Washington University, Department of Computer Science, Technical Report WUCS-01-14, Jul. 2001. |
| Garey et al., “Computers and Intractability: A Guide to the Theory of NP-Completeness”, W.H. Freeman & Co., 1979. |
| Gaughan, “Data Streaming: Very Low Overhead Communication for Fine-Grained Multicomputing”, 1995, <http://dx.doi.org/ 10.1109/SPDP.1995.530727>, 3 pages. |
| Gavrila et al., “Multi-feature Hierarchical Template Matching Using Distance Transforms”, IEEE, Aug. 16-20, 1998, vol. 1, pp. 439-444. |
| Google Search Results Page for “field programmable gate array financial calculation stock market” over dates of Jan. 1, 1990-May 21, 2002, 1 page. |
| Guerdoux-Jamet et al., “Systolic Filter for Fast DNA Similarity Search”, IEEE, 1995, pp. 145-156. |
| Gunther et al., “Assessing Document Relevance with Run-Time Reconfigurable Machines”, IEEE Symposium on FPGAs for Custom Computing Machines, 1996, pp. 10-17, Proceedings, Napa Valley, CA. |
| Gupta et al., “High-Speed Implementations of Rule-Based Systems,” ACM Transactions on Computer Systems, May 1989, pp. 119-146, vol. 7, Issue 2. |
| Gupta et al., “Packet Classification on Multiple Fields”, Computer Systems Laboratory, Stanford University, Stanford, CA. |
| Gupta et al., “PMM: A Parallel Architecture for Production Systems,” Proceedings of the IEEE, Apr. 1992, pp. 693-696, vol. 2. |
| Gurtov, “Effect of Delays on TCP Performance”, Cellular Systems Development, Sonera Corporation, online at http://cs.helsinki.fi/u/gurtov/papers/pwc01.pdf. |
| Gyang, “NCBI BLASTN Stage 1 in Reconfigurable Hardware,” Technical Report WUCSE-2005-30, Aug. 2004, Department of Computer Science and Engineering, Washington University, St. Louis, MO. |
| Hauck et al., “Software Technologies for Reconfigurable Systems”, Northwestern University, Dept. of ECE, Technical Report, 1996. |
| Hayes, “Computer Architecture and Organization”, Second Edition, 1988, pp. 448-459, McGraw-Hill, Inc. |
| Hezel et al., “FPGA-Based Template Matching Using Distance Transforms”, Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, Apr. 22, 2002, pp. 89-97, IEEE Computer Society, USA. |
| Hoinville, et al. “Spatial Noise Phenomena of Longitudinal Magnetic Recording Media”, IEEE Transactions on Magnetics, vol. 28, No. 6, Nov. 1992. |
| Hollaar, “Hardware Systems for Text Information Retrieval”, Proceedings of the Sixth Annual International ACM Sigir Conference on Research and Development in Information Retrieval, Jun. 6-8, 1983, pp. 3-9, Baltimore, Maryland, USA. |
| Hutchings et al., “Assisting Network Intrusion Detection with Reconfigurable Hardware”, FCCM 2002: 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2002. |
| International Preliminary Report on Patentability (Chapter II) for PCT/US2004/016021 dated Aug. 21, 2007. |
| International Preliminary Report on Patentability (Chapter II) for PCT/US2004/016398 dated Mar. 13, 2006. |
| International Search Report and Written Opinion for PCT/US2017/067515 dated Mar. 9, 2018. |
| International Search Report for PCT/US2001/011255 dated Jul. 10, 2003. |
| International Search Report for PCT/US2002/033286 dated Jan. 22, 2003. |
| International Search Report for PCT/US2003/015638 dated May 6, 2004. |
| International Search Report for PCT/US2004/016021 dated Aug. 18, 2005. |
| International Search Report for PCT/US2004/016398 dated Apr. 12, 2005. |
| International Search Report for PCT/US2005/030046; dated Sep. 25, 2006. |
| Jacobson et al., “RFC 1072: TCP Extensions for Long-Delay Paths”, Oct. 1988. |
| Jacobson et al., “tcpdump—dump traffic on a network”, Jun. 30, 1997, online at www.cse.cuhk.edu.hk/˜cslui/CEG4430/tcpdump.ps.gz. |
| Jeanmougin et al., “Multiple Sequence Alignment with Clustal X”, TIBS, 1998, vol. 23, pp. 403-405. |
| Johnson et al., “Pattern Matching in Reconfigurable Logic for Packet Classification”, College of Computing, Georgia Institute of Technology, Atlanta, GA. |
| Jones et al., “A Probabilistic Model of Information Retrieval: Development and Status”, Information Processing and Management, Aug. 1998, 76 pages. |
| Jung et al., “Efficient VLSI for Lempel-Ziv Compression in Wireless Data Communication Networks”, IEEE Transactions on VLSI Systems, Sep. 1998, pp. 475-483, vol. 6, No. 3, Institute of Electrical and Electronics Engineers, Washington, DC, USA. |
| Office Action for EP Application 047532593 dated Apr. 15, 2010. |
| Office Action for EP Application 047532593 dated Jun. 25, 2014. |
| Office Action for EP Application 12165559.1 dated Apr. 28, 2016. |
| Office Action for EP Application 12165559.1 dated Jul. 7, 2014. |
| Office Action for JP Application 2006-514919 dated Aug. 24, 2010. |
| Office Action for JP Application 2006-514919 dated Jan. 20, 2010. |
| Office Action for JP Application 2006-533393 dated Aug. 24, 2010. |
| Office Action for JP Application 2006-533393 dated Jan. 26, 2010. |
| Office Action for U.S. Appl. No. 10/550,323 dated Jan. 3, 2011. |
| Office Action for U.S. Appl. No. 10/550,323 dated Jun. 24, 2010. |
| Office Action for U.S. Appl. No. 10/550,326 dated Dec. 23, 2010. |
| Office Action for U.S. Appl. No. 10/550,326 dated Jun. 3, 2010. |
| Office Action for U.S. Appl. No. 11/690,034 dated Dec. 14, 2010. |
| Office Action for U.S. Appl. No. 11/932,596 dated Dec. 3, 2010. |
| Office Action for U.S. Appl. No. 13/345,011 dated Aug. 28, 2012. |
| Office Action for U.S. Appl. No. 16/503,244 dated Sep. 5, 2019. |
| Partial International Search Report for PCT/US03/15638 dated Feb. 3, 2004. |
| Patterson, “High Performance DES Encryption in Virtex™ FPGAs using JBits™”, IEEE Symposium on Field-Programmable Custom Computing Machines, 2000, pp. 113-121. |
| Pirsch et al., “VLSI Architectures for Video Compression—A Survey”, Proceedings of the IEEE, Feb. 1995, pp. 220-243, vol. 83, No. 2, Institute of Electrical and Electronics Engineers, Washington, DC, USA. |
| Prakash et al., “OC-3072 Packet Classification Using BDDs and Pipelined SRAMs”, Department of Electrical and Computer Engineering, The University of Texas at Austin. |
| Pramanik et al., “A Hardware Pattern Matching Algorithm on a Dataflow”; Computer Journal; Jul. 1, 1985; pp. 264-269; vol. 28, No. 3; Oxford University Press, Surrey, Great Britain. |
| Prosecution History for U.S. Appl. No. 14/929,791, filed Nov. 2, 2015 (Chamberlain et al.). |
| Ramakrishna et al., “A Performance Study of Hashing Functions for Hardware Applications”, Int. Conf. on Computing and Information, May 1994, pp. 1621-1636, vol. 1, No. 1. |
| Ramakrishna et al., “Efficient Hardware Flashing Functions for High Performance Computers”, IEEE Transactions on Computers, Dec. 1997, vol. 46, No. 12. |
| Ramesh et al., “Automatic Selection of Tuning Parameters for Feature Extraction Sequences”, IEEE, Jun. 21-23, 1994, pp. 672-677. |
| Ranganathan et al., “High-Speed VLSI Designs for Lempe-Ziv Based Data Compression”, IEEE Transactions on Circuits and Systems—II: Analog and Digital Signal Processing, Feb. 1993, pp. 96-106, vol. 40, No. 2, Institute of Electrical and Electronics Engineers, Washington, DC, USA. |
| Ratha et al., “Convolution on Splash 2”, Proceedings of IEEE Symposium on FPGAS for Custom Computing Machines, Apr. 19, 1995, pp. 204-213, Los Alamitos, California. |
| Ratha et al., “FPGA-based coprocessor for text string extraction”, IEEE, Sep. 11-13, 2000, pp. 217-221. |
| Roberts, “Internet Still Growing Dramatically Says Internet Founder”, Press Release, Caspian Networks, Inc.—Virtual Pressroom. |
| Roesch, “Snort—Lightweight Intrusion Detection for Networks”, Proceedings of LISA '99: 13th Systems Administration Conference; Nov. 7-12, 1999; pp. 229-238; USENIX Association, Seattle, WA USA. |
| Roy, “A bounded search algorithm for segmented channel routing for FPGA's and associated channel architecture ssues”, IEEE, Nov. 11, 1993, pp. 1695-1705, vol. 12. |
| Russ, “The Image Processing Handbook”, 3rd Edition, 1999, CRC Press, pp. 365-367. |
| Sachin Tandon, “A Programmable Architecture for Real-Time Derivative Trading”, Master's Thesis, University of Edinburgh, 2003. |
| Schmit, “Incremental Reconfiguration for Pipelined Applications”, FPGAs for Custom Computing Machines, Proceedings, The 5th Annual IEEE Symposium, Dept. of ECE, Carnegie Mellon University, Apr. 16-18, 1997, pp. 17-55, Pittsburgh, PA. |
| Schuehler et al., “Architecture for a Hardware Based, TCP/IP Content Scanning System”, IEEE Micro, 24(1):62-69, Jan.-Feb. 2004, USA. |
| Schuehler et al., “TCP-Splitter: A TCP/IP Flow Monitor in Reconfigurable Hardware”, Hot Interconnects 10 (Hotl-10), Stanford, CA, Aug. 21-23, 2002, pp. 127-131. |
| Search Results from IEEE Xplore for “Deterministic Finite Automaton current states”, dated Dec. 28, 2010, 2 pages, citing Cole, “Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines”, 1966; Kashyap, “Syntactic Decision Rules for Recognition of Spoken Words and Phrases Using a Stochastic Automaton”, 1979; Rouvellou, “Inference of a Probabilistic Finite State Machine from its Output”, 1995; and Yi, “A Method of Instance Learning based on Finite-State Automaton and its Application on TCM Medical Cases”, 2010, et al. |
| Seki et al., “High Speed Computation of Shogi With FPGA”, Proceedings of 58th Convention Architecture, Software Science, Engineering, Mar. 9, 1999, pp. 1-133-1-134. |
| Shah, “Understanding Network Processors”, Version 1.0, University of California-Berkeley, Sep. 4, 2001. |
| Shalunov et al., “Bulk TCP Use and Performance on Internet 2”, ACM SIGCOMM Internet Measurement Workshop, 2001. |
| Shirazi et al., “Quantitative Analysis of FPGA-based Database Searching”, Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology, May 2001, pp. 85-96, vol. 28, No. 1/2, Kluwer Academic Publishers, Dordrecht, NL. |
| Sidhu et al., “Fast Regular Expression Matching Using FPGAs”, IEEE Symposium on Field Programmable Custom Computing Machines (FCCM 2001), Apr. 2001. |
| Sidhu et al., “String Matching on Multicontext FPGAs Using Self-Reconfiguration”, FPGA '99: Proceedings of the 1999 ACM/SIGDA 7th International Symposium on Field Programmable Gate Arrays, Feb. 1999, pp. 217-226. |
| Singh et al., “The EarlyBird System for Real-Time Detection on Unknown Worms”, Technical report CS2003-0761, Aug. 2003. |
| Sourdis and Pnevmatikatos, “Fast, Large-Scale String Match for a 10Gbps FPGA-based Network Intrusion Detection System”, 13th International Conference on Field Programmable Logic and Applications, 2003. |
| Srini, “DFS-SuperMPx: Low-Cost Parallel Processing System for Machine Vision and Image Processing”, 1995, Retrieved from https://dialog.proquest.com/professional/docview/828015663?accountid=142257, 3 pages. |
| Steinbach et al., “A Comparison of Document Clustering Techniques”, KDD Workshop on Text Mining, 2000. |
| Tau et al., “Transit Note #114: A First Generation DPGA Implementation”, Jan. 1995, 9 pages. |
| Taylor et al., “Dynamic Hardware Plugins (DHP): Exploiting Reconfigurable Hardware for High-Performance Programmable Routers”, Computer Networks, 38(3): 295-310 (16), Feb. 21, 2002, and online at http://www.cc.gatech.edu/classes/AY2007/cs8803hpc_fall/papers/phplugins.pdf. |
| Taylor et al., “Generalized RAD Module Interface Specification of the Field Programmable Port Extender (FPX) Version 2”, Washington University, Department of Computer Science, Technical Report, Jul. 5, 2001, pp. 1-10. |
| Element Farabet et al., “Large-Scale FPGA-based Convolutional Networks”, Machine Learning on Very Large Data Sets, University Press, May 2011, pp. 1-26. |
| Dehon, “DPGA-coupled microprocessors: commodity ICs for the early 21st Century”, FPGAS for Custom Computing Machines, 1994, Proceedings. IEEE Workshop on Napa Valley, CA, pp. 31-39, Los Alamitos, CA. |
| Extended European Search Report for EP Application 17883314.1 dated Jul. 3, 2020. |
| Number | Date | Country | |
|---|---|---|---|
| 20200184378 A1 | Jun 2020 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15388498 | Dec 2016 | US |
| Child | 16795016 | US |
