Providing real-time control data for a network processor

Information

  • Patent Grant
  • 7620702
  • Patent Number
    7,620,702
  • Date Filed
    Tuesday, December 28, 1999
    24 years ago
  • Date Issued
    Tuesday, November 17, 2009
    15 years ago
Abstract
A multiprocessor includes a module configured to collect status data, one or more processing engines, and a push engine. Part of the status data is collected from devices connected to a bus and indicates readiness of the devices to participate in data transfers over the bus. The processing engines schedule transfers of data packets between the processor and the devices. The push engine performs unsolicited transfers of a portion of the status data to the processing engines in response to the module collecting new status data.
Description
BACKGROUND OF THE INVENTION

This invention relates to controlling parallel processor arrays.


Many modern routers use application specific integrated circuits (ASIC's) to perform routing functions. The ASIC's can be designed to handle the protocols used by the networks connected to the router. In particular, the ASIC's can route high provide high performance routing for data packets having one of a preselected set of protocols.


SUMMARY OF THE INVENTION

According to one aspect of the invention, a processor includes a module configured to collect status data, one or more processing engines, and a push engine. The status data is collected from devices connected to a bus. The status data indicates readiness of the devices to participate in data transfers over the bus. The processing engines schedule transfers of data packets between the processor and the devices. The push engine performs unsolicited transfers of a portion of the status data to the processing engines in response to the module collecting new status data.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of a router based on a parallel processor;



FIG. 2 is a block diagram of a FIFO bus interface of the parallel processor of FIG. 1;



FIG. 3 is a block diagram of one of the parallel processing engines used by the processor of FIG. 1;



FIG. 4 is a block diagram of a MAC port coupled to the parallel processor of FIG. 1;



FIG. 5A shows the status registers for receive-status data;



FIG. 5B shows the status registers for transmit-status data;



FIG. 5C shows the transmit FIFO buffer located in the FIFO bus interface of FIG. 2;



FIG. 6 is a flow chart showing a process for providing ready-status data to scheduler threads;



FIG. 7 is a flow chart showing a process for collecting ready-status data from the MAC devices;



FIG. 8 is a flow chart for a process for transferring newly collected ready status data to the scheduler threads; and



FIG. 9 is a flow chart for a process that performs data transfers responsive to ready status data.





DESCRIPTION


FIG. 1 is a block diagram of a router 10 that uses a parallel processor 12, a set of media access chip (MAC) devices 14, 14′, 14″, and a FIFO bus 16. The router 10 performs data switching between source and destination networks 18, 18′, 18″ connected to the MAC devices 14, 14′, 14″. The MAC devices 14, 14′, 14″ are bridges that couple external networks 18, 18′, 18″ to the FIFO bus 16. The processor 12 can execute software to control data routing. By basing control on software, the processor 12 may be more easily modified to accommodate new protocols or data characteristics.


The router 10 performs data routing in two stages. First, one of the MAC devices 14, 14′, 14″ connected to the source network 18, 18′, 18″ transmits a data packet to the parallel processor 12 via the FIFO bus 16. Second, the parallel processor 12 retransmits the data packet over the FIFO bus 18 to the MAC device 14, 14′, 14″ connected to the destination network 18, 18′, 18″. The data transmissions over the FIFO bus 16 employ 64-byte data packets and proceed via an Ethernet protocol.


The parallel processor 12 has a parallel data forwarding structure that includes an array of identical processing engines 22a-22f. Each processing engine 22a-22f has an internal structure for executing a plurality of, e.g., four, independent threads.


Referring to FIGS. 1 and 2, the processing engines 22a-22f process data packets received from the MAC devices 14, 14′, 14″. To process a data packet, one of the processing engines 22a-22f looks up routing information in a synchronous random-access memory (SRAM) 24 using information from the packet header. The processing engines 22a-22f also move the data packets from a FIFO buffer 58 to a queue in a synchronous dynamic random-access memory (SDRAM) 26. The FIFO buffer 58 temporarily stores data packets received from the MAC devices 14, 14′, 14″. The various queues located in the SDRAM 26 are classified by destination MAC device 14, 14′, 14″ and retransmission priority.


The processing engines 22a-22f also process data from the queues of the SDRAM 26. This processing includes moving data packets from the queues of the SDRAM 26 to a FIFO buffer 60. The FIFO buffer 60 temporarily stores data prior to retransmission to the MAC devices 14, 14′, 14″ over the FIFO bus 16. Along with the data, associated control and destination information are stored in the FIFO buffer 60 for use in transmitting the data. The associated data is 16 bytes wide.


The SRAM 24 and SDRAM 26 couple to the processing engines 22a-22f through respective SRAM and SDRAM controllers 34, 36. The SRAM controller 34 has content addressable memory that supports look ups of identification information on the queues of the SDRAM 24. The look-ups use header data from received data packets. The SDRAM controller 36 coordinates data writes to and reads from the queues of the SDRAM 24 that store received data packets.


The parallel processor 12 has several internal busses 39, 40, 41. An S bus 39 couples the processing engines 22a-22f to a FIFO bus interface 38 (FBI) and to the SRAM controller 34. An M bus 40 couples the processing engines 22a-22f and the FBI 38 to the SDRAM controller 36 and the SDRAM 26. An AMBA bus 41 couples a processor core 44 to the processing engines 22a-22f and the FBI 38.


The FBI 38 controls data transfers on the FIFO bus 16 and collects status data on the readiness of the ports 28, 30, 32 of the MAC devices 14, 14′, 14″ to participate in data transfers over the FIFO bus 16. The ready status data is collected from the MAC devices 14, 14′, 14″ through a ready bus 42, which is also controlled by the FBI 38.


Referring again to FIG. 1, the processor core 44 uses software to perform a variety of functions. The functions may include data packet routing, exception handling, queue management, monitoring of data packet transfers, supporting network management protocols and/or providing local area network emulation.


The parallel processor 12 includes a PCI bus interface 46 that couples to a PCI bus 48. The PCI bus 48 can support communications between the parallel processor 12 and external processors. The other processors may control and/or reprogram the processor core 44 or other components 22a-22f, 38 of the multiprocessor 12.


Referring again to FIG. 2, the connections between the FBI 38 and the processing engines 22a-22f are shown. The FBI 38 includes a control module 50 for the ready bus 42 and a push engine 62. The control module 50 periodically collects receive-ready status data and transmit-ready status data from the MAC devices 14, 14′, 14″. The collected ready status data is stored in a set of status registers 54. The set includes separate registers for storing receive-ready status data and transmit-ready status data. The push engine 62 regularly sends the ready status data over the S bus 39 to scheduler threads located in the processing engines 22a-22f in response to commands from logic internal to the FBI 38.


The processing engines 22a-22f include separate receive-scheduler and transmit-scheduler threads. The receive-scheduler thread schedules the processing of data received from the FIFO bus 16. The transmit-scheduler thread schedules the processing of data to be transmitted to the FIFO bus 16.


The receive-scheduler thread assigns data forwarding and header processing tasks to other threads in the processing engines 22a-22f. These tasks include sharing operation of a push engine 62 that transports data from the receive FIFO buffer 58 in the FBI 38 to one of the storage queues in the SDRAM 26.


The transmit-scheduler thread also assigns data forwarding tasks to other threads in the processing engines 22a-22f. These tasks include sharing in operation of a pull engine 64, which moves data from the storage queues in the SDRAM 26 to the transmit FIFO buffer 60. The tasks also include directing the pull engine 62 to write transmission control and MAC device 14, 14′, 14″ address information to the FIFO buffer 60. Each data packet in the transmit FIFO buffer 60 has associated address and control information that control the retransmission over the FIFO bus 16.


To control data forwarding by the push and pull engines 62, 64, the execution threads of the processing engines 22a-22f send commands signals to FIFO command queues 66, 68 via a line 70. Components of the FBI 38 can also send commands to the command queues 66, 68 of push and pull engines 62, 64. For example, the ready bus controller 50 can send a command to the queue 66 that causes the push engine 62 to transfer ready status data from the status registers 54 to the processing engines 22a-22f. An arbiter 56 controls transmission of commands from the queues 66, 68 to the push and pull engines 62, 64.


The push and pull engines 62, 64 perform several types of tasks. The push and the pull engines 62, 64 are involved in bi-directional forwarding of data packets between the FIFO buffers 58, 60 and the SDRAM controller 36. The push and pull engines 62, 64 also operate a large hardware unit 71 located in the FBI 38. The push engine 62 also forwards ready status data from the set of status registers 54 to the receive- and transmit-scheduler threads located in the processing engines 22a-22f.


The hardware unit 71 performs various operations for the execution threads of the processing engines 22a-22f and includes a hash unit 72 and a scratchpad memory 73. The execution threads operate the hardware unit 71 by sending commands to the queues 66, 68. To perform the operations, the pull engine 64 retrieves input data over the S bus 39 from output transfer registers 80a-80f of the requesting processing engine 22a-22f. The pull engine 64 moves the retrieved data and associated commands to the hardware unit 71. The hardware unit 71 forwards results from the operations to the push engine 62. The push engine 62 uses command information from the command queue 66 and/or pull engine 64 to transmit the results back over the S bus 39 to input transfer registers 78a-78f of the requesting or destination processing engine 22a-22f.


Referring to FIG. 3, one embodiment 74 of the processing engines 22a-22f is shown. The processing engines 22a-22f have input/output terminals 75-77 for control signals, address signals, and data. Control signals, address signals, and data are transferred to and from the processing engines 22a-22f over three busses, i.e., the M bus 40, the S bus 39, and the AMBA bus 41. The address signals identify both a processing engine 22a-22f and an execution thread so that external commands can independently address different threads. Data is received at and transmitted from respective input and output transfer registers 78, 80. Each input and output transfer register 78, 80 is assigned to an individual execution thread. To write data to or read data from a particular execution thread, an external device accesses one of the transfer registers 78, 80 assigned to the particular thread.


Referring to FIG. 4, the port 28 of the MAC device 14 is shown. The port 28 has transmit and receive FIFO buffers 90, 92 for storing data prior to transmission to and after reception from the FIFO bus 16, respectively. Both buffers 90, 92 have entries of fixed size that are multiples of 64 bytes, i.e., the size of data packets on the FIFO bus 16. The port 28 also includes address decoders and a controller 94. The controller 94 controls both protocol transfers over the FIFO bus 16 and responses to ready status queries from the ready bus 42. The responses to the queries indicate whether the transmit buffer 90 has a 64 byte data packet to transmit and/or whether the receive buffer 92 has space to receive a 64 byte data packet.


The various ports 28, 30, 32 of the MAC devices 14, 14′, 14″ may support different data transfer rates. The ports 28, 30 of the MAC devices 14, 14′ support transfer rates of about ten or one hundred megabits of data per second. The port 32 of the MAC device 14″ may have a transfer rate of up to about one gigabit per second.


The ready bus 42 includes control/address and data lines. The control/address lines enable selection of a transaction type and a port 28, 30, 32 of the MAC devices 14, 14′, 14″. The data line transfers receive-ready status data and transmit-ready status data to the FBI 38 in response to status queries from the control module 50 for the ready bus 42.


Referring to 5A, the registers R1, R2, R3 that store receive-ready status data are shown. The registers R1 and R2 store receive-ready status data for individual MAC ports 28, 30, 32. The readiness of each MAC port 28, 30, 32 to transmit a data packet to the FIFO bus 16 is indicated by the value of an associated bit or flag stored in one of the registers R1, R2. One logic value of the bit or flag indicates that the associated port 28, 30, 32 has a data packet ready to transmit, and the other logic value indicates the associated port 28, 30, 323 has no ready data packets. Different ports 28, 30, 32 may have data packets of different sizes, but the receive scheduler thread knows the packet size associated with each port 28, 30, 32.


The registers R2 and R3 have 32 bits each and thus, can accommodate receive-ready status data for up to 64 different MAC ports 28, 30, 32.


The register R3 stores a cyclic counter value, which acts as a time stamp for the receive-status data stored in registers R1, R2. The counter value is incremented each time new receive-status data is collected. By comparing the counter value to a previously received counter value, the scheduler thread can determine whether the present receive-status data is new or stale, i.e., whether the data has already been seen.


Referring to FIG. 5B, the registers R4, R5, R6 that store transmit-ready status data are shown. The registers R4 and R4 store transmit-ready status data for individual MAC ports 28, 30, 32. Each MAC port 28, 30, 32 has an associated bit or flag in one of the registers R4 and R4. One logic value of the bit or flag indicates that the associated port 28, 30, 32 has enough space to receive a data packet, and the other logic value indicates the associated port 28, 30, 32 does not have enough space.


The registers R4 and R5 have a total of 64 bits and thus, can report transmit ready status for up to 64 MAC ports 28, 30, 32.


Referring to FIG. 5C, the number stored in register R6 indicates the position of a remove pointer 96 in the transmit FIFO buffer 60. For an embodiment in which the transmit FIFO buffer 60 has sixteen entries, the position of the remove pointer is represented as a 4-bit number.


Since the FBI 38 transmits 64-byte data packets from the buffer 60 according to a FIFO scheme, the remove pointer 96 indicates which data packets are scheduled but not transmitted. The position of the pointer 96 can be used to determine which MAC ports 28, 30, 32 have been scheduled to receive a data packet but have not yet received a data packet. Such ports 28, 30, 32 may have status data in registers R4, R5 indicating an availability to receive a data packet even though the available space has already been assigned to a waiting data packet.


The transmit scheduler thread can use the position of the remove pointer 96 to interpret transmit-ready status data of the registers R4, R5. From the position of the remove pointer 96, the transmit scheduler thread identifies MAC ports 28, 30, 32 already scheduled to receive a data packet. The transmit scheduler thread does not schedule a new data packet for such ports, because the waiting and already scheduled data packet may take the available space therein.


In the parallel processor 12, the collection of ready status data is asynchronous with respect to scheduling of data packet transfers. The asynchronous relationship enables both the collection of ready status data and the scheduling of data packets to have higher effective bandwidths. The asynchronous relationship also introduces some unpredictability into latencies associated with the transfer of newly collected ready status data to scheduler threads.


Referring to FIG. 6, a process 100 by which the FBI 38 provides ready status data to the scheduler threads is shown. The FBI 38 performs 102 a collection cycle in which new ready status data is obtained from the MAC devices 14, 14′, 14″ interactively via the ready bus 42. In response to completing the collection cycle, the FBI 38 performs an unsolicited transfer 104 of the newly collected ready status data to the input transfer registers 78a-78f assigned to the scheduler threads. In an unsolicited data transfer, the destination device for the transfer does not request the transfer. The transfer of ready status data from the FBI 38 to destination processing engines 22a-22f and scheduling threads proceeds without any request from the processing engines 22a-22f. Instead, the FBI 38 automatically performs the transfer in response to finishing a collection cycle for the ready status data. The completion of each collection cycle causes issuance of a command to the push engine 62, which transfers the ready bus data to the processing engines 22a-22f. After completing the transfer, the FBI 38 loops back 106 to collect new ready status data.


Making transfers of new ready status data unsolicited lowers latencies for delivering such data to scheduler threads. Since latencies in delivering such data can cause scheduling errors, making the transfer of ready status data unsolicited can lower numbers of occurrences of scheduling errors.


Referring to FIG. 7, a process 110 by which the FBI 38 collects ready status data is shown. Separate collection cycles are performed to collect receive-ready status data and to collect transmit-ready status data. Each collection cycle also initiates an unsolicited transfer of at least a portion of the collected ready status data to the processing engines 22a-22f.


To start a new collection cycle, the control module 50 for the ready bus 42 selects 112 the addresses to be polled for ready status data. The selection may be for all addresses of the MAC ports 28, 30, 32 connected to the FIFO bus 16 or for a sub-range of the addresses. If a sub-range is selected, the collection of new ready status data spans several cycles, a portion of the MAC ports 28, 30, 32 being polled in each cycle. The sub-range polled in collection cycles may be programmed into the processor core 44 or the FBI 38.


The control module 50 polls 114 by sending status queries over the ready bus 42 to the selected ports 28, 30, 32 of the MAC devices 14, 14′, 14″. In response to the queries, the control module 50 receives 116 new ready status data from the polled ports 28, 30, 32. A response to a query for receive-ready status data indicates whether the responding port 28, 30, 32 has a data packet ready to transmit. A response to a query for transmit-ready status indicates whether the responding port 28, 30, 32 has space available to receive another data packet.


The control module 50 writes 118 new ready status data, which has been from the responses, to the status registers R1, R2, R4, R5, shown in FIGS. 5A-5B. The control module 50 also increments 120 the counter value in status register R3. Incrementing the counter value updates the time stamp associated with the newly collected ready status data. After updating the time stamp, the FBI 38 performs an unsolicited transfer of the newly collected ready status data to the scheduler threads located in processing engines 22a-22f.


The FBI 38 transmits 126 data packets from the transmit FIFO buffer 60 asynchronously with respect to the collection of ready status data from the MAC devices 14, 14′, 14″. In response to each transmission, the FBI 38 advances 128 the remove pointer 96 of the transmit FIFO buffer 60 and writes 130 the new position of the remove pointer 96 to status register R6. The number stored in the status register R6 reflects the present position of the remove pointer 96 of the transmit FIFO buffer 60.


Referring to FIG. 8, a process 140 by which the FBI 38 transfers receive-ready and transmit-ready status data to the respective receive and transmit scheduler threads is shown. The FBI 36 transfers the ready status data via the S bus 39 when the S bus 39 is not being used for communications with the SRAM controller 34.


Completion of a collection cycle enables 142 the push engine 62 to transfer ready status data from the status registers 54 to the appropriate execution threads, i.e., scheduler threads. The push engine 62 reads 144 both a value for the number of the status registers R1-R3 or R4-R6 to be transferred and the identity of the target scheduler thread. One, two, or three status registers may be transferred in one cycle. The count and identity of the scheduler threads, i.e., for both the thread and the associated processing engine 22a-22f, are stored in control registers 52.


Transfers of 1, 2 or 3 of the status registers R1-R6 write to the 1, 2 or 3 lowest consecutive input transfer registers 78a-78f assigned to the target scheduler thread. But, the transfers may also alternate targeting of the input transfer registers 78a-78f. To alternate targets, the push engine 62 sends consecutive transfers to different input transfer registers 78a-78f assigned to the same scheduler thread. For example, a first transfer of two of the status registers R1-R3 could be written to the two lowest input transfer registers, and the next transfer would then be written to the two next-lowest input transfer registers. From the count and alternate-select status, the push engine 62 determines 146 which input transfer registers 78a-78f to write during the transfer.


The push engine 62 transmits 148 a transfer protect control signal to the target input transfer registers 78a-78f. The transfer protect signal protects the target transfer registers 78a-78f against read-write conflicts during transfers. The transfer protect signal blocks reads of the registers 78a-78f by the associated scheduler threads. While protected from such reads, the push engine 62 writes 150 the new ready status data to the input transfer registers 78a-78f.


After completing a transfer of ready status data, the push engine 62 stops 152 transmitting the transfer protect signal. When the protect signal is no longer asserted, the scheduler threads can read the input transfer registers 78a-78f. The scheduler threads reads the ready status data from the input transfer registers 78a-78f in the order written to avoid other read-write conflicts.


Referring to FIG. 9, a process 160 that performs data transfers responsive to ready status data is shown. To schedule a transfer, the appropriate scheduler thread determines 162 which MAC ports 28, 30, 32 are available from the values of the new ready status data. For the available ports 28, 30, 32, the scheduling thread selects 164 an available execution thread to handle the data transfer and signals the selected thread. The selected thread and FBI 38 perform the scheduled data transfer 166 the scheduled data transfer.


For receive-ready status data, the scheduler thread also compares the time stamp of the status data to the time-stamp of time stamps of previous receive-ready status data. If the time stamp has an old value the ready status data is stale, and the receive scheduler thread stops without scheduling data transfers. Otherwise, the receive scheduler thread proceeds as described above.


For transmit-ready status data, the scheduler thread uses present values of the remove pointer 96 to determine whether any of the available ports are already scheduled to receive a data packet. Any such devices are not scheduled for another data transmission.


While various embodiments have been described in the detailed description, the description is intended to illustrate and not to limit the scope of the invention, which is defined by the appended claims. Other aspects, advantages, and modifications are within the scope of the claims.

Claims
  • 1. A processor, comprising: a module configured to collect status data from media access devices connected to a bus, the status data indicating readiness of the media access devices to participate in data transfers, the status data comprising data indicating whether a one of the media access devices has received packet data;one or more processing engines to schedule transfers of packet data; anda push engine to perform unsolicited transfers of the status data to the processing engines in response to the module collecting new status data.
  • 2. The processor of claim 1, wherein the processing engines comprise: one or more input transfer registers to receive the unsolicited transfers of status data for use to schedule the transfers of packet data.
  • 3. The processor of claim 2, wherein the processing engines use a portion of received new status data to schedule retrievals of packet data from the media access devices.
  • 4. The processor of claim 2, wherein the processing engines use a portion of the received status data to schedule transmissions of packet data.
  • 5. The processor of claim 4, wherein the processing engines use a portion of the received status data to determine whether scheduled transmissions of packet data have been completed.
  • 6. The processor of claim 2, wherein a portion of the status data are flags indicative of whether associated media access devices have packet data to transmit.
  • 7. The processor of claim 2, wherein a portion of the status data includes flags indicative of whether associated media access devices have space to receive packet data.
  • 8. The processor of claim 1, wherein the module is configured to poll the media access devices for the status data over a second bus.
  • 9. The processor of claim 1 in which the processing engines schedule the transfer of data packets independently of the module collecting status data from the media access devices.
  • 10. The processor of claim 9 in which the processing engines schedule the transfer of data packets from a device to the bus independently of the readiness of other devices to receive the data, and schedule the transfer of data from the bus to a device independently of the readiness other devices to send the data.
  • 11. A method of transferring data packets over a bus, comprising: collecting information on readiness of media access devices connected to the bus to one of transmit and receive data packets; andtransferring a portion of the collected information to a processing engine configured to schedule data transfers, the transferring being unsolicited by the processing engine.
  • 12. The method of claim 11, further comprising: scheduling data transfers with a portion of the media access devices based on the transferred portion of the collected information.
  • 13. The method of claim 12, wherein scheduling further includes: determining whether the transferred information is at least partly new; andwherein the scheduling is performed in response to the transferred information being at least partly new.
  • 14. The method of claim 12, wherein scheduling further comprises: determining whether an earlier scheduled data transfer have been completed from the transferred information.
  • 15. The method of claim 12, wherein collecting further comprises: polling the media access devices for ready status data on the availability of ports thereon; andreceiving ready status data associated with individual ones of the devices in response to the polling.
  • 16. The method of claim 12, wherein determining includes comparing a value of a time stamp transferred with the information to a previous value of the time stamp.
  • 17. The method of claim 16, wherein collecting further comprises: writing the received ready status data to a status register; andscheduling transfers of data packets over the bus in response to the transferred portion of the ready status data.
  • 18. The method of claim 11, wherein the transferred portion of the information includes flags that indicate whether associated ports of the devices have one of space to receive data packets and data packets ready to transmit over the bus.
  • 19. The method of claim 18, further comprising: polling the ports of the devices over a second bus to determine values of the flags.
  • 20. An article comprising a computer-readable medium which stores executable instructions for transferring data packets over a bus, the instructions causing a processor to: collect information on readiness of media access devices connected to the bus to one of transmit and receive data packets; andtransfer a portion of the collected information to a processing engine configured to schedule data transfers, the transferring being unsolicited by the processing engine.
  • 21. The article of claim 20, the instructions further causing the processor to: schedule data transfers with a portion of the devices based on the transferred portion of the collected information.
  • 22. The article of claim 21, the instructions further causing the processor to: determine whether the transferred information is at least partly new; andwherein instructions causing the processor to schedule are performed in response to determining that the transferred information being at least partly new.
US Referenced Citations (400)
Number Name Date Kind
3373408 Ling Mar 1968 A
3478322 Evans Nov 1969 A
3623001 Kleist et al. Nov 1971 A
3736566 Anderson et al. May 1973 A
3792441 Wymore et al. Feb 1974 A
3889243 Drimak Jun 1975 A
3940745 Sajeva Feb 1976 A
4016548 Law et al. Apr 1977 A
4032899 Jenny et al. Jun 1977 A
4075691 Davis et al. Feb 1978 A
4130890 Adam Dec 1978 A
4400770 Chan et al. Aug 1983 A
4514807 Nogi Apr 1985 A
4523272 Fukunaga et al. Jun 1985 A
4658351 Teng Apr 1987 A
4709347 Kirk Nov 1987 A
4745544 Renner et al. May 1988 A
4788640 Hansen Nov 1988 A
4831358 Ferrio et al. May 1989 A
4858108 Ogawa et al. Aug 1989 A
4866664 Burkhardt, Jr. et al. Sep 1989 A
4890218 Bram Dec 1989 A
4890222 Kirk Dec 1989 A
4991112 Callemyn Feb 1991 A
5115507 Callemyn May 1992 A
5140685 Sipple et al. Aug 1992 A
5142683 Burkhardt, Jr. et al. Aug 1992 A
5155831 Emma et al. Oct 1992 A
5155854 Flynn et al. Oct 1992 A
5168555 Byers et al. Dec 1992 A
5173897 Schrodi et al. Dec 1992 A
5202987 Bayer et al. Apr 1993 A
5251205 Callon et al. Oct 1993 A
5255239 Taborn et al. Oct 1993 A
5263169 Genusov et al. Nov 1993 A
5313454 Bustini et al. May 1994 A
5347648 Stamm et al. Sep 1994 A
5367678 Lee et al. Nov 1994 A
5379295 Yonehara Jan 1995 A
5379432 Orton et al. Jan 1995 A
5390329 Gaertner et al. Feb 1995 A
5392391 Caulk, Jr. et al. Feb 1995 A
5392411 Ozaki Feb 1995 A
5392412 McKenna Feb 1995 A
5404464 Bennett Apr 1995 A
5404469 Chung et al. Apr 1995 A
5404482 Stamm et al. Apr 1995 A
5432918 Stamm Jul 1995 A
5448702 Garcia, Jr. et al. Sep 1995 A
5450351 Heddes Sep 1995 A
5452437 Richey et al. Sep 1995 A
5452452 Gaetner et al. Sep 1995 A
5459842 Begun et al. Oct 1995 A
5459843 Davis et al. Oct 1995 A
5463625 Yasrebi Oct 1995 A
5467452 Blum et al. Nov 1995 A
5475856 Kogge Dec 1995 A
5485455 Dobbins et al. Jan 1996 A
5515296 Agarwal May 1996 A
5517648 Bertone et al. May 1996 A
5539737 Lo et al. Jul 1996 A
5542070 LeBlanc et al. Jul 1996 A
5542088 Jennings, Jr. et al. Jul 1996 A
5544236 Andruska et al. Aug 1996 A
5550816 Hardwick et al. Aug 1996 A
5557766 Takiguchi et al. Sep 1996 A
5568476 Sherer et al. Oct 1996 A
5568617 Kametani Oct 1996 A
5574922 James Nov 1996 A
5581729 Nishtala et al. Dec 1996 A
5592476 Calamvokis et al. Jan 1997 A
5592622 Isfeld et al. Jan 1997 A
5613071 Rankin et al. Mar 1997 A
5613136 Casavant et al. Mar 1997 A
5617327 Duncan Apr 1997 A
5623489 Cotton et al. Apr 1997 A
5625812 David Apr 1997 A
5627829 Gleeson et al. May 1997 A
5630074 Beltran May 1997 A
5630130 Perotto et al. May 1997 A
5633865 Short May 1997 A
5638531 Crump et al. Jun 1997 A
5644623 Gulledge Jul 1997 A
5649110 Ben-Nun et al. Jul 1997 A
5649157 Williams Jul 1997 A
5651002 Van Seters et al. Jul 1997 A
5659587 Kim et al. Aug 1997 A
5680641 Sidman Oct 1997 A
5689566 Nguyen Nov 1997 A
5692126 Templeton et al. Nov 1997 A
5699537 Sharangpani et al. Dec 1997 A
5701434 Nakagawa Dec 1997 A
5717898 Kagan et al. Feb 1998 A
5721870 Matsumoto Feb 1998 A
5724574 Stratigos et al. Mar 1998 A
5740402 Bratt et al. Apr 1998 A
5742587 Zornig et al. Apr 1998 A
5742782 Ito et al. Apr 1998 A
5742822 Motomura Apr 1998 A
5745913 Pattin et al. Apr 1998 A
5751987 Mahant-Shetti et al. May 1998 A
5754764 Davis et al. May 1998 A
5761507 Govett Jun 1998 A
5761522 Hisanga et al. Jun 1998 A
5764915 Heimsoth et al. Jun 1998 A
5768528 Stumm Jun 1998 A
5781551 Born Jul 1998 A
5781774 Krick Jul 1998 A
5784649 Begur et al. Jul 1998 A
5784712 Byers et al. Jul 1998 A
5796413 Shipp et al. Aug 1998 A
5797043 Lewis et al. Aug 1998 A
5805816 Picazo, Jr. et al. Sep 1998 A
5809235 Sharma et al. Sep 1998 A
5809237 Watts et al. Sep 1998 A
5809530 Samra et al. Sep 1998 A
5812868 Moyer et al. Sep 1998 A
5828746 Ardon Oct 1998 A
5828863 Barrett et al. Oct 1998 A
5828881 Wang Oct 1998 A
5828901 O'Toole et al. Oct 1998 A
5832215 Kato et al. Nov 1998 A
5835755 Stellwagen, Jr. Nov 1998 A
5838988 Panwar et al. Nov 1998 A
5850399 Ganmukhi et al. Dec 1998 A
5850530 Chen et al. Dec 1998 A
5854922 Gravenstein et al. Dec 1998 A
5857188 Douglas Jan 1999 A
5860138 Engebretsen et al. Jan 1999 A
5860158 Pai et al. Jan 1999 A
5886992 Raatikaien et al. Mar 1999 A
5887134 Ebrahim Mar 1999 A
5890208 Kwon Mar 1999 A
5892979 Shiraki et al. Apr 1999 A
5898686 Virgile Apr 1999 A
5898701 Johnson Apr 1999 A
5898885 Dickol et al. Apr 1999 A
5905876 Pawlowski et al. May 1999 A
5905889 Wilhelm, Jr. May 1999 A
5909686 Muller et al. Jun 1999 A
5915123 Mirsky et al. Jun 1999 A
5918235 Kirshenbaum et al. Jun 1999 A
5933627 Parady Aug 1999 A
5937187 Kosche et al. Aug 1999 A
5938736 Muller et al. Aug 1999 A
5940612 Brady et al. Aug 1999 A
5940866 Chisholm et al. Aug 1999 A
5946487 Dangelo Aug 1999 A
5948081 Foster Sep 1999 A
5953336 Moore et al. Sep 1999 A
5958031 Kime Sep 1999 A
5960210 Jin Sep 1999 A
5961628 Nguyen et al. Oct 1999 A
5968169 Pickett Oct 1999 A
5970013 Fischer et al. Oct 1999 A
5974518 Nogradi Oct 1999 A
5978838 Mohamed et al. Nov 1999 A
5983274 Hyder et al. Nov 1999 A
5995513 Harrand et al. Nov 1999 A
6012151 Mano Jan 2000 A
6014729 Lannan et al. Jan 2000 A
6023742 Ebeling et al. Feb 2000 A
6032190 Bremer et al. Feb 2000 A
6032218 Lewin et al. Feb 2000 A
6047002 Hartmann et al. Apr 2000 A
6049867 Eickemeyer et al. Apr 2000 A
6058168 Braband May 2000 A
6061710 Eickemeyer et al. May 2000 A
6067300 Baumert et al. May 2000 A
6067585 Hoang May 2000 A
6070231 Ottinger May 2000 A
6072781 Feeney et al. Jun 2000 A
6073215 Snyder Jun 2000 A
6079008 Clery, III Jun 2000 A
6085215 Ramakrishnan et al. Jul 2000 A
6085248 Sambamurthy et al. Jul 2000 A
6085294 Van Doren et al. Jul 2000 A
6092127 Tausheck Jul 2000 A
6092158 Harriman et al. Jul 2000 A
6104700 Haddock et al. Aug 2000 A
6111886 Stewart Aug 2000 A
6112016 MacWilliams et al. Aug 2000 A
6122251 Shinohara Sep 2000 A
6128669 Moriarty et al. Oct 2000 A
6134665 Klein et al. Oct 2000 A
6141677 Hanif et al. Oct 2000 A
6141689 Yasrebi Oct 2000 A
6141765 Sherman Oct 2000 A
6144669 Williams et al. Nov 2000 A
6145054 Mehrotra et al. Nov 2000 A
6157955 Narad et al. Dec 2000 A
6160562 Chin et al. Dec 2000 A
6170051 Dowling Jan 2001 B1
6175927 Cromer et al. Jan 2001 B1
6182177 Harriman Jan 2001 B1
6195676 Spix et al. Feb 2001 B1
6199133 Schnell Mar 2001 B1
6201807 Prasanna Mar 2001 B1
6212542 Kahle et al. Apr 2001 B1
6212544 Borkenhagen et al. Apr 2001 B1
6212604 Tremblay Apr 2001 B1
6212611 Nizar et al. Apr 2001 B1
6216220 Hwang Apr 2001 B1
6223207 Lucovsky et al. Apr 2001 B1
6223238 Meyer et al. Apr 2001 B1
6223243 Ueda et al. Apr 2001 B1
6223274 Catthoor et al. Apr 2001 B1
6223279 Nishimura et al. Apr 2001 B1
6226680 Boucher et al. May 2001 B1
6247025 Bacon Jun 2001 B1
6256713 Audityan et al. Jul 2001 B1
6269391 Gillespie Jul 2001 B1
6272109 Pei et al. Aug 2001 B1
6272520 Sharangpani et al. Aug 2001 B1
6272616 Fernando et al. Aug 2001 B1
6275505 O'Loughlin et al. Aug 2001 B1
6279113 Vaidya Aug 2001 B1
6282169 Kiremidjian Aug 2001 B1
6286083 Chin et al. Sep 2001 B1
6289011 Seo et al. Sep 2001 B1
6295600 Parady Sep 2001 B1
6298370 Tang et al. Oct 2001 B1
6307789 Wolrich et al. Oct 2001 B1
6311261 Chamdani et al. Oct 2001 B1
6320861 Adam et al. Nov 2001 B1
6324624 Wolrich et al. Nov 2001 B1
6335932 Kadambi et al. Jan 2002 B2
6338078 Chang et al. Jan 2002 B1
6345334 Nakagawa et al. Feb 2002 B1
6347344 Baker et al. Feb 2002 B1
6349331 Andra et al. Feb 2002 B1
6356962 Kasper Mar 2002 B1
6359911 Movshovich et al. Mar 2002 B1
6360262 Guenthner et al. Mar 2002 B1
6360277 Ruckley et al. Mar 2002 B1
6366998 Mohamed Apr 2002 B1
6373848 Allison et al. Apr 2002 B1
6377998 Noll et al. Apr 2002 B2
6389031 Chao et al. May 2002 B1
6389449 Nermirovsky et al. May 2002 B1
6393026 Irwin May 2002 B1
6393483 Latif et al. May 2002 B1
6404737 Novick et al. Jun 2002 B1
6415338 Habot Jul 2002 B1
6418488 Chilton et al. Jul 2002 B1
6424657 Voit et al. Jul 2002 B1
6424659 Viswanadham et al. Jul 2002 B2
6426940 Seo et al. Jul 2002 B1
6426943 Spinney et al. Jul 2002 B1
6427196 Adiletta et al. Jul 2002 B1
6430626 Witkowski et al. Aug 2002 B1
6434145 Opsasnick et al. Aug 2002 B1
6438132 Vincent et al. Aug 2002 B1
6438134 Chow et al. Aug 2002 B1
6448812 Bacigalupo Sep 2002 B1
6453404 Bereznyi et al. Sep 2002 B1
6457015 Eastham Sep 2002 B1
6463035 Moore Oct 2002 B1
6463072 Wolrich et al. Oct 2002 B1
6463480 Kikuchi et al. Oct 2002 B2
6463527 Vishkin Oct 2002 B1
6466898 Chan Oct 2002 B1
6477562 Nemirovsky et al. Nov 2002 B2
6484224 Robins et al. Nov 2002 B1
6493754 Rosborough et al. Dec 2002 B1
6501731 Chong et al. Dec 2002 B1
6507862 Joy et al. Jan 2003 B1
6522188 Poole Feb 2003 B1
6526451 Kasper Feb 2003 B2
6526452 Petersen et al. Feb 2003 B1
6529983 Marshall et al. Mar 2003 B1
6532509 Wolrich et al. Mar 2003 B1
6535878 Guedalia et al. Mar 2003 B1
6552826 Adler et al. Apr 2003 B2
6553406 Berger et al. Apr 2003 B1
6560667 Wolrich et al. May 2003 B1
6570850 Gutierrez et al. May 2003 B1
6577542 Wolrich et al. Jun 2003 B2
6584522 Wolrich et al. Jun 2003 B1
6587906 Wolrich et al. Jul 2003 B2
6604125 Belkin Aug 2003 B1
6606326 Herring Aug 2003 B1
6606704 Adiletta et al. Aug 2003 B1
6625654 Wolrich et al. Sep 2003 B1
6628668 Hutzli et al. Sep 2003 B1
6629147 Grow Sep 2003 B1
6629236 Aipperspach et al. Sep 2003 B1
6631422 Althaus et al. Oct 2003 B1
6631430 Wolrich et al. Oct 2003 B1
6631462 Wolrich et al. Oct 2003 B1
6657963 Paquette et al. Dec 2003 B1
6658551 Berenbaum et al. Dec 2003 B1
6661774 Lauffenburger et al. Dec 2003 B1
6661794 Wolrich et al. Dec 2003 B1
6665699 Hunter et al. Dec 2003 B1
6665755 Modelski et al. Dec 2003 B2
6667920 Wolrich et al. Dec 2003 B2
6668317 Bernstein et al. Dec 2003 B1
6671827 Guilford et al. Dec 2003 B2
6675190 Schabernack et al. Jan 2004 B1
6675192 Emer et al. Jan 2004 B2
6678746 Russell et al. Jan 2004 B1
6680933 Cheesman et al. Jan 2004 B1
6681300 Wolrich et al. Jan 2004 B2
6684326 Cromer et al. Jan 2004 B1
6694380 Wolrich et al. Feb 2004 B1
6697379 Jacquet et al. Feb 2004 B1
6721325 Duckering et al. Apr 2004 B1
6724767 Chong et al. Apr 2004 B1
6728845 Adiletta et al. Apr 2004 B2
6732187 Lougheed et al. May 2004 B1
6754211 Brown Jun 2004 B1
6754222 Joung et al. Jun 2004 B1
6768717 Reynolds et al. Jul 2004 B1
6775284 Calvignac et al. Aug 2004 B1
6792488 Wolrich et al. Sep 2004 B2
6798744 Loewen et al. Sep 2004 B1
6826615 Barrall et al. Nov 2004 B2
6834053 Stacey et al. Dec 2004 B1
6850521 Kadambi et al. Feb 2005 B1
6856622 Calamvokis et al. Feb 2005 B1
6873618 Weaver Mar 2005 B1
6876561 Wolrich et al. Apr 2005 B2
6895457 Wolrich et al. May 2005 B2
6925637 Thomas et al. Aug 2005 B2
6931641 Davis et al. Aug 2005 B1
6934780 Modelski et al. Aug 2005 B2
6934951 Wilkinson et al. Aug 2005 B2
6938147 Joy et al. Aug 2005 B1
6944850 Hooper et al. Sep 2005 B2
6947425 Hooper et al. Sep 2005 B1
6952824 Hooper et al. Oct 2005 B1
6959002 Wynne et al. Oct 2005 B2
6967963 Houh et al. Nov 2005 B1
6976095 Wolrich et al. Dec 2005 B1
6981077 Modelski et al. Dec 2005 B2
6983350 Wheeler et al. Jan 2006 B1
7006495 Hooper Feb 2006 B2
7065569 Teraslinna Jun 2006 B2
7069548 Kushlis Jun 2006 B2
7096277 Hooper Aug 2006 B2
7100102 Hooper et al. Aug 2006 B2
7111072 Matthews et al. Sep 2006 B1
7111296 Wolrich et al. Sep 2006 B2
7124196 Hooper Oct 2006 B2
7126952 Hooper et al. Oct 2006 B2
7149786 Bohringer et al. Dec 2006 B1
7181742 Hooper Feb 2007 B2
7191321 Bernstein et al. Mar 2007 B2
7206858 Hooper et al. Apr 2007 B2
7248584 Hooper Jul 2007 B2
7305500 Adiletta et al. Dec 2007 B2
7328289 Wolrich et al. Feb 2008 B2
7352769 Hooper et al. Apr 2008 B2
7424579 Wheeler et al. Sep 2008 B2
7433307 Hooper et al. Oct 2008 B2
7434221 Hooper et al. Oct 2008 B2
7443836 Hooper et al. Oct 2008 B2
20010023487 Kawamoto Sep 2001 A1
20020027448 Bacigalupo Mar 2002 A1
20020041520 Wolrich et al. Apr 2002 A1
20020075878 Lee et al. Jun 2002 A1
20020118692 Oberman et al. Aug 2002 A1
20020150047 Knight et al. Oct 2002 A1
20020181194 Ho et al. Dec 2002 A1
20030043803 Hooper Mar 2003 A1
20030067934 Hooper et al. Apr 2003 A1
20030086434 Kloth May 2003 A1
20030105901 Wolrich et al. Jun 2003 A1
20030105917 Ostler et al. Jun 2003 A1
20030110166 Wolrich et al. Jun 2003 A1
20030115347 Wolrich et al. Jun 2003 A1
20030115426 Rosenbluth et al. Jun 2003 A1
20030131198 Wolrich et al. Jul 2003 A1
20030140196 Wolrich et al. Jul 2003 A1
20030145159 Adiletta et al. Jul 2003 A1
20030147409 Wolrich et al. Aug 2003 A1
20030161303 Mehrvar et al. Aug 2003 A1
20030161337 Weinman, Jr. Aug 2003 A1
20030196012 Wolrich et al. Oct 2003 A1
20030210574 Wolrich et al. Nov 2003 A1
20030231635 Kalkunte et al. Dec 2003 A1
20040039895 Wolrich et al. Feb 2004 A1
20040052269 Hooper et al. Mar 2004 A1
20040054880 Bernstein et al. Mar 2004 A1
20040059828 Hooper et al. Mar 2004 A1
20040071152 Wolrich et al. Apr 2004 A1
20040073728 Wolrich et al. Apr 2004 A1
20040073778 Adiletta et al. Apr 2004 A1
20040085901 Hooper et al. May 2004 A1
20040098496 Wolrich et al. May 2004 A1
20040109369 Wolrich et al. Jun 2004 A1
20040148382 Narad et al. Jul 2004 A1
20040162933 Adiletta et al. Aug 2004 A1
20040252686 Hooper et al. Dec 2004 A1
20050033884 Wolrich et al. Feb 2005 A1
20050149665 Wolrich et al. Jul 2005 A1
20060007871 Welin Jan 2006 A1
20060069882 Wheeler et al. Mar 2006 A1
20060156303 Hooper et al. Jul 2006 A1
Foreign Referenced Citations (28)
Number Date Country
0 379 709 Aug 1990 EP
0 464 715 Jan 1992 EP
0 633 678 Jan 1995 EP
0 745 933 Dec 1996 EP
0 773 648 May 1997 EP
0 809 180 Nov 1997 EP
0 959 602 Nov 1999 EP
2327784 Feb 1999 GB
59111533 Jun 1984 JP
WO 9415287 Jul 1994 WO
WO 9738372 Oct 1997 WO
WO 9820647 May 1998 WO
WO 9909469 Feb 1999 WO
WO 0038376 Jun 2000 WO
WO 0056024 Sep 2000 WO
WO 0115718 Mar 2001 WO
WO 0116718 Mar 2001 WO
WO 0116769 Mar 2001 WO
WO 0116770 Mar 2001 WO
WO 0116782 Mar 2001 WO
WO 0117179 Mar 2001 WO
WO 0131856 May 2001 WO
WO 0148596 Jul 2001 WO
WO 0148606 Jul 2001 WO
WO 0148619 Jul 2001 WO
WO 0150247 Jul 2001 WO
WO 0150679 Jul 2001 WO
WO 03030461 Apr 2003 WO