Register set used in multithreaded parallel processor architecture

Information

  • Patent Grant
  • 7991983
  • Patent Number
    7,991,983
  • Date Filed
    Wednesday, June 3, 2009
    15 years ago
  • Date Issued
    Tuesday, August 2, 2011
    12 years ago
Abstract
A parallel hardware-based multithreaded processor. The processor includes a general purpose processor that coordinates system functions and a plurality of microengines that support multiple hardware threads or contexts. The processor maintains execution threads. The execution threads access a register set organized into a plurality of relatively addressable windows of registers that are relatively addressable per thread.
Description
BACKGROUND

This invention relates to computer processors.


Parallel processing is an efficient form of information processing of concurrent events in a computing process. Parallel processing demands concurrent execution of many programs in a computer, in contrast to sequential processing. In the context of a parallel processor, parallelism involves doing 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, with parallel processing, a plurality of stations are provided with each capable of performing all tasks. That is, in general all or a plurality of the stations work simultaneously and independently on the same or common elements of a problem. Certain problems are suitable for solution by applying parallel processing.





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 detailed block diagram of the hardware-based multithreaded processor of FIG. 1.



FIG. 3 is a block diagram of a microengine functional unit employed in the hardware-based multithreaded processor of FIGS. 1 and 2.



FIG. 4 is a block diagram of a pipeline in the microengine of FIG. 3.



FIG. 5 is a block diagram showing general purpose register address arrangement.





DESCRIPTION

Referring to FIG. 1, a communication system 10 includes a parallel, hardware-based multithreaded processor 12. The hardware-based multithreaded processor 12 is coupled to a bus such as a PCI bus 14, a memory system 16 and a second bus 18. The system 10 is especially useful for tasks that can be broken into parallel subtasks or functions. Specifically hardware-based multithreaded processor 12 is useful for tasks that are bandwidth oriented rather than latency oriented. The hardware-based multithreaded processor 12 has multiple microengines 22 each with multiple hardware controlled threads that can be simultaneously active and independently work on a task.


The hardware-based multithreaded processor 12 also includes a central controller 20 that assists in loading microcode control for other resources of the hardware-based multithreaded processor 12 and performs other general purpose computer type functions such as handling protocols, exceptions, extra support for packet processing where the microengines pass the packets off for more detailed processing such as in boundary conditions. In one embodiment, the processor 20 is a Strong Arm® (Arm is a trademark of ARM Limited, United Kingdom) based architecture. The general purpose microprocessor 20 has an operating system. Through the operating system the processor 20 can call functions to operate on microengines 22a-22f. The processor 20 can use any supported operating system preferably a real time operating system. For the core processor implemented as a Strong Arm architecture, operating systems such as, Microsoft NT® real-time, VXWorks and :CUS, a freeware operating system available over the Internet, can be used.


The hardware-based multithreaded processor 12 also includes a plurality of function microengines 22a-22f. Functional microengines (microengines) 22a-22f each maintain a plurality of program counters in hardware and states associated with the program counters. 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.


In one embodiment, there are six microengines 22a-22f as shown. Each microengines 22a-22f has capabilities for processing four hardware threads. The six microengines 22a-22f operate with shared resources including memory system 16 and bus interfaces 24 and 28. The memory system 16 includes 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 are typically used for processing large volumes of data, e.g., processing of network payloads from network packets. The SRAM controller 26b and SRAM memory 16b are used in a networking implementation for low latency, fast access tasks, e.g., 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. Thus, low latency, low bandwidth data is stored in and fetched from SRAM, whereas higher bandwidth data for which latency is not as important, is stored in and fetched from SDRAM. The microengines 22a-22f can execute memory reference instructions to either the SDRAM controller 26a or SRAM controller 16b.


Advantages of hardware multithreading can be explained by SRAM or SDRAM memory accesses. As an 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 controls arbitration for the SRAM bus, accesses the SRAM 16b, fetches the data from the SRAM 16b, and returns data to a requesting microengine 22a-22b. During an SRAM access, if the microengine e.g., 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, the hardware context swapping enables other contexts with unique program counters to execute in that same microengine. Thus, another thread e.g., Thread_1 can function while the first thread, e.g., Thread_0, is awaiting the read data to return. 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, e.g., 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, simultaneously, the processor 12 can have a bus operation, SRAM operation and SDRAM operation all being completed or operated upon by one microengine 22a and have one more thread available to process more work in the data path.


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


One example of an application for the hardware-based multithreaded processor 12 is as a network processor. As a network processor, the hardware-based multithreaded processor 12 interfaces to network devices such as a media access controller device e.g., a 10/100BaseT Octal MAC 13a or a Gigabit Ethernet device 13b. In general, as a network processor, the hardware-based multithreaded processor 12 can interface to any type of communication device or interface that receives/sends large amounts of data. Communication system 10 functioning in a networking application could receive a plurality of network packets from the devices 13a, 13b and process those packets in a parallel manner. With the hardware-based multithreaded processor 12, each network packet can be independently processed.


Another example for use of processor 12 is a print engine for a postscript processor or as a processor for a storage subsystem, i.e., RAID disk storage. A further use is 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.


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


The processor 12 includes a second interface e.g., a PCI bus interface 24 that couples other system components that reside on the PCI 14 bus to the processor 12. The PCI bus interface 24, provides a high speed data path 24a to memory 16 e.g., the SDRAM memory 16a. Through that path data can be moved quickly from the SDRAM 16a through the PCI bus 14, via direct memory access (DMA) transfers. The hardware based multithreaded processor 12 supports image 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 to deliver information to another target to maintain high processor 12 efficiency. Additionally, the PCI bus interface 24 supports target and master operations. Target operations are operations where slave devices on bus 14 access SDRAMs 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 are coupled to one or more internal buses. As described below, the internal buses are dual, 32 bit buses (i.e., one bus for read and one for write). The hardware-based multithreaded processor 12 also is constructed such that the sum of the bandwidths of the internal buses in the processor 12 exceed the bandwidth of external buses coupled to the processor 12. The processor 12 includes an internal core processor bus 32, e.g., an ASB bus (Advanced System Bus) that couples the processor core 20 to the memory controller 26a, 26c and to an ASB translator 30 described below. The ASB bus is a subset of the so called 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 memory controller 26a, 26b to the bus interfaces 24 and 28 and memory system 16 including flashrom 16c used for boot operations and so forth.


Referring to FIG. 2, each of the microengines 22a-22f includes an arbiter that examines flags to determine the available threads to be operated upon. Any thread from any of the microengines 22a-22f can access the SDRAM controller 26a, SDRAM controller 26b or FBUS interface 28. The memory controllers 26a and 26b each include a plurality of queues to store outstanding memory reference requests. The queues either maintain order of memory references or arrange memory references to optimize memory bandwidth. For example, if a thread_0 has no dependencies or relationship to a thread_1, there is no reason that thread 1 and 0 cannot complete their memory references to the SRAM unit out of order. The microengines 22a-22f issue memory reference requests to the memory controllers 26a and 26b. The microengines 22a-22f flood the memory subsystems 26a and 26b with enough memory reference operations such that the memory subsystems 26a and 26b become the bottleneck for processor 12 operation.


If the memory subsystem 16 is flooded with memory requests that are independent in nature, the processor 12 can perform memory reference sorting. Memory reference sorting improves achievable memory bandwidth. Memory reference sorting, as described below, reduces dead time or a bubble that occurs with accesses to SRAM. With memory references SRAM, switching current direction on signal lines between reads and writes produces a bubble or a dead time waiting for current to settle on conductors coupling the SRAM 16b to the SRAM controller 26b.


That is, the drivers that drive current on the bus need to settle out prior to changing states. Thus, repetitive cycles of a read followed by a write can degrade peak bandwidth. Memory reference sorting allows the processor 12 to organize references to memory such that long strings of reads can be followed by long strings of writes. This can be used to minimize dead time in the pipeline to effectively achieve closer to maximum available bandwidth. Reference sorting helps maintain parallel hardware context threads. On the SDRAM, reference sorting allows hiding of pre-charges from one bank to another bank. Specifically, if the memory system 16b is organized into an odd bank and an even bank, while the processor is operating on the odd bank, the memory controller can start precharging the even bank. Precharging is possible if memory references alternate between odd and even banks. By ordering memory references to alternate accesses to opposite banks, the processor 12 improves SDRAM bandwidth. Additionally, other optimizations can be used. For example, merging optimizations where operations that can be merged, are merged prior to memory access, open page optimizations where by examining addresses an opened page of memory is not reopened, chaining, as will be described below, and refreshing mechanisms, can be employed.


The FBUS interface 28 supports Transmit and Receive flags for each port that a MAC device supports, along with an Interrupt flag indicating when service is warranted. The FBUS interface 28 also includes a controller 28a that performs header processing of incoming packets from the FBUS 18. The controller 28a extracts the packet headers and performs a microprogrammable source/destination/protocol hashed lookup (used for address smoothing) in SRAM. If the hash does not successfully resolve, the packet header is sent to the processor core 20 for additional processing. The FBUS interface 28 supports the following internal data transactions:



















FBUS unit
(Shared bus SRAM)
to/from microengine.



FBUS unit
(via private bus)
writes from SDRAM Unit.



FBUS unit
(via Mbus)
Reads to SDRAM.










The FBUS 18 is a standard industry bus and includes a data bus, e.g., 64 bits wide and sideband control for address and read/write control. The FBUS interface 28 provides the ability to input large amounts of data using a series of input and output FIFO's 29a-29b. From the FIFOs 29a-29b, the microengines 22a-22f fetch data from or command the SDRAM controller 26a to move data from a receive FIFO in which data has come from a device on bus 18, into the FBUS interface 28. The data can be sent through memory controller 26a to SDRAM memory 16a, via a direct memory access. Similarly, the microengines can move data from the SDRAM 26a to interface 28, out to FBUS 18, via the FBUS interface 28.


Data functions are distributed amongst the microengines. Connectivity to the SRAM 26a, SDRAM 26b and FBUS 28 is via command requests. A command request can be a memory request or a FBUS request. For example, a command request can move data from a register located in a microengine 22a to a shared resource, e.g., an SDRAM location, SRAM location, flash memory or some MAC address. The commands are sent out to each of the functional units and the shared resources. However, the shared resources do not need to maintain local buffering of the data. Rather, the shared resources access distributed data located inside of the microengines. This enables microengines 22a-22f, to have local access to data rather than arbitrating for access on a bus and risk contention for the bus. With this feature, there is a 0 cycle stall for waiting for data internal to the microengines 22a-22f.


The data buses, e.g., ASB bus 30, SRAM bus 34 and SDRAM bus 38 coupling these shared resources, e.g., memory controllers 26a and 26b are of sufficient bandwidth such that there are no internal bottlenecks. Thus, in order to avoid bottlenecks, the processor 12 has an bandwidth requirement where each of the functional units is provided with at least twice the maximum bandwidth of the internal buses. As an example, the SDRAM can run a 64 bit wide bus at 83 MHz. The SRAM data bus could have separate read and write buses, e.g., could be a read bus of 32 bits wide running at 166 MHz and a write bus of 32 bits wide at 166 MHz. That is, in essence, 64 bits running at 166 MHz which is effectively twice the bandwidth of the SDRAM.


The core processor 20 also can access the shared resources. The core processor 20 has a direct communication to the SDRAM controller 26a to the bus interface 24 and to SRAM controller 26b via bus 32. However, to access the microengines 22a-22f and transfer registers located at any of the microengines 22a-22f, the core processor 20 access the microengines 22a-22f via the ASB Translator 30 over bus 34. The ASB translator 30 can physically reside in the FBUS interface 28, but logically is distinct. The ASB Translator 30 performs an address translation between FBUS microengine transfer register locations and core processor addresses (i.e., ASB bus) so that the core processor 20 can access registers belonging to the microengines 22a-22c.


Although microengines 22 can use the register set to exchange data as described below, a scratchpad memory 27 is also provided to permit microengines to write data out to the memory for other microengines to read. The scratchpad 27 is coupled to bus 34.


The processor core 20 includes a RISC core 50 implemented in a five stage pipeline performing a single cycle shift of one operand or two operands in a single cycle, provides multiplication support and 32 bit barrel shift support. This RISC core 50 is a standard Strong Arm® architecture but it is implemented with a five stage pipeline for performance reasons. The processor core 20 also includes a 16 kilobyte instruction cache 52, an 8 kilobyte data cache 54 and a prefetch stream buffer 56. The core processor 20 performs arithmetic operations in parallel with memory writes and instruction fetches. The core processor 20 interfaces with other functional units via the ARM defined ASB bus. The ASB bus is a 32-bit bi-directional bus 32.


Microengines:


Referring to FIG. 3, an exemplary one of the microengines 22a-22f, e.g., microengine 22f is shown. The microengine includes a control store 70 which, in one implementation, includes a RAM of here 1,024 words of 32 bit. The RAM stores a microprogram. The microprogram is loadable by the core processor 20. The microengine 22f also includes controller logic 72. The controller logic includes an instruction decoder 73 and program counter (PC) units 72a-72d. The four micro program counters 72a-72d are maintained in hardware. The microengine 22f also includes context event switching logic 74. Context event logic 74 receives messages (e.g., SEQ_EVENT_RESPONSE; FBI_EVENT_RESPONSE; SRAM_EVENT_RESPONSE; SDRAM_EVENT_RESPONSE; and ASB_EVENT_RESPONSE) from each one of the shared resources, e.g., SRAM 26a, SDRAM 26b, or processor core 20, control and status registers, and so forth. These messages provide information on whether a requested function has completed. Based on whether or not a function requested by a thread has completed and signaled completion, the thread needs to wait for that completion signal, and if the thread is enabled to operate, then the thread is placed on an available thread list (not shown). The microengine 22f can have a maximum of e.g., 4 threads available.


In addition to event signals that are local to an executing thread, the microengines 22 employ signaling states that are global. With signaling states, an executing thread can broadcast a signal state to all microengines 22. Receive Request Available signal, Any and all threads in the microengines can branch on these signaling states. These signaling states can be used to determine availability of a resource or whether a resource is due for servicing.


The context event logic 74 has arbitration for the four (4) threads. In one embodiment, the arbitration is a round robin mechanism. Other techniques could be used including priority queuing or weighted fair queuing. The microengine 22f also includes an execution box (EBOX) data path 76 that includes an arithmetic logic unit 76a and general purpose register set 76b. The arithmetic logic unit 76a performs arithmetic and logical functions as well as shift functions. The registers set 76b has a relatively large number of general purpose registers. As will be described in FIG. 6, in this implementation there are 64 general purpose registers in a first bank, Bank A and 64 in a second bank, Bank B. The general purpose registers are windowed as will be described so that they are relatively and absolutely addressable.


The microengine 22f also includes a write transfer register stack 78 and a read transfer stack 80. These registers are also windowed so that they are relatively and absolutely addressable. Write transfer register stack 78 is where write data to a resource is located. Similarly, read register stack 80 is for return data from a shared resource. Subsequent to or concurrent with data arrival, an event signal from the respective shared resource e.g., the SRAM controller 26a, SDRAM controller 26b or core processor 20 will be provided to context event arbiter 74 which will then alert the thread that the data is available or has been sent. Both transfer register banks 78 and 80 are connected to the execution box (EBOX) 76 through a data path. In one implementation, the read transfer register has 64 registers and the write transfer register has 64 registers.


Referring to FIG. 4, the microengine datapath maintains a 5-stage micro-pipeline 82. This pipeline includes lookup of microinstruction words 82a, formation of the register file addresses 82b, read of operands from register file 82c, ALU, shift or compare operations 82d, and write-back of results to registers 82e. By providing a write-back data bypass into the ALU/shifter units, and by assuming the registers are implemented as a register file (rather than a RAM), the microengine can perform a-simultaneous register file read and write, which completely hides the write operation.


The SDRAM interface 26a provides a signal back to the requesting microengine on reads that indicates whether a parity error occurred on the read request. The microengine microcode is responsible for checking the SDRAM read Parity flag when the microengine uses any return data. Upon checking the flag, if it was set, the act of branching on it clears it. The Parity flag is only sent when the SDRAM is enabled for checking, and the SDRAM is parity protected. The microengines and the PCI Unit are the only requesters notified of parity errors. Therefore, if the processor core 20 or FIFO requires parity protection, a microengine assists in the request.


Referring to FIG. 5, the two register address spaces that exist are Locally accessibly registers, and Globally accessible registers accessible by all microengines. The General Purpose Registers (GPRs) are implemented as two separate banks (A bank and B bank) whose addresses are interleaved on a word-by-word basis such that A bank registers have lsb=0, and B bank registers have lsb=1. Each bank is capable of performing a simultaneous read and write to two different words within its bank.


Across banks A and B, the register set 76b is also organized into four windows 76b0-76b3 of 32 registers that are relatively addressable per thread. Thus, thread_0 will find its register 0 at 77a (register 0), the thread_1 will find its register_0 at 77b (register 32), thread_2 will find its register_0 at 77c (register 64), and thread_3 at 77d (register 96). Relative addressing is supported so that multiple threads can use the exact same control store and locations but access different windows of register and perform different functions. The uses of register window addressing and bank addressing provide the requisite read bandwidth using only dual ported RAMS in the microengine 22f.


These windowed registers do not have to save data from context switch to context switch so that the normal push and pop of a context swap file or stack is eliminated. Context switching here has a 0 cycle overhead for changing from one context to another. Relative register addressing divides the register banks into windows across the address width of the general purpose register set. Relative addressing allows access any of the windows relative to the starting point of the window. Absolute addressing is also supported in this architecture where any one of the absolute registers may be accessed by any of the threads by providing the exact address of the register.


Addressing of general purpose registers 78 occurs in 2 modes depending on the microword format. The two modes are absolute and relative. In absolute mode, addressing of a register address is directly specified in 7-bit source field (a6-a0 or b6-b0):






















7
6
5
4
3
2
1
0

























A GPR:
a6
0
a5
a4
a3
a2
a1
a0
a6 = 0


B GPR:
b6
1
b5
b4
b3
b2
b1
b0
b6 = 0


SRAM/ASB:
a6
a5
a4
0
a3
a2
a1
a0
a6 = 1, a5 = 0,











a4 = 0


SDRAM:
a6
a5
a4
0
a3
a2
a1
a0
a6 = 1, a5 = 0,











a4 = 1










register address directly specified in 8-bit dest field (d7-d0):






















7
6
5
4
3
2
1
0

























A GPR:
d7
d6
d5
d4
d3
d2
d1
d0
d7 = 0, d6 = 0


B GPR:
d7
d6
d5
d4
d3
d2
d1
d0
d7 = 0, d6 = 1


SRAM/ASB:
d7
d6
d5
d4
d3
d2
d1
d0
d7 = 1, d6 = 0,











d5 = 0


SDRAM:
d7
d6
d5
d4
d3
d2
d1
d0
d7 = 1, d6 = 0,











d5 = 1









If <a6:a5>=1,1, <b6:b5>=1,1, or <d7:d6>=1,1 then the lower bits are interpreted as a context-relative address field (described below). When a non-relative A or B source address is specified in the A, B absolute field, only the lower half of the SRAM/ASB and SDRAM address spaces can be addressed. Effectively, reading absolute SRAM/SDRAM devices has the effective address space; however, since this restriction does not apply to the dest field, writing the SRAM/SDRAM still uses the full address space.


In relative mode, addresses a specified address is offset within context space as defined by a 5-bit source field (a4-a0 or b4-b0):






















7
6
5
4
3
2
1
0
























A GPR:
a4
0
context
a3
a2
a1
a0
a4 = 0


B GPR:
b4
1
context
b3
b2
b1
b0
b4 = 0


SRAM/ASB:
ab4
0
ab3
context
b2
b1
ab0
ab4 = 1,










ab3 = 0


SDRAM:
ab4
0
ab3
context
b2
b1
ab0
ab4 = 1,










ab3 = 1










or as defined by the 6-bit dest field (d5-d0):






















7
6
5
4
3
2
1
0
























A GPR:
d5
d4
context
d3
d2
d1
d0
d5 = 0, d4 = 0


B GPR:
d5
d4
context
d3
d2
d1
d0
d5 = 0, d4 = 1


SRAM/ASB:
d5
d4
d3
context
d2
d1
d0
d5 = 1, d4 = 0,










d3 = 0


SDRAM:
d5
d4
d3
context
d2
d1
d0
d5 = 1, d4 = 0,










d3 = 1









If <d5:d4>=1,1, then the destination address does not address a valid register, thus, no dest operand is written back.


Other embodiments are within the scope of the appended claims.

Claims
  • 1. A method of maintaining execution threads in a parallel multithreaded processor comprising: for each microengine of a plurality of microengines of the multithreaded processor: accessing, by an executing thread in the microengine, a register set of the microengine organized into a plurality of relatively addressable windows of registers that are relatively addressable per thread of the microengine.
  • 2. The method of claim 1 wherein multiple threads of one of the plurality of microengines can use the same control store and relative register locations but access different window banks of registers of the one of the plurality of microengines.
  • 3. The method of claim 1 wherein the relative register addressing divides register banks of one of the plurality of microengines into windows across the address width of the general purpose register set.
  • 4. The method of claim 1 wherein relative addressing allows access to any of the window of registers of one of the plurality of microengines with reference to a starting point of a window of registers.
  • 5. The method of claim 1 further comprising: organizing the register set of one of the plurality of microengines into windows according to the number of threads that execute in the one of the plurality of microengines.
  • 6. The method of claim 1 wherein relative addressing allows multiple threads of one of the plurality of microengines to use the same control store and locations while allowing access to different windows of registers of the one of the plurality of microengines to perform different functions.
  • 7. The method of claim 1 wherein the window registers of one of the plurality of microengines are implemented using dual ported random access memories.
  • 8. The method of claim 1 wherein relative addressing allows access to any of the windows of registers of one of the plurality of microengines with reference to a starting point of the window of registers.
  • 9. The method of claim 1 wherein the register set of one of the plurality of microengines is also absolutely addressable where any one of the absolutely addressable registers of the one of the plurality of microengines may be accessed by any of the threads of one of the plurality of microengines by providing the exact address of the one of the absolutely addressable registers.
  • 10. The method of claim 9 wherein an absolute address of a register is directly specified in a source field or destination field of an instruction.
  • 11. The method of claim 1 wherein relative addresses are specified in instructions as an address offset within a context execution space as defined by a source field or destination field operand.
  • 12. A hardware based multi-threaded processor including: a processor unit comprising: a plurality of microengines, each microengine having: control logic including context event switching logic, the context switching logic arbitrating access to the microengine for a plurality of executable threads of the microengine;an arithmetic logic unit to process data for executing the threads of the microengine; anda register set that is organized into a plurality of relatively addressable windows of registers that are relatively addressable per thread of the microengine.
  • 13. The processor of claim 12 wherein the control logic of one of the plurality of microengines further comprises: an instruction decoder; andprogram counter units to track executing threads of the one of the plurality of microengines.
  • 14. The processor of claim 13 wherein the program counters units of the one of the plurality of microengines are maintained in hardware.
  • 15. The processor of claim 13 wherein register banks of the one of the plurality of microengines are organized into windows across an address width of the register set of the one of the plurality of microengines, with each window of the one of the plurality of microengines relatively accessible by a corresponding thread.
  • 16. The processor of claim 15 wherein relative addressing allows access to any of the registers of the register set of the one of the plurality of microengines with reference to a starting point of a window of the register set of the one of the plurality of microengines.
  • 17. The processor of claim 15 wherein the number of windows of the register set of the one of the plurality of microengines is according to the number of threads that execute in the one of the plurality of microengines.
  • 18. The processor of claim 13 wherein relative addressing allow the multiple threads of one of the plurality of microengines to use the same control store and locations while allowing access to different windows of registers of the one of the plurality of microengines to perform different functions.
  • 19. The processor of claim 13 wherein the window registers of the one of the plurality of microengines are provided using dual ported random access memories.
  • 20. The processor of claim 12 wherein the multi-threaded processor is a microprogrammed processor unit.
  • 21. A computer program product residing on a computer readable medium for managing execution of multiple threads in a multithreaded processor comprising instructions causing the multithreaded processor to perform a method comprising: for each microengine of a plurality of microengines of the multithreaded processor: accessing, by an executing thread in the microengine, a register set of the microengine organized into a plurality of relatively addressable windows of registers that are relatively addressable per thread of the microengine.
  • 22. The product of claim 21 wherein the register set of one of the plurality of microengines is also absolutely addressable where any one of the absolutely addressable registers of the register set of the one of the plurality of microengines may be accessed by any of the threads of the one of the plurality of microengines by providing the exact address of the register.
RELATED APPLICATIONS

This application is a continuation application and claims the benefit of U.S. application Ser. No. 10/070,091, filed on Jun. 28, 2002 (now U.S. Pat. No. 7,546,444), which is the national phase application claiming benefit to International Application Serial No. PCT/US00/23993, filed on Aug. 31, 2000, which claims benefit to U.S. Provisional Application Ser. No. 60/151,961, filed on Sep. 1, 1999. These applications are hereby incorporated in their entirety.

US Referenced Citations (359)
Number Name Date Kind
3373408 Ling Mar 1968 A
3478322 Evans Nov 1969 A
3577189 Cocke et al. May 1971 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
4130890 Adam Dec 1978 A
4392758 Bowles et al. Jul 1983 A
4400770 Chan et al. Aug 1983 A
4454595 Cage Jun 1984 A
4471426 McDonough Sep 1984 A
4477872 Losq et al. Oct 1984 A
4514807 Nogi Apr 1985 A
4523272 Fukunaga et al. Jun 1985 A
4569016 Hao et al. Feb 1986 A
4606025 Peters et al. Aug 1986 A
4724521 Carron et al. Feb 1988 A
4742451 Bruckert et al. May 1988 A
4745544 Renner et al. May 1988 A
4754398 Pribnow Jun 1988 A
4755966 Lee et al. Jul 1988 A
4777587 Case et al. Oct 1988 A
4808988 Burke et al. Feb 1989 A
4816913 Harney et al. Mar 1989 A
4847755 Morrison et al. Jul 1989 A
4866664 Burkhardt, Jr. et al. Sep 1989 A
4868735 Moller et al. Sep 1989 A
4926322 Stimac et al. May 1990 A
4991078 Wilhelm et al. Feb 1991 A
4992934 Portanova et al. Feb 1991 A
5045995 Levinthal et al. Sep 1991 A
5056015 Baldwin et al. Oct 1991 A
5073864 Methvin et al. Dec 1991 A
5113516 Johnson 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
5165025 Lass Nov 1992 A
5168555 Byers et al. Dec 1992 A
5170484 Grondalski Dec 1992 A
5173897 Schrodi et al. Dec 1992 A
5187800 Sutherland Feb 1993 A
5189636 Patti et al. Feb 1993 A
5202972 Gusefski et al. Apr 1993 A
5220669 Baum et al. Jun 1993 A
5247671 Adkins et al. Sep 1993 A
5255239 Taborn et al. Oct 1993 A
5263169 Genusov et al. Nov 1993 A
5274770 Khim 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
5394530 Kitta Feb 1995 A
5404464 Bennett Apr 1995 A
5404482 Stamm et al. Apr 1995 A
5428779 Allegrucci et al. Jun 1995 A
5428809 Coffin et al. Jun 1995 A
5432918 Stamm Jul 1995 A
5436626 Fujiwara et al. 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
5463746 Brodnax et al. Oct 1995 A
5467452 Blum et al. Nov 1995 A
5481683 Karim Jan 1996 A
5487159 Byers et al. Jan 1996 A
5509130 Trauben et al. Apr 1996 A
5517628 Morrison et al. May 1996 A
5517648 Bertone et al. May 1996 A
5537603 Baum et al. Jul 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
5544337 Beard et al. Aug 1996 A
5550816 Hardwick et al. Aug 1996 A
5557766 Takiguchi et al. Sep 1996 A
5568617 Kametani Oct 1996 A
5572690 Molnar et al. Nov 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
5600848 Sproull et al. 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
5640528 Harney et al. Jun 1997 A
5640538 Dyer et al. Jun 1997 A
5644623 Gulledge Jul 1997 A
5649157 Williams Jul 1997 A
5652583 Kang Jul 1997 A
5655132 Watson Aug 1997 A
5659687 Kim et al. Aug 1997 A
5659722 Blaner et al. Aug 1997 A
5669012 Shimizu et al. Sep 1997 A
5680564 Divivier et al. Oct 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
5704054 Bhattacharya Dec 1997 A
5717760 Satterfield Feb 1998 A
5717898 Kagan et al. Feb 1998 A
5721869 Imakawa 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
5748950 White et al. May 1998 A
5751987 Mahant-Shetti et al. May 1998 A
5761507 Govett Jun 1998 A
5761522 Hisanaga et al. Jun 1998 A
5761726 Guttag et al. Jun 1998 A
5781774 Krick Jul 1998 A
5784649 Begur et al. Jul 1998 A
5784712 Byers et al. Jul 1998 A
5787454 Rohlman Jul 1998 A
5796413 Shipp et al. Aug 1998 A
5797043 Lewis et al. Aug 1998 A
5802373 Yates et al. Sep 1998 A
5809235 Sharma et al. Sep 1998 A
5809530 Samra et al. Sep 1998 A
5812811 Dubey et al. Sep 1998 A
5812839 Hoyt et al. Sep 1998 A
5812868 Moyer et al. Sep 1998 A
5815698 Holmann et al. Sep 1998 A
5815714 Shridhar et al. Sep 1998 A
5819080 Dutton et al. Oct 1998 A
5822619 Sidwell Oct 1998 A
5828746 Ardon Oct 1998 A
5828863 Barrett 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
5838975 Abramson et al. Nov 1998 A
5848276 King et al. Dec 1998 A
5854922 Gravenstein et al. Dec 1998 A
5857104 Natarjan et al. Jan 1999 A
5859789 Sidwell Jan 1999 A
5859790 Sidwell Jan 1999 A
5860085 Stormon et al. Jan 1999 A
5860158 Pai et al. Jan 1999 A
5870597 Panwar et al. Feb 1999 A
5872963 Bitar et al. Feb 1999 A
5875355 Sidwell et al. Feb 1999 A
5875470 Dreibelbis et al. Feb 1999 A
5884069 Sidwell Mar 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
5898866 Atkins et al. Apr 1999 A
5900025 Sollars May 1999 A
5905876 Pawlowski et al. May 1999 A
5905889 Wilhelm, Jr. May 1999 A
5915123 Mirsky et al. Jun 1999 A
5923872 Chrysos et al. Jul 1999 A
5926646 Pickett et al. Jul 1999 A
5928358 Takayama et al. Jul 1999 A
5933627 Parady Aug 1999 A
5937177 Molnar et al. 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
5943491 Sutherland et al. Aug 1999 A
5944816 Dutton et al. Aug 1999 A
5946222 Redford Aug 1999 A
5946487 Dangelo Aug 1999 A
5948081 Foster Sep 1999 A
5951679 Anderson et al. Sep 1999 A
5956514 Wen et al. Sep 1999 A
5958031 Kim Sep 1999 A
5961628 Nguyen et al. Oct 1999 A
5970013 Fischer et al. Oct 1999 A
5974523 Glew et al. Oct 1999 A
5978838 Mohamed et al. Nov 1999 A
5983274 Hyder et al. Nov 1999 A
5993627 Anderson et al. Nov 1999 A
5996068 Dwyer, III et al. Nov 1999 A
6002881 York et al. Dec 1999 A
6005575 Colleran 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
6029228 Cai et al. Feb 2000 A
6052769 Huff et al. Apr 2000 A
6058168 Braband May 2000 A
6058465 Nguyen May 2000 A
6061710 Eickemeyer et al. May 2000 A
6061711 Song 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
6076158 Sites et al. Jun 2000 A
6079008 Clery, III Jun 2000 A
6079014 Papworth et al. Jun 2000 A
6081880 Sollars 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
6100905 Sidwell Aug 2000 A
6101599 Wright et al. Aug 2000 A
6112016 MacWilliams et al. Aug 2000 A
6115777 Zahir et al. Sep 2000 A
6115811 Steele, Jr. Sep 2000 A
6134665 Klein et al. Oct 2000 A
6138254 Voshell Oct 2000 A
6139199 Rodriguez Oct 2000 A
6141348 Muntz Oct 2000 A
6141689 Ysrebi Oct 2000 A
6141765 Sherman Oct 2000 A
6144669 Williams et al. Nov 2000 A
6145054 Mehrotra et al. Nov 2000 A
6145077 Sidwell et al. Nov 2000 A
6145123 Torrey et al. Nov 2000 A
6151668 Pechanek et al. Nov 2000 A
6157955 Narad et al. Dec 2000 A
6157988 Dowling Dec 2000 A
6160562 Chin et al. Dec 2000 A
6182177 Harriman Jan 2001 B1
6195676 Spix et al. Feb 2001 B1
6195739 Wright et al. Feb 2001 B1
6199133 Schnell Mar 2001 B1
6201807 Prasanna Mar 2001 B1
6205468 Diepstraten et al. Mar 2001 B1
6212542 Kahle et al. Apr 2001 B1
6212611 Nizar et al. Apr 2001 B1
6216220 Hwang Apr 2001 B1
6223207 Lucovsky et al. Apr 2001 B1
6223208 Kiefer 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
6230230 Joy et al. May 2001 B1
6230261 Henry et al. May 2001 B1
6247025 Bacon Jun 2001 B1
6256713 Audityan et al. Jul 2001 B1
6259699 Opalka et al. Jul 2001 B1
6269391 Gillespie Jul 2001 B1
6272613 Bouraoui et al. Aug 2001 B1
6272616 Fernando et al. Aug 2001 B1
6275505 O'Loughlin et al. Aug 2001 B1
6275508 Aggarwal et al. Aug 2001 B1
6279066 Velingker Aug 2001 B1
6279113 Vaidya Aug 2001 B1
6289011 Seo et al. Sep 2001 B1
6292483 Kerstein Sep 2001 B1
6298370 Tang et al. Oct 2001 B1
6304956 Tran Oct 2001 B1
6307789 Wolrich et al. Oct 2001 B1
6314510 Saulsbury et al. Nov 2001 B1
6324624 Wolrich et al. Nov 2001 B1
6336180 Long et al. Jan 2002 B1
6338133 Schroter Jan 2002 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
6356994 Barry et al. Mar 2002 B1
6360262 Guenthner et al. Mar 2002 B1
6373848 Allison et al. Apr 2002 B1
6378124 Bates et al. Apr 2002 B1
6378125 Bates et al. Apr 2002 B1
6385720 Tanaka et al. May 2002 B1
6389449 Nemirovsky et al. May 2002 B1
6393483 Latif et al. May 2002 B1
6401155 Saville 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
6434145 Opsasnick et al. Aug 2002 B1
6442669 Wright et al. Aug 2002 B2
6446190 Barry et al. Sep 2002 B1
6463072 Wolrich et al. Oct 2002 B1
6496847 Bugnion et al. Dec 2002 B1
6505229 Turner et al. Jan 2003 B1
6523108 James et al. Feb 2003 B1
6532509 Wolrich et al. Mar 2003 B1
6543049 Bates et al. Apr 2003 B1
6552826 Adler et al. Apr 2003 B2
6560629 Harris May 2003 B1
6560667 Wolrich et al. May 2003 B1
6560671 Samra et al. May 2003 B1
6564316 Perets et al. May 2003 B1
6574702 Khanna et al. Jun 2003 B2
6577542 Wolrich et al. Jun 2003 B2
6584522 Wolrich et al. Jun 2003 B1
6587906 Wolrich et al. Jul 2003 B2
6606704 Adiletta et al. Aug 2003 B1
6625654 Wolrich et al. Sep 2003 B1
6629237 Wolrich et al. Sep 2003 B2
6631422 Althaus et al. Oct 2003 B1
6631430 Wolrich et al. Oct 2003 B1
6631462 Wolrich et al. Oct 2003 B1
6661794 Wolrich et al. Dec 2003 B1
6667920 Wolrich et al. Dec 2003 B2
6668317 Bernstein et al. Dec 2003 B1
6681300 Wolrich et al. Jan 2004 B2
6694380 Wolrich et al. Feb 2004 B1
6697935 Borkenhagen et al. Feb 2004 B1
6718457 Tremblay et al. Apr 2004 B2
6784889 Radke Aug 2004 B1
6836838 Wright et al. Dec 2004 B1
6862676 Knapp et al. Mar 2005 B1
6934951 Wilkinson, III et al. Aug 2005 B2
6971103 Hokenek et al. Nov 2005 B2
6976095 Wolrich et al. Dec 2005 B1
6983350 Adiletta et al. Jan 2006 B1
7020871 Bernstein et al. Mar 2006 B2
7181594 Wilkinson, III et al. Feb 2007 B2
7185224 Fredenburg et al. Feb 2007 B1
7191309 Wolrich et al. Mar 2007 B1
7302549 Wilkinson, III et al. Nov 2007 B2
7421572 Wolrich et al. Sep 2008 B1
20020038403 Wolrich et al. Mar 2002 A1
20020053017 Adiletta et al. May 2002 A1
20020056037 Wolrich et al. May 2002 A1
20030041228 Rosenbluth et al. Feb 2003 A1
20030145159 Adiletta et al. Jul 2003 A1
20030191866 Wolrich et al. Oct 2003 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
20040205747 Bernstein et al. Oct 2004 A1
20070234009 Wolrich et al. Oct 2007 A1
Foreign Referenced Citations (42)
Number Date Country
0 130 381 Jan 1985 EP
0 379 709 Aug 1990 EP
0 463 855 Jan 1992 EP
0 464 715 Jan 1992 EP
0 476 628 Mar 1992 EP
0 633 678 Jan 1995 EP
0 696 772 Feb 1996 EP
0 745 933 Dec 1996 EP
0 809 180 Nov 1997 EP
0 827 071 Mar 1998 EP
0 863 462 Sep 1998 EP
0 905 618 Mar 1999 EP
2752966 Mar 1998 FR
59-111533 Jun 1984 JP
WO 9207335 Apr 1992 WO
WO 9415287 Jul 1994 WO
WO 9738372 Oct 1997 WO
WO 9924903 May 1999 WO
WO 0116697 Mar 2001 WO
WO 0116698 Mar 2001 WO
WO 0116702 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 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
WO 03019399 Mar 2003 WO
WO 03085517 Oct 2003 WO
Related Publications (1)
Number Date Country
20090307469 A1 Dec 2009 US
Provisional Applications (1)
Number Date Country
60151961 Sep 1999 US
Continuations (1)
Number Date Country
Parent 10070091 US
Child 12477287 US