This invention relates to network communication, for example serial communication between devices using a protocol such as Transmission Control Protocol (TCP).
TCP has been employed for decades and has increased in popularity, or at least in usage, over the years. An advantage of TCP is its guaranteed delivery of error free data. Unfortunately, this guarantee comes with a price of greater complexity relative to some other network protocols. Such complexity can slow TCP communication, or at least make it difficult for TCP to be used as network data rates increase, for example from 100 MB/s ten years ago to 10 GB/s currently. Moreover, even for a 100 MB/s transmission line rate that was conventional ten years ago, TCP processing at the endpoints of the network proved a bottleneck that slowed network communication, as well as consumed inordinate CPU cycles.
A solution to the TCP bottleneck was provided by Alacritech, Inc., which offloaded established TCP connections from the host CPU to hardware that could process data transfer much more rapidly, significantly increasing TCP data transfer rates while reducing CPU utilization. Descriptions and claims to such a solution can be found in multiple patents, including U.S. Pat. Nos. 7,337,241; 7,284,070; 7,254,696; 7,237,036; 7,191,318; 7,191,241; 7,185,266; 7,174,393; 7,167,927; 7,167,926; 7,133,940; 7,124,205; 7,093,099; 7,089,326; 7,076,568; 7,042,898; 6,996,070; 6,965,941; 6,941,386; 6,938,092; 6,807,581; 6,757,746; 6,751,665; 6,697,868; 6,687,758; 6,658,480; 6,591,302; 6,470,415; 6,434,620; 6,427,173; 6,427,171; 6,393,487; 6,389,479; 6,334,153; 6,247,060; and 6,226,680, which are incorporated by reference herein. Also incorporated by reference is U.S. patent application Ser. No. 11/799,720, filed May 1, 2007.
For a situation in which an application is running on a host CPU while a TCP connection for that application is handled by a network interface card, however, certain communications between the host and the device could hamper performance. For example, some previous Alacritech host interface designs employed a command-response interface for sending data. That is, if an application performed a send, the host would encapsulate that send in a command. The address of that command was then written to the card, which would read out the command contents and send the data specified. When that data was fully acknowledged by the peer (the other side of the TCP connection), the card would notify the driver of the command completion by filling in a response buffer.
This interface worked well when performing large data transfers. For instance, if the application sent 64 KB of data, the driver would encapsulate it into a single command and hand it to the card. After all 64 KB of data was sent and acknowledged, the card would send a response to the host. As a result, 64 KB of data required only two interactions with the card—a dramatic reduction compared to traditional networking, which would have required sending 44 segments and processing ˜22 ACKs (assuming the default ACK-every-other-segment behavior of Windows®).
That command/response interface did not perform nearly so well, however, with small data transfers. For example, consider an application that is instead sending 64-byte sends asynchronously (meaning it doesn't wait for a previous send to complete before starting on the next one). In the previous model, the host would have constructed a command for each send, and received a response every time a send was acknowledged—a particularly high overhead for such a small amount of data. Although there were times when multiple sends could be coalesced into a single command, the inherent problem of relatively high overhead for small packet sends has remained.
The problem has been solved, in one exemplary embodiment, by batching the notification that relatively small data transmit commands have completed whereas the notification that relatively large data transmit commands have completed are not batched. In one exemplary embodiment, the notification that data transmit commands have completed may be intrinsically modulated by the size and frequency of the commands and the processing of the data transfer by the TCP connection.
In one exemplary embodiment, a method is disclosed comprising: running, on a network interface for a computer, a TCP connection for an application, including maintaining a SndUna value for the TCP connection; setting a SndUna threshold at the network interface; and providing the SndUna value to the computer when the SndUna value is greater than or equal to the SndUna threshold.
In one exemplary embodiment, a method is disclosed comprising: running an application on a computer having a network interface; running, on the network interface, a transmission control protocol (TCP) connection for the application; providing, by the computer to the network interface, a command to send data from the application; updating, by the network interface, a SndUna value for the TCP connection; and providing, by the network interface to the computer, the SndUna value, thereby indicating to the computer that the command has been completed.
The computer 20 is running an operating system (OS) 30, with an application 28 running above the OS 30. The operating system 30 has a network stack 33 that includes conventional components such as a TCP layer and an Internet Protocol (IP) layer, and may include instructions regarding offloading and uploading TCP connections to and from NIC 40. A device driver 35 allows the OS 30 to interact with the NIC 40.
The NIC 40 includes a processor 46 and memory 48, and may also include other communications processing hardware and instructions for handling a TCP connection, including maintaining the connection as a TCP control block (TCB) 44 in NIC memory 48. A TCB is a large block of information, occupying well over 100 bytes and 100 fields, which stores the status of TCP communication for a particular connection. Many of the TCB fields are interrelated and many of the TCB fields change rapidly for an active connection. One of the many variables maintained in TCB 44 is a SndUna value 50, which indicates the data for that TCB that has been transmitted by NIC 40 and acknowledged (ACKed) by a receiving node. According to the TCP protocol, every byte transferred over a TCP connection is given a sequence number, which is used in part to track whether data has been successfully transferred. The SndUna value, like the ACK from which it is derived, indicates the contiguous data that has been successfully transferred, by indicating the next expected sequence number (i.e., the sequence number immediately following the largest sequence number of the contiguous data that has been successfully transferred).
The NIC 40 may include instructions regarding offloading and uploading TCP connections from and to computer 20, which is sometimes referred to as “partial offload” or “dynamic offload,” or the NIC may establish, maintain and close TCP connections without transfer to or from the computer, which is sometimes referred to as “full offload.” In either of these cases, the NIC 40 may sometimes be referred to as a “TCP offload engine” or “TOE.” Similarly, although the NIC 40 is shown as a separate entity in
As noted above, some prior art TOEs communicated to their computers the successful transmission of data for a TCP connection by posting a “response buffer” to a “command” to send the data. In one embodiment, instead of posting a “response buffer”, the mechanism by which these sends are completed is the current SndUna value 50, which is set based on acknowledgments received from the peer. As represented by arrow 58, the SndUna value 50 is sent from NIC 40 to device driver 35 to indicate that the transmission of certain application 28 data to the peer has been successfully completed by NIC 40.
In this embodiment, while the SndUna value 50 contained within the TCB 44 is owned and adjusted by the NIC 40, the computer 20 can very easily keep an association between pending sends and their starting and ending sequence numbers. This is due to the fact that each byte sent corresponds to a single sequence number. For example, say the starting sequence number at the time a connection is offloaded to the NIC 40 is 10000. Also assume that the driver 35 is given a series of 64-byte sends which it provides to the NIC 40. The computer 20 can easily keep track of the starting and ending sequence numbers of each send (send #1 starts with 10000, send #2 starts with 10064, and so on).
The NIC 40 can then complete one or more sends by simply providing the computer 20 with the current SndUna value 50. Using the above example, a SndUna value 50 of 10100 would complete the first send, but not the second, since the second send starts with 10064, but ends with 10127.
This offers a convenient way to notify the computer 20 of the completion of a batch of sends by the NIC 40. A SndUna value of 12960 in the above example would complete 46 64-byte sends at once back to the device driver 35. In turn, the driver 35 can complete this entire batch of sends back to the network stack 33 above it, and subsequently to the application 28. The savings of this embodiment are tremendous when contrasted against the response-per-send model of the prior art.
One challenge, which has been solved as explained below, is determining when the NIC 40 should send these SndUna values 50 (also known as “SndUna updates” or “SndUna events”) to the host computer 20. If one considers the 64-byte send example, the temptation would be to have the NIC 40 issue a SndUna event every time it receives an ACK from the peer. It should be noted that TCP implementations typically only send acknowledgments after they've received a minimum amount of data (or a delayed ACK timer expires). A typical minimum value is two full segments—2960 bytes in the case of IPv4 with no TCP options and standard Ethernet Maximum Transmission Unit (MTU).
But a SndUna event per ACK would be inefficient if applied to 64 KB sends in comparison with the previous Alacritech command-response mechanism. As noted above, that previous host interface resulted in a single response buffer per 64 KB send. If instead a SndUna event is provided to the host per ACK, and the peer were to ACK every other segment, the driver would have to process 22 SndUna events (44 send segments per 64 KB assuming standard MTU) before the 64 KB send was completely acknowledged, which requires far greater overhead than the previous Alacritech command-response mechanism.
To overcome this problem, in one embodiment a mechanism is utilized that ensures that a SndUna event from the NIC 40 completes, at a minimum, one outstanding send operation. In one embodiment, the NIC 40 keeps track of the ending sequence number of the data denoted by any send commands that it has received from the driver 35, to forward a SndUna value or related number to the driver indicating that at least one of the commands has been completed. This minimum value for forwarding a SndUna event may be termed a SndUna threshold.
As shown
Another problem that has been discovered, however, is that it is more difficult than it might first appear for a program running on the NIC processor 40 to keep track of the ending sequence number of each send command that is outstanding on the NIC 40. Note that the processor 46 cannot simply keep track of the ending sequence number of the first outstanding send, because once that is completed, it then needs to know the sequence number of the next outstanding send. Although possible, this can require a costly amount of highly accessible storage such as SRAM.
In one embodiment, the task of tracking the ending sequence number of the send commands outstanding on the NIC 40 is instead handled by the device driver 35. When multiple sends are outstanding, the driver 35 in this embodiment is responsible for providing the NIC 40 with a SndUna threshold value that indicates the completion the first outstanding send. Returning to the previous example in which multiple 64-byte sends were outstanding and the starting sequence number was 10000, the driver 35 would in this case provide the NIC 40 with a SndUna threshold of 10064, so that the NIC would provide to the driver the current SndUna value when it equaled or exceeded 10064. If the NIC 40 were to receive an ACK for 10030, it would update its TCB 44 accordingly, but not issue a SndUna event. If it were to receive an ACK for 10100, however, it would also issue a SndUna event. Upon receiving this event, the driver 35 would complete the first outstanding send to the network stack 33 and application 28 above it, and issue a new SndUna threshold of 10128 (the sequence number which completes the next outstanding send) to the NIC 40.
As noted above, it is unlikely that the NIC 40 would receive an ACK for 10100. A more likely value would be the 2-full-segment value of 12960, which would complete 46 sends. That ACK, being larger than the current SndUna threshold of 10064, would result in a SndUna event which specified a current value of 12960. That would in turn cause the driver 35 to complete 46 of the outstanding sends. After doing so, the driver 35 would provide a new SndUna threshold of 13008, which is the sequence number of the 47th 64-byte send.
Note that this embodiment avoids paying a penalty with large sends in comparison with the prior art command-response mechanism. When multiple 64 KB sends are outstanding, the SndUna threshold is set to the end of the first send, so like the prior art host interface, in this embodiment the host will receive a single SndUna event, like the single response buffer of the prior art, per send. In other words, this embodiment can batch the notification that relatively small data transmit commands have completed whereas the notification that relatively large data transmit commands have completed are not batched.
As shown in
A surprising advantage of making the driver 35 responsible for setting the SndUna threshold on the NIC 40 is that the completion notification mechanism in this embodiment has some self-tuning attributes. Consider, for example, a series of 2920-byte sends from the host computer 20, starting with relative sequence number 0. In a typical environment, each of these sends (being 2 full segments) would result in an ACK from the peer. If the NIC 40 were to implement an embodiment in which the SndUna value 50 is provided to the driver 35 whenever an ACK completes a send command, then it would result in a SndUna event per send. This may be optimal if the host could keep up, but imagine that the host CPU 20 is having trouble keeping up with this amount of traffic. In that case what is likely to happen in one exemplary embodiment in which the driver 35 is responsible for setting the SndUna threshold on the NIC 40 is the following:
1. Multiple 2920-byte sends are provided to the NIC 40;
2. The driver 35 provides a SndUna threshold of 2920 (the acknowledgment that completes the first outstanding send) to the NIC 40;
3. On the arrival of the first ACK, a SndUna event with a value of 2920 is generated (the SndUna value 50 of 2920 is provided to the driver 35);
4. At this point the host 20 is delayed in processing the SndUna event due to the fact that it is CPU-bound;
5. Additional acknowledgements arrive on the NIC 40, but since there is no outstanding SndUna threshold they do not result in SndUna events to the host;
6. Ultimately the driver processes the SndUna event, completes the first send, and issues a SndUna threshold of 5840—the acknowledgment that completes the next outstanding send;
7. Upon receiving a SndUna threshold of 5840, the NIC 40, having received several acknowledgments greater than 5840 (step 5), issues a SndUna event with the current SndUna value. This event results in the completion of several outstanding events.
In other words, the delay in step 4 actually facilitates additional batching and “self-tunes” based on CPU load. Stated differently, the notification that data transmit commands have completed may be intrinsically modulated by the size and frequency of the commands and the processing of the data transfer by the TCP connection.
In one embodiment, assurance is provided that the SndUna threshold mechanism does not result in undesired latency. Consider, for instance, a situation in which the application 28 has sent a series of sends and is then waiting for the last of the sends to be completed. Undesirable delay could be caused by the NIC 40 waiting for a SndUna threshold to be provided to the NIC before completing the last outstanding send. For this reason, when the NIC 40 receives an acknowledgment that completes all of its outstanding data (SndUna==SndNxt), it automatically issues a SndUna event to the driver 35.
On the other hand, when the host computer 20 has a single send command outstanding, it doesn't bother setting the SndUna threshold in one embodiment. This is because the processor 46 microcode is written to complete the single command when all outstanding send data is ACKed. When the host has two or more outstanding send commands, the host sets the SndUna threshold to the ending sequence of the first outstanding command. As SndUna events are received from the NIC 40, associated commands are completed back to the OS 30. Then, if there are still multiple commands outstanding, a new SndUna threshold is given to the processor 46 running the microcode, again set to the ending sequence number of the first outstanding send command.
Careful consideration of a variety of such scenarios has led to the development, in one embodiment, of the following set of rules:
A) Driver 35 Response to a New Host Computer 20 TCP Send Request:
B) Driver 35 Response to a SndUna Event from Network Interface 40:
C) Network Interface 40 Operation for ACK Processing:
D) Network Interface 40 Operation for New SndUna Threshold Value:
Some or all of these rules may be used in a particular embodiment. Moreover, while the embodiments above have typically involved providing a SndUna value from the NIC 40 to the driver 35, in other embodiments other numbers could instead be used, provided that the driver 35 or another entity on a host such as computer 20 keeps track of certain byte sequence numbers for connections that are owned by a network interface such as NIC 40. For example, one embodiment can include providing, for an offloaded connection, a command to send data while maintaining, by the computer, an ending sequence number for the data corresponding to the command; and notifying the computer, by the network interface, that the command has been completed by providing to the computer a sequence number from which the ending sequence number can be determined. Thus, even if a computer does not know the sequence numbers used by a network interface for an offloaded TCP connection, once an ending sequence number is known to complete a particular command, relative sequence numbers can be established between the computer and the network interface that allows the computer to determine whether a another command has been completed.
Evidence that a system employs the present invention can take many forms. In one example, for a situation in which a binary device driver and interface device are available but source code is not, it may be possible to reverse engineer the communication between the driver and the interface device using a logic analyzer. This process may be enhanced with the use of a NDIS filter driver in Windows®. An NDIS filter driver could be implemented to monitor interactions between a NDIS device driver and the TCP stack above it. For instance, a filter driver could be written to “catch” chimney send completions that are performed by the underlying driver. For example, the filter driver could be written to trigger a logic analyzer (by writing to a specified PCI address for instance), as well as stop the system (via an assert or panic of some kind).
Having done this, one can correlate several pieces of information. From the filter driver one can extract the contents of the send completion to determine which send is being completed. One can also locate the corresponding data and associated acknowledgements on a sniffer attached to the network. One can analyze the interaction between the interface device and the driver that occurred immediately before the send completion. Using this information one may determine the process by which the interface device completes send commands to the driver.
It may be possible then to further analyze the relationship between send commands, acknowledgments on the wire, and send completions from the card to the host. For instance, if acknowledgments arrive which acknowledge all data for a given outstanding send command, and those acknowledgments do not result in a send completion from the card, then one can surmise that the interface device is batching multiple send completions together. Further analysis of the data being passed between the driver and the interface device (using the PCI analyzer) may be used to identify SndUna values. Since SndUna values are comprised of a 4-byte sequence number, they are pretty reliably identifiable—a coincidental match has a probability of one in four billion.
If one sees an acknowledgment value specified by the host to the interface device (contained in data written to the interface device, or read out of host memory by the interface device) and then a subsequent send completion that is triggered by the receipt of an ACK (packet) equal to or greater than this value, then one can be reasonably certain that the system is using the innovations disclosed herein.
Although we have focused on detailed descriptions of particular embodiments, other embodiments and modifications are within the spirit of this invention as defined by the appended claims. For example, although TCP is discussed as an exemplary transport level protocol, other protocols that define logical connections using streams of bytes may instead be employed. As another example, although particular numbers are discussed, such as setting a SndUna threshold to be equal to an ending sequence number of data denoted by a command, varying either or both sequence numbers slightly could still perform the same function in the same way with the same result, and is therefore intended to be covered.
This application claims the benefit under 35 U.S.C. 119 of Provisional Patent Application Ser. No. 61/085,352, filed Jul. 31, 2008, by the same inventors and having the same title, which is incorporated by reference herein.
Number | Name | Date | Kind |
---|---|---|---|
4366538 | Johnson et al. | Dec 1982 | A |
4485455 | Boone et al. | Nov 1984 | A |
4485460 | Stambaugh | Nov 1984 | A |
4589063 | Shah et al. | May 1986 | A |
4700185 | Balph et al. | Oct 1987 | A |
4991133 | Davis et al. | Feb 1991 | A |
5056058 | Hirata et al. | Oct 1991 | A |
5058110 | Beach et al. | Oct 1991 | A |
5097442 | Ward et al. | Mar 1992 | A |
5129093 | Muramatsu et al. | Jul 1992 | A |
5163131 | Row et al. | Nov 1992 | A |
5212778 | Dally et al. | May 1993 | A |
5274768 | Traw et al. | Dec 1993 | A |
5280477 | Trapp | Jan 1994 | A |
5281963 | Ishikawa et al. | Jan 1994 | A |
5289580 | Latif et al. | Feb 1994 | A |
5303344 | Yokoyama et al. | Apr 1994 | A |
5412782 | Hausman et al. | May 1995 | A |
5418912 | Christenson | May 1995 | A |
5448566 | Richter et al. | Sep 1995 | A |
5485455 | Dobbins et al. | Jan 1996 | A |
5485460 | Schrier et al. | Jan 1996 | A |
5485579 | Hitz et al. | Jan 1996 | A |
5506966 | Ban | Apr 1996 | A |
5511169 | Suda | Apr 1996 | A |
5517668 | Szwerinski et al. | May 1996 | A |
5524250 | Chesson et al. | Jun 1996 | A |
5535375 | Eshel et al. | Jul 1996 | A |
5548730 | Young et al. | Aug 1996 | A |
5553241 | Shirakhar | Sep 1996 | A |
5566170 | Bakke et al. | Oct 1996 | A |
5574919 | Netravali et al. | Nov 1996 | A |
5588121 | Reddin et al. | Dec 1996 | A |
5590328 | Seno et al. | Dec 1996 | A |
5592622 | Isfeld et al. | Jan 1997 | A |
5596574 | Perlman et al. | Jan 1997 | A |
5598410 | Stone | Jan 1997 | A |
5619650 | Bach et al. | Apr 1997 | A |
5629933 | Delp et al. | May 1997 | A |
5633780 | Cronin et al. | May 1997 | A |
5634099 | Andrews et al. | May 1997 | A |
5634127 | Cloud et al. | May 1997 | A |
5642482 | Pardillos | Jun 1997 | A |
5664114 | Krech, Jr. et al. | Sep 1997 | A |
5671355 | Collins | Sep 1997 | A |
5678060 | Yokoyama et al. | Oct 1997 | A |
5682534 | Kapoor et al. | Oct 1997 | A |
5684954 | Kaiserwerth et al. | Nov 1997 | A |
5692130 | Shobu et al. | Nov 1997 | A |
5699317 | Sartore et al. | Dec 1997 | A |
5699350 | Kraslavsky | Dec 1997 | A |
5701434 | Nakagawa | Dec 1997 | A |
5701516 | Cheng et al. | Dec 1997 | A |
5706514 | Bonola | Jan 1998 | A |
5727142 | Chen | Mar 1998 | A |
5742765 | Wong et al. | Apr 1998 | A |
5749095 | Hagersten | May 1998 | A |
5751715 | Chan et al. | May 1998 | A |
5751723 | Vanden Heuvel et al. | May 1998 | A |
5752078 | Delp et al. | May 1998 | A |
5758084 | Silverstein et al. | May 1998 | A |
5758089 | Gentry et al. | May 1998 | A |
5758186 | Hamilton et al. | May 1998 | A |
5758194 | Kuzma | May 1998 | A |
5768618 | Erickson et al. | Jun 1998 | A |
5771349 | Picazo, Jr. et al. | Jun 1998 | A |
5774660 | Brendel et al. | Jun 1998 | A |
5778013 | Jedwab | Jul 1998 | A |
5778419 | Hansen et al. | Jul 1998 | A |
5790804 | Osborne | Aug 1998 | A |
5794061 | Hansen et al. | Aug 1998 | A |
5799150 | Hamilton et al. | Aug 1998 | A |
5802258 | Chen | Sep 1998 | A |
5802580 | McAlpice | Sep 1998 | A |
5809328 | Nogales et al. | Sep 1998 | A |
5809527 | Cooper et al. | Sep 1998 | A |
5812775 | Van Seeters et al. | Sep 1998 | A |
5815646 | Purcell et al. | Sep 1998 | A |
5819111 | Davies et al. | Oct 1998 | A |
5828835 | Isfeld et al. | Oct 1998 | A |
5848293 | Gentry et al. | Dec 1998 | A |
5870394 | Oprea | Feb 1999 | A |
5872919 | Wakeland et al. | Feb 1999 | A |
5878225 | Bilansky et al. | Mar 1999 | A |
5878227 | Wade et al. | Mar 1999 | A |
5892903 | Klaus | Apr 1999 | A |
5898713 | Melzer et al. | Apr 1999 | A |
5913028 | Wang et al. | Jun 1999 | A |
5915094 | Kouloheris et al. | Jun 1999 | A |
5917828 | Thompson | Jun 1999 | A |
5920566 | Hendel et al. | Jul 1999 | A |
5926642 | Favor | Jul 1999 | A |
5930830 | Mendelson et al. | Jul 1999 | A |
5931918 | Row et al. | Aug 1999 | A |
5935205 | Murayama et al. | Aug 1999 | A |
5935249 | Stern et al. | Aug 1999 | A |
5937169 | Connery et al. | Aug 1999 | A |
5941969 | Ram et al. | Aug 1999 | A |
5941972 | Hoese et al. | Aug 1999 | A |
5950203 | Stakuis et al. | Sep 1999 | A |
5963876 | Manssen et al. | Oct 1999 | A |
5978844 | Tsuchiya et al. | Nov 1999 | A |
5987022 | Geiger et al. | Nov 1999 | A |
5991299 | Radogna et al. | Nov 1999 | A |
5996013 | Delp et al. | Nov 1999 | A |
5996024 | Blumenau | Nov 1999 | A |
6005849 | Roach et al. | Dec 1999 | A |
6009478 | Panner et al. | Dec 1999 | A |
6014380 | Hendel et al. | Jan 2000 | A |
6014557 | Morten et al. | Jan 2000 | A |
6016513 | Lowe | Jan 2000 | A |
6021446 | Gentry et al. | Feb 2000 | A |
6021507 | Chen | Feb 2000 | A |
6026452 | Pitts | Feb 2000 | A |
6034963 | Minami et al. | Mar 2000 | A |
6038562 | Anjur et al. | Mar 2000 | A |
6041058 | Flanders et al. | Mar 2000 | A |
6041381 | Hoese | Mar 2000 | A |
6044438 | Olnowich | Mar 2000 | A |
6047323 | Krause | Apr 2000 | A |
6047356 | Anderson et al. | Apr 2000 | A |
6049528 | Hendel et al. | Apr 2000 | A |
6057863 | Olarig | May 2000 | A |
6061368 | Hitzelberger | May 2000 | A |
6065096 | Day et al. | May 2000 | A |
6067569 | Khaki et al. | May 2000 | A |
6070200 | Gates et al. | May 2000 | A |
6078564 | Lakshman et al. | Jun 2000 | A |
6078733 | Osborne | Jun 2000 | A |
6097734 | Gotesman et al. | Aug 2000 | A |
6101555 | Goshey et al. | Aug 2000 | A |
6111673 | Chang et al. | Aug 2000 | A |
6115615 | Ota et al. | Sep 2000 | A |
6122670 | Bennett et al. | Sep 2000 | A |
6141701 | Whitney | Oct 2000 | A |
6141705 | Anand et al. | Oct 2000 | A |
6145017 | Ghaffari | Nov 2000 | A |
6157944 | Pedersen | Dec 2000 | A |
6157955 | Narad et al. | Dec 2000 | A |
6172980 | Flanders et al. | Jan 2001 | B1 |
6173333 | Jolitz et al. | Jan 2001 | B1 |
6181705 | Branstad et al. | Jan 2001 | B1 |
6202105 | Gates et al. | Mar 2001 | B1 |
6219693 | Napolitano et al. | Apr 2001 | B1 |
6223242 | Sheafor et al. | Apr 2001 | B1 |
6226680 | Boucher et al. | May 2001 | B1 |
6233242 | Mayer et al. | May 2001 | B1 |
6243667 | Kerr et al. | Jun 2001 | B1 |
6246683 | Connery et al. | Jun 2001 | B1 |
6247060 | Boucher et al. | Jun 2001 | B1 |
6279051 | Gates et al. | Aug 2001 | B1 |
6289023 | Dowling et al. | Sep 2001 | B1 |
6298403 | Suri et al. | Oct 2001 | B1 |
6324649 | Eyres et al. | Nov 2001 | B1 |
6334153 | Boucher et al. | Dec 2001 | B2 |
6343345 | Hilla et al. | Jan 2002 | B1 |
6343360 | Feinleib | Jan 2002 | B1 |
6345301 | Burns et al. | Feb 2002 | B1 |
6345302 | Bennett et al. | Feb 2002 | B1 |
6356951 | Gentry et al. | Mar 2002 | B1 |
6370599 | Anand et al. | Apr 2002 | B1 |
6385647 | Willis et al. | May 2002 | B1 |
6389468 | Muller et al. | May 2002 | B1 |
6389479 | Boucher | May 2002 | B1 |
6393487 | Boucher et al. | May 2002 | B2 |
6418169 | Datari | Jul 2002 | B1 |
6421742 | Tillier | Jul 2002 | B1 |
6421753 | Hoese et al. | Jul 2002 | B1 |
6427169 | Elzur | Jul 2002 | B1 |
6427171 | Craft et al. | Jul 2002 | B1 |
6427173 | Boucher et al. | Jul 2002 | B1 |
6434620 | Boucher et al. | Aug 2002 | B1 |
6434651 | Gentry, Jr. | Aug 2002 | B1 |
6449656 | Elzur et al. | Sep 2002 | B1 |
6452915 | Jorgensen | Sep 2002 | B1 |
6453360 | Muller et al. | Sep 2002 | B1 |
6453406 | Sarnikowski et al. | Sep 2002 | B1 |
6470415 | Starr et al. | Oct 2002 | B1 |
6473425 | Bellaton et al. | Oct 2002 | B1 |
6480489 | Muller et al. | Nov 2002 | B1 |
6483804 | Muller et al. | Nov 2002 | B1 |
6487202 | Klausmeier et al. | Nov 2002 | B1 |
6487654 | Dowling | Nov 2002 | B2 |
6490631 | Teich et al. | Dec 2002 | B1 |
6502144 | Accarie | Dec 2002 | B1 |
6523119 | Pavlin et al. | Feb 2003 | B2 |
6526446 | Yang et al. | Feb 2003 | B1 |
6542504 | Mahler et al. | Apr 2003 | B1 |
6570884 | Connery et al. | May 2003 | B1 |
6591302 | Boucher et al. | Jul 2003 | B2 |
6591310 | Johnson | Jul 2003 | B1 |
6594261 | Boura et al. | Jul 2003 | B1 |
6631484 | Born | Oct 2003 | B1 |
6648611 | Morse et al. | Nov 2003 | B2 |
6650640 | Muller et al. | Nov 2003 | B1 |
6657757 | Chang et al. | Dec 2003 | B1 |
6658480 | Boucher et al. | Dec 2003 | B2 |
6678283 | Teplitsky | Jan 2004 | B1 |
6681364 | Calvignac et al. | Jan 2004 | B1 |
6683851 | Wilkie et al. | Jan 2004 | B1 |
6687758 | Craft et al. | Feb 2004 | B2 |
6697366 | Kim | Feb 2004 | B1 |
6697868 | Craft et al. | Feb 2004 | B2 |
6751665 | Philbrick et al. | Jun 2004 | B2 |
6757746 | Boucher et al. | Jun 2004 | B2 |
6765901 | Johnson et al. | Jul 2004 | B1 |
6807581 | Starr et al. | Oct 2004 | B1 |
6842896 | Redding et al. | Jan 2005 | B1 |
6862264 | Moura et al. | Mar 2005 | B1 |
6912522 | Edgar | Jun 2005 | B2 |
6938092 | Burns | Aug 2005 | B2 |
6941386 | Craft et al. | Sep 2005 | B2 |
6965941 | Boucher et al. | Nov 2005 | B2 |
6976148 | Arimilli et al. | Dec 2005 | B2 |
6996070 | Starr et al. | Feb 2006 | B2 |
7016361 | Swonk et al. | Mar 2006 | B2 |
7042898 | Blightman et al. | May 2006 | B2 |
7047320 | Arimilli et al. | May 2006 | B2 |
7073196 | Dowd et al. | Jul 2006 | B1 |
7076568 | Philbrick et al. | Jul 2006 | B2 |
7089326 | Boucher et al. | Aug 2006 | B2 |
7093099 | Bodas et al. | Aug 2006 | B2 |
7124205 | Craft et al. | Oct 2006 | B2 |
7133940 | Blightman et al. | Nov 2006 | B2 |
7167926 | Boucher et al. | Jan 2007 | B1 |
7167927 | Philbrick et al. | Jan 2007 | B2 |
7174393 | Boucher et al. | Feb 2007 | B2 |
7181531 | Pinkerton et al. | Feb 2007 | B2 |
7185266 | Blightman et al. | Feb 2007 | B2 |
7187679 | Dally et al. | Mar 2007 | B2 |
7191241 | Boucher et al. | Mar 2007 | B2 |
7191318 | Tripathy et al. | Mar 2007 | B2 |
7237036 | Boucher et al. | Jun 2007 | B2 |
7254696 | Mittal et al. | Aug 2007 | B2 |
7260518 | Kerr et al. | Aug 2007 | B2 |
7283522 | Siddabathuni | Oct 2007 | B2 |
7284070 | Boucher et al. | Oct 2007 | B2 |
7287092 | Sharp | Oct 2007 | B2 |
7337241 | Boucher et al. | Feb 2008 | B2 |
7461160 | Boucher et al. | Dec 2008 | B2 |
7472156 | Philbrick et al. | Dec 2008 | B2 |
7496689 | Sharp et al. | Feb 2009 | B2 |
7502869 | Boucher et al. | Mar 2009 | B2 |
7512144 | Fan | Mar 2009 | B2 |
7519699 | Jain et al. | Apr 2009 | B2 |
7543087 | Philbrick et al. | Jun 2009 | B2 |
7584260 | Craft et al. | Sep 2009 | B2 |
7620726 | Craft et al. | Nov 2009 | B2 |
7627001 | Craft et al. | Dec 2009 | B2 |
7627684 | Boucher et al. | Dec 2009 | B2 |
7640364 | Craft et al. | Dec 2009 | B2 |
7664868 | Boucher et al. | Feb 2010 | B2 |
7664883 | Craft et al. | Feb 2010 | B2 |
7673072 | Boucher et al. | Mar 2010 | B2 |
7694024 | Philbrick et al. | Apr 2010 | B2 |
7738500 | Jones et al. | Jun 2010 | B1 |
20010004354 | Jolitz | Jun 2001 | A1 |
20010013059 | Dawson et al. | Aug 2001 | A1 |
20010014892 | Gaither et al. | Aug 2001 | A1 |
20010014954 | Purcell et al. | Aug 2001 | A1 |
20010025315 | Jolitz | Sep 2001 | A1 |
20010037406 | Philbrick et al. | Nov 2001 | A1 |
20010048681 | Bilic et al. | Dec 2001 | A1 |
20010053148 | Bilic et al. | Dec 2001 | A1 |
20020066011 | Vialen et al. | May 2002 | A1 |
20020073223 | Darnell et al. | Jun 2002 | A1 |
20020112175 | Makofka et al. | Aug 2002 | A1 |
20020156927 | Boucher et al. | Oct 2002 | A1 |
20030014544 | Pettey | Jan 2003 | A1 |
20030046330 | Hayes | Mar 2003 | A1 |
20030067903 | Jorgensen | Apr 2003 | A1 |
20030110344 | Szezepanek et al. | Jun 2003 | A1 |
20030165160 | Minami et al. | Sep 2003 | A1 |
20030204631 | Pinkerton et al. | Oct 2003 | A1 |
20040010712 | Hui et al. | Jan 2004 | A1 |
20040042458 | Elzu | Mar 2004 | A1 |
20040042464 | Elzur et al. | Mar 2004 | A1 |
20040049580 | Boyd et al. | Mar 2004 | A1 |
20040049601 | Boyd et al. | Mar 2004 | A1 |
20040054814 | McDaniel | Mar 2004 | A1 |
20040059926 | Angelo et al. | Mar 2004 | A1 |
20040088262 | Boucher et al. | May 2004 | A1 |
20040153578 | Elzur | Aug 2004 | A1 |
20040210795 | Anderson | Oct 2004 | A1 |
20040213290 | Johnson et al. | Oct 2004 | A1 |
20040246974 | Gyugyi et al. | Dec 2004 | A1 |
20040249957 | Ekis et al. | Dec 2004 | A1 |
20050060538 | Beverly | Mar 2005 | A1 |
20050144300 | Craft et al. | Jun 2005 | A1 |
20060133386 | McCormack et al. | Jun 2006 | A1 |
20060248208 | Walbeck et al. | Nov 2006 | A1 |
20070083682 | Bartley et al. | Apr 2007 | A1 |
20070140240 | Dally et al. | Jun 2007 | A1 |
20080025210 | Honary et al. | Jan 2008 | A1 |
20080037420 | Tang | Feb 2008 | A1 |
20080043732 | Desai et al. | Feb 2008 | A1 |
20080170501 | Patel et al. | Jul 2008 | A1 |
20080209084 | Wang et al. | Aug 2008 | A1 |
20080240111 | Gadelrab | Oct 2008 | A1 |
20090063696 | Wang et al. | Mar 2009 | A1 |
Number | Date | Country |
---|---|---|
WO 9819412 | May 1998 | WO |
WO 9850852 | Nov 1998 | WO |
WO 9904343 | Jan 1999 | WO |
WO 9965219 | Dec 1999 | WO |
WO 0013091 | Mar 2000 | WO |
WO 0104770 | Jan 2001 | WO |
WO 0105107 | Jan 2001 | WO |
WO 0105116 | Jan 2001 | WO |
WO 0105123 | Jan 2001 | WO |
WO 0140960 | Jun 2001 | WO |
WO 0159966 | Aug 2001 | WO |
WO 0186430 | Nov 2001 | WO |
WO 2007-130476 | Nov 2007 | WO |
Number | Date | Country | |
---|---|---|---|
61085352 | Jul 2008 | US |