The invention relates generally to switching of messages in a packet/cell switching apparatus. The message switching is optimized for efficient switching of small messages, and is performed fully separated from the packet/cell switching.
The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.
The input and output units of a general switching apparatus are connected respectively to the input and output links of a packet/cell switch element which resides inside the switching apparatus. Incoming packets/cells are switched from the input units to the output units via the packet/cell switch element in a packet and/or cell format. The typical packet format is a variable size frame with a typical size range from 32 to 10000 bytes, and the typical cell format is a fixed size frame with a typical size range from 32 to 80 bytes.
The input and output units of the switching apparatus may also require means for efficiently switching messages between the input and output units. Such messages are typically used for distributing information related to packet/cell input/output unit queuing status, packet/cell switching/scheduling credits, packet/cell flow control commands, and packet/cell control table state information. These messages are typically in the range of 2 to 16 bytes, which is smaller than the typical minimum packets and/or cell size. Furthermore, messages may be switched from input units to output units and vice versa, while packets/cells are typically only switched from input units to output units.
The packet/cell switch element is typically optimized for switching of packet and/or cells with a minimum size of 32 to 80 bytes, and therefore is inefficient for switching the smaller messages. One reason for this inefficiency is that a required switching header per packet/cell unit may be comparable in size to the message itself. The packet/cell switch element may also pad the size of the message up to a minimum packet/cell size, which also reduces the efficiency of the packet/cell switch element when used to switch small messages. It may also be a problem that when messages are switched across the packet/cell switch element together with packets/cells, the messages impact the packet/cell switching throughput and vice versa, and this results in non-deterministic switching performance for both messages and packets/cells.
One solution described in U.S. Patent Publication No. 2003/0103501 uses a separate ring element integrated inside a switch element to separate smaller messages from traffic data (packets/cells) which is switched across a crossbar. The ring element is constructed by successively connecting adjacent switch element links, forming a ring for passing the messages from an input link, successively through intermediate links, to the destination output link. The drawback of this approach is that although the messages and traffic data (packets/cells) use separate switching resources inside the switch element, they share the switch elements input and output links when passed to and from the switch element respectively. This structure means that the messages impact the switching of traffic data (packets/cells) and vice versa, which may result in non-deterministic switching performance for messages and traffic data (packets/cells).
Another solution described in U.S. Pat. No. 5,703,875 uses separate queuing resources inside a switch element to separate short control messages from longer data messages. Each input link has separate input queue resources to separate short and long messages, and all messages are switched using the same crossbar element. The drawback of this approach is that although the messages and traffic data (packets/cells) use separate queue resources inside the switch element, they share the switch elements input and output links when passed to and from the switch element respectively, and they also share the same crossbar element. This structure means that, the messages impact the switching of traffic data and vice versa, which may result in non-deterministic switching performance for messages and traffic data (packets/cells).
At least one aspect of the present invention performs efficient message switching inside a packet/cell switching apparatus, fully separated from the packet/cell switching.
According to one aspect of the invention, there is provided a method of transferring packets/cells and messages within a switching apparatus that includes a plurality of input units, a packet/cell switch element, a message controller, and a plurality of output units. The method includes generating a message at one of the plurality of input units and output units, the message destined for another of the input units and output units. The method also includes transferring the message, via the message controller and via one of a plurality of links dedicated for message transfer, from the one of the plurality of input units and outputs units, to another of the input units and the output units. The method further includes outputting a packet/cell scheduling request command from the one of the input units to the message controller, the packet/cell scheduling request command being transferred to the message controller from one of the plurality of input units using one of a plurality of links dedicated for message transfer within the switching apparatus. The method still further includes receiving the packet/cell transfer scheduling request command at the message controller, determining by the message controller when to allow transfer of the packet/cell, and notifying the one of the plurality of input units by outputting a packet/cell data acknowledging command from the message controller to the one of the plurality of input units over the one or another of the plurality of links dedicated for message transfer. The method also includes outputting the packet/cell from the one of the plurality of input units to the packet/cell switch element, by using one of a plurality of links dedicated for packet/cell transfer.
According to another aspect of the invention, there is provided a method of transferring packets/cells and messages within a switching apparatus that includes a plurality of input units, a packet/cell switch element, a message controller, and a plurality of output units. The method includes generating a message at one of the plurality of input units and output units, the message destined for another of the input units and output units. The method also includes transferring the message, via a message switch of the message controller and via at least one of a plurality of links dedicated for message transfer, from the one of the plurality of input units and outputs units, to another of the input units and the output units. The method further includes outputting a packet/cell from one of the input units to one of the output units, via the packet/cell switch element and via at least one of a plurality of links dedicated for packet/cell transfer, under control of the message controller.
According to yet another aspect of the invention, there is provided a system for transferring packets/cells and messages within a switching apparatus that includes a plurality of input units, a packet/cell switch element, a message controller which includes a packet/cell arbiter and a message switch, and a plurality of output units. The system includes a first plurality of input and output links for respectively connecting each of the input units and the output units to a packet/cell switch element. The system also includes a second plurality of input and output links for connecting each of the input and output units to a message controller. All packets and cells are transferred from the input units to the output units by way of the first plurality of input and output links and the packet/cell switch element, under packet/cell scheduling control including a first transfer of a scheduling request messages from one of the input units to the packet/cell arbiter by way of the second plurality of input links and then one of input units receiving a corresponding scheduling acknowledge messages back from the packet/cell arbiter by way of the second plurality of output links, and then a second transfer of the corresponding packet/cell to one of the output units by way of a first plurality of input and output links and the packet/cell switch element. All messages are transferred among the input units and the output units by way of the second plurality of input and output links, and the message switch.
Further areas of applicability of the present disclosure will become apparent from the detailed description, the claims and the drawings. The detailed description and specific examples are intended for purposes of illustration only and are not intended to limit the scope of the disclosure.
The foregoing advantages and features of the invention will become apparent upon reference to the following detailed description and the accompanying drawings, of which:
A switching apparatus according to a first embodiment of the invention includes a packet/cell switch element and a message controller. The switching apparatus enables efficient message switching via the message controller, fully separated from the packet/cell switching which is performed via the packet/cell switch element.
In addition to operating as a mechanism for enabling efficient message switching between the input and output units of the switching apparatus, the message controller performs a packet/cell scheduling arbitration by processing received requests messages from input units and generating and transmitting acknowledge messages back to input units for directing packets/cells across the packet/cell switch element.
The messages are transmitted to the message controller in a frame format. The frame format defines multiple message transmission timeslots per frame, and the position of each message transmission timeslot is fixed relative to the frame boundary. Although transmission delineation overhead is required per frame, it is not required per individual message transmission timeslot, thereby providing an efficient message transmission format with little overhead.
When a message arrives at the message controller, it will either be forwarded to the message controller's packet/cell arbiter or to the message controller's message switch, depending upon if the message is a packet/cell scheduling request message type or an message type which is to be exchanged between the input and output units of the switching apparatus respectively.
In a typical switching apparatus embodiment, the message controller's packet/cell arbiter will accept packet/cell scheduling request command messages and generate packet/cell scheduling acknowledge command message in return. The operation of the packet/cell arbiter is outside the scope of this invention, and will not be discussed in any detail herein, whereby the embodiments of the present invention are independent of the packet/cell arbiter.
The message controller integrates a message switch which is optimized for small messages. The message switch is typically optimized for smaller messages in the typical size range from 2-16 bytes. Since the message switch can be optimized for switching of very small messages independent of the packet/cell switch element, it is possible to integrate a highly efficient message switch.
The message controller's message switch includes a set of input message queues per input link, and a set of output message queues per output link, whereby these queues are connected via the inputs and outputs of a message crossbar, respectively. A message scheduler controls the switching of messages across the message crossbar, whereby the message crossbar is capable of simultaneously switching multiple messages from one or more input message queues, to one or more output message queues, on a per output link basis.
Each of the N input ports 192 receives packet and/or cells, and buffers them in their respective input units 100, in a manner known to those skilled in the art. Each input unit 100 connects to a packet/cell switch element 160 via one or more input links 140, and the packets and/or cells 150 are transmitted from the input units 100 to the packet/cell switch element 160 via these dedicated packet/cell input links 140. Each output unit 190 connects to a packet/cell switch element 160 via one or more output links 170, to transmit packets and/or cells 152 from the packet/cell switch element 160 to the output units 190 via these dedicated packet/cell output links 170, before final forwarding to their destination output port 194.
In addition to the connectivity between the input/output units and the packet/cell switch element, each input unit 100 connects to the message controller 130 via one or more input/output links 110 that are dedicated for bi-directional transfer of messages between the message controller 130 and the input units 100 within the N×N switching apparatus. An input unit 100 transmits messages 120 to the message controller 130 via one or more input/output links 110 that is dedicated for message transfer, and receives messages 120 from the message controller 130 via one or more input/output links 110 that is dedicated for message transfer. Similarly, each output unit 190 also connects to the message controller 130 via one or more input/output links 110 that are dedicated for bi-directional message transfer between the message controller 130 and the output units 190.
While
A packet/cell arbitration (scheduling) function is included in the message controller 130 for the embodiment structure shown in
A preferred implementation of the packet/cell switch element 160 is a single stage structure of parallel switch devices, scheduled such that packets/cells from the input units are distributed in parallel across these parallel switch devices.
In a preferred embodiment of the first embodiment, input unit L and output unit L are integrated into a single physical device. This way, the integrated input and output unit can share the same input link connecting to the message controller 130, which reduces the number of input/output links 110 on the message controller 130 by a factor of two.
Each message frame defines a number of message transmission timeslots 260, wherein each message transmission timeslot 260 is used to transmit a message including empty messages. The position of each message transmission timeslot 260 is fixed relative to the frame boundary. A receiver does not need any transmission overhead per message to identify the message boundaries within received message frames.
The specific format of the different message types depends on the specific utilization of the N×N switching apparatus. In one particular implementation, the messages can divided into three general categories or types. The first type of messages is packet/cell scheduling request command messages which has been generated by an input unit (e.g., a request to transfer a packet/cell just received at the input unit to a particular output unit), and forwarded to the message controller 220, where they are processed and terminated by the packet/cell arbiter 350. This message type is only transmitted on the message controller's input links.
The second type of messages is packet/cell acknowledge command messages which has been generated by the message controller's packet/cell arbiter 350, and forwarded to an input unit for processing. This message type is only transmitted on the message controller's output links.
The third type of messages is messages which are generated by input/output units 200, and are switched between input/output units by being transparently switched across the message controller 220. This category also includes messages which are copied and replicated inside the message controller 220, and then being transmitted out of the message controller in multiple copies on different output links 240. This message type is transmitted on the message controller's input and output links.
The first embodiment can allocate the input link's message transmission bandwidth between the first and third message type by pre-assigning each of the message transmission timeslots 260 per input message frame 250 for one of the two message types. The optimal ratio between available input link transmission bandwidth for these two message types depends on the specific implementation of the switching apparatus, and can be modified as needed to suit that particular implementation.
The first embodiment allocates the output link's message transmission bandwidth between the second and third message type by pre-assigning each of the message transmission timeslots 260 per output message frame 250 for one of the two message types. The optimal ratio between available output link transmission bandwidth for these two message types depends on the specific implementation of the switching apparatus, and can be modified as needed to suit that particular implementation.
In one possible implementation of the first embodiment, the typical message transmission timeslot 260 size may vary depending on the type of message, whereby the message transmission according to the first embodiment can therefore be optimized by defining individual sizes message transmission timeslots for each of the corresponding message types.
In a preferred implementation of the first embodiment, the size of the message transmission timeslot 260 matches the corresponding message size in the switching apparatus embodiment, such that padding of the message information to match the size of the message to the message transmission timeslot size can be avoided.
By such a method of message processing, incoming messages destined for the packet/cell arbiter 350 are forwarded to the packet/cell arbiter 350, and messages destined for an input/output unit 100/190 are forwarded to the message switch 340. When all message transmission timeslots in an incoming message frame have been processed, the message frame parser 340 waits for the arrival of the next message frame.
In other words, the method determines whether the message transmission timeslot is pre-assigned for the packet/cell arbiter or for the message switch. When a message transmission timeslot is pre-assigned for the message switch, a message from the message switch is inserted into the outgoing message frame in step 540. When a message transmission timeslot is pre-assigned for the message switch 340, but a message is not available from the message switch, an empty message is inserted into the outgoing message frame.
When a message transmission timeslot is pre-assigned for the packet/cell arbiter 350, a message from the packet/cell arbiter 350 is inserted into the outgoing message frame in step 530. When a message transmission timeslot is pre-assigned for the packet/cell arbiter 350, but a message is not available from the packet/cell arbiter 350, an empty message is inserted into the outgoing message frame. Step 550 determines whether or not this is the last message transmission timeslot in the message frame; if Yes the process returns to step 500, and if No the process goes to step 510 to identify the next message transmission timeslot in the message frame.
The message switch 340 includes a message scheduler 600, a message crossbar 660, one message input queue 650 per input link, and one message output queue 610 per output link.
The message scheduler 600 determines when messages are switched from input message queues 650 to output message queues 620 via the message crossbar 660, and updates the message crossbar switching configuration accordingly every scheduling cycle.
The message crossbar 660 provides connectivity from any input message queue to any output message queue, and is capable of broadcasting from any input message queue 650 to all of the output message queues 620 (or to any particular subset thereof).
In a preferred implementation, the message scheduler 600 implements four parallel arbiters (not shown) per output message queue 620:
Arbitration is preferably only performed on the input message queues head-of-line message, and each input message queue can forward one message into the message crossbar per scheduling cycle. The four arbiters implemented per output message queue are capable of switching one or two messages originating from even numbered links plus one or two messages originating from odd numbered links to each output message queue per scheduling cycle. When the incoming messages are evenly distributed between even and odd numbered input links, the message scheduler is capable of switching up to four messages to each output message queue per scheduling cycle.
A message can be switched as a unicast message or as a broadcast message. Broadcast switching is preferably performed spatially, meaning that the switching may be performed across multiple scheduling cycles. Once the message has been switched to all output message queues, it is removed from the input message queue head-of-line position. In a best case scenario, complete broadcast can be performed in a single scheduling cycle.
The methodology of different embodiments of the present invention has now been described above. The following will describe different options and approaches for implementing the invention.
Another embodiment of a switching apparatus incorporating a message switching method and apparatus is similar to the first embodiment shown in
A switching apparatus incorporating a message switching method and apparatus of the foregoing embodiments includes a packet/cell switch element 160 for switching packets/cells between input and output units. The present invention can be incorporated with any packet/cell switch element that can provide switching of packets and/or cells between the input and output units. As one example, the packet/cell switch element can be implemented as a structure that includes a single stage of parallel switch devices. Another possible implementation is a structure that includes multiple stages of switch devices.
The switch device for the packet/cell switch element can take on any of a number of forms that provide switching of packet and/or cells between the switch device input and output. Exemplary switch devices include crossbar switch devices, output buffered switch devices, crosspoint buffered switch devices, and switch devices embodied as described in U.S. patent application Ser. No. 10/898,540, entitled “Network interconnect Crosspoint Switching Architecture and Method”, which is incorporated in its entirety herein by reference.
The message switch 340 can take on any number of forms that is able to provide switching of messages between the message controller's inputs and outputs.
Numerous variations of the message switch may exist. For example, the message switch may be implementation to have the number of arbiters per output to be less or more than the four arbiters per output in the message switch.
Another possible variation of the message switch implementation may correspond to having each arbiter select in a round robin fashion between inputs, instead of fixed ascending/descending order selection between inputs. The message switch can be implemented to have each arbiter select between all inputs instead of only between odd or even numbered inputs.
Yet another variation of the message switch implementation may correspond to having the input and/or output message queues implement multiple priority queuing levels, and/or where the message scheduler schedules message across the crossbar according to these priorities, instead of a single message priority.
Still another variation of the message switch implementation has an output buffered structure where each output buffer accepts simultaneously arriving messages from all inputs.
Further, while
In another variation of the message transmission format, the message transmission times lots in the message frames are not pre-assigned for specific message types, but are instead dynamically assigned by the message frame generator to the different message types. A field embedded in each message is used to identify the type of the message being transmitted in a message frame's message transmission timeslot.
Thus, apparatuses and methods have been described according to the present invention. Many modifications and variations may be made to the techniques and structures described and illustrated herein without departing from the spirit and scope of the invention. Accordingly, it should be understood that the methods and apparatus described herein are illustrative only and are not limiting upon the scope of the invention. Further, one or more aspects as described can be combined in any given system or method. Still further, one or more embodiments may be implemented in hardware, e.g., by a schematic design or a hardware description language (HDL), and/or implemented in a programmable logic device (FPGA/CPLD) or an ASIC, and/or they can be implemented in hardware using discrete hardware devices. Alternatively, one or more embodiments may be implemented in software.
The foregoing description is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses. The broad teachings of the disclosure can be implemented in a variety of forms. Therefore, while this disclosure includes particular examples, the true scope of the disclosure should not be so limited since other modifications will become apparent upon a study of the drawings, the specification, and the following claims. As used herein, the phrase at least one of A, B, and C should be construed to mean a logical (A or B or C), using a non-exclusive logical OR. It should be understood that one or more steps within a method may be executed in different order (or concurrently) without altering the principles of the present disclosure.
The present disclosure is a continuation of U.S. patent application Ser. No. 11/187,236 filed on Jul. 22, 2005. The entire disclosure of the application referenced above is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4156798 | Doelz | May 1979 | A |
4271506 | Broc et al. | Jun 1981 | A |
4387425 | El-Gohary | Jun 1983 | A |
4475010 | Huensch et al. | Oct 1984 | A |
4536873 | Leete | Aug 1985 | A |
4703475 | Dretzka et al. | Oct 1987 | A |
4787081 | Waters et al. | Nov 1988 | A |
4807408 | Lew et al. | Feb 1989 | A |
4816826 | Munter et al. | Mar 1989 | A |
4821259 | DeBruler et al. | Apr 1989 | A |
4831373 | Hess | May 1989 | A |
4837858 | Ablay et al. | Jun 1989 | A |
4953158 | Schruer | Aug 1990 | A |
5058110 | Beach et al. | Oct 1991 | A |
5093827 | Franklin et al. | Mar 1992 | A |
5129077 | Hillis | Jul 1992 | A |
5184347 | Farwell et al. | Feb 1993 | A |
5218367 | Sheffer et al. | Jun 1993 | A |
5227775 | Bruckert et al. | Jul 1993 | A |
5239537 | Sakauchi | Aug 1993 | A |
5239680 | Grube et al. | Aug 1993 | A |
5251212 | Gass | Oct 1993 | A |
5282201 | Frank et al. | Jan 1994 | A |
5296934 | Ohtsuki | Mar 1994 | A |
5341483 | Frank et al. | Aug 1994 | A |
5355370 | Fairhurst et al. | Oct 1994 | A |
5367520 | Cordell | Nov 1994 | A |
5387905 | Grube et al. | Feb 1995 | A |
5388243 | Glider et al. | Feb 1995 | A |
5396359 | Abramovitz | Mar 1995 | A |
5404374 | Mullins et al. | Apr 1995 | A |
5404537 | Olnowich et al. | Apr 1995 | A |
5408419 | Wong | Apr 1995 | A |
5420574 | Erickson et al. | May 1995 | A |
5422816 | Sprague et al. | Jun 1995 | A |
5425025 | Tahara | Jun 1995 | A |
5432908 | Heddes et al. | Jul 1995 | A |
5434993 | Liencres et al. | Jul 1995 | A |
5442659 | Bauchot et al. | Aug 1995 | A |
5481537 | Crisler et al. | Jan 1996 | A |
5491692 | Gunner et al. | Feb 1996 | A |
5493569 | Buchholz et al. | Feb 1996 | A |
5500858 | McKeown | Mar 1996 | A |
5515379 | Crisler et al. | May 1996 | A |
5519706 | Bantz et al. | May 1996 | A |
5530693 | Averbuch et al. | Jun 1996 | A |
5548814 | Lorang et al. | Aug 1996 | A |
5548818 | Sawyer et al. | Aug 1996 | A |
5594868 | Nakagoshi et al. | Jan 1997 | A |
5598417 | Crisler et al. | Jan 1997 | A |
5600643 | Robrock, II | Feb 1997 | A |
5666364 | Pierce et al. | Sep 1997 | A |
5668803 | Tymes et al. | Sep 1997 | A |
5675807 | Iswandhi et al. | Oct 1997 | A |
5678172 | Dinkins | Oct 1997 | A |
5696760 | Hardin et al. | Dec 1997 | A |
5703875 | Burnett | Dec 1997 | A |
5737706 | Seazholtz et al. | Apr 1998 | A |
5748627 | Weir | May 1998 | A |
5751955 | Sonnier et al. | May 1998 | A |
5761193 | Derango et al. | Jun 1998 | A |
5787075 | Uchida | Jul 1998 | A |
5790963 | Welham | Aug 1998 | A |
5799012 | Ayerst et al. | Aug 1998 | A |
5809012 | Takase et al. | Sep 1998 | A |
5809076 | Hofmann | Sep 1998 | A |
5835485 | Grube et al. | Nov 1998 | A |
5838894 | Horst | Nov 1998 | A |
5872523 | Dellaverson et al. | Feb 1999 | A |
5883893 | Rumer et al. | Mar 1999 | A |
5901142 | Averbuch et al. | May 1999 | A |
5913028 | Wang et al. | Jun 1999 | A |
5914953 | Krause et al. | Jun 1999 | A |
5931901 | Wolfe et al. | Aug 1999 | A |
5963542 | Shum | Oct 1999 | A |
5963555 | Takase et al. | Oct 1999 | A |
5974458 | Abe et al. | Oct 1999 | A |
5987018 | Freeburg et al. | Nov 1999 | A |
6002678 | Jayapala et al. | Dec 1999 | A |
6028860 | Laubach et al. | Feb 2000 | A |
6038591 | Wolfe et al. | Mar 2000 | A |
6041038 | Aimoto | Mar 2000 | A |
6044061 | Aybay et al. | Mar 2000 | A |
6058102 | Drysdale et al. | May 2000 | A |
6067297 | Beach | May 2000 | A |
6069886 | Ayerst et al. | May 2000 | A |
6075784 | Frankel et al. | Jun 2000 | A |
6081512 | Muller et al. | Jun 2000 | A |
6085233 | Jeffrey et al. | Jul 2000 | A |
6137798 | Nishihara et al. | Oct 2000 | A |
6147980 | Yee et al. | Nov 2000 | A |
6157843 | Derango et al. | Dec 2000 | A |
6161142 | Wolfe et al. | Dec 2000 | A |
6167457 | Eidison et al. | Dec 2000 | A |
6185213 | Katsube et al. | Feb 2001 | B1 |
6188892 | Krishnamurthi et al. | Feb 2001 | B1 |
6198927 | Wright et al. | Mar 2001 | B1 |
6198929 | Krishnamurthi et al. | Mar 2001 | B1 |
6240067 | Sorber | May 2001 | B1 |
6240444 | Fin et al. | May 2001 | B1 |
6246691 | Briem et al. | Jun 2001 | B1 |
6249528 | Kothary | Jun 2001 | B1 |
6272141 | Reed | Aug 2001 | B1 |
6272338 | Modzelesky et al. | Aug 2001 | B1 |
6272341 | Threadgill et al. | Aug 2001 | B1 |
6272581 | Leung et al. | Aug 2001 | B1 |
6278861 | Ward et al. | Aug 2001 | B1 |
6333932 | Kobayasi et al. | Dec 2001 | B1 |
6351466 | Prabhakar et al. | Feb 2002 | B1 |
6366622 | Brown et al. | Apr 2002 | B1 |
6370127 | Daraiseh et al. | Apr 2002 | B1 |
6370153 | Eng | Apr 2002 | B1 |
6370381 | Minnick et al. | Apr 2002 | B1 |
6373399 | Johnson et al. | Apr 2002 | B1 |
6385174 | Li | May 2002 | B1 |
6389022 | Jeong et al. | May 2002 | B1 |
6389479 | Boucher et al. | May 2002 | B1 |
6392994 | Dubuc | May 2002 | B1 |
6402691 | Peddicord et al. | Jun 2002 | B1 |
6411620 | Takase et al. | Jun 2002 | B1 |
6421357 | Hall | Jul 2002 | B1 |
6452926 | Wiklund | Sep 2002 | B1 |
6512741 | Kohzuki et al. | Jan 2003 | B1 |
H2059 | Ledsham et al. | Feb 2003 | H |
6515991 | McKeown | Feb 2003 | B1 |
6529848 | Sone | Mar 2003 | B2 |
6545996 | Falco et al. | Apr 2003 | B1 |
6574211 | Padovani et al. | Jun 2003 | B2 |
6621796 | Miklos | Sep 2003 | B1 |
6628615 | Joseph et al. | Sep 2003 | B1 |
6631180 | Ikeda | Oct 2003 | B1 |
6639916 | Wakizaka | Oct 2003 | B1 |
6697349 | Mathis et al. | Feb 2004 | B2 |
6704394 | Kambhatla et al. | Mar 2004 | B1 |
6731638 | Ofek | May 2004 | B1 |
6738381 | Agnevik et al. | May 2004 | B1 |
6751232 | Patterson et al. | Jun 2004 | B1 |
6778512 | Gipson et al. | Aug 2004 | B2 |
6907001 | Nakayama et al. | Jun 2005 | B1 |
6907254 | Westfield | Jun 2005 | B1 |
6928304 | Wigell et al. | Aug 2005 | B2 |
6944138 | Song | Sep 2005 | B1 |
6954448 | Farely et al. | Oct 2005 | B2 |
6956818 | Thodiyil | Oct 2005 | B1 |
6970478 | Nishihara | Nov 2005 | B1 |
6977919 | Stanwood | Dec 2005 | B1 |
7065580 | Eberie et al. | Jun 2006 | B1 |
7079550 | Padovani et al. | Jul 2006 | B2 |
7088710 | Johnson et al. | Aug 2006 | B1 |
7154854 | Zweig et al. | Dec 2006 | B1 |
7173922 | Beach | Feb 2007 | B2 |
7177309 | Shinohara | Feb 2007 | B2 |
7203193 | Hoof | Apr 2007 | B2 |
7277425 | Sikdar | Oct 2007 | B1 |
7280511 | Ahn | Oct 2007 | B2 |
7362751 | Khacherian et al. | Apr 2008 | B2 |
7742486 | Nielsen et al. | Jun 2010 | B2 |
8559443 | Nielsen | Oct 2013 | B2 |
20010021174 | Luijten et al. | Sep 2001 | A1 |
20010055283 | Beach | Dec 2001 | A1 |
20020051427 | Carvey | May 2002 | A1 |
20020054568 | Hoogenboom et al. | May 2002 | A1 |
20020080775 | Engbersen et al. | Jun 2002 | A1 |
20020101839 | Farley et al. | Aug 2002 | A1 |
20020118689 | Luijten et al. | Aug 2002 | A1 |
20020145974 | Saidi et al. | Oct 2002 | A1 |
20020152263 | Goldrian et al. | Oct 2002 | A1 |
20020163915 | Wallner et al. | Nov 2002 | A1 |
20020170013 | Bolourchi et al. | Nov 2002 | A1 |
20020181455 | Norman et al. | Dec 2002 | A1 |
20030002865 | Matsui et al. | Jan 2003 | A1 |
20030016688 | Hoof | Jan 2003 | A1 |
20030021230 | Kuo et al. | Jan 2003 | A1 |
20030043772 | Mathis et al. | Mar 2003 | A1 |
20030056073 | Zeiger | Mar 2003 | A1 |
20030058802 | Jones et al. | Mar 2003 | A1 |
20030060203 | Ahn | Mar 2003 | A1 |
20030063583 | Padovani et al. | Apr 2003 | A1 |
20030063604 | Wallner et al. | Apr 2003 | A1 |
20030063618 | Khacherian et al. | Apr 2003 | A1 |
20030088694 | Patek et al. | May 2003 | A1 |
20030103501 | Clem et al. | Jun 2003 | A1 |
20030112820 | Beach | Jun 2003 | A1 |
20030117947 | Koehl et al. | Jun 2003 | A1 |
20030117983 | Ton et al. | Jun 2003 | A1 |
20030118058 | Kim et al. | Jun 2003 | A1 |
20030123469 | Nong | Jul 2003 | A1 |
20030221043 | Sota | Nov 2003 | A1 |
20030227932 | Meempat et al. | Dec 2003 | A1 |
20030233612 | Gilchrist et al. | Dec 2003 | A1 |
20040085979 | Lee et al. | May 2004 | A1 |
20040093415 | Thomas | May 2004 | A1 |
20040148396 | Meyer et al. | Jul 2004 | A1 |
20040268057 | Landin et al. | Dec 2004 | A1 |
20050008011 | Georgiou et al. | Jan 2005 | A1 |
20050041970 | Harai | Feb 2005 | A1 |
20050047334 | Paul et al. | Mar 2005 | A1 |
20050132060 | Mo et al. | Jun 2005 | A1 |
20050135356 | Muthukrishnan et al. | Jun 2005 | A1 |
20050135398 | Muthukrishnan et al. | Jun 2005 | A1 |
20060031506 | Redgate | Feb 2006 | A1 |
20060285520 | Venkitaraman | Dec 2006 | A1 |
20070019674 | Bourlas et al. | Jan 2007 | A1 |
Number | Date | Country |
---|---|---|
1 206 087 | May 2002 | EP |
WO-2004049174 | Jun 2004 | WO |
Entry |
---|
U.S. Appl. No. 11/187,236, filed Jul. 22, 2005, Nielsen, et al. |
U.S. Appl. No. 10/898,540, filed Jul. 2, 2004, Nielson, et al. |
Number | Date | Country | |
---|---|---|---|
Parent | 11187236 | Jul 2005 | US |
Child | 14053128 | US |