US 7,225,436 B1Grant
Java hardware accelerator using microcode engine
Issue Date:2007-05-29
•22 Claims
•20 Drawing Sheets
Abstract
A hardware Java™ accelerator is comprised of a decode stage and a microcode stage. Separating into the decode and microcode stage allows the decode stage to implement instruction level parallelism while the microcode stage allows the conversion of a single Java™ bytecode into multiple native instructions. A reissue buffer is provided which stores the converted instructions and reissues them when the system returns from an interrupt. In this manner, the hardware accelerator need not be flushed upon an interrupt A native PC monitor is also used. While the native PC is within a specific range, the hardware accelerator is enabled to convert the Java™ bytecodes into native instructions. When the native PC is outside the range, the hardware accelerator is disabled and the CPU operates on native instructions obtained from the memory.
Metadata
Assignee
- Nazomi Communications Inc.
Inventor
- Mukesh K. Patel
Application Information
Application Number:US 09/687,777
Filing Date:2000-10-13
Priority Date:1998-12-08
Art Unit:2192
Classifications
IPC:
G06F9/45G06F9/44G06F15/00
Patent Drawings (20 sheets)
Description
Related Applications
[0001] The present application is a continuation-in-part of the application entitled “Java Virtual Machine Hardware for RISC and CISC Processors,” filed Dec. 8, 1998, now U.S. Pat. No. 6,332,215 inventor Mukesh K. Patel, et al., U.S. Application Ser. No. 09/208,741. The present application also claims priority to a provisional application 60/239,298 filed Oct. 10, 2000 entitled “Java Hardware Accelerator Using Microcode Engine”.
Background of the Invention
[0002] Java™ is an object-orientated programming language developed by Sun Microsystems. The Java language is small, simple and portable across platforms and operating systems, both at the source and at the binary level. This makes the Java programming language very popular on the Internet.
[0003] Java's platform independence and code compaction are the most significant advantages of Java over conventional programming languages. In conventional programming languages, the source code of a program is sent to a compiler which translates the program into machine code or processor.
[0004] Java™ operates differently. The Java™ compiler takes a Java™ program and, instead of generating machine code for a particular processor, generates bytecodes. Bytecodes are instructions that look like machine code, but aren't specific to any processor. To execute a Java™ program, a bytecode interpreter takes the Java™ bytecode converts them to equivalent native processor instructions and executes the Java™ program. The Java™ bytecode interpreter is one component of the Java™ Virtual Machine.
[0005] Having the Java™ programs in bytecode form means that instead of being specific to any one system, the programs can run on any platform and any operating system as long a Java™ Virtual Machine is available. This allows a binary bytecode file to be executable across platforms.
[0006] The disadvantage of using bytecodes is execution speed. System specific programs that run directly on the hardware from which they are compiled, run significantly faster that Java™ bytecodes, which must be processed by the Java™ Virtual Machine. The processor must both convert the Java™ bytecodes into native instructions in the Java™ Virtual Machine and execute the native instructions.
[0007] One way to speed up the Java™ Virtual Machine is by techniques such as the “Just in Time” (JIT) interpreter, and even faster interpreters known as “Hot Spot JITs” interpreters. The JIT versions all result in a JIT compile overhead to generate native processor instructions. These JIT interpreters also result in additional memory overhead.
[0008] The slow execution speed of Java™ and overhead of JIT interpreters have made it difficult for consumer appliances requiring local-cost solutions with minimal memory usage and low energy consumption to run Java™ programs. The performance requirements for existing processors using the fastest JITs more than double to support running the Java™ Virtual Machine in software. The processor performance requirements could be met by employing superscalar processor architectures or by increasing the processor clock frequency. In both cases, the power requirements are dramatically increased. The memory bloat that results from JIT techniques, also goes against the consumer application requirements of low cost and low power.
[0009] It is desired to have an improved system for implementing Java™ programs that provides a low-cost solution for running Java™ programs for consumer appliances.
Summary of the Invention
[0010] The present invention generally relates to Java™ hardware accelerators used to translate Java™ bytecodes into native instructions for a central processing unit (CPU). One embodiment of the present invention comprises a reissue buffer, the reissue buffer associated with a hardware accelerator and adapted to store converted native instructions issued to the CPU along with associated native program counter values. When the CPU returns from an interrupt the reissue buffer examines the program counter to determine whether to reissue a stored native instruction value from the reissue buffer. In this way, returns from interrupts can be efficiently handled without reloading the hardware accelerator with the instructions to convert.
[0011] Another embodiment of the present invention comprises a hardware accelerator to convert stacked-base instructions into register-based instructions native to a central processing unit. The hardware accelerator includes a native program counter monitor. The native program counter monitor checks whether the native program counter is within a hardware accelerator program counter range. When the hardware accelerator program counter is within the hardware accelerator program counter range, the hardware accelerator is enabled and converted native instructions are sent to the CPU from the hardware accelerator, the native program counter is not used to determine instructions to load from memory.
[0012] In this manner, the hardware accelerator can spoof the native program counter to be within a certain range which corresponds to the program counter range in which the stacked-base instructions are stored. By monitoring the program counter, the hardware accelerator can always tell when it needs to be operating and needs to not operate. Thus if a interrupt occurs, causing the data program counter to move to a range outside of the hardware accelerator program counter range, there need be no explicit instruction to the hardware accelerator from the CPU handling the interrupt to stall the hardware accelerator.
[0013] Yet another embodiment of the present invention comprises a hardware accelerator operably connected to a central processing unit, the hardware accelerator adapted to convert stack-based instructions into register-based instructions native to the central processing unit. The hardware accelerator includes a microcode stage. The microcode stage includes microcode memory. The microcode memory output includes a number of fields, the fields including a first set of fields corresponding to native instruction fields and a control bit field which affects the interpretation of the first set of fields by the microcode controlled logic to produce a native instruction. Use of a microcode portion allows the same general hardware accelerator architecture to work with a variety of central processing units. In a preferred embodiment, the microcode portion is separate from a decode portion.
Brief Description of the Drawings
[0014] The present invention may be further understood from the following description in conjunction with the drawings.
[0015] FIG. 1 is a diagram of the system of the parent invention including a hardware Java™ accelerator.
[0016] FIG. 2 is a diagram illustrating the use of the hardware Java™ accelerator of the parent invention.
[0017] FIG. 3 is a diagram illustrating some the details of a Java™ hardware accelerator of one embodiment of the parent invention.
[0018] FIG. 4 is a diagram illustrating the details of one embodiment of a Java™ accelerator instruction translation in the system of the parent invention.
[0019] FIG. 5 is a diagram illustration the instruction translation operation of one embodiment of the parent invention.
[0020] FIG. 6 is a diagram illustrating the instruction translation system of one embodiment of the parent invention using instruction level parallelism.
[0021] FIGS. 7A-D are the table of exception bytecodes for one embodiment of the parent invention.
[0022] FIG. 8 is a diagram of one embodiment of a hardware accelerator used with one embodiment of the present invention.
[0023] FIG. 9 is a diagram that illustrates the decode stage for use in the hardware accelerator of the present invention.
[0024] FIG. 10 is a diagram that illustrates one embodiment of an instruction decode unit used with the decode stage of FIG. 9.
[0025] FIG. 11 is a diagram that illustrates one embodiment of a microcode stage for use with the embodiment of FIG. 8.
[0026] FIG. 12 is a diagram of a microcode address logic used with the microcode stage of FIG. 11.
[0027] FIG. 13 is a diagram of a native instruction composer unit used with the embodiment of FIG. 11.
[0028] FIG. 14 is a diagram of a register selection logic used with the native instruction composer unit of FIG. 13.
[0029] FIG. 15 illustrates a stack-and-variable-register manager of one embodiment of the present invention.
[0030] FIG. 16 illustrates a stack-and-variable-register manager of an alternate embodiment of the present invention.
[0031] FIG. 17 is a diagram of the native PC monitor used with one embodiment of the present invention.
[0032] FIG. 18 is a diagram of a reissue buffer used with one embodiment of the present invention.
[0033] FIGS. 19 and 20 are diagrams that illustrate the operation of one embodiment of the present invention.
Detailed Description of the Preferred Embodiments
[0034] FIGS. 1-7D illustrate the operation of the parent application.
[0035] FIG. 1 is a diagram of the system 20 showing the use of a hardware Java™ accelerator 22 in conjunction with a central processing unit 26. The Java™ hardware accelerator 22 allows part of the Java™ Virtual Machine to be implemented in hardware. This hardware implementation speeds up the processing of the Java™ bytecodes. In particular, in a preferred embodiment, the translation of the Java™ bytecodes into native processor instructions is at least partially done in the hardware Java™ accelerator 22. This translation has been part of a bottleneck in the Java™ Virtual Machine when implemented in software. In FIG. 1 , instructions from the instruction cache 24 or other memory is supplied to the hardware Java™ accelerator 22. If these instruction are Java™ bytecode, the hardware Java™ accelerator 22 can convert these bytecodes into native processor instruction which are supplied through the multiplexer 28 to the CPU. If a non-Java™ code is used, the hardware accelerator can be by-passed using the multiplexer 26. The Java™ stack includes the frame, the operand stack, the variables, etc.
[0036] The Java™ hardware accelerator can do some or all of the following tasks:
- [0037] 1. Java™ bytecode decode;
- [0038] 2. identifying and encoding instruction level parallelism (ILP), wherever possible;
- [0039] 3. translating bytecodes to native instructions;
- [0040] 4. managing the Java™ stack on a register file associated with the CPU or as a separate stack;
- [0041] 5. generating exceptions on instructions on predetermined Java™ bytecodes;
- [0042] 6. switching to native CPU operation when native CPU code is provided;
- [0043] 7. performing bounds checking on array instructions; and
- [0044] 8. managing the variables on the register file associated with the CPU.
[0045] In a preferred embodiment, the Java™ Virtual Machine functions of bytecode interpreter, Java™ register, and Java™ stack are implemented in the hardware Java™ accelerator. The garbage collection heap and constant pool area can be maintained in normal memory and accessed through normal memory referencing. In one embodiment, these functions are accelerated in hardware, e.g. write barrier.
[0046] The major advantages of the Java™ hardware accelerator is to increase the speed in which the Java™ Virtual Machine operates, and allow existing native language legacy applications, software base, and development tools to be used. A dedicated microprocessor in which the Java™ bytecodes were the native instructions would not have access to those legacy applications.
[0047] Although the Java™ hardware accelerator is shown in FIG. 1 as separate from the central processing unit, the Java™ hardware accelerator can be incorporated into a central processing unit. In that case, the central processing unit has a Java™ hardware accelerator subunit to translate Java™ bytecode into the native instructions operated on by the main portion of the CPU.
[0048] FIG. 2 is a state machine diagram that shows the operation of one embodiment of the parent invention. Block 32 is the power-on state. During power-on, the multiplexer 28 is set to bypass the Java™ hardware accelerator. In block 34, the native instruction boot-up sequence is run. Block 36 shows the system in the native mode executing native instructions and by-passing the Java™ hardware accelerator.
[0049] In block 38, the system switches to the Java™ hardware accelerator mode. In the Java™ hardware accelerator mode, Java™ bytecode is transferred to the Java™ hardware accelerator 22, converted into native instructions then sent to the CPU for operation.
[0050] The Java™ accelerator mode can produce exceptions at certain Java™ bytecodes. These bytecodes are not processed by the hardware accelerator 22 but are processed in the CPU 26. As shown in block 40, the system operates in the native mode but the Java™ Virtual Machine is implemented in the accelerator which does the bytecode translation and handles the exception created in the Java™ accelerator mode.
[0051] The longer and more complicated bytecodes that are difficult to handle in hardware can be selected to produce the exceptions. FIGS. 7A-D is a table showing one possible list of bytecodes which can cause exceptions in a preferred embodiment.
[0052] FIG. 3 is a diagram illustrating details of one embodiment of the Java™ hardware accelerator of the parent invention. The Java™ hardware accelerator includes Java™ accelerator instruction translation hardware 42. The instruction translation Unit 42 is used to convert Java™ bytecodes to native instructions. One embodiment of the Java™ accelerator instruction translation hardware 42 is described in more detail below with respect to FIG. 4. This instruction translation hardware 42 uses data stored in hardware Java™ registers 44. The hardware Java™ Registers store the Java™ Registers defined in the Java™ Virtual Machine. The Java™ Registers contain the state the Java™ Virtual Machine, affect its operation, and are updated at runtime. The Java™ registers in the Java™ virtual machine include the PC, the program counter indicating what bytecode is being executed; Optop, a pointer to the top of the operand stack; Frame, a pointer to the execution environment of the current method; and Java™ variables (Vars), a pointer to the first local variable available of the currently executing method. The virtual machine defines these registers to be a single 32-bit word wide. The Java™ registers are also stored in the Java™ stack which can be implemented as the hardware Java™ stack 50 or the Java™ stack can be stored into the CPU associated register file.
[0053] In a preferred embodiment, the hardware Java™ registers 44 can include additional registers for the use of the instruction translation hardware 42. These registers can include a register indicating a switch to native instructions configuration and control registers and a register indicating the version number of the system.
[0054] The Java™ PC can be used to obtain bytecode instructions from the instruction cache 24 or memory. In one embodiment the Java™ PC is multiplexed with the normal program counter 54 of the central processing unit 26 in multiplexer 52. The normal PC 54 is not used during the operation of the Java™ hardware bytecode translation. In another embodiment, the normal program counter 54 is used as the Java™ program counter.
[0055] The Java™ registers are a part of the Java™ Virtual Machine and should not be confused with the general registers 46 or 48 which are operated upon by the central processing unit 26. In one embodiment, the system uses the traditional CPU register file 46 as well as a Java™ CPU register file 48. When native code is being operated upon the multiplexer 56 connects the conventional register file 46 to the execution logic 26c of the CPU 26. When the Java™ hardware accelerator is active, the Java™ CPU register file 48 substitutes for the conventional CPU register file 46. In another embodiment, the conventional CPU register file 46 is used.
[0056] As described below with respect to FIGS. 3 and 4 , the Java™ CPU register file 48, or in an alternate embodiment the conventional CPU register file 46, can be used to store portions of the operand stack and some of the variables. In this way, the native register-based instructions from the Java™ accelerator instruction translator 42 can operate upon the operand stack and variable values stored in the Java™ CPU register file 48, or the values stored in the conventional CPU register file 46. Data can be written in and out of the Java™ CPU register file 48 from the data cache or other memory 58 through the overflow/underflow line 60 connected to the memory arbiter 62 as well as issued load/store instructions. The overflow/underflow transfer of data to and from the memory can be done concurrently with the CPU operation. Alternately, the overflow/underflow transfer can be done explicitly while the CPU is not operating. The overflow/underflow bus 60 can be implemented as a tri-state bus or as two separate buses to read data in and write data out of the register file when the Java™ stack overflows or underflows.
[0057] The register files for the CPU could alternately be implemented as a single register file with native instructions used to manipulate the loading of operand stack and variable values to and from memory. Alternately, multiple Java™ CPU register files could be used: one register file for variable values, another register file for the operand stack values, and another register file for the Java™ frame stack holding the method environment information.
[0058] The Java™ accelerator controller (co-processing unit) 64 can be used to control the hardware Java™ accelerator, read in and out from the hardware Java™ registers 44 and Java™ stack 50, and flush the Java™ accelerator instruction translation pipeline upon a “branch taken” signal from the CPU execute logic 26c.
[0059] The CPU 26 is divided into pipeline stages including the instruction fetch 26a, instruction decode 26b, execute logic 26c, memory access logic 26d, and writeback logic 26e. The execute logic 26c executes the native instructions and thus can determine whether a branch instruction is taken and issue the “branch taken” signal. In one embodiment, the execute logic 26c monitors addresses for detecting branches. FIG. 4 illustrates an embodiment of a Java™ accelerator instruction translator which can be used with the parent invention. The instruction buffer 70 stores the bytecode instructions from the instruction cache. The bytecodes are sent to a parallel decode unit 72 which decodes multiple bytecodes at the same time. Multiple bytecodes are processed concurrently in order to allow for instruction level parallelism. That is, multiple bytecodes may be converted into a lesser number of native instructions.
[0060] The decoded bytecodes are sent to a state machine unit 74 and Arithmetic Logic Unit (ALU) 76. The ALU 76 is provided to rearrange the bytecode instructions to make them easier to be operated on by the state machine 74 and perform various arithmetic functions including computing memory references. The state machine 74 converts the bytecodes into native instructions using the lookup table 78. Thus, the state machine 74 provides an address which indicates the location of the desired native instruction in the microcode look-up table 78. Counters are maintained to keep a count of how many entries have been placed on the operand stack, as well as to keep track of and update the top of the operand stack in memory and in the register file. In a preferred embodiment, the output of the microcode look-up table 78 is augmented with indications of the registers to be operated on in the native CPU register file at line 80. The register indications are from the counters and interpreted from bytecodes. To accomplish this, it is necessary to have a hardware indication of which operands and variables are in which entries in the register file. Native Instructions are composed on this basis. Alternately, these register indications can be sent directly to the Java™ CPU register file 48 shown in FIG. 3.
[0061] The state machine 74 has access to the Java™ registers in 44 as well as an indication of the arrangement of the stack and variables in the Java™ CPU register file 48 or in the conventional CPU register file 46. The buffer 82 supplies the translated native instructions to the CPU.
[0062] The operation of the Java™ hardware accelerator of one embodiment of the parent invention is illustrated in FIGS. 5 and 6 . FIG. 5 , section I shows the instruction translation of the Java™ bytecode. The Java™ bytecode corresponding to the mnemonic iadd is interpreted by the Java™ virtual machine as an integer operation taking the top two values of the operand stack, adding them together and pushing the result on top of the operand stack. The Java™ translating machine translates the Java™ bytecode into a native instruction such as the instruction ADD R1, R2. This is an instruction native to the CPU indicating the adding of value in register R1 to the value in register R2 and the storing of this result in register R2. R1 and R2 are the top two entries in the operand stack.
[0063] As shown in FIG. 5 , section II, the Java™ register includes a PC value of “Value A” that is incremented to “Value A+1”. The Optop value changes from “Value B” to “Value B−1” to indicate that the top of the operand stack is at a new location. The Vars base value which points to the start of the variable list is not modified. In FIG. 5 , section m, the contents of a native CPU register file or a Java™ CPU register file, 48 in FIG. 3 , is shown. The Java™ CPU register file starts off with registers R0-R5 containing operand stack values and registers R6-R7 containing variable values. Before the operation of the native instruction, register R1 contains the top value of the operand stack. Register R6 contains the first variable. Hardware is used to detect the availability of the Vars in the register file. If the Var is not available, the hardware in conjunction with microcode issue load instructions to the native CPU. Once the value of a Var has been updated in the RF, that entry is marked as being modified so when doing method calls, only the updated Vars in memory are written back to memory. This results in significantly higher performance methods. After the execution of the native instruction, register R2 now contains the top value of the operand stack. Register R1 no longer contains a valid operand stack value and is available to be overwritten by a operand stack value.
[0064] FIG. 5 , section IV, shows the memory locations of the operand stack and variables which can be stored in the data cache 58 or in main memory. For convenience, the memory is illustrated without illustrating any virtual memory scheme. Before the native instruction executes, the address of the top of the operand stack, Optop, is “Value B”. After the native instruction executes, the address of the top of the operand stack is “Value B−1” containing the result of the native instruction. Note that the operand stack value “4427” can be written into register R1 across the overflow/underflow line 60. Upon a switch back to the native mode, the data in the Java™ CPU register file 48 should be written to the data memory.
[0065] Consistency must be maintained between the Hardware Java™ Registers 44, the Java™ CPU register file 48 and the data memory. The CPU 26 and Java™ Accelerator Instruction Translation Unit 42 are pipelined and any changes to the hardware java registers 44 and changes to the control information for the Java™ CPU register file 48 must be able to be undone upon a “branch taken” signal. The system preferably uses buffers (not shown) to ensure this consistency. Additionally, the Java™ instruction translation must be done so as to avoid pipeline hazards in the instruction translation unit and CPU.
[0066] FIG. 6 is a diagram illustrating the operation of instruction level parallelism with the parent invention. In FIG. 6 the Java™ bytecodes iload_n and iadd are converted by the Java™ bytecode translator to the single native instruction ADD R6, R1. In the Java™ Virtual Machine, iload_n pushes the top local variable indicated by the Java™ register Var onto the operand stack.
[0067] In the parent invention the Java™ hardware translator can combine the iload_n and iadd bytecode into a single native instruction. As shown in FIG. 6 , section II, the Java™ Register, PC, is updated from “Value A” to “Value A+2”. The Optop value remains “value B”. The value Var remains at “value C”.
[0068] As shown in FIG. 6 , section m, after the native instruction ADD R6, R1 executes the value of the first local variable stored in register R6, “1221”, is added to the value of the top of the operand stack contained in register R1 and the result stored in register R1. In FIG. 6 , section IV, the Optop value does not change but the value in the top of the register contains the result of the ADD instruction, 1371. This example shows the present invention operating with a native CPU supporting only two operands. The invention can also support three operands and Very Long Instruction Word (VLIW) CPU's.
[0069] For some byte codes such as SiPush, BiPush, etc., the present invention makes available sign extended data for the immediate field of the native instruction being composed (120) by the hardware and microcode. This data can alternatively be read as a coprocessor register. The coprocessor register read/write instruction can be issued by hardware accelerator as outlined in the present invention. Additionally, the microcode has several fields that aid in composing the native instruction.
[0070] The Java™ hardware accelerator of the parent invention is particularly well suited to a embedded solution in which the hardware accelerator is positioned on the same chip as the existing CPU design. This allows the prior existing software base and development tools for legacy applications to be used. In addition, the architecture of the present embodiment is scalable to fit a variety of applications ranging from smart cards to desktop solutions. This scalability is implemented in the Java™ accelerator instruction translation unit of FIG. 4. For example, the lookup table 78 and state machine 74 can be modified for a variety of different CPU architectures. These CPU architectures include reduced instruction set computer (RISC) architectures as well as complex instruction set computer (CISC) architectures. The present invention can also be used with superscalar CPUs or very long instruction word (VLIW) computers.
[0071] FIGS. 8-20 illustrate the operation of the present invention. FIG. 8 is a diagram that shows a system 100 of one embodiment of the present invention. The system includes a CPU 101 and a hardware accelerator. The hardware accelerator portion includes a decode stage 102 for receiving the Java™ bytecode from the memory. Decode stage 102 preferably uses instruction level parallelism in which more than one Java™ bytecode can be converted into a single native instruction. In a preferred embodiment, the system 100 includes a microcode stage 104 which receives signals from the decode stage 102 and is used to construct the native instructions. The microcode stage 104 allows for the production of multiple native instructions from a single bytecode. The reissue buffer 106 stores a copy of the converted instructions in the reissue buffer 106 as they are sent to the CPU 101.
[0072] The reissue buffer 106 monitors the native PC value 110. In a preferred embodiment, when the hardware accelerator is active, the hardware accelerator does not use the native PC value to determine the memory location to load the instructions from memory. The native PC value is instead maintained within a spoofed range which indicates that the hardware accelerator is active. In a preferred embodiment, the native PC monitor 110 detects whether the native PC value is within the spoofed range. If so, the multiplexer 112 sends the converted instructions from the hardware accelerator to the CPU 101. If not, the native instructions from memory are loaded to the CPU 101. When in the spoofed range, the addresses sourced to memory are the Java™ PC from the accelerator. Otherwise the native PC is sourced to memory.
[0073] If an interrupt occurs, the native PC value will go to a value outside the spoofed range. The PC monitor 110 will then stall the hardware accelerator. When a return from interrupt occurs, the CPU 101 will be flushed, and upon return from interrupt, the native PC value 108 returned to the PC value prior to the interrupt. The reissue buffer 106 will then reissue stored native instructions flushed from CPU 101 to the CPU 101 that corresponds to this prior native PC value. With the use of this system, the hardware accelerator does not need to be flushed upon an interrupt, nor do previously converted Java™ bytecodes need to be reloaded into the hardware accelerator. The use of the reissue buffer 106 can thus speed the operation and recovery from interrupt.
[0074] The CPU 101 is associated with a register file 113. This register file is the native CPU's normal register file, operably connected to the CPU's ALU but is shown separately here for illustration. The register file 113 stores Stack and Var values which can be used by the converted instructions. The Stack- and Variable-managers 114 keep track of any information stored in the register file 113 and use it to help the microcode stage operations. As described below, in one embodiment there are a fixed number of registers used for Stack values and Variable value. For example, six registers can be used for the top six Stack values and six registers used for six Variable values.
[0075] In another embodiment of the present invention, the Stack and Variable manager assigns Stack and Variable values to different registers in the register file. An advantage of this alternate embodiment is that in some cases the Stack and Var values may switch due to an Invoke Call and such a switch can be more efficiently done in the Stack and Var manager 114 rather than producing a number of native instructions to implement this.
[0076] In one embodiment a number of important values can be stored in the hardware accelerator to aid in the operation of the system. These values stored in the hardware accelerator help improve the operation of the system, especially when the register files of the CPU are used to store portions of the Java™ stack.
[0077] The hardware accelerator preferably stores an indication of the top of the stack value. This top of the stack value aids in the loading of stack values from the memory. The top of the stack value is updated as instructions are converted from stack-based instructions to register-based instructions. When instruction level parallelism is used, each stack-bases instruction which is part of a single register-based instruction needs to be evaluated for its effects on the Java™ stack.
[0078] In one embodiment, an operand stack depth value is maintained in the hardware accelerator. This operand stack depth indicates the dynamic depth of the operand stack in the CPU's register files. Thus, if four stack values are stored in the register files, the stack depth indicator will read “4.” Knowing the depth of the stack in the register file helps in the loading and storing of stack values in and out of the register files.
[0079] In a preferred embodiment, a minimum stack depth value and a maximum stack depth value are maintained within the hardware accelerator. The stack depth value is compared to the maximum and minimum stack depths. When the stack value goes below the minimum value, the hardware accelerator composes load instructions to load stack values from the memory into the register file of the CPU. When the stack depth goes above the maximum value, the hardware accelerator composes store instructions to store stack values back out to the memory.
[0080] In one embodiment, at least the top four (4) entries of the operand stack in the CPU register file operated as a ring buffer, the ring buffer maintained in the accelerator and operably connected to a overflow/underflow unit.
[0081] The hardware accelerator also preferably stores an indication of the operands and variables stored in the register file of the CPU. These indications allow the hardware accelerator to compose the converted register-based instructions from the incoming stack-based instructions.
[0082] The hardware accelerator also preferably stores an indication of the variable base and operand base in the memory. This allows for the composing of instructions to load and store variables and operands between the register file of the CPU and the memory. For example, When a Var is not available in the register file, the hardware issues load instructions. The hardware adapted to multiply the Var number by four and adding the Var base to produce the memory location of the Var. The instruction produced is based on knowledge that the Var base is in a temporary native CPU register. The Var number times four can be made available as the immediate field of the native instruction being composed, which may be a memory access instruction with the address being the content of the temporary register holding a pointer to the Vars base plus an immediate offset. Alternatively, the final memory location of the Var may be read by the CPU as an instruction saved by the accelerator and then the Var can be loaded.
[0083] In one embodiment, the hardware accelerator marks the variables as modified when updated by the execution of Java™ byte codes. The hardware accelerator can copy variables marked as modified to the system memory for some bytecodes.
[0084] In one embodiment, the hardware accelerator composes native instructions wherein the native instructions operands contains at least two native CPU register file references where the register file contents are the data for the operand stack and variables.
[0085] FIG. 9 illustrates a decode stage of one embodiment of the present invention. This decode stage 102′ is divided into the prefetch stage 116 and the instruction decode 118. The prefetch stage 116 includes a bytecode buffer and alignment prefetch stage unit 120 which receives the raw bytecodes from a memory (not shown). The Java™ bytecode buffer control element 122 provides instructions to determine when to load additional bytecodes from the memory. The address unit 124 uses the Java™ program counter 126 to determine the location of the next bytecode to load. As described above, while the hardware accelerator is active, the Java™ program counter is used to get the next word from memory containing Java™ bytecode. The native PC is maintained within a spoofed region and is not used to get the next instruction while the hardware accelerator is active. The bytecode buffer alignment unit 120 contains a number of bytecodes from the memory. When the instructions are passed on from the instruction decode unit 118, a number of bytes are removed from the bytecode buffer alignment unit 120. A signal on line 128 indicates the number of bytecodes which are used by the instruction decode unit 118. In one embodiment, the decoded data on line 130 is sent to the microcode stage. This data can include the microcode Start Address data 130a, Index/Address and Vars data 130b, and Var Control data 130c.
[0086] FIG. 10 shows an instruction decode unit 118′. In this embodiment, a number of bytes are sent to an Instruction Decode unit. Individual Decode units 132, 134, 136, 138 and 140 receive and decode the bytes. Note that the value of adjacent bytes affects how the byte is decoded. For example, if byte A is the start of a two-byte instruction, the value of byte B is interpreted as the second half of the two-byte instruction. The instruction level parallelism logic 142 receives the decoded information and then determines the microcode start address for the primary bytecode. Secondary byte codes can be combined with the primary bytecode by the selection of registers accessed by the converted instruction. One example of this embodiment is described below with respect to FIGS. 19 and 20 .
[0087] The accelerator ALU 144 is used to calculate index addresses and the like. The accelerator ALU is connected to the register pool. The use of the accelerator ALU allows certain simple calculations to be moved from the CPU unit to the hardware accelerator unit, and thus allows the Java™ bytecodes to be converted into fewer native instructions. The Variable Selection+Other Control unit 146 determines which registers are used as Vars. The Var control line from the ILP Logic unit 142 indicates how these Vars are interpreted. A Var and associated Var control line can be made available for each operand field in the native CPU's instruction.
[0088] In one embodiment, the hardware accelerator issues native load instructions when a variable is not present in the native CPU register file, the memory address being computed by the ALU in the hardware accelerator.
[0089] The microcode stage 104′ shown in FIG. 11 includes a microcode address logic 148 and microcode memory 150. The microcode address logic sends microcode addresses to the microcode memory 150. The microcode memory 150 then sends the contents of that address to the Native Instruction Composer Logic 152 which produces the native instruction. Each microcode memory line includes a main instruction portion on line 154, control bits on line 156 and update stack pointer bits on line 158. Both the microcode address logic 148 and the microcode 150 can produce a string of native instructions until the update stack Bit is sent to the microcode address logic 148. At that point, the microcode address logic obtains another start address from the decode logic (not shown). The native instruction composer receives the main instruction portion on line 154, the control bits from the decode, the index address, Vars, and the Var controls. These inputs allow the native instruction composer 152 to construct the native instructions which are sent to the reissue buffer and the native CPU.
[0090] FIG. 12 shows a microcode address logic 148′ of one embodiment of the present invention. Start address coming from the decode logic goes to multiplexer 154. The multiplexer 154 can either send the start address or an incremental or calculated value to the microcode RAM. In a preferred embodiment, while the update stack bit is not set, the address of the next element in the microcode is calculated by the ALU 156 and provided to the multiplexer 154 for sending to the microcode memory (not shown). Space in the microcode RAM memory can be conserved by including jumps to other areas of the microcode memory. These jumps can be done by calculation in unit 158 or by providing the address on line 160.
[0091] FIG. 13 illustrates an embodiment of a native instruction composer unit for use with the present invention. In this embodiment a number of register selection logic units 162, 164 and 166 are provided. Each register selection logic unit can be used to select a register used with a native instruction. Special resources logic unit 168 and selection logic 170 allow the selection of special instructions.
[0092] FIG. 14 shows the register selection logic 161′ of one embodiment of the present invention. The register determination logic 172 determines from the variable control bits, the microcode control bits and the Stack and Vars register manager information which register to use. For example, if the instruction is to load the top of stack and then use this top of stack value in next bytecode register determination logic 172 can be used to determine that register R10 contains the top of stack value and so Register R10 is used in the converted instruction.
[0093] Register remapping unit 174 does register remapping. In conventional CPUs, some registers are reserved. Register remapping unit 174 allows the decoder logic to assume that the Stack and Var registers are virtual, which simplifies the calculations. Multiplexer 176 allows the value on line 171 to be passed without being modified.
[0094] FIG. 15 illustrates an embodiment of a stack-and-variable-register manager 114′. The stack-and-variable-register manager maintains indications of what is stored in the variable and stack registers of the register file of the CPU. This information is then provided to the decode stage and microcode stage in order to help in the decoding of the Java™ bytecode and generating appropriate native instructions.
[0095] In a preferred embodiment, one of the functions of the Stack-and-Var register manager is to maintain an indication of the top of the stack. Thus, if for example registers R1-R4 store the top 4 stack values from memory or by executing byte codes, the top of the stack will change as data is loaded into and out of the register file. Thus, register R2 can be the top of the stack and register R1 be the bottom of the stack in the register file. When a new data is loaded into the stack within the register file, the data will be loaded into register R3, which then becomes the new top of the stack, the bottom of the stack remains R1. With two more items loaded on the stack in the register file, the new top of stack in the register file will be R1 but first R1 will be written back to memory by the accelerators overfiow/underlfow unit, and R2 will be the bottom of the partial stack in the CPU register file.
[0096] FIG. 16 illustrates an alternate stack-and-variable-register manager 114″. In this alternate embodiment, a register assignment table 172 is maintained. The register assignment table maintains an indication of which Vars and stack variables are stored in which registers. When an instruction is decoded it is checked whether a Var or stack value is stored in the register file using the register assignment table 172. If there is a match to the incoming stack or Var value, the values within the register file of the CPU are used. If there is no match, the value can be loaded into the register file from the memory and the register assignment table updated. In one embodiment, an invoke assignment logic unit 174 is operably conected with the register assignment table. When an invoke occurs, typically the values of some of the stack and the Vars are switched. By reassigning the values within the register assignment table 172 using reassignment logic 174, the operation of the invoke can be speeded up.
[0097] FIG. 17 shows one embodiment of a native PC monitor 110′. The native PC value is compared to a high range register and a low range register. If the native PC value is within this range, the hardware accelerator is enabled using line 178. Otherwise the hardware accelerator is disabled. The element 180 tests whether the native PC value is coming close to the high end of the spoof range. If so, the system induces a jump to a lower value of the native PC unit.
[0098] FIG. 18 illustrates an embodiment of a reissue buffer 106′. The reissue buffer receives the converted instructions and stores them along with the associated native PC value. As long as there is no interrupt, the native PC value will continue to increment, and the next instruction and current native PC is stored in the reissue buffer and instruction issued to the CPU. When an interrupt occurs, the CPU pipeline is flushed, including non-executed instructions, of which there is a copy in the reissue buffer. When a return from an interrupt occurs, the CPU is flushed and the native PC value before the interrupt is restored. This restored native PC value matches a native PC stored in the PC value store 184, causing a buffered instruction in the old instruction store 186 to be provided to the CPU. The old instruction store and the PC value store are synchronized. Once all of the old instructions are provided to the CPU 102, the native PC value will be outside of the range of all of the old PC values in store 184, and new converted instructions will be provided. The depth of the reissue buffer depends upon the number of pipeline stages in the CPU 102 (not shown). Under certain conditions such as branches, the reissue buffer is flushed. As described above, the reissue buffer eases the operation of the hardware accelerator. The hardware accelerator need not know the details of the return from interrupt operation of the CPU. Thus the hardware accelerator can operate with a variety of different CPUs without requiring major modification of the hardware accelerator architecture. Changes to the microcode stage are sufficient to change the hardware accelerator so that it could be used with different CPUs.
[0099] FIGS. 19 and 20 illustrate the operation of one embodiment of the system of the present invention. In FIG. 19 , multiple instructions are shown being received by the decoder stage. The top two instructions are integer loads and the bottom instruction is an integer add. The ideal combination of these bytecodes by the system would be the main op code being an add and the two loads combined together. The system tests whether each of the Vars is in memory. In this example, the iload 31 is not a Var which is stored in memory. Thus the value of the Var 31 needs to be loaded from memory into a free register. In this example, the Var base stored in the stack manager is loaded into temp register R10. The word is put into the top of the stack, or in this case in the register file indicating the top of the stack.
[0100] FIG. 20 illustrates an example when iload_3 and iload 5 are used. In this example, both of these Vars are stored within the register file. Thus, the add can be combined with the two loads. In this example, Var H is indicated as being a 3, Var L is indicated as being a 5. The op type is indicated as being iadd. The Var H Control and Var L Control indicate that the Vars are load types and in the register file. The top of the stack modification is +1. This is because two values are loaded upon the stack for the two loads, and one value is removed from the stack as a result of the main add operation.
[0101] In actuality, as can be understood with respect to the figures described above, the Var 3 and Var 5 are already stored within the two register files. The value of these register files is determined by the system. The instructions iload 3, iload 5 and iadd are done by determining which two registers store Var 3 and Var S and also determining which register is to store the new top of the stack. If Var 3 is stored in register R9 and Var 5 is stored in register R11 and the top of the stack is to be stored in register R2, the converted native instruction is an add of the value within register R9 to the value within register R11 and store the value into register R2. This native instruction thus does the operation of three bytecodes at the same time, resulting in the instruction level parellelism as operated on a native CPU.
[0102] Additionally within the hardware accelerator a ALU is deployed where the decoded byte code instructions for bytecodes such as GOTO and GOTO_W, the immediate branch offset following the bytecode instruction is sign extended and added to the Java™ PC of the current bytecode instruction and the result is stored in the Java™ PC register. JSR and JSR_W bytecode instructions also do this in addition to pushing the Java™ PC of the next byte code instruction on the operand stack.
[0103] The Java™ PC is incremented by a value calculated by the hardware accelerator. This increment value is based on the number of bytes being disposed of during the current decode which may include more than one byte code due to ILP. Similarly, SiPush and BiPush instructions are also sign extended and made available in the immediate field of the native instruction being composed. In some processors, the immediate field of the native instruction has a smaller bit width than is desired for the offsets or sign extended constants so this data may be read as memory mapped or I/O mapped reads.
[0104] While the present invention has been described with reference to the above embodiments, this description of the preferred embodiments and methods is not meant to be construed in a limiting sense. For example, the term Java™ in the specification or claims should be construed to cover successor programming languages or other programming languages using basic Java™ concepts (the use of generic instructions, such as bytecodes, to indicate the operation of a virtual machine). It should also be understood that all aspects of the present invention are not to be limited to the specific descriptions, or to configurations set forth herein. Some modifications in form and detail the various embodiments of the disclosed invention, as well as other variations in the present invention, will be apparent to a person skilled in the art upon reference to the present disclosure. It is therefore contemplated that the following claims will cover any such modifications or variations of the described embodiment as falling within the true spirit and scope of the present invention.
Claims
What is claimed is:
1. A CPU for executing stack and register-based instructions, comprising:
execute logic for executing the register-based instructions;
a register file associated with the executed logic; and
a hardware accelerator to process stack-based instructions in cooperation with the execute logic, wherein the hardware accelerator generates a new virtual machine program counter (PC) due to a “jump subroutine JSR” or “jump subroutine wide JSR_W” bytecode by sign extending the immediate branch offset following the “jump subrountine JSR” or “jump subroutine wide JSR_W” byte code and adding it to the virtual machine (PC) of the current byte code instruction, computes the return virtual machine program counter and pushes the return virtual machine program counter
2. A central processing unit (CPU) for executing stack and register-based instructions, comprising:
execute logic for executing the register-based instructions;
a register file associated with the execute logic; and
a hardware accelerator to process stack-based instructions in cooperation with the execute logic, wherein the hardware accelerator:
maintains an operand stack for the stack-based instructions in the register file such that the operand stack in the register file define a ring buffer in conjunction with an overflow/underflow mechanism for moving operands in the operand stack between the register file and a memory, and loads variables required for processing the stack-based instructions into the register file,
generates a new virtual machine program counter due to a “GOTO” or “GOTO_W” byte code by sign extending the immediate branch offset following the “GOTO” or “GOTO_W” bytecode and adds it to the virtual machine program counter of the current bytecode instruction,
generates a new virtual machine program counter due to a “JSR” or “JSR_W” bytecode by sign extending the immediate branch offset following the “JSR” or “JSR_W” bytecode and adding it to the virtual machine PC of the current byte code instruction, computes the return virtual machine program counter and pushes the return virtual machine program counter onto the operand stack,
performs a sign extension for the virtual machine SiPush and BiPush byte codes and appends the sign extended data to the immediate field of a register-based instruction being composed based the stack-based instructions;
performs sign extension for virtual machine SiPush and BiPush bytecodes and makes the sign extended data available to be read by the execute logic; and
produces exceptions in respect of selected stack-based instructions.
3. The CPU of claim 2, wherein the exceptions are processed using register-based instructions.
4. The CPU of claim 2, wherein the hardware accelerator processes the stack-based instructions in cooperation with the execute logic by converting the stack-based instructions into register-based instructions for execution in the execute logic.
5. A central processing unit (CPU) comprising:
execute logic to receive and process input corresponding to register-based instruction;
a hardware accelerator to process stack-based instructions to produce an output that can be processed by the execute logic;
an operand stack for the stack-based instructions, the operand stack being maintained in a register file as a ring buffer;
an overflow/underflow mechanism for moving operands in the operand stack between a register file and a memory, said register file also storing data associated with the register-based instructions;
a bytecode buffer that receives stack-based instructions from the memory; and
an instruction decode unit coupled to the bytecode buffer to decode instructions received from the bytecode buffer and to provide an indication of how many bytes have been processed; and
a common program counter for the stack-based instructions and the register-based instructions, wherein the common program counter is incremented by the indication of the number of bytes processed.
6. The CPU of claim 5, further comprising a common instruction cache for the stack-based instructions and the register-based instructions.
7. The CPU of claim 5, wherein the instruction decode unit produces an indication for a variable stored in the register file.
8. The CPU of claim 5, further comprising a microcode unit coupled to the instruction decode unit to receive output therefrom.
9. The CPU of claim 8, wherein the instruction decode unit generates a start address for the microcode unit.
10. The CPU of claim 9, further comprising a mechanism to select the start address or an incremented start address for the microcode unit.
11. The CPU of claim 9, wherein the microcode unit produces a stack update indication to cause the instruction decode unit to generate a new start address for the microcode unit.
12. The CPU of claim 5, wherein the hardware accelerator produces an exception in respect of selected stack-based instructions.
13. The CPU of claim 12, wherein the exception is processed using register based instructions.
14. The CPU of claim 5, wherein the instruciton decode unit decodes multiple instructions received from the bytecode buffer in parallel.
15. The CPU of claim 14, wherein the instruction decode unit comprises multiple decoders.
16. A method for a central processing unit (CPU), comprising:
for register-based instructions, processing the register-based instructions in execute logic capable of processing the register-based instructions; and
for stack-based instructions, processing the stack-based instructions in a hardware accelerator into input the execute logic is capable of processing, wherein the hardware accelerator generates a new virtual machine program counter (PC) due to a “jump subroutine JSR” or “jump subroutine wide JSR-W” bytecode by sign extending an immediate branch offset following the “JSR” or “JSR-W” bytecode and adding it to a virtual machine program counter (PC) of a current bytecode instruction, computes a return virtual machine program counter (PC) and pushes the return virtual machine program counter onto an operand stack.
17. The method of claim 16, wherein processing the stack-based instructions comprises decoding multiple stack-based instructions in an instruction decode unit in parallel.
18. The method of claim 17, wherein processing the stack-based instructions comprises generating a start address for a microcode unit in the instruction deccode unit.
19. The method of claim 18, processing the stack-based instructions comprises selecting the start address or an incremented start address for the microcode unit.
20. The method of claim 16, wherein processing the stack-based instructions comprises generating exceptions in respect of selected stack-based instructions.
21. The method of claim 16, further comprising storing the storing the stack-based instructions and the register-based instructions in a common instruction cache.
22. The method of claim 16, wherein processing the stack-based instructions comprises producing an indication for a variable stored in a register file.
Patent Citations (111)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3889243(A) | 1975-06-01 | Drimak | Applicant |
| US4236204(A) | 1980-11-01 | Groves | Applicant |
| US4524416(A) | 1985-06-01 | Stanley et al. | Applicant |
| US4587612(A) | 1986-05-01 | Fisk et al. | Applicant |
| US4587632(A) | 1986-05-01 | Ditzel | Applicant |
| US4631663(A) | 1986-12-01 | Chilinski et al. | Applicant |
| US4763255(A) | 1988-08-01 | Hopkins et al. | Applicant |
| US4783738(A) | 1988-11-01 | Li et al. | Applicant |
| US4860191(A) | 1989-08-01 | Nomura et al. | Applicant |
| US4922414(A) | 1990-05-01 | Holloway et al. | Applicant |
| US4961141(A) | 1990-10-01 | Hopkins et al. | Applicant |
| US4969091(A) | 1990-11-01 | Muller | Applicant |
| US5077657(A) | 1991-12-01 | Cooper et al. | Applicant |
| US5113522(A) | 1992-05-01 | Dinwiddie, Jr. et al. | Applicant |
| US5136696(A) | 1992-08-01 | Beckwith et al. | Applicant |
| US5142681(A) | 1992-08-01 | Driscoll et al. | Applicant |
| US5163139(A) | 1992-11-01 | Haigh et al. | Applicant |
| US5193180(A) | 1993-03-01 | Hastings | Applicant |
| US5201056(A) | 1993-04-01 | Daniel et al. | Applicant |
| US5218711(A) | 1993-06-01 | Yoshida | Applicant |
| US5241636(A) | 1993-08-01 | Kohn | Applicant |
| US5265206(A) | 1993-11-01 | Shackelford et al. | Applicant |
| US5307492(A) | 1994-04-01 | Benson | Applicant |
| US5313614(A) | 1994-05-01 | Goettelmann et al. | Applicant |
| US5333296(A) | 1994-07-01 | Bouchard et al. | Applicant |
| US5335344(A) | 1994-08-01 | Hastings | Applicant |
| US5355460(A) | 1994-10-01 | Eickemeyer et al. | Applicant |
| US5430862(A) | 1995-07-01 | Smith et al. | Applicant |
| US5481684(A) | 1996-01-01 | Richter et al. | Applicant |
| US5490256(A) | 1996-02-01 | Mooney et al. | Applicant |
| US5535329(A) | 1996-07-01 | Hastings | Applicant |
| US5542059(A) | 1996-07-01 | Blomgren | Applicant |
| US5574927(A) | 1996-11-01 | Scantlin | Applicant |
| US5577233(A) | 1996-11-01 | Goettelmann et al. | Applicant |
| US5619665(A) | 1997-04-01 | Emma | Applicant |
| US5619666(A) | 1997-04-01 | Coon et al. | Applicant |
| US5634118(A) | 1997-05-01 | Blomgren | Applicant |
| US5638525(A) | 1997-06-01 | Hammond et al. | Applicant |
| US5650948(A) | 1997-07-01 | Gafter | Applicant |
| US5659703(A) | 1997-08-01 | Moore et al. | Applicant |
| US5668999(A) | 1997-09-01 | Gosling | Applicant |
| US5692170(A) | 1997-11-01 | Isaman | Applicant |
| US5740441(A) | 1998-04-01 | Yellin et al. | Applicant |
| US5740461(A) | 1998-04-01 | Jaggar | Applicant |
| US5748964(A) | 1998-05-01 | Gosling | Applicant |
| US5752035(A) | 1998-05-01 | Trimberger | Applicant |
| US5761477(A) | 1998-06-01 | Wahbe et al. | Applicant |
| US5764908(A) | 1998-06-01 | Shoji et al. | Applicant |
| US5768593(A) | 1998-06-01 | Walters et al. | Applicant |
| US5774868(A) | 1998-06-01 | Cragun et al. | Applicant |
| US5778178(A) | 1998-07-01 | Arunachalam | Applicant |
| US5781750(A) | 1998-07-01 | Blomgren et al. | Applicant |
| US5784584(A) | 1998-07-01 | Moore et al. | Applicant |
| US5794068(A) | 1998-08-01 | Asghar et al. | Applicant |
| US5805895(A) | 1998-09-01 | Breternitz, Jr. et al. | Applicant |
| US5809336(A) | 1998-09-01 | Moore et al. | Applicant |
| US5838165(A) | 1998-11-01 | Chatter | Applicant |
| US5838948(A) | 1998-11-01 | Bunza | Applicant |
| US5875336(A) | 1999-02-01 | Dickol et al. | Examiner |
| US5889996(A) | 1999-03-01 | Adams | Applicant |
| US5898850(A) | 1999-04-01 | Dickol et al. | Examiner |
| US5898885(A) | 1999-04-01 | Dickol et al. | Examiner |
| US5903761(A) | 1999-05-01 | Tyma | Applicant |
| US5905895(A) | 1999-05-01 | Halter | Applicant |
| US5920720(A) | 1999-07-01 | Toutonghi et al. | Applicant |
| US5923892(A) | 1999-07-01 | Levy | Applicant |
| US5925123(A) | 1999-07-01 | Tremblay et al. | Applicant |
| US5926832(A) | 1999-07-01 | Wing et al. | Applicant |
| US5937193(A) | 1999-08-01 | Evoy | Applicant |
| US5940858(A) | 1999-08-01 | Green | Examiner |
| US5946487(A) | 1999-08-01 | Dangelo | Examiner |
| US5946718(A) | 1999-08-01 | Green | Examiner |
| US5953741(A) | 1999-09-01 | Evoy et al. | Applicant |
| US5983334(A) | 1999-11-01 | Coon et al. | Applicant |
| US5999731(A) | 1999-12-01 | Yellin et al. | Examiner |
| US6003038(A) | 1999-12-01 | Chen | Applicant |
| US6009499(A) | 1999-12-01 | Koppala | Applicant |
| US6014723(A) | 2000-01-01 | Tremblay et al. | Examiner |
| US6021469(A) | 2000-02-01 | Tremblay et al. | Applicant |
| US6026485(A) | 2000-02-01 | O'Connor et al. | Applicant |
| US6031992(A) | 2000-02-01 | Cmelik et al. | Applicant |
| US6038643(A) | 2000-03-01 | Tremblay et al. | Applicant |
| US6052526(A) | 2000-04-01 | Chatt | Applicant |
| US6065108(A) | 2000-05-01 | Tremblay et al. | Applicant |
| US6067577(A) | 2000-05-01 | Beard | Applicant |
| US6071317(A) | 2000-06-01 | Nagel | Applicant |
| US6075940(A) | 2000-06-01 | Gosling | Applicant |
| US6076141(A) | 2000-06-01 | Tremblay et al. | Examiner |
| US6081665(A) | 2000-06-01 | Nilsen | Applicant |
| US6108768(A) | 2000-08-01 | Koppala et al. | Applicant |
| US6110226(A) | 2000-08-01 | Bothner | Applicant |
| US6118940(A) | 2000-09-01 | Alexander, III et al. | Applicant |
| US6125439(A) | 2000-09-01 | Tremblay et al. | Examiner |
| US6131144(A) | 2000-10-01 | Koppala | Applicant |
| US6131191(A) | 2000-10-01 | Cierniak et al. | Applicant |
| US6139199(A) | 2000-10-01 | Rodriguez | Applicant |
| US6141794(A) | 2000-10-01 | Dice et al. | Applicant |
| US6158048(A) | 2000-12-01 | Lueh et al. | Applicant |
| US6167488(A) | 2000-12-01 | Koppala | Applicant |
| US6209077(B1) | 2001-03-01 | Robertson et al. | Applicant |
| US6233678(B1) | 2001-05-01 | Bala | Examiner |
| US6275903(B1) | 2001-08-01 | Koppala et al. | Applicant |
| US6292883(B1) | 2001-09-01 | Augusteijn et al. | Applicant |
| US6317872(B1) | 2001-11-01 | Gee et al. | Applicant |
| US6321323(B1) | 2001-11-01 | Nugroho et al. | Applicant |
| US6330659(B1) | 2001-11-01 | Poff et al. | Applicant |
| US6349377(B1) | 2002-02-01 | Lindwer | Applicant |
| US6374286(B1) | 2002-04-01 | Gee et al. | Applicant |
| US6477702(B1) | 2002-11-01 | Yellin et al. | Examiner |
| US6532531(B1) | 2003-03-01 | O'Connor et al. | Applicant |
| US6606743(B1) | 2003-08-01 | Raz et al. | Examiner |
Non-Patent Literature (32)
- Title: Fast, Effective Code Generation in a Just-in-time Java Compiler, author: Reza et al, ACM, May 1998.Examiner
- Title: A Software High Performane APL Interpreter, author: Saal et al, ACM, 1979.Examiner
- “SGI WebForce 02 is a one-stop Web authoring platform,” InfoWorld, Jan. 20, 1997.Applicant
- Krall, et al., “CACAO—A 64-bit Java VM just-in-time compiler,” Concurrency: Practice and Experience, vol. 9 (11), pp. 1017-1030, Nov. 1997.Applicant
- “Sun says JAVA chips will vastly increased speed, reduce costs to run JAVA programs,” Interactive Daily (Dec. 1996) downloaded from the Internet.Applicant
- Andreas Krall, “Efficient JAVA VM Just-In-Time Compilation,” IEEE 1998.Applicant
- Debaere and Campenhout, “Interpretation and Instruction Path Copressing,” ©1990 The MIT Press.Applicant
- C. John Glossner and Stamatis Vassiliadis, The Delft-Java Engine: An Introduction, Euro-Part '97, Parallel Processing, Third International Euro-Par Conference, pp. 766-770 (Aug. 1997).Applicant
- M.W. El-Kharashi et al., Java Microprocessor: Computer Architecture Implications, IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, vol. 1, pp. 277-280 (Aug. 20-22, 1997).Applicant
- R. Tomasulo, An Efficient Algorithm for Exploring Multiple Arithmetic Units, IBM Journal of Research and Development, vol. 11, No. 1, pp. 25-33 (Jan. 1967).Applicant
- Andrews, et al., “Migrating a CISC computer family onto RISC via object code translation”, Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, 1992, (1992).Applicant
- Berekovic, et al., “Hardware Realization of a Java Virtual Machine for High Performance Multimedia Applications”, IEEE Workshop on Signal Processing Systems 1997, (Jan. 1, 1997).Applicant
- Deutsch, Peter , et al., “Efficient Implementation of the Smalltalk-80 System”, 11th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1984, (1984).Applicant
- Ertl, “A new approach to forth native code generation”, EuroForth Conference Proceedings, 1992, (1992).Applicant
- Ertl, “Stack caching for interpreters”, SIGPLAN, 1995, (1995).Applicant
- Ertl, “Stack caching for interpreters”, EuroForth Conference Proceedings 1994, (1994).Applicant
- Glossner, et al., “Delft-Java Link Translation Buffer”, Proceedings of the 24th EUROMICRO conference, Aug. 1998, (Aug. 1998).Applicant
- Hsieh, et al., “Java Byte Code to Native Code Translation: The Caffeine Prototype and Preliminary Results”, IEEE, (Jan. 1, 1996).Applicant
- Kieburtz, “A RISC architecture for symbolic computation”, ACM 1987, (1987).Applicant
- Mahlke, et al., “A Comparsion of Full and Partial Predicted Execution Support for ILP Processors”, IEEE, (Jan. 1, 1995).Applicant
- Maierhofer, et al., “Optimizing stack code”, Forth-Tagung, 1997, (1997).Applicant
- McGhan, et al., “picoJava: A Direct Execution Engine for Java Bytecode”, IEEE, 1998, (1998).Applicant
- Miyoshi, et al., “Implementation and Eveluation of Real Time Java Threads”, IEEE, (Jan. 1, 1997).Applicant
- Ertl, “Implementation of stack-based languages on register machines”, dissertation, Apr. 1996, (Apr. 1996).Applicant
- O'Connor, et al., “picoJava-I: The Java Virtual Machine in Hardware”, IEEE, Mar. 1997, (Mar. 1997).Applicant
- Rose, A C., “Hardware Java Accelerator for the ARM 7th ” 4th Year Undergraduate Project in Group D, (1996/97), 1-49, Appendix.Applicant
- Steensgarrd, et al., “Object and Native Code Thread Mobilty Among Heterogeneous Computers”, ACM, (Jan. 1, 1995).Applicant
- Sun Microsystems, “PicoJava 1 Microprocessor Core Architecture”, Oct. 1996, (Oct. 1996).Applicant
- Sun Microsystems, “PicoJava I, Java Processor Core Data Sheet”, Dec. 1997, (Dec. 1997).Applicant
- Unger, et al., “Architecture of SOAR: Smalltalk on a RISC”, 11th Symposium on Computer Architecture Jun. 1984, (Jun. 1, 1984).Applicant
- Rose, A C., “Hardware Java Accelerator for the ARM 7”, 4th Year Undergraduate Project in Group D, (1996/97), 1-49, Appendix.Applicant
- Steinbusch, Otto , “Designing Hardware to Interpret Virtual Machine Instructions”, Dept. of Electrical Engineering, Eindhoven University of Technology, Master Degree Thesis, Feb. 1998, 59.Applicant