US 7,546,444 B1Grant
Register set used in multithreaded parallel processor architecture
Issue Date:2009-06-09
•20 Claims
•7 Drawing Sheets
Abstract
A parallel hardware-based multithreaded processor is described. The processor includes a general purpose processor that coordinates system functions and a plurality of microengines that support multiple hardware threads or contexts (THREAD—3 . . . THREAD—0). The processor maintains execution threads (THREAD—3 . . . THREAD—0) access a register set organized into a plurality of relatively addressable windows of registers that are relatively addressable per thread (THREAD—3 . . . THREAD—0).
Metadata
Assignee
- Intel Corporation
Inventors
- Gilbert Wolrich
- Matthew J. Adiletta
- William R. Wheeler
- Debra Bernstein
- Donald F. Hooper
Application Information
Application Number:US 10/070,091
Filing Date:2000-08-31
Priority Date:1999-09-01
Art Unit:2183
Classifications
IPC:
G06F9/00G06F12/00
Patent Drawings (7 sheets)
Description
[0001] This application is a 371 Application of International Application PCT/US00/23993, filed Aug. 31, 2000, which claims the benefit of Provisional Patent Application Ser. No. 60/151,961 filed Sep. 1, 1999.
Background
[0002] This invention relates to computer processors.
[0003] 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
[0004] FIG. 1 is a block diagram of a communication system employing a hardware-based multithreaded processor.
[0005] FIG. 2 is a detailed block diagram of the hardware-based multithreaded processor of FIG. 1 .
[0006] FIG. 3 is a block diagram of a microengine functional unit employed in the hardware-based multithreaded processor of FIGS. 1 and 2 .
[0007] FIG. 4 is a block diagram of a pipeline in the microengine of FIG. 3 .
[0008] FIG. 5 is a block diagram showing general purpose register address arrangement.
Description
[0009] 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.
[0010] 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, MicrosoftNT® real-time, VXWorks and □CUS, a freeware operating system available over the Internet, can be used.
[0011] 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.
[0012] 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.
[0013] 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.
[0014] 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.
[0015] 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 these 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.
[0016] 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.
[0017] 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.
[0018] 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.
[0019] 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.
[0020] 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.
[0021] 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.
[0022] 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 to 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.
[0023] 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.
[0024] 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:
[0025]
| FBUS unit | (Shared bus SRAM) | to/from microengine. | |
| FBUS unit | (via private bus) | writes from SDRAM Unit. | |
| FBUS unit | (via Mbus) | Reads to SDRAM. | |
[0026] 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.
[0027] 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.
[0028] 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.
[0029] 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.
[0030] 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.
[0031] 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:
[0032] 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.
[0033] 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.
[0034] 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.
[0035] 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.
[0036] 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.
[0037] 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.
[0038] 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.
[0039] 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.
[0040] 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.
[0041] 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):
[0042]
register address directly specified in 8-bit dest field (d7-d0):
register address directly specified in 8-bit dest field (d7-d0):
[0043]
[0044] 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.
[0045] 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):
[0046]
or as defined by the 6-bit dest field (d5-d0):
or as defined by the 6-bit dest field (d5-d0):
[0047]
[0048] If <d5:d4>=1,1, then the destination address does not address a valid register, thus, no dest operand is written back.
[0049] Other embodiments are within the scope of the appended claims.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method of maintaining execution threads in a parallel multithreaded processor comprises:
accessing, by a thread executing in the multithreaded processor, a register in a register set organized into a plurality of windows of registers, each of the plurality of windows of registers associated with a corresponding thread, each register in the plurality of windows of registers being relatively addressable by the corresponding thread and absolutely addressable by two or more of the threads executing on the multithreaded processor with absolutely addressable comprises providing an exact address of the register with the exact address specified in an instruction.
2. The method of claim 1 wherein multiple threads can use the same control store and relative register locations but access different window banks of registers.
3. The method of claim 1 wherein the relative register addressing divides the register banks into windows across the address width of the general purpose register set.
4. The method of claim 1 wherein relative addressing allows access any of the window registers relative to the starting point of a window of registers.
5. The method of claim 1 further comprising:
organizing the register set into windows according to the number of threads that execute in the processor.
6. The method of claim 1 wherein relative addressing allow the multiple threads to use the same control store and locations while allowing access to different windows of register and perform different functions.
7. The method of claim 1 wherein the window registers 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 relative to the starting point of the window of registers.
9. The method of claim 1 wherein the exact address of the register is directly specified in a source field or destination field of the instruction.
10. 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.
11. A hardware based multi-threaded processor comprises:
a processor unit comprising:
control logic circuit including context event switching logic, the context switching logic arbitrating access to the microengine for a plurality of executable threads;
an arithmetic logic unit to process data for executing threads; and
a register set that is organized into a plurality of windows of registers, each of the plurality of windows of registers associated with a corresponding one of the plurality of threads, each register in the plurality of windows of registers being relatively addressable by the corresponding thread associated with the respective window of registers and absolutely addressable by two or more of the threads executing on the multi-threaded processor, with any one of the registers of the register set being absolutely addressable by providing an exact address of the register with the exact address specified in an instruction.
12. The processor of claim 11 wherein the control logic circuit further comprises:
an instruction decoder; and
program counter units to track executing threads.
13. The processor of claim 12 wherein the program counters units are maintained in hardware.
14. The processor of claim 11 wherein the register set is organized into windows across an address width of the general purpose register set with each window relatively accessible by the corresponding thread.
15. The processor of claim 14 wherein the relative addressing allows access to any of the registers relative to the starting point of a window of registers.
16. The processor of claim 14 wherein the number of windows of the register set is according to the number of threads that execute in the processor.
17. The processor of claim 11 wherein relative addressing allow the multiple threads to use the same control store and locations while allowing access to different windows of register and perform different functions.
18. The processor of claim 11 wherein the windows of registers are provided using dual ported random access memories.
19. The processor of claim 11 wherein the processing unit is a microprogrammed processor unit.
20. A computer program product residing on a computer readable storage medium for managing execution of multiple threads in a multithreaded processor comprising instructions causing a processor to:
access, by an executing thread in the multithreaded processor, a register in a register set organized into a plurality of windows of registers, each of the plurality of windows of registers being associated with a corresponding thread, each register in the plurality of windows of registers being relatively addressable by the corresponding thread and absolutely addressable by two or more threads executing on the multithreaded processor with absolutely addressable comprises instructions that when executed cause the processor to provide an exact address of the register with the exact address specified in an instruction.
Patent Citations (382)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3373408(A) | 1968-03-01 | Ling | Applicant |
| US3478322(A) | 1969-11-01 | Evans | Applicant |
| US3577189(A) | 1971-05-01 | Cocke et al. | Applicant |
| US3792441(A) | 1974-02-01 | Wymore et al. | Applicant |
| US3881173(A) | 1975-04-01 | Larsen et al. | Applicant |
| US3913074(A) | 1975-10-01 | Homberg et al. | Applicant |
| US3940745(A) | 1976-02-01 | Sajeva | Applicant |
| US4023023(A) | 1977-05-01 | Bourrez et al. | Applicant |
| US4130890(A) | 1978-12-01 | Adam | Applicant |
| US4392758(A) | 1983-07-01 | Bowles et al. | Applicant |
| US4400770(A) | 1983-08-01 | Chan et al. | Applicant |
| US4454595(A) | 1984-06-01 | Cage | Applicant |
| US4471426(A) | 1984-09-01 | McDonough | Applicant |
| US4477872(A) | 1984-10-01 | Losq et al. | Applicant |
| US4514807(A) | 1985-04-01 | Nogi | Applicant |
| US4523272(A) | 1985-06-01 | Fukunaga et al. | Applicant |
| US4569016(A) | 1986-02-01 | Hao et al. | Applicant |
| US4606025(A) | 1986-08-01 | Peters et al. | Applicant |
| US4724521(A) | 1988-02-01 | Carron et al. | Applicant |
| US4742451(A) | 1988-05-01 | Bruckert et al. | Applicant |
| US4745544(A) | 1988-05-01 | Renner et al. | Applicant |
| US4754398(A) | 1988-06-01 | Pribnow | Applicant |
| US4755966(A) | 1988-07-01 | Lee et al. | Applicant |
| US4777587(A) | 1988-10-01 | Case et al. | Applicant |
| US4808988(A) | 1989-02-01 | Burke et al. | Applicant |
| US4816913(A) | 1989-03-01 | Harney et al. | Applicant |
| US4847755(A) | 1989-07-01 | Morrison et al. | Applicant |
| US4866664(A) | 1989-09-01 | Burkhardt, Jr. et al. | Applicant |
| US4868735(A) | 1989-09-01 | Moller et al. | Applicant |
| US4992934(A) | 1991-02-01 | Portanova et al. | Applicant |
| US5045995(A) | 1991-09-01 | Levinthal et al. | Applicant |
| US5056015(A) | 1991-10-01 | Baldwin et al. | Applicant |
| US5073864(A) | 1991-12-01 | Methvin et al. | Applicant |
| US5113516(A) | 1992-05-01 | Johnson | Applicant |
| US5140685(A) | 1992-08-01 | Sipple et al. | Applicant |
| US5142683(A) | 1992-08-01 | Burkhardt, Jr. et al. | Applicant |
| US5155831(A) | 1992-10-01 | Emma et al. | Applicant |
| US5155854(A) | 1992-10-01 | Flynn et al. | Applicant |
| US5165025(A) | 1992-11-01 | Lass | Applicant |
| US5168555(A) | 1992-12-01 | Byers et al. | Applicant |
| US5170484(A) | 1992-12-01 | Grondalski | Applicant |
| US5173897(A) | 1992-12-01 | Schrodi et al. | Applicant |
| US5187800(A) | 1993-02-01 | Sutherland | Applicant |
| US5189636(A) | 1993-02-01 | Patti et al. | Applicant |
| US5202972(A) | 1993-04-01 | Gusefski et al. | Applicant |
| US5220669(A) | 1993-06-01 | Baum et al. | Applicant |
| US5247671(A) | 1993-09-01 | Adkins et al. | Applicant |
| US5255239(A) | 1993-10-01 | Taborn et al. | Applicant |
| US5263169(A) | 1993-11-01 | Genusov et al. | Applicant |
| US5274770(A) | 1993-12-01 | Khim Yeoh et al. | Applicant |
| US5347648(A) | 1994-09-01 | Stamm et al. | Applicant |
| US5357617(A) | 1994-10-01 | Davis et al. | Applicant |
| US5363448(A) | 1994-11-01 | Koopman, Jr. et al. | Applicant |
| US5367678(A) | 1994-11-01 | Lee et al. | Applicant |
| US5390329(A) | 1995-02-01 | Gaertner et al. | Applicant |
| US5392391(A) | 1995-02-01 | Caulk, Jr. et al. | Applicant |
| US5392411(A) | 1995-02-01 | Ozaki | Applicant |
| US5392412(A) | 1995-02-01 | McKenna | Applicant |
| US5394530(A) | 1995-02-01 | Kitta | Applicant |
| US5404464(A) | 1995-04-01 | Bennett | Applicant |
| US5404482(A) | 1995-04-01 | Stamm et al. | Applicant |
| US5428779(A) | 1995-06-01 | Allegrucci et al. | Applicant |
| US5428809(A) | 1995-06-01 | Coffin et al. | Applicant |
| US5432918(A) | 1995-07-01 | Stamm | Applicant |
| US5436626(A) | 1995-07-01 | Fujiwara | Applicant |
| US5442756(A) | 1995-08-01 | Grochowski et al. | Applicant |
| US5448702(A) | 1995-09-01 | Garcia, Jr. et al. | Applicant |
| US5450351(A) | 1995-09-01 | Heddes | Applicant |
| US5450603(A) | 1995-09-01 | Davies | Applicant |
| US5452437(A) | 1995-09-01 | Richey et al. | Applicant |
| US5459842(A) | 1995-10-01 | Begun et al. | Applicant |
| US5463625(A) | 1995-10-01 | Yasrebi | Applicant |
| US5463746(A) | 1995-10-01 | Brodnax et al. | Applicant |
| US5467452(A) | 1995-11-01 | Blum et al. | Applicant |
| US5481683(A) | 1996-01-01 | Karim | Applicant |
| US5487159(A) | 1996-01-01 | Byers et al. | Applicant |
| US5509130(A) | 1996-04-01 | Trauben et al. | Applicant |
| US5517628(A) | 1996-05-01 | Morrison et al. | Applicant |
| US5517648(A) | 1996-05-01 | Bertone et al. | Applicant |
| US5541920(A) | 1996-07-01 | Angle et al. | Applicant |
| US5542070(A) | 1996-07-01 | LeBlanc et al. | Applicant |
| US5542088(A) | 1996-07-01 | Jennings, Jr. et al. | Applicant |
| US5544236(A) | 1996-08-01 | Andruska et al. | Applicant |
| US5544337(A) | 1996-08-01 | Beard et al. | Applicant |
| US5550816(A) | 1996-08-01 | Hardwick et al. | Applicant |
| US5557766(A) | 1996-09-01 | Takiguchi et al. | Applicant |
| US5568617(A) | 1996-10-01 | Kametani | Applicant |
| US5572690(A) | 1996-11-01 | Molnar et al. | Applicant |
| US5574922(A) | 1996-11-01 | James | Applicant |
| US5574939(A) | 1996-11-01 | Keckler et al. | Applicant |
| US5592622(A) | 1997-01-01 | Isfeld et al. | Applicant |
| US5600812(A) | 1997-02-01 | Park | Applicant |
| US5600848(A) | 1997-02-01 | Sproull et al. | Applicant |
| US5606676(A) | 1997-02-01 | Grochowski et al. | Applicant |
| US5610864(A) | 1997-03-01 | Manning | Applicant |
| US5613071(A) | 1997-03-01 | Rankin et al. | Applicant |
| US5613136(A) | 1997-03-01 | Casavant et al. | Applicant |
| US5623489(A) | 1997-04-01 | Cotton et al. | Applicant |
| US5627829(A) | 1997-05-01 | Gleeson et al. | Applicant |
| US5630130(A) | 1997-05-01 | Perotto et al. | Applicant |
| US5640538(A) | 1997-06-01 | Dyer et al. | Applicant |
| US5644623(A) | 1997-07-01 | Gulledge | Applicant |
| US5649157(A) | 1997-07-01 | Williams | Applicant |
| US5652583(A) | 1997-07-01 | Kang | Applicant |
| US5659687(A) | 1997-08-01 | Kim et al. | Applicant |
| US5659722(A) | 1997-08-01 | Blaner et al. | Applicant |
| US5669012(A) | 1997-09-01 | Shimizu et al. | Applicant |
| US5680564(A) | 1997-10-01 | Divivier et al. | Applicant |
| US5680641(A) | 1997-10-01 | Sidman | Applicant |
| US5689566(A) | 1997-11-01 | Nguyen | Applicant |
| US5692167(A) | 1997-11-01 | Grochowski et al. | Applicant |
| US5699537(A) | 1997-12-01 | Sharangpani et al. | Applicant |
| US5701435(A) | 1997-12-01 | Chi | Applicant |
| US5704054(A) | 1997-12-01 | Bhattacharya | Applicant |
| US5717760(A) | 1998-02-01 | Satterfield | Applicant |
| US5717898(A) | 1998-02-01 | Kagan et al. | Applicant |
| US5721869(A) | 1998-02-01 | Imakawa | Applicant |
| US5721870(A) | 1998-02-01 | Matsumoto | Applicant |
| US5724563(A) | 1998-03-01 | Hasegawa | Applicant |
| US5742587(A) | 1998-04-01 | Zornig et al. | Applicant |
| US5742782(A) | 1998-04-01 | Ito et al. | Applicant |
| US5742822(A) | 1998-04-01 | Motomura | Applicant |
| US5745913(A) | 1998-04-01 | Pattin et al. | Applicant |
| US5748950(A) | 1998-05-01 | White et al. | Applicant |
| US5751987(A) | 1998-05-01 | Mahant-Shetti et al. | Applicant |
| US5761507(A) | 1998-06-01 | Govett | Applicant |
| US5761522(A) | 1998-06-01 | Hisanaga et al. | Applicant |
| US5781774(A) | 1998-07-01 | Krick | Applicant |
| US5784649(A) | 1998-07-01 | Begur et al. | Applicant |
| US5784712(A) | 1998-07-01 | Byers et al. | Applicant |
| US5787454(A) | 1998-07-01 | Rohlman | Applicant |
| US5796413(A) | 1998-08-01 | Shipp et al. | Applicant |
| US5797043(A) | 1998-08-01 | Lewis et al. | Applicant |
| US5802373(A) | 1998-09-01 | Yates et al. | Applicant |
| US5809235(A) | 1998-09-01 | Sharma et al. | Applicant |
| US5809530(A) | 1998-09-01 | Samra et al. | Applicant |
| US5812811(A) | 1998-09-01 | Dubey et al. | Applicant |
| US5812839(A) | 1998-09-01 | Hoyt et al. | Applicant |
| US5812868(A) | 1998-09-01 | Moyer et al. | Applicant |
| US5815698(A) | 1998-09-01 | Holmann et al. | Applicant |
| US5815714(A) | 1998-09-01 | Shridhar et al. | Applicant |
| US5819080(A) | 1998-10-01 | Dutton et al. | Applicant |
| US5822619(A) | 1998-10-01 | Sidwell | Applicant |
| US5828746(A) | 1998-10-01 | Ardon | Applicant |
| US5828863(A) | 1998-10-01 | Barrett et al. | Applicant |
| US5832215(A) | 1998-11-01 | Kato et al. | Applicant |
| US5832258(A) | 1998-11-01 | Kiuchi et al. | Applicant |
| US5835755(A) | 1998-11-01 | Stellwagen, Jr. | Applicant |
| US5838975(A) | 1998-11-01 | Abramson et al. | Applicant |
| US5848276(A) | 1998-12-01 | King et al. | Applicant |
| US5854922(A) | 1998-12-01 | Gravenstein et al. | Applicant |
| US5857104(A) | 1999-01-01 | Natarjan et al. | Applicant |
| US5859789(A) | 1999-01-01 | Sidwell | Applicant |
| US5859790(A) | 1999-01-01 | Sidwell | Applicant |
| US5860085(A) | 1999-01-01 | Stormon et al. | Applicant |
| US5860158(A) | 1999-01-01 | Pai et al. | Applicant |
| US5870597(A) | 1999-02-01 | Panwar et al. | Examiner |
| US5872963(A) | 1999-02-01 | Bitar et al. | Applicant |
| US5875355(A) | 1999-02-01 | Sidwell et al. | Applicant |
| US5875470(A) | 1999-02-01 | Dreibelbis et al. | Applicant |
| US5884069(A) | 1999-03-01 | Sidwell | Applicant |
| US5886992(A) | 1999-03-01 | Raatikainen et al. | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5890208(A) | 1999-03-01 | Kwon | Applicant |
| US5892979(A) | 1999-04-01 | Shiraki et al. | Applicant |
| US5898866(A) | 1999-04-01 | Atkins et al. | Applicant |
| US5900025(A) | 1999-05-01 | Sollars | Examiner |
| US5905876(A) | 1999-05-01 | Pawlowski et al. | Applicant |
| US5905889(A) | 1999-05-01 | Wilhelm, Jr. | Applicant |
| US5915123(A) | 1999-06-01 | Mirsky et al. | Applicant |
| US5923872(A) | 1999-07-01 | Chrysos et al. | Applicant |
| US5926646(A) | 1999-07-01 | Pickett et al. | Applicant |
| US5928358(A) | 1999-07-01 | Takayama et al. | Applicant |
| US5933627(A) | 1999-08-01 | Parady | Applicant |
| US5937177(A) | 1999-08-01 | Molnar et al. | Applicant |
| US5937187(A) | 1999-08-01 | Kosche et al. | Applicant |
| US5938736(A) | 1999-08-01 | Muller et al. | Applicant |
| US5940612(A) | 1999-08-01 | Brady et al. | Applicant |
| US5940866(A) | 1999-08-01 | Chisholm et al. | Applicant |
| US5943491(A) | 1999-08-01 | Sutherland et al. | Applicant |
| US5944816(A) | 1999-08-01 | Dutton et al. | Applicant |
| US5946222(A) | 1999-08-01 | Redford | Applicant |
| US5946487(A) | 1999-08-01 | Dangelo | Applicant |
| US5948081(A) | 1999-09-01 | Foster | Applicant |
| US5951679(A) | 1999-09-01 | Anderson et al. | Applicant |
| US5956514(A) | 1999-09-01 | Wen et al. | Applicant |
| US5958031(A) | 1999-09-01 | Kim | Applicant |
| US5961628(A) | 1999-10-01 | Nguyen et al. | Applicant |
| US5970013(A) | 1999-10-01 | Fischer et al. | Applicant |
| US5978838(A) | 1999-11-01 | Mohamed et al. | Applicant |
| US5983274(A) | 1999-11-01 | Hyder et al. | Applicant |
| US5993627(A) | 1999-11-01 | Anderson et al. | Applicant |
| US5996068(A) | 1999-11-01 | Dwyer et al. | Examiner |
| US6002881(A) | 1999-12-01 | York et al. | Applicant |
| US6005575(A) | 1999-12-01 | Colleran et al. | Applicant |
| US6009505(A) | 1999-12-01 | Thayer et al. | Applicant |
| US6009515(A) | 1999-12-01 | Steele, Jr. | Applicant |
| US6012151(A) | 2000-01-01 | Mano | Applicant |
| US6014729(A) | 2000-01-01 | Lannan et al. | Applicant |
| US6023742(A) | 2000-02-01 | Ebeling et al. | Applicant |
| US6029228(A) | 2000-02-01 | Cai et al. | Applicant |
| US6052769(A) | 2000-04-01 | Huff et al. | Applicant |
| US6058168(A) | 2000-05-01 | Braband | Applicant |
| US6058465(A) | 2000-05-01 | Nguyen | Applicant |
| US6061710(A) | 2000-05-01 | Eickemeyer et al. | Applicant |
| US6061711(A) | 2000-05-01 | Song et al. | Applicant |
| US6067585(A) | 2000-05-01 | Hoang | Applicant |
| US6070231(A) | 2000-05-01 | Ottinger | Applicant |
| US6072781(A) | 2000-06-01 | Feeney et al. | Applicant |
| US6073215(A) | 2000-06-01 | Snyder | Applicant |
| US6076158(A) | 2000-06-01 | Sites et al. | Applicant |
| US6079008(A) | 2000-06-01 | Clery, III | Applicant |
| US6079014(A) | 2000-06-01 | Papworth et al. | Applicant |
| US6085215(A) | 2000-07-01 | Ramakrishnan et al. | Applicant |
| US6085294(A) | 2000-07-01 | Van Doren et al. | Applicant |
| US6092127(A) | 2000-07-01 | Tausheck | Applicant |
| US6092158(A) | 2000-07-01 | Harriman et al. | Applicant |
| US6092175(A) | 2000-07-01 | Levy et al. | Applicant |
| US6100905(A) | 2000-08-01 | Sidwell | Applicant |
| US6101599(A) | 2000-08-01 | Wright et al. | Applicant |
| US6112016(A) | 2000-08-01 | MacWilliams et al. | Applicant |
| US6115777(A) | 2000-09-01 | Zahir et al. | Applicant |
| US6115811(A) | 2000-09-01 | Steele, Jr. | Applicant |
| US6134665(A) | 2000-10-01 | Klein et al. | Applicant |
| US6139199(A) | 2000-10-01 | Rodriguez | Applicant |
| US6141348(A) | 2000-10-01 | Muntz | Applicant |
| US6141689(A) | 2000-10-01 | Yasrebi | Applicant |
| US6141765(A) | 2000-10-01 | Sherman | Applicant |
| US6144669(A) | 2000-11-01 | Williams et al. | Applicant |
| US6145054(A) | 2000-11-01 | Mehrotra et al. | Applicant |
| US6145077(A) | 2000-11-01 | Sidwell et al. | Applicant |
| US6145123(A) | 2000-11-01 | Torrey et al. | Applicant |
| US6157955(A) | 2000-12-01 | Narad et al. | Applicant |
| US6157988(A) | 2000-12-01 | Dowling | Applicant |
| US6160562(A) | 2000-12-01 | Chin et al. | Applicant |
| US6182177(B1) | 2001-01-01 | Harriman | Applicant |
| US6195676(B1) | 2001-02-01 | Spix et al. | Applicant |
| US6195739(B1) | 2001-02-01 | Wright et al. | Applicant |
| US6199133(B1) | 2001-03-01 | Schnell | Applicant |
| US6201807(B1) | 2001-03-01 | Prasanna | Applicant |
| US6205468(B1) | 2001-03-01 | Diepstraten et al. | Applicant |
| US6212542(B1) | 2001-04-01 | Kahle et al. | Applicant |
| US6212611(B1) | 2001-04-01 | Nizar et al. | Applicant |
| US6216220(B1) | 2001-04-01 | Hwang | Applicant |
| US6223207(B1) | 2001-04-01 | Lucovsky et al. | Applicant |
| US6223208(B1) | 2001-04-01 | Kiefer et al. | Applicant |
| US6223238(B1) | 2001-04-01 | Meyer et al. | Applicant |
| US6223277(B1) | 2001-04-01 | Karguth | Applicant |
| US6223279(B1) | 2001-04-01 | Nishimura et al. | Applicant |
| US6230119(B1) | 2001-05-01 | Mitchell | Applicant |
| US6230230(B1) | 2001-05-01 | Joy et al. | Applicant |
| US6230261(B1) | 2001-05-01 | Henry et al. | Applicant |
| US6247025(B1) | 2001-06-01 | Bacon | Applicant |
| US6256713(B1) | 2001-07-01 | Audityan et al. | Applicant |
| US6259699(B1) | 2001-07-01 | Opalka et al. | Applicant |
| US6269391(B1) | 2001-07-01 | Gillespie | Applicant |
| US6272616(B1) | 2001-08-01 | Fernando et al. | Applicant |
| US6275505(B1) | 2001-08-01 | O Loughlin et al. | Applicant |
| US6275508(B1) | 2001-08-01 | Aggarwal et al. | Applicant |
| US6279066(B1) | 2001-08-01 | Velingker | Applicant |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6289011(B1) | 2001-09-01 | Seo et al. | Applicant |
| US6298370(B1) | 2001-10-01 | Tang et al. | Applicant |
| US6304956(B1) | 2001-10-01 | Tran | Applicant |
| US6307789(B1) | 2001-10-01 | Wolrich et al. | Applicant |
| US6314510(B1) | 2001-11-01 | Saulsbury et al. | Applicant |
| US6324624(B1) | 2001-11-01 | Wolrich et al. | Applicant |
| US6338133(B1) | 2002-01-01 | Schroter | Applicant |
| US6345334(B1) | 2002-02-01 | Nakagawa et al. | Applicant |
| US6347344(B1) | 2002-02-01 | Baker et al. | Applicant |
| US6351808(B1) | 2002-02-01 | Joy et al. | Applicant |
| US6356962(B1) | 2002-03-01 | Kasper et al. | Applicant |
| US6360262(B1) | 2002-03-01 | Guenthner et al. | Applicant |
| US6373848(B1) | 2002-04-01 | Allison et al. | Applicant |
| US6378124(B1) | 2002-04-01 | Bates et al. | Applicant |
| US6378125(B1) | 2002-04-01 | Bates et al. | Applicant |
| US6385720(B1) | 2002-05-01 | Tanaka et al. | Applicant |
| US6389449(B1) | 2002-05-01 | Nemirovsky et al. | Applicant |
| US6393483(B1) | 2002-05-01 | Latif et al. | Applicant |
| US6401155(B1) | 2002-06-01 | Saville et al. | Applicant |
| US6408325(B1) | 2002-06-01 | Shaylor | Examiner |
| US6415338(B1) | 2002-07-01 | Habot | Applicant |
| US6426940(B1) | 2002-07-01 | Seo et al. | Applicant |
| US6427196(B1) | 2002-07-01 | Adiletta et al. | Applicant |
| US6430626(B1) | 2002-08-01 | Witkowski et al. | Applicant |
| US6434145(B1) | 2002-08-01 | Opsasnick et al. | Applicant |
| US6442669(B2) | 2002-08-01 | Wright et al. | Applicant |
| US6446190(B1) | 2002-09-01 | Barry et al. | Applicant |
| US6463072(B1) | 2002-10-01 | Wolrich et al. | Applicant |
| US6496847(B1) | 2002-12-01 | Bugnion et al. | Applicant |
| US6505229(B1) | 2003-01-01 | Turner et al. | Applicant |
| US6523108(B1) | 2003-02-01 | James et al. | Applicant |
| US6532509(B1) | 2003-03-01 | Wolrich et al. | Applicant |
| US6543049(B1) | 2003-04-01 | Bates et al. | Applicant |
| US6552826(B2) | 2003-04-01 | Adler et al. | Applicant |
| US6560629(B1) | 2003-05-01 | Harris | Applicant |
| US6560667(B1) | 2003-05-01 | Wolrich et al. | Applicant |
| US6560671(B1) | 2003-05-01 | Samra et al. | Applicant |
| US6564316(B1) | 2003-05-01 | Perets et al. | Applicant |
| US6574702(B2) | 2003-06-01 | Khanna et al. | Applicant |
| US6577542(B2) | 2003-06-01 | Wolrich et al. | Applicant |
| US6584522(B1) | 2003-06-01 | Wolrich et al. | Applicant |
| US6587906(B2) | 2003-07-01 | Wolrich et al. | Applicant |
| US6606704(B1) | 2003-08-01 | Adiletta et al. | Applicant |
| US6625654(B1) | 2003-09-01 | Wolrich et al. | Applicant |
| US6629237(B2) | 2003-09-01 | Wolrich et al. | Applicant |
| US6631430(B1) | 2003-10-01 | Wolrich et al. | Applicant |
| US6631462(B1) | 2003-10-01 | Wolrich et al. | Applicant |
| US6661794(B1) | 2003-12-01 | Wolrich et al. | Applicant |
| US6667920(B2) | 2003-12-01 | Wolrich et al. | Applicant |
| US6668317(B1) | 2003-12-01 | Bernstein et al. | Applicant |
| US6681300(B2) | 2004-01-01 | Wolrich et al. | Applicant |
| US6694380(B1) | 2004-02-01 | Wolrich et al. | Applicant |
| US6697935(B1) | 2004-02-01 | Borkenhagen et al. | Applicant |
| US6718457(B2) | 2004-04-01 | Tremblay et al. | Applicant |
| US6784889(B1) | 2004-08-01 | Radke | Applicant |
| US6836838(B1) | 2004-12-01 | Wright et al. | Applicant |
| US6862676(B1) | 2005-03-01 | Knapp et al. | Applicant |
| US6934951(B2) | 2005-08-01 | Wilkinson, III et al. | Applicant |
| US6971103(B2) | 2005-11-01 | Hokenek et al. | Applicant |
| US6976095(B1) | 2005-12-01 | Wolrich et al. | Applicant |
| US6983350(B1) | 2006-01-01 | Adiletta et al. | Applicant |
| US7020871(B2) | 2006-03-01 | Bernstein et al. | Applicant |
| US7181594(B2) | 2007-02-01 | Wilkinson, III et al. | Applicant |
| US7185224(B1) | 2007-02-01 | Fredenburg et al. | Applicant |
| US7191309(B1) | 2007-03-01 | Wolrich et al. | Applicant |
| US7302549(B2) | 2007-11-01 | Wilkinson, III et al. | Applicant |
| US7421572(B1) | 2008-09-01 | Wolrich et al. | Applicant |
| US2002/0038403(A1) | 2002-03-01 | Wolrich et al. | Applicant |
| US2002/0053017(A1) | 2002-05-01 | Adiletta et al. | Applicant |
| US2002/0056037(A1) | 2002-05-01 | Wolrich et al. | Examiner |
| US2003/0041228(A1) | 2003-02-01 | Rosenbluth et al. | Applicant |
| US2003/0145159(A1) | 2003-07-01 | Adiletta et al. | Applicant |
| US2003/0191866(A1) | 2003-10-01 | Wolrich et al. | Applicant |
| US2004/0039895(A1) | 2004-02-01 | Wolrich et al. | Applicant |
| US2004/0054880(A1) | 2004-03-01 | Bernstein et al. | Applicant |
| US2004/0071152(A1) | 2004-04-01 | Wolrich et al. | Applicant |
| US2004/0073728(A1) | 2004-04-01 | Wolrich et al. | Applicant |
| US2004/0073778(A1) | 2004-04-01 | Adiletta et al. | Applicant |
| US2004/0098496(A1) | 2004-05-01 | Wolrich et al. | Applicant |
| US2004/0109369(A1) | 2004-06-01 | Wolrich et al. | Applicant |
| US2004/0205747(A1) | 2004-10-01 | Bernstein et al. | Applicant |
| US2007/0234009(A1) | 2007-10-01 | Wolrich et al. | Applicant |
| EP130381 | 1985-01-01 | Applicant | |
| EP379709 | 1990-08-01 | Applicant | |
| EP463855 | 1992-01-01 | Applicant | |
| EP464715 | 1992-01-01 | Applicant | |
| EP4476628 | 1992-03-01 | Applicant | |
| EP633678 | 1995-01-01 | Applicant | |
| EP696772 | 1996-02-01 | Applicant | |
| EP745933 | 1996-12-01 | Applicant | |
| EP809180 | 1997-11-01 | Applicant | |
| EP863462 | 1998-09-01 | Applicant | |
| FR2752966 | 1998-03-01 | Applicant | |
| JP59111533 | 1984-06-01 | Applicant | |
| WO92/07335 | 1992-04-01 | Applicant | |
| WO94/15287 | 1994-07-01 | Applicant | |
| WO97/38372 | 1997-10-01 | Applicant | |
| WO1/15718 | 2001-03-01 | Applicant | |
| WO1/16697 | 2001-03-01 | Applicant | |
| WO1/16698 | 2001-03-01 | Applicant | |
| WO1/16703 | 2001-03-01 | Applicant | |
| WO1/16713 | 2001-03-01 | Applicant | |
| WO1/16714 | 2001-03-01 | Applicant | |
| WO1/16715 | 2001-03-01 | Applicant | |
| WO1/16716 | 2001-03-01 | Applicant | |
| WO1/16718 | 2001-03-01 | Applicant | |
| WO1/16722 | 2001-03-01 | Applicant | |
| WO1/16758 | 2001-03-01 | Applicant | |
| WO1/16769 | 2001-03-01 | Applicant | |
| WO1/16770 | 2001-03-01 | Applicant | |
| WO1/16782 | 2001-03-01 | Applicant | |
| WO1/18646 | 2001-03-01 | Applicant | |
| WO1/41530 | 2001-06-01 | Applicant | |
| WO1/48596 | 2001-07-01 | Applicant | |
| WO1/48599 | 2001-07-01 | Applicant | |
| WO1/48606 | 2001-07-01 | Applicant | |
| WO1/48619 | 2001-07-01 | Applicant | |
| WO1/50247 | 2001-07-01 | Applicant | |
| WO1/50679 | 2001-07-01 | Applicant | |
| WO3/019399 | 2003-03-01 | Applicant | |
| WO3/085517 | 2003-10-01 | Applicant |
Non-Patent Literature (56)
- Chen et al., “The Compiler for Supporting Multithreading in Cyclic Register Windows”, pp. 57-62, IEEE, 1996.Examiner
- Nuth, Peter R., The Named-State Register File, Aug. 1993, MIT ,Technical Report 1459, 136 pages.Examiner
- Paver et al., “Register Locking in Asynchronous Processor Computer Design: VLSI Processors,” ICCD '92 Proceedings, IEEE 1992 International Conference, 1992, pp. 351-355.Applicant
- Waldspurger et al., “Register Relocation: Flexible Contents for Multithreading,” Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993, pp. 120-130.Applicant
- U.S. Appl. No. 09/473,571, filed Dec. 28, 1999, Wolrich et al.Applicant
- U.S. Appl. No. 09/475,614, filed Dec. 30, 1999, Wolrich et al.Applicant
- Agarneal et al., “April: A Processor ArchitecUre for Multiprocessing,” Proceedings of the 17th Annual International Symposium on Computer Architecture, IEEE, pp. 104-114.Applicant
- Byrd et al., “Multithread Processor Architectures,” IEEE Spectrum, vol. 32, No. 8, New York, Aug. 1, 1995, pp. 38-46.Applicant
- Chang et al., “A New Mechanism For Improving Branch Predictor Performance,” IEEE, pp. 22-31 (1994).Applicant
- Doyle et al., Microsoft Press Computer Dictionary, 2nd ed., Microsoft Press, Redmond, Washington, USA, 1994, p. 326.Applicant
- Farkas et al., “The multicluster architecture: reducing cycle time through partitioning,” IEEE, vol. 30, Dec. 1997, pp. 149-159.Applicant
- Fillo et al., “The M-Machine Multicomputer,” IEEE Proceedings of MICRO-28, 1995, pp. 146-156.Applicant
- Gomez et al., “Efficient Multithreaded User-Space Transport for Network Computing: Design and Test of the TRAP Protocol,” Journal of Parallel and Distributed Computing, Academic Press, Duluth, Minnesota, USA, vol. 40, No. 1, Jan. 10, 1997, pp. 103-117.Applicant
- Haug et al., “Reconfigurable hardware as shared resource for parallel threads,” IEEE Symposium on FPGAs for Custom Computing Machines, 1998.Applicant
- Hauser et al., “Garp: a MIPS processor with a reconfigurable coprocessor,” Proceedings of the 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 1997.Applicant
- Hennessy et al., “Complete Organization and Design: The Hardware/Software Interface,” Morgan Kaufman Publishers, 1998, pp. 476-482.Applicant
- Hyde, R., “Overview of Memory Management,” Byte, vol. 13, No. 4, 1998, pp. 219-225.Applicant
- Intel, “1A-64 Application Developer's Architecture Guide,” Rev. 1.0, May 1999, pp. 2-2, 4-29 to 4-31, 7-116 to 7-118 and c-21.Applicant
- Keckler et al., “Exploiting fine grain thread level parallelism on the MIT multi-ALU processor,” IEEE, Jun. 1998.Applicant
- Litch et al., “StrongARMing Portable Communications,” IEEE Micro, 1998, pp. 48-55.Applicant
- Mendelson et al., “Design Alternatives of Multithreaded Architecture,” International Journal of Parallel Programming, vol. 27, No. 3,Plenum Press, New York, USA, Jun. 1999, pp. 161-193.Applicant
- Schmidt et al., “The Performance of Alternative Threading Architectures for Parallel Communication Subsystems,” Internet Document, Online!, Nov. 13, 1998.Applicant
- Thistle et al., “A Processor Architecture for Horizon,” IEEE, 1998, pp. 35-41.Applicant
- Tremblay et al., “A Three Dimensional Register File for Superscalar Processors,” IEEE Proceedings of the 28th Annual Hawaii International Conference on System Sciences, 1995, pp. 191-201.Applicant
- Trimberger et al, “A time-multiplexed FPGA,” Proceedings of the 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 1998.Applicant
- Turner et al., “Design of a High Performance Active Router,” Internet Document, Online, Mar. 18, 1999.Applicant
- Vibhatavanijt et al., “Simultaneous Multithreading-Based Routers,” Proceedings of the 2000 International Conference of Parallel Processing, Toronto, Ontario, Canada, Aug. 21-24, 2000, pp. 362-359.Applicant
- Wadler, “The Concatenate Vanishes,” University of Glasgow, Dec. 1987 (revised Nov. 1989), pp. 1-7.Applicant
- Wazlowski et al., “PRISM-II computer and architecture,” IEEE Proceedings, Workshop on FPGAs for Custom Computing Machines, 1993.Applicant
- “IOP Task Switching”, IBM Technical Disclosure Bulletin, 33(5):156-158, Oct. 1990.Applicant
- “HART, Field Communications Protocol, Application Guide”, Hart Communication Foundation, pp. 1-74, (1999).Applicant
- Bowden, Romilly, “What is HART?” Romilly's HART® and Fieldbus Web Site, 3 pages, (1997). <URL: http://www.romilly.co.uk/whathart.htm>.Applicant
- Cogswell, et al., “MACS: a predictable architecture for real time systems”, IEEE Comp. Soc. Press, SYMP(12):296-305, (1991).Applicant
- Fiske et al., “Thread prioritization: a thread scheduling mechanism for multiple-context parallel processors”, IEEE Comput. Soc., pp. 210-221, (1995).Applicant
- Hennesy et al., Computer Organization and Design: The Hardware/Software Interface, Morgan Kaufman Publishers, pp. 116-119, 181-182, 225-227, 447-449, 466-470, 476-482, 510-519, 712, (1998).Applicant
- Heuring et al., Computer Systems Design and Architecture, Reading, MA, Addision Wesley Longman, Inc., pp. 174-176 and 200, (1997).Applicant
- Heuring et al., Computer Systems Design and Architecture, Reading, MA, Addision Wesley Longman, Inc., pp. 38-40, 143-171, and 258-288, (1997).Applicant
- Heuring et al., Computer Systems Design and Architecture, Reading, MA, Addision Wesley Longman, Inc., pp. 69-71, (1997).Applicant
- Hirata, H., et al., “An Elementary Processor Architecture with Simultaneous Instruction Issuing from Multiple Threads”, Proc. 19th Annual International Symposium on Computer Architecture, ACM & IEEE-CS, 20(2):136-145, May 1992.Applicant
- Intel, “1A-64 Application Developer's Architecture Guide,” Rev.1.0, pp. 2-2, 2-3, 3-1, 7-165, C-4, and C-23, May 1999.Applicant
- Jung, G., et al., “Flexible Register Window Structure for Multi-Tasking”, Proc. 24th Annual Hawaii Conference on System Sciences, vol. 1, pp. 110-116, (1991).Applicant
- Kane, Gerry, PA-RISC 2.0 Architecture, 1995, Prentice Hall PTR, pp. 1-6, 7-13 & 7-14.Applicant
- Koch, G., et al., “Breakpoints and Breakpoint Detection in Source Level Emulation”, Proc. 19th International Symposium on System Synthesis (ISSS '96), IEEE, pp. 26-31 (1996).Applicant
- Moors, et al., “Cascading Content-Addressable Memories”, IEEE Micro, 12(3):56-66 (1992).Applicant
- Patterson, et al., Computer Architecture A Quantitative Approach, 2nd Ed., Morgan Kaufmann Publishers, Inc., pp. 447-449, (1996).Applicant
- Paver, et al., “Register Locking in an Asynchronous Microprocessor”, IEEE, pp. 351-355, (1992).Applicant
- Philips ED - Philips Components: “8051 Based 8 Bit Microcontrollers, Data Handbook Integrated Circuits, Book IC20”, 8051 Based 8 Bit Microcontrollers, Eindhoven, Philips, NL, pp. 5-19 (1991).Applicant
- Probst et al., “Programming, Compiling and Executing Partially-Ordered Instruction Streams on Scalable Shared-Memory Multiprocessors”, Proceedings of the 27th Annual Hawaiian International Conference on System Sciences, IEEE, pp. 584-593, (1994).Applicant
- Quammen, D., et al., “Flexible Register Management for Sequential Programs”, IEEE Proc. of the Annual International Symposium on the Computer Architecture, Toronto, May 27-30, 1991, vol. SYMP. 18, pp. 320-329.Applicant
- Ramsey, N., “Correctness of Trap-Based Breakpoint Implementations”, Proc. of the 21st ACM Symposium on the Principles of Programming Languages, pp. 15-24 (1994).Applicant
- Sproull, R.F., et al., “The Counterflow Pipeline Processor Architecture”, IEEE Design & Test of Computers, pp. 48-59, (1994).Applicant
- Steven, G.B., et al., “ALU design and processor branch architecture”, Miroprocessing and Microprogramming, 36(5):259-278, Oct. 1993.Applicant
- Young, H.C., “Code Scheduling Methods for Some Architectural Features in Pipe”, Microprocessing and Microprogramming, Elsevier Science Publishers, Amsterdam, NL, 22(1):39-63, Jan. 1988.Applicant
- Young, H.C., “On Instruction and Data Prefetch Mechanisms”, International Symposium on VLSI Technology, Systems and Applications, Proc. of Technical Papers, pp. 239-246, (1995).Applicant
- Hidaka, Y., et al., “Multiple Threads in Cyclic Register Windows”, Computer Architecture News, ACM, New York, NY, USA, 21(2):131-142, May 1993.Applicant
- Okamoto, K., et al., “Multithread Execution Mechanisms on RICA-1 for Massively Parallel Computation”, IEEE - Proc. Of PACT '96, pp. 116-121 (1996).Applicant