Parallel multi-threaded processing

Information

  • Patent Grant
  • RE41849
  • Patent Number
    RE41,849
  • Date Filed
    Wednesday, June 22, 2005
    19 years ago
  • Date Issued
    Tuesday, October 19, 2010
    14 years ago
Abstract
A parallel, multi-threaded processor system and technique for arbitrating command requests is described. The system includes a plurality of microengines, a plurality of shared system resources and a global command arbiter. The global command arbiter uses a command request protocol that is based on the shared system resources and command type to grant or deny a microengine command request for a shared resource.
Description
BACKGROUND OF THE INVENTION

This invention relates to a protocol for providing parallel, multi-threaded processors with high bandwidth access to shared resources.


Parallel processing is an efficient form of computer information processing of concurrent events. Certain problems may be solved by applying parallel computer processing, which demands concurrent execution of many programs to do more than one thing at the same time. Unlike a serial paradigm where all tasks are performed sequentially at a single station, or a pipelined machine where tasks are performed at specialized stations, parallel processing requires that a plurality of stations have the capability to perform all tasks. In general, all or a plurality of the stations work simultaneously and independently on the same or common elements of a problem.


Types of computer processing include single instruction stream, single data stream, which is the conventional serial von Neumann computer that includes a single stream of instructions. A second processing type is the single instruction stream, multiple data streams process (SIMD). This processing scheme may include multiple arithmetic-logic processors and a single control processor. Each of the arithmetic-logic processors performs operations on the data in lock step and are synchronized by the control processor. A third type is multiple instruction streams, single data stream (MISD) processing which involves processing the same data stream flows through a linear array of processors executing different instruction streams. A fourth processing type is multiple instruction streams, multiple data streams (MIMD) processing which uses multiple processors, each executing its own instruction stream to process a data stream fed to each of the processors. MIMD processors may have several instruction processing units and therefore several data streams.


SUMMARY OF THE INVENTION

According to an aspect of the present invention, a parallel, hardware-based, multi-threaded processor includes a global command arbiter for determining the allocation of access to system resources. The multi-threaded processor system includes a plurality of microengines, a plurality of shared system resources and a global command arbiter. The global command arbiter uses a command request protocol based on the shared system resources and command type to grant or deny a microengine command request for a shared resource. The processor system may be advantageously realized on an integrated circuit chip with minimal wiring and buffer storage elements.


The technique according to the invention provides each microengine with fair access to the shared system resources based on command priority and resource utilization. Consequently, the microengines have high bandwidth access to the shared system resources.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of a communication system employing a hardware-based multithreaded processor.



FIG. 2 is a simplified block diagram of a global arbitration system for a multithreaded process according to the invention.



FIGS. 3A and 3B illustrate a flow chart of an implementation of a global command arbitration process according to the invention.





DESCRIPTION


FIG. 1 illustrates a communication system 10 that includes a parallel, hardware-based multithreaded processor 12. The system 10 is especially useful for tasks that can be broken into parallel subtasks or functions, and the hardware-based multithreaded processor 12 is particularly useful for tasks that are bandwidth oriented rather than latency oriented.


The hardware-based multithreaded processor 12 may be an integrated circuit, and may be coupled to a bus such as a PCI bus 14, a memory system 16 and a second bus 18. In the illustrated implementation, the hardware-based multi-threaded processor 12 has multiple microengines 22a to 22f that each includes multiple hardware-controlled threads that can be simultaneously active and that may independently work on a task. The multithreaded processor 12 also includes a central or core controller 20 that assists in loading microcode control for other resources and performs other general purpose computer-type functions such as handling protocols, handling exceptions, and providing extra support for packet processing, which may occur if the microengines pass the packets off for more detailed processing. In one embodiment, the core controller 20 is a Strong Arm® (Arm is a trademark of ARM Limited, United Kingdom) based architecture embedded general-purpose microprocessor, which includes an operating system. The operating system enables the core processor 20 to call functions to operate on the microengines 22a-22f. The core processor 20 can use any supported operating system but preferably utilizes a real time operating system. Suitable operating systems for a core processor implemented as a Strong Arm architecture microprocessor may include Microsoft NT real-time, VXWorks and μCUS, which is a freeware operating system available over the Internet.


The plurality of functional microengines 22a-22f each maintain a plurality of program counters in hardware, and maintain states associated with the program counters. Each of the six microengines 22a-22f is capable of processing four independent hardware threads. Such processing allows one thread to start executing just after another thread issues a memory reference and then waits until that reference completes before doing more work. This behavior is critical to maintaining efficient hardware execution of the microegines because memory latency may be significant. Stated differently, if only a single thread execution was supported, the microengines would sit idle for a significant number of cycles waiting for references to return and thereby reduce overall computational throughput. Multi-threaded execution allows the microengines to mask memory latency by performing useful independent work across several threads. Effectively, a corresponding plurality of sets of threads can be simultaneously active on each of the microengines 22a-22f while only one is actually operating at any one time.


The six microengines 22a-22f operate with shared system resources including the memory system 16, the PCI bus 14 and the FBUS 18. The memory system 16 may be accessed via a Synchronous Dynamic Random Access Memory (SDRAM) controller 26a and a Static Random Access Memory (SRAM) controller 26b. SDRAM memory 16a and SDRAM controller 26a may be typically used for processing large volumes of data or high bandwidth data, such as processing network payloads from network packets. The SRAM controller 26b and SRAM memory 16b may be used in a networking implementation for low latency, fast access tasks or low bandwidth data, such as accessing look-up tables, memory for the core processor 20, and so forth.


The six microengines 22a-22f access either the SDRAM 16a or SRAM 16b based on characteristics of the data. Low latency, low bandwidth data is stored in and fetched from SRAM 16b, whereas higher bandwidth data for which latency is not as important is stored in and fetched from SDRAM 16a. The microengines 22a-22f can execute memory reference instructions to either the SDRAM controller 26a or SRAM controller 26b.


Advantages of hardware multithreading can be explained in the context of SRAM or SDRAM memory accesses. For example, an SRAM access requested by a Thread_0 from a microengine will cause the SRAM controller 26b to initiate an access to the SRAM memory 16b. The SRAM controller 26b controls arbitration for the SRAM bus 15, accesses the SRAM 16b, fetches the data from the SRAM 16b, and returns data to a requesting microengine 22a-22b. During a SRAM access, if the microengine 22a had only a single thread that could operate, that microengine would be dormant until data was returned from the SRAM. By employing hardware context swapping within each of the microengines 22a-22f, another thread such as Thread_1 can function while the first thread, Thread_0, is awaiting the read data to return. Hardware context swapping enables other contexts with unique program counters to execute in that same microengine. Continuing the example, during execution Thread_1 may access the SDRAM memory 16a. While Thread_1 operates on the SDRAM unit, and Thread_0 is operating on the SRAM unit, a new thread such as Thread_2 can now operate in the microengine 22a. Thread_2 can operate for a certain amount of time until it needs to access memory or perform some other long latency operation, such as making an access to a bus interface. Therefore, the processor 12 can simultaneously perform a bus operation, SRAM operation and SDRAM operation with all being completed or operated upon by one microengine 22a, which microengine 22a has one more thread available to process more work in the data path.


The hardware context swapping also synchronizes completion of tasks. For example, it is possible that two threads could hit the same-shared resource such as the SRAM 16b. Each one of the separate functional units, such as the interface 28, the SRAM controller 26a, and the SDRAM controller 26b, reports back a flag signaling completion of an operation when a requested task from one of the microengine thread contexts is completed. When the flag is received by the microengine, the microengine can determine which thread to turn on.


The processor 12 includes a bus interface 28 that couples the processor to a second bus 18. In an implementation, an FBUS interface 28 couples the processor 12 to the so-called FBUS 18 (FIFO bus). The FBUS is a 64-bit wide FIFO bus, used to interface to Media Access Controller (MAC) devices. The FBUS interface 28 is responsible for controlling and interfacing the processor 12 to the FBUS 18.


The processor 12 also includes a PCI bus interface 24 that couples other system components that reside on the PCI bus 14 to the processor 12. The PCI bus interface 24 also provides a high-speed data path 24a to the SDRAM memory 16a. The data path 24a permits data to be moved quickly from the SDRAM 16a to the PCI bus 14, via direct memory access (DMA) transfers. The hardware based multithreaded processor 12 can employ a plurality of DMA channels so if one target of a DMA transfer is busy, another one of the DMA channels can take over the PCI bus 14 to deliver information to another target to maintain high processor 12 efficiency. The PCI bus interface 24 supports image transfers, target operations and master operations. Target operations are operations where slave devices on bus 14 access the SDRAM through reads and writes that are serviced as a slave to target operation. In master operations, the processor core 20 sends data directly to or receives data directly from the PCI interface 24.


Each of the functional units of the processor 12 are coupled to one or more internal buses. In an implementation, the internal buses are dual 32-bit buses (i.e., one bus for read and one for write). The multithreaded processor 12 also is constructed such that the sum of the bandwidths of the internal buses exceeds the bandwidth of external buses coupled to the processor 12. The internal core processor bus 32 may be an Advanced System Bus (ASB bus) that couples the processor core 20 to the memory controllers 26a and 26b and to an ASB translator 30. The ASB bus is a subset of an “AMBA” bus that is used with the Strong Arm processor core. The processor 12 also includes a private bus 34 that couples the microengine units to SRAM controller 26b, ASB translator 30 and FBUS interface 28. A memory bus 38 couples the SDRAM controller 26a, the PCI bus interface 24, the FBUS interface 28 and memory system 16 together, including Flash ROM 16c which is used for boot operations and the like.


The hardware-based multithreaded processor 12 may be utilized as a network processor. As a network processor, the hardware-based multithreaded processor 12 interfaces to network devices such as a media access controller (MAC) device such as a 10/100BaseT Octal MAC 13a or a Gigabit Ethernet device 13b. In general, the hardware-based multi-threaded processor 12 can interface to any type of communication device or interface that receives/sends large amount of data. The communication system 10 functioning in a networking application could receive a plurality of network packets from the devices 13a, 13b and process each of those packets independently in a parallel manner.


The processor 12 may also be utilized as a print engine for a postscript processor, as a processor for a storage subsystem such as RAID disk storage, or as a matching engine. In the securities industry for example, the advent of electronic trading requires the use of electronic matching engines to match orders between buyers and sellers. These and other parallel types of tasks can be accomplished on the system 10.



FIG. 2 shows a global arbitration system 40 for use with the multithreaded processor 12 of FIG. 1. A global command arbiter 42 is connected to each of the microengines 22a-22f, to the SDRAM controller 26a, to the SRAM controller 26b, to the interface 28 and to the PCI interface 24. The global command arbiter 42 functions to provide high bandwidth access to the shared system resources utilizing a minimal amount of buffer storage elements and minimal wiring. The global command arbiter provides each microengine 22a-22f with fair access to the common system resources of the SDRAM, SRAM, PCI interface registers and FBUS interface registers based on command priority and resource utilization, which is explained below.


In an implementation, each microengine 22a-22f has a two-command deep first-in, first-out (FIFO) register for issuing command requests for SDRAM 16a and SRAM 16b memory access, and for issuing command requests for access to registers in the PCI interface 24 and FBUS interface 28. The SDRAM controller 26a queues commands from the microengines in one of four FIFO command queue structures: an eight-entry high-priority queue 44, a sixteen-entry odd bank queue 46, a sixteen-entry even bank queue 48, and a twenty-four entry maintain order queue 50. A single physical random access memory (RAM) structure with four input pointers and four output pointers may be used to implement the SDRAM queues 44, 46, 48, 50. A reference request from a microengine may include a bit set called the “optimized MEM bit” which will be sorted into either the odd bank queue 46 or the even bank queue 48. If the memory reference request does not have a memory optimization bit set, the default will be to go into the order queue 50. The order queue 50 maintains the order of reference requests from the microengines 22a-22f. With a series of odd and even banks references it may be required that a signal is returned to both the odd and even banks. If the microengine 22f sorts the memory references into odd bank and even bank references and one of the banks, for example the even bank, is drained of memory references before the odd bank but the signal is asserted on the last even reference, the SDRAM controller 26a could conceivably signal back to a microengine that the memory request had completed, even though the odd bank reference had not been serviced. This occurrence could cause a coherency problem. The situation is avoided by providing the order queue 50 which permits a microengine to have multiple memory references outstanding, of which only its last memory reference needs to signal a completion.


The SDRAM controller 26a also included a high priority queue 44. If an incoming memory reference from one of the microengines goes directly to the high priority queue then it is operated upon at a higher priority than other memory references in the other queues.


A feature of the SDRAM controller 26a is that when a memory reference is stored in the queues, in addition to the optimized MEM bit that may be set, a “chaining bit” may be set to require special handling of contiguous memory references. A microengine context may issue chained memory references when the second and/or third reference of the chain must be scheduled by the SDRAM controller 26a immediately after the initial chained memory request. The global command arbiter 42 must ensure that chained references are delivered to consecutive locations of the same SDRAM controller queue.


The SRAM controller 26b also has four command queues: an eight-entry high priority queue 62, a sixteen-entry read queue 64, a sixteen-entry write order queue 66 and a twenty-four entry read-lock fail queue 68. A single physical RAM structure may be used to implement the four queues. The SRAM controller 26b is optimized based on the type of memory operation; i.e., a read or a write operation, and the predominant function that the SRAM performs is read operations.


The read lock fail queue 68 is used to hold read memory reference requests that fail because of a lock existing on a portion of memory. That is, one of the microengines issues a memory request that has a read lock request that is processed in an address and control queue. The memory request will operate on either the write order queue 66 or the read queue 64 and will recognize it as a read lock request. The SRAM controller 26b will access a lock lookup device to determine whether this memory location is already locked. If this memory location is locked from any prior read lock request, then this memory lock request will fail and will be stored in the read lock fail queue 68. If it is unlocked or if the lock lookup device shows no lock on that address, then the address of that memory reference will be used by the SRAM interface 26b to perform a traditional SRAM address read/write request to SRAM memory 16b. A command controller and address generator will also enter the lock into the lock look up device so that subsequent read lock requests will find the memory location locked. A memory location is unlocked by clearing a valid bit in a content addressable memory (CAM) of the SRAM controller. After an unlock, the read lock fail queue 68 becomes the highest priority queue giving all queued read lock misses a chance to issue a memory lock request. The read-lock miss queue is loaded by the SRAM controller itself and not directly from a microengine output buffer. The global arbiter 42 ensures that a command from a microengine to a SRAM queue is not selected on the same cycle that the SRAM controller must write a read-lock miss entry.


The FBUS interface 28 includes three command queues: an eight-entry push queue 72, an eight-entry pull queue 74 and an eight-entry hash queue 76. The pull queue is used when data is moved from a microengine to an FBUS interface resource, the push queue is used for reading data from the FBUS interface to a microengine, and the hash queue is used for sending from one to three hash arguments to a polynomial hash unit within the FBUS interface and for getting the hash result returned. The FBUS interface 28 in a network application can perform header processing of incoming packets from the FBUS 18. A key function performed by the FBUS interface 28 is extraction of packet headers, and a hashed lookup of microprogrammable source/destination/protocol in SRAM memory 16b. If the hash does not successfully resolve, then the packet header is subjected to more sophisticated processing.


The PCI bus interface 24 includes a single, two-entry direct memory access (DMA) command register 78. The DMA register provides a completion signal to the initiating microengine thread.


The global command arbiter 42 operates to select commands from the two-deep output command queues of each microengine for transmission to a destination queue in one of the functional units. The functional units include the core controller 20, the PCI interface 24, the SDRAM controller 26a, the SRAM controller 26b, the FBUS interface 28 and the microengines 22a to 22f. Each microengine request to the global command arbiter 42 is a three-bit encoded field that specifies the command type and destination. Each microengine global command arbiter request is serviced with the following priority:

















1. SDRAM chained commands



2. SRAM



3. SDRAM



4. FBUS



5. PCI bus










The global arbiter maintains a pointer that indicates the last microengine request granted. If more than one request is present at the same priority, the global command arbiter selects the next higher numbered microengine (with a wrap-around feature). For example, the microengines 22a to 22f may be numbered from 1 to 6 in an implementation so that if a request from microengine 6 was the last one granted, then when priority is not an issue a request from microengine 1 is next up for consideration.


The three SRAM controller command queues 62, 64 and 66 are loaded directly from microengine commands. Since an SRAM command could be granted every cycle, it is possible that up to 6 additional SRAM commands will be granted and are in the pipeline, all of which could be destined for the same SRAM queue before a signal indicating that the queue is full is received by the global command arbiter. Thus, the SRAM controller asserts an SRAM_queue_full signal to the global command arbiter 42 if there is less than seven (7) empty entries in any SRAM command queue loaded from the microengines. For example, if the high priority queue has two entries filled then the SRAM_queue_full signal is asserted (because eight entries minus two entries is six). Similarly, if the read queue or the order queue contains ten entries then the SRAM_queue_full signal is asserted. This protocol is followed because a six cycle minimum latency exists from the assertion of a command request from a microengine and the command actually being stored in a destination queue.


The following diagram illustrates the timing of a request for a command destined for a queue in a system resource:




















1
2
3
4
5
6
7
8
9







Req
arb
gat
bus
cmd
rcv
full
arb
NOGNT



req
arb
gnt
bus
cmd
rcv
full
arb




req
arb
gnt
bus
cmd
rcv
full





req
arb
gat
bus
cmd
rcv






req
arb
gnt
bus
cmd







req
arb
gnt
bus








req
arb
NOGNT










Where: req=bus request from the microengine;
    • arb=arbitrate requests;
    • gnt=drive grant to appropriate microengine;
    • bus=enable tri-state bus driver;
    • cmd=drive command onto fx_cmd_bus;
    • rcv=receiving box queues command;
    • full=full_status_que signal driven if necessary;
    • nognt=a grant is not sent to queues that sent “full” by cycle 7.


Referring to the above timing diagram, in the first cycle, a request is sent to the global command arbiter. In cycle two, arbitration is performed and in cycle three the request is granted to the requesting microengine. In cycle four, a bus is enabled and in cycle five the command is driven onto the bus. In cycle six the receiving unit (SDRAM controller, SRAM controller, PCI bus interface or FBUS interface) queues the command. In cycle seven a full_status_que command is driven if necessary (e.g. that queue contains less than a minimum number of available entry spaces). In cycle eight, the global command arbiter is deciding whether another request should be granted to that system resource, but sees that the full_status_queue signal was generated. The arbiter then acts to deny requests (nognt) to the queue which sent a full signal by the seventh cycle.


The FBUS interface 28 has 3 command queues (pull, hash, push) which all contain eight (8) entries. Commands to the FBUS interface are not granted in consecutive cycles. Thus, when any of the 3 FBUS interface queues reaches four (4) entries (instead of the two discussed above for an eight entry queue) a FBUS_queue_full signal is sent to the global command arbiter since only a maximum of 3 commands can be in transit to the FBUS interface queues prior to the global arbiter detecting FBUS_queue_full.


The SDRAM controller 26a has 4 command queues (high=8, even=16, odd=16, order=24). The threshold for asserting SDRAM_queue_full is the same as for the SRAM, i.e. less than 7 entries available in any queue. However, commands to the SDRAM controller are not granted on consecutive cycles. This insures queue entry space for any SDRAM chained commands from a particular microengine, which must be granted, even after SDRAM_queue_full asserts. It is necessary to always transfer SDRAM chained commands to avoid a live-lock condition, in which the SDRAM controller is waiting for the chained command in one queue while the command is “stuck” in a microengine because the global arbiter is no longer granting SDRAM commands since a different SDRAM queue is “full”. A limit is placed on the chain length of SDRAM commands to three as a coding restriction. In addition, when a chained SDRAM command is granted to a microengine, the next SDRAM command to be granted must also come from the same microengine so that the paired commands arrive in the selected SDRAM queue contiguously.


The restrictions of not sending commands to the FBUS on consecutive cycles, and not sending commands to the SDRAM on consecutive cycles do not degrade system performance since each command requires many cycles to actually execute. The restriction is not placed on SRAM commands since the SRAM queue sizing is more than adequate, and more SRAM references requiring fewer cycles with lower latency are issued in most applications.



FIGS. 3A and 3B illustrate an implementation of a global command arbiter protocol process 100. The global command arbiter reviews 102 the command requests in the FIFO registers of the microengines 22a-22f. If all of the requests have the same priority 104, a pointer is checked 106 to determine the identity of the last microengine that had a request granted, and then the request of the next higher microengine is considered. Before granting the command request, the arbiter checks 108 to see if a queue_full_signal has been asserted. If so, the command request is denied 110 and the pointer is incremented 111 so that the next microengine's request will be considered. However, if no queue_full_signal has been asserted, then the command request is granted 112 and the flow returns to 102.


Referring again to step 104 of FIG. 3A, if the command requests in the microengines 22a to 22f have different priorities, then the global command arbiter checks 114 to see if a SDRAM request with a chained bit set has been granted previously. If so, then the SDRAM request from the same microengine that sent the previous SDRAM request with a chained bit is granted 116. Next, the SDRAM queues are checked 118 to determine if any contain less than “N” empty entries, where N is equal to the number of microengines plus one. In the implementation described above, the SDRAM_queue_full signal will be asserted 120 if any SDRAM queue contains less than seven (7) empty entries and then the flow returns to 102. If checking the queues 118 determines that the SDRAM queues have space for seven or more entries, then the flow returns to 102.


If there was no history of an SDRAM command request with a chained bit set 114, the global command arbiter determines 122 if there is a SRAM command request. If there is a SRAM request, the SRAM queues are checked 124 to see if any SRAM queue contains less than N empty entries. If so, then a SRAM_queue_full signal is asserted 126, the command request is denied and the flow moves to 134 where the arbiter determines if a SDRAM request has been made. However, if the answer 124 is no, then the arbiter checks 128 to see if the SRAM controller 26b needs to write a read_lock_miss entry. If so, then the command request is denied in step 130 and the flow moves to 134; if not, then the command request is granted 132 and the flow returns to 102.


If the answer was no at 122, then the arbiter checks 134 (see FIG. 3B) to see if a SDRAM request is being made. If so, the arbiter determines 136 if the last granted request was also a SDRAM command request. If it was, then the request is denied 138 and the flow goes to 146 where the arbiter determines if an FBUS command request has been made. Commands are not granted to the SDRAM controller in consecutive cycles to ensure that there is adequate queue entry space for a SDRAM chained command which is always granted when it occurs (even after a SDRAM_queue_full signal has been asserted). If the last granted command request was not an SDRAM command the SDRAM queues are checked 140 to see if any contains less than N entries. If so, then an SDRAM_queue_full signal is asserted 142, access is denied 138 and the flow moves to 146. If the SDRAM queues have adequate entry space, then the command request is granted 144 and the flow returns to 102.


If a SDRAM request is not being made 134, then the arbiter checks 146 to see if an FBUS command request has been made. If so, the arbiter checks 148 to see if the last granted request was a FBUS request. If so, then the request is denied 150 and the flow moves to 160 where the arbiter determines if a PCI command request has been made. Command requests to the FBUS are not granted in consecutive cycles to improve processing efficiency of the system. If the last granted request was not an FBUS command request 148, then the FBUS queues are checked 152 to see if any contain less than “F” empty entries. For the example discussed above where there are six microengines and each of the FBUS command queues (pull, hash, push) contains eight entries, F equals five (5) since only a maximum of three (3) commands can be in transit to the FBI queues. Thus, if four or fewer entries are available in any FBUS queue, then the FBUS_queue_full signal is asserted 154, the command is denied 150 and the flow moves to 160. However, if the FBUS queues have adequate space, the request is granted 156 and the flow returns to 102.


If an FBUS request is not made 146, a PCI command request has been asserted 160. Direct memory access is granted and a completion signal is sent, then the flow returns to 102.


It is to be understood that while implementations of the invention have been described, the foregoing description is intended to illustrate and not limit the invention, which is defined by the scope of the appended claims. For example, the flow chart depicted in FIGS. 3A and 3B could be modified to accommodate more, less or different system resources. Other aspects, advantages, and modifications are within the scope of the following claims.

Claims
  • 1. A method for using a parallel, multi-threaded processor system comprising: processing threads with a plurality of microengines, at least one microengine capable of processing at least two independent threads; processing commands issued by the microengines using a plurality of system resource interface units that each include at least one commands queue; and utilizing a global command arbiter including a pointer to store the identity of thea last agent that had a request granted to determine whether a particular microengine command request should be granted.
  • 2. The method of claim 1 wherein each microengine utilizes a FIFO commands register.
  • 3. The method of claim 1 wherein the system resource units include at least one of a core controller, a SDRAM controller, a SRAM controller, a PCI bus interface and an FBUS interface.
  • 4. The method of claim 3 wherein in at least one of the SDRAM controller, the SRAM controller and the FBUS interface utilize three command queues.
  • 5. The method of claim 3 wherein in at least one of the SDRAM controller and the SRAM controller utilize a high priority queue.
  • 6. The method of claim 3 wherein the SRAM controller utilizes a read lock fail queue.
  • 7. The method of claim 3 wherein the PCI bus interface utilizes a single command register.
  • 8. The method of claim 1, wherein the agent comprises at least one of the following: a microengine and a microengine thread.
  • 9. The method of claim 1, wherein the threads comprise at least one thread that operates on a packet.
  • 10. A communications system comprising: at least one Ethernet medium access controller (MAC); a multithreaded processor, the processor including: a plurality of microengines for processing a plurality of hardware threads; at least one of an ASB translator, a PCI bus interface, a SDRAM controller, a SRAM controller, and an bus interface to the Ethernet MAC; and a global command arbiter including a pointer to store the identity of thea last agent that had a request granted to determine whether a particular command request should be granted.
  • 11. The system of claim 10 further comprising a FIFO commands register for each microengine.
  • 12. The system of claim 10 wherein at least one of the SDRAM controller, the SRAM controller and the FBUS interface includes three command queues.
  • 13. The system of claim 10 wherein at least one of the SDRAM controller and the SRAM controller includes a high priority queue.
  • 14. The system of claim 10 wherein the SRAM controller includes a read lock fail queue.
  • 15. The system of claim 10 wherein the PCI bus interface includes a single command register.
  • 16. The methodsystem of claim 10, wherein the agent comprises at least one of the following: a microengine and a microengine thread.
  • 17. The methodsystem of claim 10, wherein the threads comprise at least one thread that operates on a packet received via the at least one Ethernet MAC.
  • 18. A method comprising: identifying a last programmable unit of a plurality of multiple multi-threaded programmable units within an integrated circuit to have a request granted; and based, at least in part, on the identifying of the last programmable unit of the plurality of multiple multi-threaded programmable units within the integrated circuit to have a request granted, selecting a different one of the multiple multi-threaded programmable units within the integrated circuit to have a next request granted.
  • 19. The method of claim 18, wherein the plurality of multiple multi-threaded programmable units within the integrated circuit are associated with a sequence of the multiple multi-threaded programmable units within the integrated circuit; and wherein selecting the one of the multiple multi-threaded programmable units within the integrated circuit to have a next request granted comprises selecting a next one of the multiple multi-threaded programmable units within the integrated circuit in the sequence.
  • 20. The method of claim 18, further comprising: selecting a memory access operation issued by the selected one of the multiple multi-threaded programmable units within the integrated circuit.
  • 21. An integrated circuit, comprising: multiple multi-threaded programmable units in the integrated circuit; and logic, communicatively coupled to the multiple multi-threaded programmable units, to: identify a last programmable unit of the plurality of multiple multi-threaded programmable units within the integrated circuit to have a request granted; and based, at least in part, on the identified last programmable unit of the plurality of multiple multi-threaded programmable units within the integrated circuit to have a request granted, select a one of the multiple multi-threaded programmable units within the integrated circuit to have a next request granted.
  • 22. The integrated circuit of claim 21, wherein the plurality of multiple multi-threaded programmable units within the integrated circuit are associated with a sequence of the multiple multi-threaded programmable units; and wherein the logic to select the one of the multiple multi-threaded programmable units within the integrated circuit to have a next request granted comprises logic to select a next one of the multiple multi-threaded programmable units in the sequence.
  • 23. The integrated circuit of claim 21, wherein the logic comprises an arbiter coupled to the multiple multi-threaded programmable units and to a memory controller to a memory shared by the multiple multi-threaded programmable units.
  • 24. The integrated circuit of claim 21, wherein the logic further comprises logic to: select a memory access operation issued by the selected one of the multiple multi-threaded programmable units within the integrated circuit.
  • 25. A method for using a parallel, multi-threaded processor system comprising: processing threads with a plurality of microengines, at least one microengine capable of processing at least two independent threads; processing commands issued by the microengines using a plurality of system resource interface units that each include at least one commands queue; and storing an identity of a last agent that had a request granted to determine whether a particular microengine command request should be granted, wherein a pointer is included to store the identity.
  • 26. The method of claim 25, wherein each microengine utilizes a FIFO commands register.
  • 27. The method of claim 25, wherein the system resource units include at least one of a core controller, a SDRAM controller, a SRAM controller, a PCI bus interface and an FBUS interface.
  • 28. The method of claim 27, wherein at least one of the SDRAM controller, the SRAM controller and the FBUS interface utilize three command queues.
  • 29. The method of claim 27, wherein in at least one of the SDRAM controller and the SRAM controller utilize a high priority queue.
  • 30. The method of claim 27, wherein the SRAM controller utilizes a read lock fail queue.
  • 31. The method of claim 27, wherein the PCI bus interface utilizes a single command register.
  • 32. The method of claim 25, wherein the agent comprises at least one of the following: a microengine and a microengine thread.
  • 33. The method of claim 25, wherein the threads comprise at least one thread that operates on a packet.
  • 34. A communications system comprising: at least one Ethernet medium access controller (MAC); a multithreaded processor, the processor including: a plurality of microengines for processing a plurality of hardware threads; at least one of an ASB translator, a PCI bus interface, a SDRAM controller, a SRAM controller, and an bus interface to the Ethernet MAC; and a pointer to store an identity of a last agent that had a request granted, the system configured to determine whether a particular command request should be granted.
  • 35. The system of claim 34 further comprising a FIFO commands register for each microengine.
  • 36. The system of claim 34 wherein at least one of the SDRAM controller, the SRAM controller and the FBUS interface includes three command queues.
  • 37. The system of claim 34 wherein at least one of the SDRAM controller and the SRAM controller includes a high priority queue.
  • 38. The system of claim 34 wherein the SRAM controller includes a read lock fail queue.
  • 39. The system of claim 34 wherein the PCI bus interface includes a single command register.
  • 40. The system of claim 34, wherein the agent comprises at least one of the following: a microengine and a microengine thread.
  • 41. The system of claim 34, wherein the threads comprise at least one thread that operates on a packet received via the at least one Ethernet MAC.
Parent Case Info

This application is a continuation of U.S. application Ser. No. 09/470,541 filed on Dec. 22, 1999, now U.S. Pat. No. 6,532,509.

US Referenced Citations (385)
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
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
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
5627829 Gleeson et al. May 1997 A
5630074 Beltran May 1997 A
5630130 Perotto et al. May 1997 A
5633865 Short May 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
5659687 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 Hisanaga 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 Raatikainen 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
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 Kim 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
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 Nemirovsky 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
6501731 Bleszynski 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
6604125 Belkin 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 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 Bradshaw 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 Adiletta 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
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
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 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 (25)
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
59-111533 Jun 1984 JP
WO 9415287 Jul 1994 WO
WO 9738372 Oct 1994 WO
WO 9820647 May 1998 WO
WO 0038376 Jun 2000 WO
WO 0056024 Sep 2000 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
Continuations (1)
Number Date Country
Parent 09470541 Dec 1999 US
Child 10339221 US
Reissues (1)
Number Date Country
Parent 10339221 Jan 2003 US
Child 11159427 US