Multithreaded microprocessor with register allocation based on number of active threads

Information

  • Patent Grant
  • 7487505
  • Patent Number
    7,487,505
  • Date Filed
    Monday, August 5, 2002
    22 years ago
  • Date Issued
    Tuesday, February 3, 2009
    15 years ago
Abstract
A mechanism in a multithreaded processor to allocate resources based on configuration information indicating how many threads are in use.
Description
BACKGROUND

Typically, hardware implementations of multithreaded microprocessors provide for use by each thread a fixed number of resources, such as registers, program counters, and so forth. Depending on the amount of parallelism in an application program executing on the microprocessor, some of the threads may not be used. Consequently, the resources of the unused threads and, more specifically, the power and silicon area consumed by those resources, are wasted.





DESCRIPTION OF DRAWINGS


FIG. 1 shows a block diagram of a communication system employing a processor having multithreaded microengines to support multiple threads of execution.



FIG. 2 shows a block diagram of the microengine (of FIG. 1).



FIG. 3 shows a microengine Control and Status Register (CSR) used to select a number of “in use” threads.



FIG. 4 shows a schematic diagram of a dual-bank implementation of a General Purpose Registers (GPR) file (of the microengine of FIG. 2) that uses a selected number of “in use” threads to allocate registers to threads.



FIG. 5 shows a table of thread GPR allocations for eight “in use” threads and four “in use” threads.



FIGS. 6A and 6B show the partition of registers in the GPR file in accordance with the thread GPR allocations for eight “in use” threads and four “in use” threads, respectively.





DETAILED DESCRIPTION

Referring to FIG. 1, a communication system 10 includes a processor 12 coupled to one or more I/O devices, for example, network devices 14 and 16, as well as a memory system 18. The processor 12 is multi-threaded processor and, as such, is especially useful for tasks that can be broken into parallel subtasks or functions. In one embodiment, as shown in the figure, the processor 12 includes multiple microengines 20, each with multiple hardware controlled program threads 22 that can be simultaneously active and independently work on a task. In the example shown, there are “n” microengines 20, and each of the microengines 20 is capable of processing multiple program threads 22, as will be described more fully below. In the described embodiment, the maximum number “N” of context threads supported is eight, but other maximum amount could be provided. Preferably, each of the microengines 20 is connected to and can communicate with adjacent microengines.


The processor 12 also includes a processor 24 that assists in loading microcode control for other resources of the processor 12 and performs other general-purpose computer type functions such as handling protocols and exceptions. In network processing applications, the processor 24 can also provide support for higher layer network processing tasks that cannot be handled by the microengines 20. In one embodiment, the processor 24 is a StrongARM (ARM is a trademark of ARM Limited, United Kingdom) core based architecture. The processor (or core) 24 has an operating system through which the processor 24 can call functions to operate on the microengines 20. The processor 24 can use any supported operating system, preferably a real-time operating system. Other processor architectures may be used.


The microengines 20 each operate with shared resources including the memory system 18, a PCI bus interface 26, an I/O interface 28, a hash unit 30 and a scratchpad memory 32. The PCI bus interface 26 provides an interface to a PCI bus (not shown). The I/O interface 28 is responsible for controlling and interfacing the processor 12 to the network devices 14, 16. The memory system 18 includes a Dynamic Random Access Memory (DRAM) 34, which is accessed using a DRAM controller 36 and a Static Random Access Memory (SRAM) 38, which is accessed using an SRAM controller 40. Although not shown, the processor 12 also would include a nonvolatile memory to support boot operations. The DRAM 34 and DRAM controller 36 are typically used for processing large volumes of data, e.g., processing of payloads from network packets. In a networking implementation, the SRAM 38 and SRAM controller 40 are used for low latency, fast access tasks, e.g., accessing look-up tables, memory for the processor 24, and so forth. The microengines 20 can execute memory reference instructions to either the DRAM controller 36 or the SRAM controller 40.


The devices 14 and 16 can be any network devices capable of transmitting and/or receiving network traffic data, such as framing/MAC devices, e.g., for connecting to 10/100BaseT Ethernet, Gigabit Ethernet, ATM or other types of networks, or devices for connecting to a switch fabric. For example, in one arrangement, the network device 14 could be an Ethernet MAC device (connected to an Ethernet network, not shown) that transmits packet data to the processor 12 and device 16 could be a switch fabric device that receives processed packet data from processor 12 for transmission onto a switch fabric. In such an implementation, that is, when handling traffic to be sent to a switch fabric, the processor 12 would be acting as an ingress network processor. Alternatively, the processor 12 could operate as an egress network processor, handling traffic that is received from a switch fabric (via device 16) and destined for another network device such as network device 14, or network coupled to such device. Although the processor 12 can operate in a standalone mode, supporting both traffic directions, it will be understood that, to achieve higher performance, it may be desirable to use two dedicated processors, one as an ingress processor and the other as an egress processor. The two dedicated processors would each be coupled to the devices 14 and 16. In addition, each network device 14, 16 can include a plurality of ports to be serviced by the processor 12. The I/O interface 28 therefore supports one or more types of interfaces, such as an interface for packet and cell transfer between a PHY device and a higher protocol layer (e.g., link layer), or an interface between a traffic manager and a switch fabric for Asynchronous Transfer Mode (ATM), Internet Protocol (IP), Ethernet, and similar data communications applications. The I/O interface 28 includes separate receive and transmit blocks, each being separately configurable for a particular interface supported by the processor 12.


Other devices, such as a host computer and/or PCI peripherals (not shown), which may be coupled to a PCI bus controlled by the PC interface 26 are also serviced by the processor 12.


In general, as a network processor, the processor 12 can interface to any type of communication device or interface that receives/sends large amounts of data. The processor 12 functioning as a network processor could receive units of packet data from a network device like network device 14 and process those units of packet data in a parallel manner, as will be described. The unit of packet data could include an entire network packet (e.g., Ethernet packet) or a portion of such a packet, e.g., a cell or packet segment.


Each of the functional units of the processor 12 is coupled to an internal bus structure 42. Memory busses 44a, 44b couple the memory controllers 36 and 40, respectively, to respective memory units DRAM 34 and SRAM 38 of the memory system 18. The I/O Interface 28 is coupled to the devices 14 and 16 via separate I/O bus lines 46a and 46b, respectively.


Referring to FIG. 2, an exemplary one of the microengines 20 is shown. The microengine (ME) 20 includes a control unit 50 that includes a control store 51, control logic (or microcontroller) 52 and a context arbiter/event logic 53. The control store 51 is used to store a microprogram. The microprogram is loadable by the processor 24.


The microcontroller 52 includes an instruction decoder and program counter units for each of supported threads. The The context arbiter/event logic 53 receives messages (e.g., SRAM event response) from each one of the share resources, e.g., SRAM 38, DRAM 34, or processor core 24, and so forth. These messages provides information on whether a requested function has completed.


The context arbiter/event logic 53 has arbitration for the eight threads. In one embodiment, the arbitration is a round robin mechanism. However, other arbitration techniques, such as priority queuing or weighted fair queuing, could be used.


The microengine 20 also includes an execution datapath 54 and a general purpose register (GPR) file unit 56 that is coupled to the control unit 50. The datapath 54 includes several datapath elements, e.g., and as shown, a first datapath element 58, a second datapath element 59 and a third datapath element 60. The datapath elements can include, for example, an ALU and a multiplier. The GPR file unit 56 provides operands to the various datapath elements. The registers of the GPR file unit 56 are read and written exclusively under program control. GPRs, when used as a source in an instruction, supply operands to the datapath 54. When use as a destination in an instruction, they are written with the result of the datapath 54. The instruction specifies the register number of the specific GPRs that are selected for a source or destination. Opcode bits in the instruction provided by the control unit 50 select which datapath element is to perform the operation defined by the instruction.


The microengine 20 further includes a write transfer register file 62 and a read transfer register file 64. The write transfer register file 62 stores data to be written to a resource external to the microengine (for example, the DRAM memory or SRAM memory). The read transfer register file 64 is used for storing return data from a resource external to the microengine 20. Subsequent to or concurrent with the data arrival, event signals 65 from the respective shared resource, e.g., memory controllers 36, 40, or core 24, can be provided to alert the thread that requested the data that the data is available or has been sent. Both of the transfer register files 62, 64 are connected to the datapath 54, the GPR file unit 56, as well as the control unit 50.


Also included in the microengine 20 is a local memory 66. The local memory 66, which is addressed by registers 68a, 68b, also supplies operands to the datapath 54. The local memory 66 receives results from the datapath 54 as a destination. The microengine 20 also includes local control and status registers (CSRs) 70 for storing local inter-thread and global event signaling information, as well as other information, and a CRC unit 72, coupled to the transfer registers, which operates in parallel with the execution datapath 54 and performs CRC computations for ATM cells. The local CSRs 70 and the CRC unit 72 are coupled to the transfer registers, the datapath 54 and the GPR file unit 56.


In addition to providing an output to the write transfer unit 62, the datapath 54 can also provide an output to the GPR file 56 over line 80. Thus, each of the datapath elements can return a result value from an executed.


The functionality of the microengine threads 22 is determined by microcode loaded (via the core processor 24) for a particular user's application into each microengine's control store 51. For example, in one exemplary thread task assignment, one thread is assigned to serve as a receive scheduler thread and another as a transmit scheduler thread, a plurality of threads are configured as receive processing threads and transmit processing threads, and other thread task assignments include a transmit arbiter and one or more core communication threads. Once launched, a thread performs its function independently.


Referring to FIG. 3, the CSRs 70 include a context enable register (“CTX_Enable”) 90, which includes an “in use” contexts field 92 to indicate a pre-selected number of threads or contexts in use. The “in use” contexts field 92 stores a single bit, which when cleared (X=0) indicates all of the 8 available threads are in use, and which when set (X=1) indicates that only a predefined number, e.g., 4, more specifically, threads 0, 2, 4 and 6, are in use.


As shown in FIG. 4, the GPRs of the GPR file unit 56 may be physically and logically contained in two banks, an A bank 56a and a B bank 56b. The GPRs in both banks include a data portion 100 and an address portion 102. Coupled to each register address path 102 is a multiplexor 104, which receives as inputs a thread number 104 and register number 106 (from the instruction) from the control unit 50. The output of the multiplexor 104, that is, the form of the “address” provided to the address path 102 to select one of the registers 109, is controlled by an enable signal 110. The state of the enable signal 110 is determined by the setting of the “In_Use” Contexts bit in the field 92 of the CTX_Enable register 90.


Conventionally, each thread has a fixed percentage of the registers allocated to it, for example, one-eighth for the case of eight threads supported. If some threads are not used, the registers dedicated for use by those unused threads go unused as well.


In contrast, the use of the multiplexor 104 controlled by “in use” contexts configuration information in the CTX_Enable CSR 90 enables a re-partitioning of the number of bits of active thread number/instruction (register number) bits in the register address and therefore a re-allocation of registers to threads. More specifically, when the bit in field 92 is equal to a “0”, the number of “in use” threads is 8, and the enable 110 controls the multiplexor 104 to select all of the bits of the active thread number 106 and all but the most significant bit from the register number 108 specified by the current instruction. Conversely, when the bit in field 92 is set to a “1”, the number of “in use” threads is reduced by half, and the number of registers available for allocation is redistributed so that the number of registers allocated per thread is doubled.



FIG. 5 shows the thread allocation for a register file of 32 registers. For 8 threads, thread numbers 0 through 7, each thread is allocated a total of four registers. For 4 threads, thread numbers 0, 2, 4 and 6, each thread is allocated a total of eight registers.



FIGS. 6A and 6B show a register file (single bank, for example, register file 56a) having 32 registers available for thread allocation and re-allocation among a maximum of eight supported threads. In an 8-thread configuration 120, that is, the case of eight threads in use, shown in FIG. 6A, each of the threads is allocated four registers. The multiplexor 104 selects all three bits of the binary representation of the thread number and all bits except the most significant bit (that is, selects two bits (bits 0 and 1)) of the binary representation of the register number from the instruction because the enable 110 is low. For a 4-thread configuration 122, that is, when enable 110 is high and thus four threads, as illustrated in FIG. 6B, each of the four threads is allocated eight registers. The multiplexor 104 selects all but the least significant bit (in this case, selects two bits, bits 1 and 2) of the binary representation of the thread number and selects all three bits (bits 0-2) of the binary representation of the register number from the instruction. Thus, the address into the register file is a concatenation of bits of the currently active thread number with bits of the register number from the instruction, and the contributing number of bits from each is determined by the setting of the In_Use contexts bit 92 in the CTX_Enable register 90 (from FIG. 3).


Thus, the GPRs are logically subdivided in equal regions such that each context has relative access to one of the regions. The number of regions is configured in the In_Use contexts field 92, and can be either 4 or 8. Thus, a context-relative register number is actually associated with multiple different physical registers. The actual register to be accessed is determined by the context making the access request, that is, the context number concatenated with the register number, in the manner described above. Context-relative addressing is a powerful feature that enables eight or four different threads to share the same code image, yet maintain separate data. Thus, instructions specify the context-relative address (register number). For eight active contexts, the instruction always specifies registers in the range of 0-3. For four active contexts, the instruction always specifies registers in the range of 0-7.


Referring back to the table shown in FIG. 4, the absolute GPR register number is the register number that is actually used by the register address path (decode logic) to access the specific context-relative register. For example, with 8 active contexts, context-relative thread 0 for context (or thread) 2 is 8.


The above thread GPR allocation scheme can be extended to different numbers of threads (based on multiples of 2) and registers, for example, re-allocating a total of 128 registers from among a maximum number of 8 “in use” threads (16 registers each) to 4 “in use” threads (32 registers each), or re-allocating a total of 128 registers from among a maximum number of 16 “in use” threads (8 registers each) to 8 “in use” threads (16 registers each).


Other embodiments are within the scope of the following claims.

Claims
  • 1. A computer implemented method for dynamically partitioning registers to threads currently in use, the method comprising: determining a number of threads that are currently executing in a multithreaded processor, and storing an indication of said number of threads that are in use, as a context indication; andallocating a number of registers within said multithreaded processor based on said context indication, said allocating based on a first number of threads and a second number of threads greater than said first number of threads, and allocating such that for said first number of threads, the registers are grouped into a first grouping of registers with groups having a first number of registers per group, and for said second number of threads, the registers are grouped into a second grouping of registers, where said second grouping of registers has half the number of registers per group as compared with said first grouping of registers, but has double the number of groups as compared with said first grouping of registers.
  • 2. The method of claim 1, wherein the storing comprises storing at least one configuration bit in a control and status register.
  • 3. The method of claim 1, the allocating comprising allocating the number of registers in a general purpose register file which includes an address decode portion and a multiplexor coupled to the address decode portion, the multiplexor to receive a thread number and a register number as inputs and to select bits of the thread number and the register number based on the context indication to form an address corresponding to one of the registers.
  • 4. The method of claim 3 wherein the context indication indicates selection of all but the least signification bit of the thread number and all bits of the register number.
  • 5. The method of claim 3 wherein the context indication indicates selection of all but the most significant bit of the register number and all bits of the thread number.
  • 6. The method of claim 3 wherein the selected bits of the register number form a thread-relative register number.
  • 7. A method as in claim 1, wherein said storing uses a single-bit context field within a context enable register, and wherein the single-bit context field indicates, in a first state, that more than a preselected number of threads are in use and, in a second state, indicates that the number of threads in use is less than or equal to the preselected number of threads.
  • 8. A processor configured to dynamically partition registers to threads currently in use, the processor comprising: a plurality of registers;a storage location, which stores an indication of a number of threads that are currently executing in the processor reflecting the number of threads that are in use; anda resource selector, which allocates said registers among said threads based on the indication of the number of threads that are in use, wherein said registers are grouped into X regions, each of the X regions having Y registers grouped therein, and when more than a preselected number of threads are in use, X is doubled and Y is halved.
  • 9. The processor of claim 8, wherein the indication of the number of threads that are in use is a single bit, which in a first state indicates that more than the preselected number of threads are in use and in a second state indicates that the number of threads in use is less than or equal to the preselected number.
  • 10. The processor of claim 9, further comprising a control and status register comprising the storage location.
  • 11. The processor of claim 9, wherein the plurality of registers comprises a general purpose register file which includes an address decode portion, and the resource selector is a multiplexor coupled to the address decode portion, the multiplexor to receive a thread number and a register number as inputs and to select bits of the thread number and the register number based on the indication of the number of threads that are in use to form an address corresponding to one of the registers.
  • 12. The processor of claim 11 wherein the indication of the number of threads that are in use indicates selection of all but the least signification bit of the thread number and all bits of the register number.
  • 13. The processor of claim 11 wherein the indication of the number of threads that are in use indicates selection of all but the most significant bit of the register number and all bits of the thread number.
  • 14. The processor of claim 11 wherein the selected bits of the register number form a thread-relative register number.
  • 15. A system for dynamically partitioning registers to threads currently in use, the system comprising: a network device;a memory system; anda processor comprising:a plurality of registers,a storage location, which stores an indication of a number of threads that are currently executing in the processor reflecting the number of threads that are in use, anda resource selector, which allocates said registers among said threads based on the indication of the number of threads that are in use, wherein said registers are grouped into X regions, each of the X regions having Y registers grouped therein, and when more than a preselected number of threads are in use, X is doubled and Y is halved.
  • 16. The system of claim 15, wherein the indication of the number of threads that are in use is a single bit, which in a first state indicates that more than the preselected number of threads are in use and in a second state indicates that the number of threads in use is less than or equal to the preselected number.
  • 17. The system of claim 16, the processor further comprising a control and status register comprising the storage location.
  • 18. The system of claim 16, wherein the plurality of registers comprises a general purpose register file which includes an address decode portion, and the resource selector is a multiplexor coupled to the address decode portion, the multiplexor to receive a thread number and a register number as inputs and to select bits of the thread number and the register number based on the indication of the number of threads that are in use to form an address corresponding to one of the registers.
  • 19. The system of claim 18 wherein the indication of the number of threads that are in use indicates selection of all but the least signification bit of the thread number and all bits of the register number.
  • 20. The system of claim 18 wherein the indication of the number of threads that are in use indicates selection of all but the most significant bit of the register number and all bits of the thread number.
  • 21. The system of claim 18 wherein the selected bits of the register number form a thread-relative register number.
CROSS REFERENCE TO RELATED APPLICATIONS

This application claims priority from U.S. Provisional Patent Application Ser. No. 60/315,144, filed Aug. 27, 2001.

US Referenced Citations (327)
Number Name Date Kind
3373408 Ling Mar 1968 A
3478322 Evans Nov 1969 A
3792441 Wymore et al. Feb 1974 A
3881173 Larsen et al. Apr 1975 A
3913074 Homberg et al. Oct 1975 A
3940745 Sajeva Feb 1976 A
4023023 Bourrez et al. May 1977 A
4045782 Anderson et al. Aug 1977 A
4130890 Adam Dec 1978 A
4189767 Ahuja Feb 1980 A
4392758 Bowles et al. Jul 1983 A
4400770 Chan et al. Aug 1983 A
4514807 Nogi Apr 1985 A
4523272 Fukunaga et al. Jun 1985 A
4569016 Hao et al. Feb 1986 A
4724521 Carron et al. Feb 1988 A
4742451 Bruckert et al. May 1988 A
4745544 Renner et al. May 1988 A
4777587 Case et al. Oct 1988 A
4833657 Tanaka May 1989 A
4866664 Burkhardt, Jr. et al. Sep 1989 A
4868735 Moller et al. Sep 1989 A
4992934 Portanova et al. Feb 1991 A
5008808 Fries et al. Apr 1991 A
5073864 Methvin et al. Dec 1991 A
5113516 Johnson May 1992 A
5140685 Sipple et al. Aug 1992 A
5142676 Fried 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
5165025 Lass Nov 1992 A
5166872 Weaver et al. Nov 1992 A
5168555 Byers et al. Dec 1992 A
5173897 Schrodi et al. Dec 1992 A
5247671 Adkins et al. Sep 1993 A
5255239 Taborn et al. Oct 1993 A
5263169 Genusov et al. Nov 1993 A
5274770 Yeoh et al. Dec 1993 A
5347648 Stamm et al. Sep 1994 A
5357617 Davis et al. Oct 1994 A
5363448 Koopman, Jr. et al. Nov 1994 A
5367678 Lee et al. Nov 1994 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
5404482 Stamm et al. Apr 1995 A
5428809 Coffin et al. Jun 1995 A
5432918 Stamm Jul 1995 A
5436626 Fijiwara Jul 1995 A
5442756 Grochowski et al. Aug 1995 A
5448702 Garcia, Jr. et al. Sep 1995 A
5450351 Heddes Sep 1995 A
5450603 Davies Sep 1995 A
5452437 Richey et al. Sep 1995 A
5459842 Begun et al. Oct 1995 A
5463625 Yasrebi Oct 1995 A
5467452 Blum et al. Nov 1995 A
5481683 Karim Jan 1996 A
5487159 Byers et al. Jan 1996 A
5517628 Morrison et al. May 1996 A
5517648 Bertone et al. May 1996 A
5541920 Angle 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
5568617 Kametani Oct 1996 A
5574922 James Nov 1996 A
5574939 Keckler et al. Nov 1996 A
5592622 Isfeld et al. Jan 1997 A
5600812 Park Feb 1997 A
5606676 Grochowski et al. Feb 1997 A
5610864 Manning Mar 1997 A
5613071 Rankin et al. Mar 1997 A
5613136 Casavant et al. Mar 1997 A
5623489 Cotton et al. Apr 1997 A
5627829 Gleeson et al. May 1997 A
5630130 Perotto et al. May 1997 A
5640538 Dyer et al. Jun 1997 A
5644623 Gulledge Jul 1997 A
5649109 Griesmer et al. Jul 1997 A
5649157 Williams Jul 1997 A
5652583 Kang Jul 1997 A
5659687 Kim et al. Aug 1997 A
5659722 Blaner et al. Aug 1997 A
5680641 Sidman Oct 1997 A
5689566 Nguyen Nov 1997 A
5692167 Grochowski et al. Nov 1997 A
5699537 Sharangpani et al. Dec 1997 A
5701435 Chi Dec 1997 A
5717760 Satterfield Feb 1998 A
5717898 Kagan et al. Feb 1998 A
5721870 Matsumoto Feb 1998 A
5724563 Hasegawa Mar 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
5761507 Govett Jun 1998 A
5761522 Hisanaga et al. Jun 1998 A
5781774 Krick Jul 1998 A
5784649 Begur et al. Jul 1998 A
5784712 Byers et al. Jul 1998 A
5790813 Whittaker Aug 1998 A
5796413 Shipp et al. Aug 1998 A
5797043 Lewis et al. Aug 1998 A
5809235 Sharma et al. Sep 1998 A
5809530 Samra et al. Sep 1998 A
5812799 Zuravleff et al. Sep 1998 A
5812839 Hoyt et al. Sep 1998 A
5812868 Moyer et al. Sep 1998 A
5813031 Chou et al. Sep 1998 A
5815714 Shridhar et al. Sep 1998 A
5819080 Dutton et al. Oct 1998 A
5828746 Ardon Oct 1998 A
5828863 Barrett et al. Oct 1998 A
5829033 Hagersten et al. Oct 1998 A
5832215 Kato et al. Nov 1998 A
5832258 Kiuchi et al. Nov 1998 A
5835755 Stellwagen, Jr. Nov 1998 A
5835928 Auslander et al. Nov 1998 A
5854922 Gravenstein et al. Dec 1998 A
5860158 Pai et al. Jan 1999 A
5886992 Raatikainen et al. Mar 1999 A
5887134 Ebrahim Mar 1999 A
5890208 Kwon Mar 1999 A
5892979 Shiraki et al. Apr 1999 A
5893162 Lau et al. Apr 1999 A
5905876 Pawlowski et al. May 1999 A
5905889 Wilhelm, Jr. May 1999 A
5915123 Mirsky 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
5951679 Anderson et al. Sep 1999 A
5958031 Kim Sep 1999 A
5961628 Nguyen et al. Oct 1999 A
5970013 Fischer et al. Oct 1999 A
5978838 Mohamed et al. Nov 1999 A
5978874 Singhal et al. Nov 1999 A
5983274 Hyder et al. Nov 1999 A
5996068 Dwyer, III et al. Nov 1999 A
6002881 York et al. Dec 1999 A
6009505 Thayer et al. Dec 1999 A
6009515 Steele, Jr. Dec 1999 A
6012151 Mano Jan 2000 A
6014729 Lannan et al. Jan 2000 A
6023742 Ebeling et al. Feb 2000 A
6029170 Garger et al. Feb 2000 A
6029228 Cai et al. Feb 2000 A
6047334 Langendorf et al. Apr 2000 A
6058168 Braband May 2000 A
6058465 Nguyen 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
6076129 Fenwick et al. Jun 2000 A
6076158 Sites et al. Jun 2000 A
6079008 Clery, III Jun 2000 A
6079014 Papworth et al. Jun 2000 A
6085215 Ramakrishnan et al. Jul 2000 A
6085294 Van Doren et al. Jul 2000 A
6088783 Morton Jul 2000 A
6092127 Tausheck Jul 2000 A
6092158 Harriman et al. Jul 2000 A
6092175 Levy et al. Jul 2000 A
6112016 MacWilliams et al. Aug 2000 A
6115811 Steele, Jr. Sep 2000 A
6134665 Klein et al. Oct 2000 A
6141348 Muntz 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
6145123 Torrey et al. Nov 2000 A
6157955 Narad et al. Dec 2000 A
6160562 Chin et al. Dec 2000 A
6173349 Qureshi 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
6212602 Wicki 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
6223277 Karguth Apr 2001 B1
6223279 Nishimura et al. Apr 2001 B1
6230119 Mitchell May 2001 B1
6230261 Henry et al. May 2001 B1
6233599 Nation et al. May 2001 B1
6247025 Bacon Jun 2001 B1
6247040 Born et al. Jun 2001 B1
6247086 Allingham Jun 2001 B1
6249829 Bloks et al. Jun 2001 B1
6256713 Audityan et al. Jul 2001 B1
6272616 Fernando et al. Aug 2001 B1
6275505 O Loughlin et al. Aug 2001 B1
6278289 Guccione et al. Aug 2001 B1
6279113 Vaidya Aug 2001 B1
6289011 Seo et al. Sep 2001 B1
6298370 Tang et al. Oct 2001 B1
6307789 Wolrich et al. Oct 2001 B1
6311256 Halligan et al. Oct 2001 B2
6324624 Wolrich et al. Nov 2001 B1
6345334 Nakagawa et al. Feb 2002 B1
6347344 Baker et al. Feb 2002 B1
6351808 Joy et al. Feb 2002 B1
6356962 Kasper et al. Mar 2002 B1
6357016 Rodgers et al. Mar 2002 B1
6360262 Guenthner et al. Mar 2002 B1
6366978 Middleton et al. Apr 2002 B1
6373848 Allison et al. Apr 2002 B1
6378124 Bates et al. Apr 2002 B1
6381668 Lunteren Apr 2002 B1
6389449 Nemirovsky et al. May 2002 B1
6393483 Latif et al. May 2002 B1
6401149 Dennin et al. Jun 2002 B1
6408325 Shaylor Jun 2002 B1
6415338 Habot Jul 2002 B1
6426940 Seo et al. Jul 2002 B1
6427196 Adiletta et al. Jul 2002 B1
6430626 Witkowski et al. Aug 2002 B1
6430646 Thusoo et al. Aug 2002 B1
6434145 Opsasnick et al. Aug 2002 B1
6449289 Quicksall Sep 2002 B1
6457078 Magro et al. Sep 2002 B1
6463072 Wolrich et al. Oct 2002 B1
6480943 Douglas et al. Nov 2002 B1
6490642 Thekkath et al. Dec 2002 B1
6496925 Rodgers et al. Dec 2002 B1
6505229 Turner et al. Jan 2003 B1
6505281 Sherry Jan 2003 B1
6513089 Hofmann et al. Jan 2003 B1
6523108 James et al. Feb 2003 B1
6529999 Keller et al. Mar 2003 B1
6532509 Wolrich et al. Mar 2003 B1
6539439 Nguyen et al. Mar 2003 B1
6552826 Adler et al. Apr 2003 B2
6560667 Wolrich et al. May 2003 B1
6570877 Kloth et al. May 2003 B1
6577542 Wolrich et al. Jun 2003 B2
6577625 Chiou et al. Jun 2003 B1
6581124 Anand Jun 2003 B1
6584522 Wolrich et al. Jun 2003 B1
6587905 Correale et al. Jul 2003 B1
6587906 Wolrich et al. Jul 2003 B2
6606704 Adiletta et al. Aug 2003 B1
6625654 Wolrich et al. Sep 2003 B1
6628652 Chrin et al. Sep 2003 B1
6629237 Wolrich et al. Sep 2003 B2
6631430 Wolrich et al. Oct 2003 B1
6631462 Wolrich et al. Oct 2003 B1
6633938 Rowlands et al. Oct 2003 B1
6643726 Patkar et al. Nov 2003 B1
6654836 Misra et al. Nov 2003 B1
6661794 Wolrich et al. Dec 2003 B1
6661795 Adas et al. Dec 2003 B1
6667920 Wolrich et al. Dec 2003 B2
6668311 Hooper et al. Dec 2003 B2
6668317 Bernstein et al. Dec 2003 B1
6671761 Kim Dec 2003 B2
6671827 Guilford et al. Dec 2003 B2
6678248 Haddock et al. Jan 2004 B1
6681300 Wolrich et al. Jan 2004 B2
6684361 Tong et al. Jan 2004 B2
6694380 Wolrich et al. Feb 2004 B1
6697923 Chen et al. Feb 2004 B2
6724767 Chong et al. Apr 2004 B1
6725313 Wingard et al. Apr 2004 B1
6728845 Adiletta et al. Apr 2004 B2
6738831 Wolrich et al. May 2004 B2
6754662 Li Jun 2004 B1
6754795 Chen et al. Jun 2004 B2
6781992 Rana et al. Aug 2004 B1
6785843 McRae et al. Aug 2004 B1
6823399 Horiguchi et al. Nov 2004 B2
6826180 Bergantino et al. Nov 2004 B1
6847645 Potter et al. Jan 2005 B1
6868476 Rosenbluth et al. Mar 2005 B2
6889319 Rodgers et al. May 2005 B1
6941438 Wolrich et al. Sep 2005 B2
6958973 Chen et al. Oct 2005 B1
7028118 Smith et al. Apr 2006 B2
7051329 Boggs et al. May 2006 B1
7089379 Sharma et al. Aug 2006 B1
7216204 Rosenbluth et al. May 2007 B2
7225281 Rosenbluth et al. May 2007 B2
7246197 Rosenbluth et al. Jul 2007 B2
7337275 Wolrich et al. Feb 2008 B2
20010043614 Viswanadham et al. Nov 2001 A1
20020053017 Adiletta et al. May 2002 A1
20020056037 Wolrich et al. May 2002 A1
20030012198 Kaganoi et al. Jan 2003 A1
20030041216 Rosenbluth et al. Feb 2003 A1
20030046488 Rosenbluth et al. Mar 2003 A1
20030065862 Wyland Apr 2003 A1
20030078950 Abernathy et al. Apr 2003 A1
20030105899 Rosenbluth et al. Jun 2003 A1
20030145155 Wolrich et al. Jul 2003 A1
20030145159 Adiletta et al. Jul 2003 A1
20030191866 Wolrich et al. Oct 2003 A1
20040034743 Wolrich et al. Feb 2004 A1
20040039895 Wolrich et al. Feb 2004 A1
20040054880 Bernstein 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
20040098496 Wolrich et al. May 2004 A1
20040109369 Wolrich et al. Jun 2004 A1
20040139290 Wolrich et al. Jul 2004 A1
20040205747 Bernstein et al. Oct 2004 A1
20050132132 Rosenbluth et al. Jun 2005 A1
20050185437 Wolrich et al. Aug 2005 A1
Foreign Referenced Citations (36)
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 809 180 Nov 1997 EP
0 953 897 Nov 1999 EP
1 191 445 Mar 2002 EP
2 344 665 Jun 2000 GB
59111533 Jun 1984 JP
WO 9415287 Jul 1994 WO
WO 9738372 Oct 1997 WO
WO 0033195 Jun 2000 WO
WO 0115718 Mar 2001 WO
WO 0116697 Mar 2001 WO
WO 0116698 Mar 2001 WO
WO 0116703 Mar 2001 WO
WO 0116713 Mar 2001 WO
WO 0116714 Mar 2001 WO
WO 0116715 Mar 2001 WO
WO 0116716 Mar 2001 WO
WO 0116718 Mar 2001 WO
WO 0116722 Mar 2001 WO
WO 0116758 Mar 2001 WO
WO 0116769 Mar 2001 WO
WO 0116770 Mar 2001 WO
WO 0116782 Mar 2001 WO
WO 0118646 Mar 2001 WO
WO 0119702 Mar 2001 WO
WO 0141530 Jun 2001 WO
WO 0148596 Jul 2001 WO
WO 0148599 Jul 2001 WO
WO 0148606 Jul 2001 WO
WO 0148619 Jul 2001 WO
WO 0150247 Jul 2001 WO
WO 0150679 Jul 2001 WO
WO0148599 Jul 2001 WO
Related Publications (1)
Number Date Country
20030041228 A1 Feb 2003 US
Provisional Applications (1)
Number Date Country
60315144 Aug 2001 US