US 7,020,871 B2Grant
Breakpoint method for parallel hardware threads in multithreaded processor
Issue Date:2006-03-28
•12 Claims
•5 Drawing Sheets
Abstract
A method of debugging code that executes in a multithreaded processor having a microengines includes receiving a program instruction and an identification representing a selected one of the microengines from a remote user interface connected to the processor pausing program execution in the threads executing in the selected microengine, inserting a breakpoint after a program instruction in the selected microengine that matches the program instruction received from the remote user interface, resuming program execution in the selected microengine, executing a breakpoint routine if program execution in the selected microengine encounters the breakpoint and resuming program execution in the microengine.
Metadata
Assignee
- Intel Corporation
Inventors
- Debra Bernstein
- Serge Kornfeld
- Desmond R. Johnson
- Donald F. Hooper
- James D. Guilford
- Richard D. Muratori
Application Information
Application Number:US 09/747,019
Filing Date:2000-12-21
Priority Date:2000-12-21
Art Unit:2191
Classifications
IPC:
G06F9/44
Patent Drawings (5 sheets)
Description
Technical Field
[0001] This invention relates to breakpoint method for parallel hardware threads in a multiprocessor.
Background
[0002] 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. That is, in general all or a plurality of the stations work simultaneously and independently on the same or common elements of a problem.
[0003] Parallel processing involves multiple processors. The execution path of a microprocessor within a parallel system is highly pipelined.
[0004] In a parallel processor where many threads of execution can run simultaneously, there is a need for debugging software running on selected threads. Debugging may be used to determine a cause (or causes) of errors in the processing threads, and to correct the errors.
[0005] Debug methods implement breakpoints in software by a combination of inserting traps and single stepping. When the target program contains multiple threads of execution, a debug method that is not carefully implemented may miss breakpoints and be less than helpful to the developer.
Description of Drawings
[0006] FIG. 1 is a block diagram of a communication system employing a hardware based multithreaded processor.
[0007] FIG. 2 is a block diagram of a microengine functional unit employed in the hardware based multithreaded processor of FIGS. 1 and 2 .
[0008] FIG. 3 is a block diagram of an interrupt register.
[0009] FIG. 4 is a block diagram of a hardware based multithreaded processor adapted to enable a breakpoint method.
[0010] FIG. 5 is a flow chart of a breakpoint method for selectively stopping parallel hardware threads from a debug console.
Detailed Description
[0011] 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 12, such as a PCI bus, 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 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 (also referred to as contexts) that can be simultaneously active and independently work on a task.
[0012] The hardware-based multithreaded processor 12 also includes a central processor 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 an embodiment, the processor 20 is a Strong ARM® (ARM is a trademark of ARM Limited, United Kingdom) based architecture. The processor 20 has an operating system. Through the operating system, the processor 20 can call functions to operate on microengines 22. The processor 20 can use any supported operating system, preferably a real-time operating system. For a processor 20 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.
[0013] As mentioned above, the hardware-based multithreaded processor 12 includes a plurality of functional microengines 22a–f. Functional microengines (microengines) 22a–f each maintain a number 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–f while only one is actually operating at any one time.
[0014] In an embodiment, there are six microengines 22a–f, as shown. Each of the microengines 22a–f has capabilities for processing four hardware threads. The six microengines 22a–f 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. SRAM memory 16a and SRAM controller 26a are typically used for processing large volumes of data, e.g., processing of network payloads from network packets. The SDRAM controller 26b and SDRAM memory 16b are used in a networking implementation for low latency fast access tasks, e.g., accessing lookup tables, memory from the core processor, and so forth.
[0015] The six microengines 22a–f 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 16b, whereas higher bandwidth data for which latency is not as important, is stored in and fetched from SDRAM 16b. The microengines 22a–f can execute memory reference instructions to either the SDRAM controller 26a or SRAM controller 26b.
[0016] 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 16a. The SRAM controller 26b controls arbitration for the SRAM bus, accesses the SRAM 16a, fetches the data from the SRAM 16a, and returns data to a requesting microengine 22a–f. During an SRAM 26b access, if the microengine, e.g. microengine 22a, had only a single thread that could operate, that microengine would be dormant until data was returned from the SRAM 26b. By employing hardware context swapping within each of the microengines 22a–f, the hardware context swapping enables only 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 26a. 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 can have a bus operation, an SRAM operation and SDRAM operation all being completed or operated upon by one microengine 22a and have one or more threads available to process more work in the data path.
[0017] Each of the microengines 22a–f includes an arbiter that examines flags to determine the available threads to be operated upon. Any thread from any of the microengines 22a–f can access the SDRAM controller 26a, SRAM controller 26b or bus interface. The memory controllers 26a and 26b each include a number 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 thread_0 cannot complete their memory references to the SRAM unit 26b out of order. The microengines 22a–f issue memory reference requests to the memory controllers 26a and 26b. The microengines 22a–f 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. Microengines 22a–f can also use a register set to exchange data.
[0018] The processor 20 includes a RISC core 50, implemented in a five-stage pipeline performing a single cycle shift of one operant or two operants in a single cycle, provides multiplication support and 32-bit barrel shift support. This risc core 50 is a standard Strong Arm® architecture, but is implemented with a five-stage pipeline for performance reasons. The processor 20 also includes a 16-kilobyte instruction cache 52, an 8-kilobyte data cache 54 and a prefetch stream buffer 56. The core processor performs arithmetic operations in parallel with memory writes and instruction fetches. The processor 20 interfaces with other functional units via the ARM defined ASB bus. The ASB bus is a 32-bit bi-directional bus.
[0019] Referring to FIG. 2 , an exemplary one of the microengines, microengine 22f, is shown. The microengine 22f includes a control store 70, which, in an implementation includes a RAM of here 1,024 words of 32-bits each. The RAM stores eight microprogram. The microprogram is loadable by the processor 20. The microengine 22f also includes controller logic 72. The controller logic 72 includes in instruction decoder 73 and program counter units 72a–d. The four program counters 72a–d are maintained in hardware. The microengine 22f also includes context event switching logic 74. Context event switching logic 74 receives messages from each of the shared resources, e.g., SRAM 16a, SDRAM 16b, or processor 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 (or context) has completed a 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 four threads available in the example of FIG. 2 .
[0020] 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 the availability of a resource or whether a resource is due for servicing.
[0021] The context event logic 74 has arbitration for the four threads in the example. In an 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) datapath 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 register set 76b has a relatively large number of general purpose registers. General purpose registers are windowed so that they are relatively and absolutely addressable.
[0022] The microengine 22f also includes a write transfer register stack 78 and a read transfer stack 80. These registers 78 and 80 are also windowed so they are relatively and absolutely addressable. The write transfer register stack 78 is where write data to a resource is located. Similarly, the read register stack 80 is for returned 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 26b, the SDRAM controller 26a, or processor 20 will be provided to context event arbiter 74 which will then alert the thread is available or has been sent. Both transfer register banks 78 and 80 are connected to the execution box 76 through a datapath. In an implementation, the read transfer register 80 has sixty-four registers and the write transfer register 78 has sixty-four registers.
[0023] Each microengine 22a–f supports multi-threaded execution of four contexts. One reason for this is to allow one thread to start executing just after another thread issues a memory reference and must wait until that reference completes before doing more work. This behavior is critical to maintaining efficient hardware execution of the microengines, because memory latency is significant. Stated differently, if only a single thread execution was supported, the microengines would sit idle for a significant number of cycles waiting for references to return and thus reduce overall computational throughput. Multithreaded execution involves all microengines to hide memory latency by performing useful, independent work across several threads.
[0024] When errors occur in software running in one or more of the threads of execution, there is a need for debugging the software running on selected threads to determine a cause (or causes) of the errors and to aid a software developer to correct the errors.
[0025] Referring to FIG. 3 , as described above, a multiprocessor 500 has many threads of execution, threads 502a–d for example, that are supported by the hardware. The core processor 504 runs the ARM instruction set, and executes one software thread at a time, in accordance with its corresponding program counter. In an embodiment, there are twenty-four hardware-supported threads. Any of these threads can interrupt the core processor 504 by issuing a write operation to a specified control and status register (CSR) referred to as an interrupt register 506.
[0026] In a normal interrupt, a hardware-supported thread, thread 502a for example, executes a write to the interrupt register 506 that carries ten bits of immediate data. A “1” in bits 6:0 is shifted left by the value of the hardware thread identification and inserted into the interrupt register.
[0027] Referring to FIG. 4 , the interrupt register 506 is a 32-bit register contained within the controlling processor 504. Bits 9:7 are designated breakpoint bits 600 and bits 6:0 are designated as a thread vectors 602. A non-zero value of the breakpoint bits 600 indicates the interrupt is a breakpoint interrupt. When a breakpoint occurs, a value of bits 9:7 of intermediate data is inserted into the breakpoint bits 600. A “1” in bits 6:0 of the intermediate data is shifted left by the value of the hardware thread identification to generate a thread vector; the thread vector is inserted into the thread vector bits 602 of the interrupt register 506.
[0028] At any time, more than one thread can issue a normal interrupt or an interrupt indicating a breakpoint. If the interrupt indicates a breakpoint, the core processor 504 traps to an interrupt handling routine 508 in an interrupt handler 510, where the interrupt register 506 is read. If the breakpoint field is non-zero, it can be used to narrow the source of the breakpoints to three groups of threads. Bits 23:0 are used to identify which threads have raised an interrupt.
[0029] The core processor 504 is linked to a remote user interface 511. A user (not shown) inputs a source code line to be breakpointed in one of the microengines using the remote user interface 511. The source code line is sent to the central processor 504. The central processor 504 searches a breakpoint database 512 in a debug library 514 to determine whether the instruction corresponding to the source code line can be breakpointed. Since there are certain cases where breakpointing is not allowed, i.e., a trap in the code cannot be inserted at this position in the code to signal a breakpoint. For example, if two instructions must be executed in succession, i.e., a register of one is used in the very next cycle in the next, the first instruction cannot be breakpointed. This is because the software breakpoint inserts a branch to displace the breakpointed instruction, thus separating the two instructions.
[0030] After searching its breakpoint database 512 and determining that an instruction may be breakpointed, the core processor 504 invokes a remote procedure call (RPC) referred to as SetBreakpoint to the debug library 514. The SetBreakpoint RPC identifies which microengine (which instruction code) to insert the breakpoint into, which program counter (PC) to breakpoint at, which microengine threads (also referred to as contexts) to enable breakpoint for, and which microengines to stop if the breakpoint occurs.
[0031] The function definition for the set breakpoint RPC to the debug library is as follows:
[0032]
| typedef struct uDbg_Bkpt { | |
| void (*callback) (unsigned short bkptId, | |
| unsigned char ueng, unsigned char ctx, void *userdata); | |
| short id; //out:the assigned ID of the breakpoint | |
| unsigned short ctx; //out: context at breakpoint | |
| unsigned shortμAddv; //in:micro-store address | |
| unsigned char μEng; //in:microengine at breakpoint | |
| void *usrData; //in:pointer to user data | |
| uDbg_CTX_T breakIfCtx; //in:break if equal to ctx | |
| unsigned int stpOnBrkUengMask; //in:microengines to | |
| stop on break | |
| } uBbg_Bkpt_T; | |
[0033] The debug library 514 generates a breakpoint routine by modifying a template of several instructions, inserts the breakpointing instruction and inserts a branch to the location of the instruction after the breakpoint instruction. The breakpoint instruction is essentially a branch instruction to the breakpoint routine.
[0034] An example breakpoint template follows:
- [0035] unsigned int breakInst[NUM_BKPT_INST]={
- [0036] NOP, // may be replaced by: BR!=CTX, or BR=CTX
- [0037] NOP, // may be replaced by: BR!=CTX, or BR=CTX
- [0038] DISABLE_CTX, // disable context
- [0039] NOP, // nop:
- [0040] NOP,
- [0041] NOP,
- [0042] FAST_WR, // fast_wr[0×80, ireg]=breakpoint interrupt
- [0043] CTX_ARB, // ctx_arb[voluntary]
- [0044] 0x9A0007B0, // statement at breakpoint placeholder—to be altered
- [0045] BR}; //br[pr]—to be altered to breakpoint +1
[0046] After the breakpoint instruction is inserted into the selected microengine, the microengine with this breakpoint code is resumed or restarted. If program execution within the microengine gets to the breakpoint program counter, program execution branches to the breakpoint routine and interrupts the core processor 504 with a breakpoint interrupt. If a breakpoint is set, the interrupt handler 510 calls the debug library 514. The interrupt handler 514 can quickly handle breakpoints by reading the program counters of the interrupting threads. The debug library 514 stops the selected threads (and bus ports) for the breakpoint. The debug library 514 determines which thread(s) sent the breakpoint interrupt. The debug library 514 replies to the user on the remote user interface 511, allowing the user to examine the state of the saved threads (and ports). The user selects a resume command that initiates resume remote procedure call to the debug library 514. The resume identifies which microengines (and ports) to resume. Upon receiving this resume RPC, the debug library 514 insures the thread that the sent the breakpoint interrupt will be next to start by setting a control and status register with context enable. The debug library 514 restarts the microengines (and bus ports) indicated by the resume command.
[0047] Referring to FIG. 5 , a breakpoint process 600 for selectively stopping parallel hardware threads from a remote user interface includes receiving 602 source code line to be breakpointed in a microengine. The process 600 fetches data 604 within its database to determine whether the source code line in the microengine may be breakpointed. If not, the process 600 signals 606 an error to the user. If the source code line can be breakpointed, the process 600 invokes 608 a setbreakpoint RPG to the debug library. The setbreakpoint RPC identifies which microengine (or bus port) to insert the breakpoint into, which program counter to breakpoint at, which microengine threads to enable breakpoints for, and which microengines (or bus ports) to stop if a breakpoint occurs.
[0048] The process 600 causes the debug library to generate 610 a breakpoint routine by modifying a template of several instructions, to insert 612 the breakpoint instruction and to insert 614 a branch to the location after the breakpoint instruction.
[0049] After the breakpoint routine is inserted 612, the process 600 causes the microengine with the inserted breakpoint routine to resume 616. If program execution in the microengine gets to the breakpoint PC, program execution branches 618 to the breakpoint routine and interrupts 620 the core processor with the breakpoint interrupt.
[0050] The process 600 causes the interrupt handler to call 622 the debug library. The debug library stops 624 the selected threads (and bus ports) for the breakpoint and determines 626 which microengine sent the interrupt. The process 600 causes the debug library to display 626 information to the user.
[0051] The process 600 receives 630 a resume command from the user and in response sets the context enable bit for the selected microengine. Setting of the context enable bit starts the microengine back into normal program execution outside of the breakpoint routine.
[0052] An embodiment of the invention has been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. For example, reset, start, pause and resume remote procedure calls can be used with the controlled stop/start of selected microengines (and bus ports). The RPC “Reset” stops the selected microengines (and bus ports) immediately, whereas the RPC “Start” starts the microengines at program counter 0 (and starts the bus ports). The RPC “Pause” stops selected microengines (and bus ports) at a safe, i.e., non-destructive stopping point. The RPC “Resume” starts the microengines at their current program counters (and starts the bus ports). Accordingly, other embodiments are within the scope of the following claims.
Claims
What is claimed is:
1. A computer-implemented method comprising:
in parallel hardware threads executing in a processor comprising a plurality of microengines, receiving a source code line to be break pointed in a selected microengine;
determining whether the source code line can be break pointed;
if the source code line can be break pointed, identifying the selected microengine to insert a break point into, which microengine threads to enable breakpoints for, and which microengines to stop if a break point occurs; and
if the source code line cannot be break pointed, signaling an error.
2. The computer-implemented method of claim 1 wherein identifying further comprises generating a break point routine by modifying a template of instructions stored in a debug library.
3. The computer-implemented method of claim 2 wherein identifying further comprises inserting a break point at the source code line and a branch to the source code line.
4. The computer-implemented method of claim 3 further comprising:
executing the parallel hardware threads until the break point is encountered; and
executing the break point routine, the break point routine stopping selected threads and determining which microengine sent an interrupt.
5. The computer-implemented method of claim 4 further comprising displaying program information to a user.
6. The computer-implemented method of claim 5 further comprising resuming execution of the parallel threads in response to a user input.
7. A processor that can execute multiple parallel threads in multiple microengines and that comprises:
a register stack;
a program counter for each executing context;
an arithmetic logic unit coupled to the register stack and a program control store that stores a breakpoint routine that causes the processor to:
receive a source code line to be break pointed in a selected microengine;
determine whether the source code line can be break pointed;
if the source code line can be break pointed, identify the selected microengine to insert a break point into, which microengine threads to enable breakpoints for, and which microengines to stop if a break point occurs; and
if the source code line cannot be break pointed, signal an error.
8. The processor of claim 7 wherein identifying further comprises generating a break point routine by modifying a template of instructions stored in a debug library.
9. The processor of claim 8 wherein identifying further comprises inserting a break point at the source code line and a branch to the source code line.
10. The processor of claim 9 wherein the breakpoint routine further causes the processor to:
execute the parallel threads until the break point is encountered; and
stop selected threads and determine which microengine sent an interrupt.
11. The processor of claim 10 wherein the breakpoint routine further causes the processor to display program information to a user.
12. The processor of claim 11 the breakpoint routine that causes the processor to resume execution of the parallel threads in response to a user input.
Patent Citations (249)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3373408(A) | 1968-03-01 | Ling | Applicant |
| US3478322(A) | 1969-11-01 | Evans | Applicant |
| US3792441(A) | 1974-02-01 | Wymore 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 |
| US4514807(A) | 1985-04-01 | Nogi | Applicant |
| US4523272(A) | 1985-06-01 | Fukunaga et al. | Applicant |
| US4724521(A) | 1988-02-01 | Carron et al. | Applicant |
| US4745544(A) | 1988-05-01 | Renner et al. | Applicant |
| US4777587(A) | 1988-10-01 | Case et al. | Applicant |
| US4866664(A) | 1989-09-01 | Burkhardt, Jr. 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 |
| US5168555(A) | 1992-12-01 | Byers et al. | Applicant |
| US5173897(A) | 1992-12-01 | Schrodi et al. | Applicant |
| US5255239(A) | 1993-10-01 | Taborn et al. | Applicant |
| US5263169(A) | 1993-11-01 | Genusov 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 |
| US5404464(A) | 1995-04-01 | Bennett | Applicant |
| US5404482(A) | 1995-04-01 | Stamm 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 |
| 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 |
| 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 |
| US5517628(A) | 1996-05-01 | Morrison et al. | Applicant |
| US5517648(A) | 1996-05-01 | Bertone 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 |
| 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 |
| 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 |
| US5606676(A) | 1997-02-01 | Grochowski et al. | 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 |
| 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 |
| 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 |
| US5717760(A) | 1998-02-01 | Satterfield | Applicant |
| US5717898(A) | 1998-02-01 | Kagan et al. | Applicant |
| US5721870(A) | 1998-02-01 | Matsumoto | 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 |
| 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 |
| US5796413(A) | 1998-08-01 | Shipp et al. | Applicant |
| US5797043(A) | 1998-08-01 | Lewis et al. | Applicant |
| US5809235(A) | 1998-09-01 | Sharma et al. | Applicant |
| US5809530(A) | 1998-09-01 | Samra et al. | Applicant |
| US5812839(A) | 1998-09-01 | Hoyt et al. | Applicant |
| US5812868(A) | 1998-09-01 | Moyer et al. | Applicant |
| US5815714(A) | 1998-09-01 | Shridhar et al. | Examiner |
| 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 |
| US5835755(A) | 1998-11-01 | Stellwagen, Jr. | Applicant |
| US5838975(A) | 1998-11-01 | Abramson et al. | Examiner |
| US5854922(A) | 1998-12-01 | Gravenstein et al. | Applicant |
| US5860158(A) | 1999-01-01 | Pai et al. | 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 |
| 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 |
| US5933627(A) | 1999-08-01 | Parady | 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 |
| 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. | Examiner |
| 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 |
| US5996068(A) | 1999-11-01 | Dwyer, III et al. | Applicant |
| US6002881(A) | 1999-12-01 | York 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 |
| US6058168(A) | 2000-05-01 | Braband | Applicant |
| US6058465(A) | 2000-05-01 | Nguyen | 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 |
| US6112016(A) | 2000-08-01 | MacWilliams et al. | Applicant |
| US6115811(A) | 2000-09-01 | Steele, Jr. | Applicant |
| US6134665(A) | 2000-10-01 | Klein et al. | 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 |
| US6145123(A) | 2000-11-01 | Torrey et al. | Examiner |
| US6157955(A) | 2000-12-01 | Narad et al. | 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 |
| US6199133(B1) | 2001-03-01 | Schnell | Applicant |
| US6201807(B1) | 2001-03-01 | Prasanna | 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 |
| US6223238(B1) | 2001-04-01 | Meyer et al. | Applicant |
| US6223279(B1) | 2001-04-01 | Nishimura et al. | Applicant |
| US6230119(B1) | 2001-05-01 | Mitchell | Examiner |
| US6247025(B1) | 2001-06-01 | Bacon | Applicant |
| US6256713(B1) | 2001-07-01 | Audityan et al. | Applicant |
| US6272616(B1) | 2001-08-01 | Fernando et al. | Applicant |
| US6275505(B1) | 2001-08-01 | O'Loughlin et al. | 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 |
| US6307789(B1) | 2001-10-01 | Wolrich et al. | Applicant |
| US6324624(B1) | 2001-11-01 | Wolrich et al. | 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. | Examiner |
| US6378125(B1) | 2002-04-01 | Bates et al. | Examiner |
| US6389449(B1) | 2002-05-01 | Nemirovsky et al. | Applicant |
| US6393483(B1) | 2002-05-01 | Latif et al. | Applicant |
| 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 |
| US6463072(B1) | 2002-10-01 | Wolrich et al. | Applicant |
| US6532509(B1) | 2003-03-01 | Wolrich et al. | Applicant |
| US6543049(B1) | 2003-04-01 | Bates et al. | Examiner |
| US6552826(B1) | 2003-04-01 | Adler et al. | Applicant |
| US6560667(B1) | 2003-05-01 | Wolrich et al. | Applicant |
| US6577542(B1) | 2003-06-01 | Wolrich et al. | Applicant |
| US6584522(B1) | 2003-06-01 | Wolrich et al. | Applicant |
| US6587906(B1) | 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(B1) | 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(B1) | 2003-12-01 | Wolrich et al. | Applicant |
| US6668317(B1) | 2003-12-01 | Bernstein et al. | Applicant |
| US6681300(B1) | 2004-01-01 | Wolrich et al. | Applicant |
| US6694380(B1) | 2004-02-01 | Wolrich et al. | Applicant |
| US2002/0053017(A1) | 2002-05-01 | Adiletta et al. | Applicant |
| US2002/0056037(A1) | 2002-05-01 | Wolrich et al. | Applicant |
| 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 |
| EP379709 | 1990-08-01 | Applicant | |
| EP464715 | 1992-01-01 | Applicant | |
| EP633678 | 1995-01-01 | Applicant | |
| EP745933 | 1996-12-01 | Applicant | |
| EP809180 | 1997-11-01 | Applicant | |
| JP59111533 | 1984-06-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/16702 | 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 |
Non-Patent Literature (29)
- Gernot Koch, Udo Kebschull, Wolfgang Rosenstiel, Breakpoints and Breakpoint Detection in Source Level Emulation, IEEE, 1996, p.: 26-31.Examiner
- Norman Ramsey, Correctness of trap-based breakpoint implementations, 1994, ACM Press, pp.: 15-24.Examiner
- Agarwal et al., “April: A Processor Architecutre for Multiprocessing,” Proceedings of the 17th Annual International Symposium on Computer Architecutre, 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., “Computer Organization and Design: The Hardware/Software Interface,” Morgan Kaufman Publishers, 1998, pp. 476-482.Applicant
- Hyde, R., “Overview of Memory Management,” Bytevol. 13, No. 4, 1998, pp. 219-225.Applicant
- Intel, “1A-64 Application Developer's Architccture 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
- Paver et al., “Register Locking in Asynchronous Processor Computer Design: VLSI Processors,” ICCD '92 Proceedings, IEEE 1992 International Conference, 1992, pp. 385-398.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
- Waldspurger et al., “Register Relocation: Flexible Contents for Multithreading,” Proceedings of the 20the Annual International Symposium on Computer Architecture, 1993, pp. 120-130.Applicant
- Wazlowski et al., “PRSIM-II computer and architecture,” IEEE Proceedings, Workshop on FPGAs for Custom Computing Machines, 1993.Applicant
- U.S. Appl. No. 09/473,571, filed Dec. 28, 1999, Wolrich et al.Applicant
- U.S. Appl. NO. 09/475,614, Dec. 30, 1999, Wolrich et al.Applicant