US20060026312A1 - Emulating a direct memory access controller - Google Patents
Emulating a direct memory access controller Download PDFInfo
- Publication number
- US20060026312A1 US20060026312A1 US11/188,667 US18866705A US2006026312A1 US 20060026312 A1 US20060026312 A1 US 20060026312A1 US 18866705 A US18866705 A US 18866705A US 2006026312 A1 US2006026312 A1 US 2006026312A1
- Authority
- US
- United States
- Prior art keywords
- processor
- instructions
- stack
- datum
- thread
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/10—Address translation
- G06F12/1081—Address translation for peripheral access to main memory, e.g. direct memory access [DMA]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/3017—Runtime instruction translation, e.g. macros
- G06F9/30174—Runtime instruction translation, e.g. macros for non-native instruction set, e.g. Javabyte, legacy code
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45504—Abstract machines for programme code execution, e.g. Java virtual machine [JVM], interpreters, emulators
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/60—Details of cache memory
- G06F2212/601—Reconfiguration of cache memory
- G06F2212/6012—Reconfiguration of cache memory of operating mode, e.g. cache mode or local memory mode
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Definitions
- Direct Memory Access is used in a variety of embedded systems.
- a central processing unit CPU
- memory may be directly accessed without using the CPU (i.e., the CPU is bypassed). Because the CPU is not interrupted from whatever task it is performing, system efficiency is enhanced.
- a system supporting DMA capability must contain a DMA controller to direct DMA activities in the system. DMA controllers occupy an undesirably large amount of circuit space and consume an undesirably large amount of power.
- An illustrative embodiment comprises an electronic device comprising a first processor adapted to process software instructions from a memory, and a second processor coupled to the first processor.
- the second processor is adapted to interrupt the first processor and to use the first processor as a direct memory access (DMA) controller.
- the second processor uses the first processor as a DMA controller by sending to the first processor a plurality of addresses, wherein the first processor uses a first address of the plurality of addresses to retrieve a group of instructions which, when executed, causes the first processor to load a datum directly from a memory location and to transfer the datum to a different memory location.
- Another illustrative embodiment comprises a processor that decodes and executes software instructions from memory, comprising decode logic adapted to receive from another processor a plurality of addresses, and fetch logic coupled to the decode logic and adapted to fetch a group of instructions from storage using a first address from the plurality of addresses.
- the group of instructions causes the processor to be used as a direct memory access (DMA) controller by causing the processor to load a datum directly from a memory location and to transfer the datum to a different memory location.
- DMA direct memory access
- Yet another illustrative embodiment comprises a method that comprises sending a first address from a first processor core to a second processor core, the second processor core adapted to decode and execute software instructions from memory.
- the method also comprises sending a command from the first processor core to the second processor core.
- the command interrupts the second processor core and causes the second processor core to fetch, from a location specified by the first address, a group of instructions.
- the group of instructions causes the second processor core to be used as a direct memory access (DMA) controller.
- DMA direct memory access
- FIG. 1 shows a diagram of a system in accordance with preferred embodiments of the invention and including a Java Stack Machine (“JSM”) and a Main Processor Unit (“MPU”), in accordance with embodiments of the invention;
- JSM Java Stack Machine
- MPU Main Processor Unit
- FIG. 2 shows a block diagram of the JSM of FIG. 1 in accordance with preferred embodiments of the invention
- FIG. 3 shows various registers used in the JSM of FIGS. 1 and 2 , in accordance with embodiments of the invention
- FIG. 4 shows the preferred operation of the JSM to include “micro-sequences,” in accordance with embodiments of the invention
- FIG. 5 shows an illustrative switching process between two execution threads, in accordance with a preferred embodiment of the invention
- FIG. 6 shows an illustrative 32-bit instruction that may be incorporated into a micro-sequence, in accordance with a preferred embodiment of the invention
- FIG. 7 shows a flow diagram of the switching process of FIG. 5 , in accordance with embodiments of the invention.
- FIG. 8 shows a timing diagram describing the transfer of data during each of a plurality of clock cycles, in accordance with embodiments of the invention.
- FIG. 9 shows a flow diagram describing how memory is directly accessed and stored by the JSM of FIG. 2 , in accordance with preferred embodiments of the invention.
- FIG. 10 shows the system described herein, in accordance with preferred embodiments of the invention.
- a host processor simply sends a command and an address to a secondary processor, along with information pertaining to the data that is to be moved.
- the command causes the secondary processor to use the address to locate and retrieve a group of instructions that has been pre-programmed into the secondary processor.
- Executing this group of instructions causes the secondary processor to use the information pertaining to the data to load, move and store the data via direct memory access.
- the secondary processor executes the group of instructions, it must first stop what it is doing in a currently executing thread and must further “bookmark” its place in the currently executing thread.
- the secondary processor can execute the group of instructions and then resume executing in the thread at the bookmarked location. Accordingly, a technique for bookmarking a spot in a thread and a technique by which the secondary processor is made to act as a DMA controller are now discussed in turn.
- a “thread” may be defined as a single stream of code execution. While executing a software program, a processor may switch from a first thread to a second thread in order to complete a particular task.
- the first thread may comprise some stimulus (i.e., instruction) that, when executed by the processor, causes the processor to halt execution of the first thread and to begin execution of the second thread.
- the second thread may comprise the performance of some task by a different portion of the software program.
- switch point The point in the first thread at which the switch is made may be termed the “switch point.”
- switch point When switching from the first thread to the second thread, the processor first “bookmarks” the switch point, so that when the processor has finished executing the second thread of code, it can resume execution in the first thread at the switch point.
- the processor stores all information that pertains to the switch point (known as the “context” of the switch point). Such information includes all registers, the program counter, pointer to the stack, etc. The processor copies such information to memory and retrieves the information later to resume execution in the first thread at the switch point. Bookmarking the switch point is time-consuming and consumes power which may be in limited supply in, for example, a battery-operated device such as a mobile phone.
- processors that store to memory all information pertaining to the switch point unnecessarily spend time and power doing so.
- the aforementioned processors store all registers, the program counter, stack pointer, etc.
- the subject matter described herein is achieved at least in part by the realization that in many cases, fewer than all such information need be stored. For example, only three values are saved to sufficiently bookmark the switch point: the program counter (PC), a second program counter called the micro-program counter ( ⁇ PC), discussed below, and a status register. Once the processor has finished executing the second thread, these three values provide sufficient information for the processor to find the switch point in the first thread and resume execution at that switch point.
- PC program counter
- ⁇ PC micro-program counter
- a “minimal” amount of information generally comprises information in one or more registers, but not all registers, of a processor core.
- a “minimal” amount of information comprises a PC register, a ⁇ PC register and a status register.
- a “minimal” amount of information comprises the PC register, the ⁇ PC register and the status register, as well as one or more additional registers, but less than all registers.
- a “minimal” amount of information comprises less than all registers.
- a “minimal” amount of information consists of only the information (i.e., registers) necessary to bookmark a switch point, where the amount of information (i.e., number of registers) varies depending on the processor used and/or the software application being processed.
- the “minimal” amount of information may simply be one register or may be all of the registers in the processor core.
- the processor described herein pushes a minimal amount of switch point information onto a processor stack. Later, when the processor needs the switch point information, it pops the information off of the stack and uses the information to resume execution at the switch point. In this way, the time and power demands placed on the processor are reduced or even minimized, resulting in increased performance.
- the disclosed processor is capable of bookmarking a switch point using a minimal amount of information (“minimal context store”) needed to resume execution at the switch point.
- minimal context store a minimal amount of information
- full context store a minimal amount of information
- Java is particularly suited for executing JavaTM Bytecodes or comparable code.
- Java is particularly suited for embedded applications.
- Java is a stack-based language, meaning that a processor stack is heavily used when executing various instructions (e.g., Bytecodes), which instructions generally have a size of 8 bits.
- Java is a relatively “dense” language meaning that on average each instruction may perform a large number of functions compared to various other instructions.
- the dense nature of Java is of particular benefit for portable, battery-operated devices that preferably include as little memory as possible to save space and power. The reason, however, for executing Java code is not material to this disclosure or the claims which follow.
- the processor advantageously includes one or more features that permit the execution of the Java code to be accelerated.
- a system 100 is shown in accordance with a preferred embodiment of the invention.
- the system includes at least two processors 102 and 104 .
- Processor 102 is referred to for purposes of this disclosure as a Java Stack Machine (“JSM”) and processor 104 may be referred to as a Main Processor Unit (“MPU”).
- System 100 may also include memory 106 coupled to both the JSM 102 and MPU 104 and thus accessible by both processors. At least a portion of the memory 106 may be shared by both processors meaning that both processors may access the same shared memory locations. Further, if desired, a portion of the memory 106 may be designated as private to one processor or the other.
- JSM Java Stack Machine
- MPU Main Processor Unit
- System 100 also includes a Java Virtual Machine (“JVM”) 108 , compiler 110 , and a display 114 .
- the MPU 104 preferably includes an interface to one or more input/output (“I/O”) devices such as a keypad to permit a user to control various aspects of the system 100 .
- I/O input/output
- data streams may be received from the I/O space into the JSM 102 to be processed by the JSM 102 .
- Other components may be included as desired for various applications.
- Java code comprises a plurality of “Bytecodes” 112 .
- Bytecodes 112 may be provided to the JVM 108 , compiled by compiler 110 and provided to the JSM 102 and/or MPU 104 for execution therein.
- the JSM 102 may execute at least some, and generally most, of the Java Bytecodes.
- the JSM 102 may request the MPU 104 to execute one or more Java Bytecodes not executed or executable by the JSM 102 .
- the MPU 104 also may execute non-Java instructions.
- the MPU 104 also hosts an operating system (“O/S”) (not specifically shown) which performs various functions including system memory management, the system task management that schedules the JVM 108 and most or all other native tasks running on the system, management of the display 114 , receiving input from input devices, etc.
- O/S operating system
- Java code may be used to perform any one of a variety of applications including multimedia, games or web based applications in the system 100
- non-Java code which may comprise the O/S and other native applications, may still run on the system on the MPU 104 .
- the JVM 108 generally comprises a combination of software and hardware.
- the software may include the compiler 110 and the hardware may include the JSM 102 .
- the JVM may include a class loader, Bytecode verifier, garbage collector, and a Bytecode interpreter loop to interpret the Bytecodes that are not executed on the JSM processor 102 .
- the JSM 102 may execute at least two types of instruction sets.
- One type of instruction set may comprise standard Java Bytecodes.
- Java is a stack-based programming language in which instructions generally target a stack. For example, an integer add (“IADD”) Java instruction pops two integers off the top of the stack, adds them together, and pushes the sum back on the stack.
- IADD integer add
- a “simple” Bytecode instruction is generally one in which the JSM 102 may perform an immediate operation either in a single cycle (e.g., an “iadd” instruction) or in several cycles (e.g., “dup2_x2”).
- a “complex” Bytecode instruction is one in which several memory accesses may be required to be made within the JVM data structure for various verifications (e.g., NULL pointer, array boundaries). As will be described in further detail below, one or more of the complex Bytecodes may be replaced by a “micro-sequence” comprising various other instructions.
- Another type of instruction set executed by the JSM 102 may include instructions other than standard Java instructions.
- the other instruction set may include register-based and memory-based operations to be performed.
- This other type of instruction set generally complements the Java instruction set and, accordingly, may be referred to as a complementary instruction set architecture (“C-ISA”).
- C-ISA complementary instruction set architecture
- complementary it is meant that a complex Java Bytecode may be replaced by a “micro-sequence” comprising C-ISA instructions.
- the execution of Java may be made more efficient and run faster by replacing some sequences of Bytecodes by preferably shorter and more efficient sequences of C-ISA instructions.
- the two sets of instructions may be used in a complementary fashion to obtain satisfactory code density and efficiency.
- the JSM 102 generally comprises a stack-based architecture for efficient and accelerated execution of Java Bytecodes combined with a register-based architecture for executing register and memory based C-ISA instructions. Both architectures preferably are tightly combined and integrated through the C-ISA. Because various of the data structures described herein are generally JVM-dependent and thus may change from one JVM implementation to another, the software flexibility of the micro-sequence provides a mechanism for various JVM optimizations now known or later developed.
- FIG. 2 shows an exemplary block diagram of the JSM 102 .
- the JSM includes a core 120 coupled to data storage 122 and instruction storage 130 .
- the core may include one or more components as shown.
- Such components preferably include a plurality of registers 140 , three address generation units (“AGUs”) 142 , 147 , micro-translation lookaside buffers (micro-TLBs) 144 , 156 , a multi-entry micro-stack 146 , an arithmetic logic unit (“ALU”) 148 , a multiplier 150 , decode logic 152 , and instruction fetch logic 154 .
- AGUs address generation units
- micro-TLBs micro-translation lookaside buffers
- ALU arithmetic logic unit
- operands may be retrieved from data storage 122 or from the micro-stack 146 and processed by the ALU 148 , while instructions may be fetched from instruction storage 130 by fetch logic 154 and decoded by decode logic 152 .
- the address generation unit 142 may be used to calculate addresses based, at least in part, on data contained in the registers 140 .
- the AGUs 142 may calculate addresses for C-ISA instructions.
- the AGUs 142 may support parallel data accesses for C-ISA instructions that perform array or other types of processing.
- the AGU 147 couples to the micro-stack 146 and may manage overflow and underflow conditions in the micro-stack preferably in parallel.
- the micro-TLBs 144 , 156 generally perform the function of a cache for the address translation and memory protection information bits that are preferably under the control of the operating system running on the MPU 104 .
- the decode logic 152 comprises auxiliary registers 151 .
- the registers 140 may include 16 registers designated as R 0 -R 15 .
- registers R 0 -R 5 and R 8 -R 14 may be used as general purposes (“GP”) registers usable for any purpose by the programmer.
- Other registers, and some of the GP registers, may be used for specific functions.
- register R 5 may be used to store the base address of a portion of memory in which Java local variables may be stored when used by the current Java method.
- the top of the micro-stack 146 can be referenced by the values in registers R 6 and R 7 .
- the top of the micro-stack 146 has a matching address in external memory pointed to by register R 6 .
- the values contained in the micro-stack 146 are the latest updated values, while their corresponding values in external memory may or may not be up to date.
- Register R 7 provides the data value stored at the top of the micro-stack 146 .
- Register R 15 may be used for status and control of the JSM 102 .
- At least one bit (called the “Micro-Sequence-Active” bit) in status register R 15 is used to indicate whether the JSM 102 is executing a simple instruction or a complex instruction through a micro-sequence. This bit controls, in particular, which program counter is used (PC or ⁇ PC) to fetch the next instruction, as will be explained below.
- the JSM 102 is adapted to process and execute instructions from at least two instruction sets, at least one having instructions from a stack-based instruction set (e.g., Java).
- the stack-based instruction set may include Java Bytecodes. Unless empty, Java Bytecodes may pop data from and push data onto the micro-stack 146 .
- the micro-stack 146 preferably comprises the top n entries of a larger stack that is implemented in data storage 122 . Although the value of n may vary in different embodiments, in accordance with at least some embodiments, the size n of the micro-stack may be the top eight entries in the larger, memory-based stack.
- the micro-stack 146 preferably comprises a plurality of gates in the core 120 of the JSM 102 .
- gates e.g., registers
- access to the data contained in the micro-stack 146 is generally very fast, although any particular access speed is not a limitation on this disclosure.
- the ALU 148 adds, subtracts, and shifts data.
- the multiplier 150 may be used to multiply two values together in one or more cycles.
- the instruction fetch logic 154 generally fetches instructions from instruction storage 130 .
- the instructions may be decoded by decode logic 152 . Because the JSM 102 is adapted to process instructions from at least two instruction sets, the decode logic 152 generally comprises at least two modes of operation, one mode for each instruction set. As such, the decode logic unit 152 may include a Java mode in which Java instructions may be decoded and a C-ISA mode in which C-ISA instructions may be decoded.
- the data storage 122 generally comprises data cache (“D-cache”) 124 and data random access memory (“DRAM”) 126 .
- D-cache data cache
- DRAM data random access memory
- the stack (excluding the micro-stack 146 ), arrays and non-critical data may be stored in the D-cache 124 , while Java local variables, critical data and non-Java variables (e.g., C, C++) may be stored in D-RAM 126 .
- the instruction storage 130 may comprise instruction RAM (“I-RAM”) 132 and instruction cache (“I-cache”) 134 .
- the I-RAM 132 may be used for “complex” micro-sequenced Bytecodes or micro-sequences, as described below.
- the I-cache 134 may be used to store other types of Java Bytecode and mixed Java/C-ISA instructions.
- the C-ISA instructions generally complement the standard Java Bytecodes.
- the compiler 110 may scan a series of Java Bytecodes 112 and replace a complex Bytecode with a micro-sequence as explained previously.
- the micro-sequence may be created to optimize the function(s) performed by the replaced complex Bytecodes.
- FIG. 4 illustrates the operation of the JSM 102 to replace Java Bytecodes with micro-sequences.
- FIG. 4 shows some, but not necessarily all, components of the JSM.
- the instruction storage 130 the decode logic 152 , and a micro-sequence vector table 162 are shown.
- the decode logic 152 receives instructions from the instruction storage 130 and accesses the micro-sequence vector table 162 .
- the decode logic 152 receives instructions (e.g., instructions 170 ) from instruction storage 130 via instruction fetch logic 154 ( FIG. 2 ) and decodes the instructions to determine the type of instruction for subsequent processing and execution.
- the JSM 102 either executes the Bytecode from instructions 170 or replaces a Bytecode from instructions 170 with a micro-sequence as described below.
- the micro-sequence vector table 162 may be implemented in the decode logic 152 or as separate logic in the JSM 102 .
- the micro-sequence vector table 162 preferably includes a plurality of entries 164 .
- the entries 164 may include one entry for each Bytecode that the JSM may receive. For example, if there are a total of 256 Bytecodes, the micro-sequence vector table 162 preferably comprises at least 256 entries.
- Each entry 164 preferably includes at least two fields—a field 166 and an associated field 168 .
- Field 168 may comprise a single bit that indicates whether the instruction 170 is to be directly executed or whether the associated field 166 contains a reference to a micro-sequence.
- bit 168 having a value of “0” (“not set”) may indicate the field 166 is invalid and thus, the corresponding Bytecode from instructions 170 is directly executable by the JSM.
- Bit 168 having a value of “1” (“set”) may indicate that the associated field 166 contains a reference to a micro-sequence.
- the reference may comprise the full starting address in instruction storage 130 of the micro-sequence or a part of the starting address that can be concatenated with a base address that may be programmable in the JSM.
- field 166 may provide as many address bits as are required to access the full memory space.
- a register within the JSM registers 140 is programmed to hold the base address and the vector table 162 may supply only the offset to access the start of the micro-sequence.
- Most or all JSM internal registers 140 and any other registers preferably are accessible by the main processor unit 104 and, therefore, may be modified by the JVM as necessary.
- At least a portion 180 of the instruction 130 may be allocated for storage of micro-sequences and thus the starting address may point to a location in micro-sequence storage 130 at which a particular micro-sequence can be found.
- the portion 180 may be implemented in I-RAM 132 shown above in FIG. 2 .
- the vector table 162 preferably comprises a JSM resource that is addressable via a register 140 .
- a single entry 164 or a block of entries within the vector table 162 may be loaded by information from the data cache 124 ( FIG. 2 ).
- a repeat loop of instructions may be executed.
- a register e.g., R 0
- R 1 Another register preferably is loaded with the size of the block to load into the table.
- Register R 14 is loaded with the value that corresponds to the first entry in the vector table that is to be updated/loaded.
- the repeated instruction loop preferably comprises two instructions that are repeated n times.
- the value n preferably is the value stored in register R 1 .
- the first instruction in the loop preferably performs a load from the start address of the block (R 0 ) to the first entry in the vector table 162 .
- the second instruction in the loop preferably adds an “immediate” value to the block start address.
- the immediate value may be “2” if each entry in the vector table is 16 bits wide.
- the loop repeats itself to load the desired portions of the total depending on the starting address.
- the decode logic 152 uses a Bytecode from instructions 170 as an index into micro-sequence vector table 162 . Once the decode logic 152 locates the indexed entry 164 , the decode logic 152 examines the associated bit 168 to determine whether the Bytecode is to be replaced by a micro-sequence. If the bit 168 indicates that the Bytecode can be directly processed and executed by the JSM, then the instruction is so executed.
- the decode logic 152 preferably changes this instruction into a “no operation” (NOP) and sets the micro-sequence-active bit (described above) in the status register R 15 .
- NOP no operation
- the JSM's pipe may be stalled to fetch and replace this micro-sequenced instruction by the first instruction of the micro-sequence. Changing the micro-sequenced Bytecode into a NOP while fetching the first instruction of the micro-sequence permits the JSM to process multi-cycle instructions that are further advanced in the pipe without additional latency.
- the micro-sequence-active bit may be set at any suitable time such as when the micro-sequence enters the JSM execution stage (not specifically shown).
- the JSM 102 implements two program counters—the PC and the ⁇ PC.
- the PC and the ⁇ PC are stored in auxiliary registers 151 , which in turn is stored in the decode logic 152 .
- one of these two program counters is the active program counter used to fetch and decode instructions.
- the PC 186 may be the currently active program counter when the decode logic 152 encounters a Bytecode to be replaced by a micro-sequence. Setting the status register's micro-sequence-active bit causes the micro-program counter 188 to become the active program counter instead of the program counter 186 .
- the contents of the field 166 associated with the micro-sequenced Bytecode preferably are loaded into the ⁇ PC 188 .
- the JSM 102 is ready to begin fetching and decoding the instructions comprising the micro-sequence.
- the PC 186 preferably is incremented by a suitable value to point the PC 186 to the next instruction following the Bytecode that is replaced by the micro-sequence.
- the micro-sequence-active bit within the status register R 15 may only be changed when the first instruction of the micro-sequence enters the execute phase of JSM 102 pipe.
- the switch from PC 186 to the ⁇ PC 188 preferably is effective immediately after the micro-sequenced instruction is decoded, thereby reducing the latency.
- the micro-sequence may end with a predetermined value or Bytecode from the C-ISA called “RtuS” (return from micro-sequence) that indicates the end of the sequence.
- This C-ISA instruction causes a switch from the ⁇ PC 188 to the PC 186 upon completion of the micro-sequence.
- the PC 186 previously was incremented, as discussed above, so that the value of the PC 186 points to the next instruction to be decoded.
- the instruction may have a delayed effect or an immediate effect depending on the embodiment that is implemented. In embodiments with an immediate effect, the switch from the ⁇ PC 188 to the PC 186 is performed immediately after the instruction is decoded and the instruction after the RtuS instruction is the instruction pointed to by the address present in the PC 186 .
- one or more Bytecodes may be replaced with a micro-sequence or a group of other instructions.
- Such replacement instructions may comprise any suitable instructions for the particular application and situation at hand. At least some such suitable instructions are disclosed in U.S. Ser. No. 10/631,308 (Publication No. 20040024989), filed Jul. 31, 2003 and incorporated herein by reference.
- Replacement micro-sequence instructions also may be used to bookmark switch points when switching code execution threads.
- the line marked “T 1 ” denotes a first thread T 1 that is processed by the JSM 102 .
- the thread T 1 comprises a plurality of Bytecode instructions, a plurality of micro-sequence instructions, or some combination thereof.
- the instructions that are executed in thread T 1 are retrieved from the instruction storage 130 . More specifically, Bytecodes are retrieved from the Bytecode storage 170 and micro-sequence instructions are retrieved from micro-sequence storage 180 .
- the decode logic 152 may encounter a sequence of JSM instructions that causes the processing of thread T 1 to be paused and the processing of a separate thread T 2 to be initialized. This sequence is executed in thread T 1 at or immediately prior to switch point 502 . Execution of this sequence causes processing of thread T 1 to stop, and processing of a separate thread T 2 (denoted by line “T 2 ”) to begin in order to perform some separate task in thread T 2 .
- thread T 1 may comprise a sequence of instructions that calls an operating system (OS) call (e.g., threadyield ( )), which OS call selects one of a plurality of threads to execute based on thread priorities as dictated by the OS.
- OS operating system
- a thread switch also may be directly initialized by the OS. Specifically, if the OS is running on the MPU 104 , the OS may use a sequence of MPU commands to initialize the thread switch.
- information pertaining to the switch point 502 is stored by being pushed onto a T 1 stack 123 (preferably a memory-based stack designated specifically for thread T 1 and stored in storage 122 , FIG. 2 ) of the JSM 102 .
- the context information may be pushed onto the micro-stack 146 .
- the context information is a minimal amount of information, as described below.
- Context information that is collected preferably comprises the values of the PC 186 , ⁇ PC 188 and status register (register R 15 ) as they are at the switch point 502 .
- the decode logic 152 encounters a sequence of switch instructions while processing thread T 1 , the sequence causes the execution of thread T 1 to be halted at switch point 502 , the context of switch point 502 to be saved, and the execution of thread T 2 to be initialized.
- commands sent from the MPU 104 may perform a function similar to that of a sequence of switch instructions.
- the switching processes are similar. As described above, the execution of thread T 1 is first halted. Once the JSM 102 has stopped processing thread T 1 , the JSM 102 is made to store the context of the switch point 502 .
- the context of the switch point 502 preferably comprises the minimum amount of information necessary for the JSM 102 to resume processing thread T 1 at switch point 502 after the JSM 102 has finished processing thread T 2 .
- the JSM 102 stores the context of the switch point 502 by retrieving the PC 186 and the ⁇ PC 188 from the auxiliary registers 151 and pushing them onto the T 1 stack 123 .
- the JSM 102 also retrieves the value of the status register R 15 and pushes that value onto the T 1 stack 123 as well.
- the JSM 102 pushes a fourth value onto the T 1 stack 123 , where the fourth value is variable.
- the fourth value may be one of the registers 140 .
- the scope of disclosure is not limited to pushing the PC 186 , ⁇ PC 188 , status register and variable register onto the stack in any particular order, nor is the scope of disclosure limited to pushing these particular values onto the stack.
- any suitable number of values e.g., a minimum amount of information
- the switch instructions in the thread T 1 may be 32-bit instructions that, when executed, call a subroutine or some other portion of code comprising instructions that store the context of the switch point 502 by pushing context values (e.g., PC, ⁇ PC, status register) onto the T 1 stack 123 .
- FIG. 6 shows an illustrative embodiment of such 32-bit instructions. Specifically, FIG. 6 shows a 32-bit instruction 599 that comprises information that describes the class of the 32-bit instruction 599 and further specifies the type of the instruction 599 . For example, as shown in the figure, bits 31:28 describe the class of the instruction and bits 27:24 and bits 3:0 describe the particular type of instruction being used.
- Bits 27:24 and bits 3:0 may specify, for example, that the instruction is a minimum-context push instruction which, when executed, causes various context values to be pushed onto the stack, as described above.
- Bits 23:2 are not of significance and preferably do not contain arguments or other relevant data. Instead, bits 23:2 may contain placeholder values (e.g., “0” bits). The scope of disclosure is not limited to the use of instructions as shown in FIG. 6 .
- Context values also may be pushed onto the T 1 stack 123 by commands received from the MPU 104 .
- the JSM 102 may further clean and invalidate the micro-stack 146 in order to preserve the entries of the micro-stack 146 and to clear the micro-stack 146 for use by thread T 2 .
- the entries of the micro-stack 146 may be copied and/or transferred to the data cache 124 .
- the JSM 102 may invalidate the current entries of the micro-stack 146 , so that after a thread switch, the entries loaded into the micro-stack 146 replace the invalidated entries.
- the JSM 102 stores the stack pointer (i.e., register R 6 ).
- the stack pointer may be defined as the address of the topmost entry on T 1 stack 123 and may be stored in any suitable memory (e.g., storage 122 ).
- thread T 2 comprises a plurality of instructions (e.g., Bytecodes, micro-sequences or a combination thereof). Like thread T 1 , thread T 2 may be executed multiple times. However, each time processing switches from thread T 1 to thread T 2 , as the context of thread T 1 is stored from the JSM 102 onto a stack, so should the context of thread T 2 be loaded from a stack onto the JSM 102 .
- the context of thread T 2 may be found on top of the T 2 stack 125 .
- the T 2 stack 125 preferably is a memory-based stack, specifically designated for thread T 2 and stored in the storage 122 .
- the thread T 2 context may have been pushed onto the T 2 stack 125 at the end of a previous iteration in a substantially similar fashion to the context-saving process described above in relation to thread T 1 , or, alternatively, the thread T 2 context may have been pushed onto the T 2 stack 125 during the creation of the thread T 2 .
- the JSM 102 loads the stack pointer for T 2 stack 125 from the storage 122 to register R 6 .
- the RAM base address is loaded from the T 2 stack 125 , thus loading the local variables for thread T 2 .
- the JSM 102 also loads the context of thread T 2 from the T 2 stack 125 onto the auxiliary registers 151 and/or the registers 140 .
- the JSM 102 uses specific instructions to pop context values off of the T 2 stack 125 , where at least some of the specific instructions are indivisible. For example, a MCTXPOP instruction may be used to pop minimum context values off of the T 2 stack 125 .
- This MCTXPOP instruction in at least some embodiments, is indivisible, mandatory for performing a context switch, and should not be preempted. In this way, the JSM 102 is initialized to the context of the previous iteration of thread T 2 . Thus, the JSM 102 effectively is able to resume processing where it “left off.” The JSM 102 decodes and executes thread T 2 in a similar fashion to thread T 1 .
- the JSM 102 may resume processing thread T 1 at switch point 502 .
- the JSM 102 loads the context information of thread T 1 from the T 1 stack 123 .
- the JSM 102 loads the stack pointer of thread T 1 from the storage 122 and into register R 6 .
- the JSM 102 then pops the RAM base address off of the T 1 stack 123 and uses the RAM base address to load the local variables for thread T 1 .
- the JSM 102 also pops the status value, ⁇ PC 188 and the PC 186 off of the T 1 stack 123 .
- the JSM 102 stores the status value to the register R 15 and stores the ⁇ PC 188 and the PC 186 to the auxiliary registers 151 . In this way, the context information that is stored on top of the T 1 stack 123 is popped off the stack and is used by the JSM 102 to return to the context of switch point 502 .
- the JSM 102 may now resume processing thread T 1 at switch point 502 .
- the thread switch from thread T 2 to thread T 1 may be controlled by a sequence of code being executed in thread T 2 or, alternatively, by commands sent from the MPU 104 .
- the thread switching technique described above may be applied to any suitable pair of threads in the system 100 .
- the process 600 further comprises cleaning and invalidating the RAM (block 610 ), pushing the RAM base address onto the T 1 stack (block 612 ), cleaning and invalidating the micro-stack (block 614 ), and storing the T 1 stack pointer to any suitable memory (block 616 ).
- the context of thread T 1 has now been saved.
- the process 600 comprises loading the T 2 stack pointer from memory (block 618 ), popping the RAM base address from the T 2 stack (block 620 ), popping the full or minimum context from the T 2 stack (block 622 ), and subsequently beginning processing of the thread T 2 (block 624 ).
- a minimum context i.e., PC, ⁇ PC, status register
- a full-context i.e., all registers in the JSM core
- full contexts also may be stored and/or loaded, in which case most or all of the registers 140 as well as most or all of the auxiliary registers 151 are stored and/or loaded with each thread switch.
- the 32-bit instructions described above and shown in FIG. 6 may comprise data (e.g., in bits 31:24 and 3:0) that causes a full-context store to be performed.
- a 32-bit instruction may comprise data that causes a full-context load to be performed.
- a full-context store and/or load may be initialized by a command from the MPU 104 instead of by code being executed in thread T 1 .
- a full-context store and/or load is performed in a similar manner to a minimum-context store and/or load, with the exception being a difference in the number of registers stored and/or loaded.
- the JSM 102 upon receiving the command and the associated parameter, stores the parameter in a suitable storage unit, such as a register 140 , an auxiliary register 151 or on any one of the stacks in the JSM 102 .
- the JSM 102 uses the parameter (i.e., the micro-sequence address) to locate the micro-sequence in the micro-sequence storage 180 .
- the JSM 102 retrieves the micro-sequence and executes the micro-sequence, thus obeying the command sent from the MPU 104 .
- the micro-sequence preferably is pre-programmed into the micro-sequence storage 180 .
- the JSM 102 pops the context information off of the stack and stores the context information to the appropriate registers (e.g., registers 140 and/or auxiliary registers 151 ) in the JSM 102 .
- the JSM 102 then may resume executing in thread T 1 .
- the MPU 104 writes the data source address, data size, and data destination address to a register 140 , an auxiliary register 151 , a T 1 stack 123 , a T 2 stack 125 , or a micro-stack 146 .
- the MPU 104 then may send the command and the DMA micro-sequence address to the JSM 102 .
- the information pertaining to the data to be transferred may be pre-programmed into the JSM 102 , and the MPU 104 may simply transfer the command and the DMA micro-sequence to the JSM 102 .
- the memory location of the information pertaining to the data may be provided to the DMA micro-sequence so that the DMA micro-sequence may locate the information.
- the information pertaining to the data may be written by the MPU 104 to memory locations indicated by the micro-sequence on the JSM 102 .
- the JSM 102 then may first retrieve the source address, data size and destination address from these memory locations, since the micro-sequence comprises the addresses of these locations.
- the number of iterations X corresponds to one of the parameters (i.e., data size) provided by the MPU 104 .
- the source address “AR 1 +AR 3 ++V 2 ” comprises three parts. The first part of the source address, AR 1 , specifies a base address in memory. The second part of the source address, AR 3 , specifies an index by which the base address AR 1 should be increased. The sum of AR 1 +AR 3 is an address that specifies the precise location in memory from which to load data.
- micro-stack 146 which micro-stack 146 preferably is a first-in, last-out (FILO) stack. Loading the data and pushing the data onto the micro-stack 146 preferably takes about 1 clock cycle. Also, each time the MEMCOPY instruction is executed, data previously pushed on the micro-stack 146 is popped off of the micro-stack 146 and is stored to the destination address AR 0 ++V 1 .
- FILO first-in, last-out
- Popping the data off of the micro-stack 146 and storing the data to the destination address preferably takes about 1 clock cycle.
- the micro-stack 146 is used because, when loading and storing data during direct memory accesses, there may be delays associated with the JSM 102 pipeline.
- the micro-stack 146 synchronizes the data loading and storing so that no data discrepancies or errors result from the delay associated with the JSM 102 pipeline.
- the loading and storing of data may be pipelined as shown in FIG. 8 .
- a first datum is loaded from a source address and is pushed onto the micro-stack 146 (indicated by “ 802 ”).
- a post-increment is performed as previously described.
- the post-increment is performed in clock cycle 2 so that, when a second datum is loaded from a source address and is pushed onto the micro-stack 146 (indicated by “ 808 ”), the source address is not the same address as the address used to load the datum in clock cycle 1 (indicated by “ 802 ”), but instead is the next available source address.
- the first datum is stored to a destination address (indicated by “ 804 ”), a post-increment (indicated by “ 812 ”) is performed, and a third datum is loaded from a corresponding source address and is pushed onto the micro-stack 146 (as indicated by “ 810 ”).
- the process 900 begins with the MPU 104 sending a command, a DMA micro-sequence address, and information pertaining to the necessary data transfer to the JSM 102 (block 902 ). As previously described, this information comprises the data source address, the data size that is used to determine the number of iterations, and the data destination address.
- the JSM 102 receives the command and other information from the MPU 104 , pauses the currently executing thread T 1 at a switch point, and saves the context of the switch point, as described above (block 904 ). Once the context has been saved, the JSM 102 follows the command to retrieve and execute the DMA micro-sequence in a new thread T 2 (block 906 ).
- the execution of the DMA micro-sequence causes the JSM 102 to repeat the MEMCOPY instruction a predetermined number of times (block 908 ). Each iteration of the MEMCOPY instruction causes the JSM 102 to load a new datum from a corresponding source address. Once the datum has been loaded, the JSM 102 pushes the datum onto the FILO micro-stack 146 . The JSM 102 then pops a previously-pushed datum off of the FILO micro-stack 146 and stores the datum to the corresponding destination address (block 910 ). Once the MEMCOPY instruction has been executed the predetermined number of times, the data transfer is complete. The JSM 102 may restore the context and resume executing thread T 1 at the switch point (block 912 ).
Abstract
An electronic device comprising a first processor adapted to process software instructions from a memory, and a second processor coupled to the first processor. The second processor is adapted to interrupt the first processor and to use the first processor as a direct memory access (DMA) controller. The second processor uses the first processor as a DMA controller by sending to the first processor a plurality of addresses, wherein the first processor uses a first address of the plurality of addresses to retrieve a group of instructions which, when executed, causes the first processor to load a datum directly from a memory location and to transfer the datum to a different memory location.
Description
- This application claims priority to European Patent Application No. 04291918.3, filed on Jul. 27, 2004 and incorporated herein by reference. This application is related to co-pending and commonly assigned applications Ser. No. ______ (Attorney Docket No. TI-38583 (1962-22400)), entitled, “Delegating Tasks Between Multiple Processor Cores,” and Ser. No. ______ (Attorney Docket No. TI-38584 (1962-22500), entitled, “Interrupt Management In Dual Core Processors,” which are incorporated by reference herein.
- Direct Memory Access (DMA) is used in a variety of embedded systems. In systems without DMA, a central processing unit (CPU) generally must be used to access memory. However, in systems with DMA, memory may be directly accessed without using the CPU (i.e., the CPU is bypassed). Because the CPU is not interrupted from whatever task it is performing, system efficiency is enhanced. However, a system supporting DMA capability must contain a DMA controller to direct DMA activities in the system. DMA controllers occupy an undesirably large amount of circuit space and consume an undesirably large amount of power.
- Disclosed herein is a technique by which one of a plurality of processor cores may be manipulated to perform the functions of a DMA controller. An illustrative embodiment comprises an electronic device comprising a first processor adapted to process software instructions from a memory, and a second processor coupled to the first processor. The second processor is adapted to interrupt the first processor and to use the first processor as a direct memory access (DMA) controller. The second processor uses the first processor as a DMA controller by sending to the first processor a plurality of addresses, wherein the first processor uses a first address of the plurality of addresses to retrieve a group of instructions which, when executed, causes the first processor to load a datum directly from a memory location and to transfer the datum to a different memory location.
- Another illustrative embodiment comprises a processor that decodes and executes software instructions from memory, comprising decode logic adapted to receive from another processor a plurality of addresses, and fetch logic coupled to the decode logic and adapted to fetch a group of instructions from storage using a first address from the plurality of addresses. When processed by the decode logic, the group of instructions causes the processor to be used as a direct memory access (DMA) controller by causing the processor to load a datum directly from a memory location and to transfer the datum to a different memory location.
- Yet another illustrative embodiment comprises a method that comprises sending a first address from a first processor core to a second processor core, the second processor core adapted to decode and execute software instructions from memory. The method also comprises sending a command from the first processor core to the second processor core. The command interrupts the second processor core and causes the second processor core to fetch, from a location specified by the first address, a group of instructions. When executed, the group of instructions causes the second processor core to be used as a direct memory access (DMA) controller.
- Certain terms are used throughout the following description and claims to refer to particular system components. As one skilled in the art will appreciate, companies may refer to a component by different names. This document does not intend to distinguish between components that differ in name but not function. In the following discussion and in the claims, the terms “including” and “comprising” are used in an open-ended fashion, and thus should be interpreted to mean “including, but not limited to . . . ”. Also, the term “couple” or “couples” is intended to mean either an indirect or direct connection. Thus, if a first device couples to a second device, that connection may be through a direct connection, or through an indirect connection via other devices and connections.
- For a more detailed description of the preferred embodiments of the present invention, reference will now be made to the accompanying drawings, wherein:
-
FIG. 1 shows a diagram of a system in accordance with preferred embodiments of the invention and including a Java Stack Machine (“JSM”) and a Main Processor Unit (“MPU”), in accordance with embodiments of the invention; -
FIG. 2 shows a block diagram of the JSM ofFIG. 1 in accordance with preferred embodiments of the invention; -
FIG. 3 shows various registers used in the JSM ofFIGS. 1 and 2 , in accordance with embodiments of the invention; -
FIG. 4 shows the preferred operation of the JSM to include “micro-sequences,” in accordance with embodiments of the invention; -
FIG. 5 shows an illustrative switching process between two execution threads, in accordance with a preferred embodiment of the invention; -
FIG. 6 shows an illustrative 32-bit instruction that may be incorporated into a micro-sequence, in accordance with a preferred embodiment of the invention; -
FIG. 7 shows a flow diagram of the switching process ofFIG. 5 , in accordance with embodiments of the invention; -
FIG. 8 shows a timing diagram describing the transfer of data during each of a plurality of clock cycles, in accordance with embodiments of the invention; -
FIG. 9 shows a flow diagram describing how memory is directly accessed and stored by the JSM ofFIG. 2 , in accordance with preferred embodiments of the invention; and -
FIG. 10 shows the system described herein, in accordance with preferred embodiments of the invention. - The following discussion is directed to various embodiments of the invention. Although one or more of these embodiments may be preferred, the embodiments disclosed should not be interpreted, or otherwise used, as limiting the scope of the disclosure, including the claims, unless otherwise specified. In addition, one skilled in the art will understand that the following description has broad application, and the discussion of any embodiment is meant only to be exemplary of that embodiment, and not intended to intimate that the scope of the disclosure, including the claims, is limited to that embodiment.
- Described herein is a technique by which one of a plurality of processor cores may be manipulated to perform the functions of a DMA controller. A host processor simply sends a command and an address to a secondary processor, along with information pertaining to the data that is to be moved. The command causes the secondary processor to use the address to locate and retrieve a group of instructions that has been pre-programmed into the secondary processor. Executing this group of instructions causes the secondary processor to use the information pertaining to the data to load, move and store the data via direct memory access. However, before the secondary processor executes the group of instructions, it must first stop what it is doing in a currently executing thread and must further “bookmark” its place in the currently executing thread. By bookmarking its place in the currently executing thread, the secondary processor can execute the group of instructions and then resume executing in the thread at the bookmarked location. Accordingly, a technique for bookmarking a spot in a thread and a technique by which the secondary processor is made to act as a DMA controller are now discussed in turn.
- In the context of software code, a “thread” may be defined as a single stream of code execution. While executing a software program, a processor may switch from a first thread to a second thread in order to complete a particular task. For example, the first thread may comprise some stimulus (i.e., instruction) that, when executed by the processor, causes the processor to halt execution of the first thread and to begin execution of the second thread. The second thread may comprise the performance of some task by a different portion of the software program.
- The point in the first thread at which the switch is made may be termed the “switch point.” When switching from the first thread to the second thread, the processor first “bookmarks” the switch point, so that when the processor has finished executing the second thread of code, it can resume execution in the first thread at the switch point.
- In order to bookmark the switch point, the processor stores all information that pertains to the switch point (known as the “context” of the switch point). Such information includes all registers, the program counter, pointer to the stack, etc. The processor copies such information to memory and retrieves the information later to resume execution in the first thread at the switch point. Bookmarking the switch point is time-consuming and consumes power which may be in limited supply in, for example, a battery-operated device such as a mobile phone.
- Processors that store to memory all information pertaining to the switch point unnecessarily spend time and power doing so. Whereas the aforementioned processors store all registers, the program counter, stack pointer, etc., the subject matter described herein is achieved at least in part by the realization that in many cases, fewer than all such information need be stored. For example, only three values are saved to sufficiently bookmark the switch point: the program counter (PC), a second program counter called the micro-program counter (μPC), discussed below, and a status register. Once the processor has finished executing the second thread, these three values provide sufficient information for the processor to find the switch point in the first thread and resume execution at that switch point.
- Accordingly, described herein is a programmable electronic device, such as a processor, that is able to bookmark a switch point using a minimal amount of information pertaining to the switch point. A “minimal” amount of information generally comprises information in one or more registers, but not all registers, of a processor core. For example, in some embodiments, a “minimal” amount of information comprises a PC register, a μPC register and a status register. In other embodiments, a “minimal” amount of information comprises the PC register, the μPC register and the status register, as well as one or more additional registers, but less than all registers. In still other embodiments, a “minimal” amount of information comprises less than all registers. In yet other embodiments, a “minimal” amount of information consists of only the information (i.e., registers) necessary to bookmark a switch point, where the amount of information (i.e., number of registers) varies depending on the processor used and/or the software application being processed. In such cases, the “minimal” amount of information may simply be one register or may be all of the registers in the processor core. Instead of storing all switch point information to memory, the processor described herein pushes a minimal amount of switch point information onto a processor stack. Later, when the processor needs the switch point information, it pops the information off of the stack and uses the information to resume execution at the switch point. In this way, the time and power demands placed on the processor are reduced or even minimized, resulting in increased performance.
- Some situations, however, require more than a minimal amount of information to be stored. For example, in these situations, a minimum amount of information may not be sufficient to properly bookmark a switch point. Accordingly, the disclosed processor is capable of bookmarking a switch point using a minimal amount of information (“minimal context store”) needed to resume execution at the switch point. The processor also is capable of bookmarking a switch point using more than a minimal amount of information (“full context store”), as described further below.
- The processor described herein is particularly suited for executing Java™ Bytecodes or comparable code. As is well known, Java is particularly suited for embedded applications. Java is a stack-based language, meaning that a processor stack is heavily used when executing various instructions (e.g., Bytecodes), which instructions generally have a size of 8 bits. Java is a relatively “dense” language meaning that on average each instruction may perform a large number of functions compared to various other instructions. The dense nature of Java is of particular benefit for portable, battery-operated devices that preferably include as little memory as possible to save space and power. The reason, however, for executing Java code is not material to this disclosure or the claims which follow. Further, the processor advantageously includes one or more features that permit the execution of the Java code to be accelerated.
- Referring now to
FIG. 1 , asystem 100 is shown in accordance with a preferred embodiment of the invention. As shown, the system includes at least twoprocessors Processor 102 is referred to for purposes of this disclosure as a Java Stack Machine (“JSM”) andprocessor 104 may be referred to as a Main Processor Unit (“MPU”).System 100 may also includememory 106 coupled to both theJSM 102 andMPU 104 and thus accessible by both processors. At least a portion of thememory 106 may be shared by both processors meaning that both processors may access the same shared memory locations. Further, if desired, a portion of thememory 106 may be designated as private to one processor or the other.System 100 also includes a Java Virtual Machine (“JVM”) 108,compiler 110, and adisplay 114. TheMPU 104 preferably includes an interface to one or more input/output (“I/O”) devices such as a keypad to permit a user to control various aspects of thesystem 100. In addition, data streams may be received from the I/O space into theJSM 102 to be processed by theJSM 102. Other components (not specifically shown) may be included as desired for various applications. - As is generally well known, Java code comprises a plurality of “Bytecodes” 112.
Bytecodes 112 may be provided to theJVM 108, compiled bycompiler 110 and provided to theJSM 102 and/orMPU 104 for execution therein. In accordance with a preferred embodiment of the invention, theJSM 102 may execute at least some, and generally most, of the Java Bytecodes. When appropriate, however, theJSM 102 may request theMPU 104 to execute one or more Java Bytecodes not executed or executable by theJSM 102. In addition to executing Java Bytecodes, theMPU 104 also may execute non-Java instructions. TheMPU 104 also hosts an operating system (“O/S”) (not specifically shown) which performs various functions including system memory management, the system task management that schedules theJVM 108 and most or all other native tasks running on the system, management of thedisplay 114, receiving input from input devices, etc. Without limitation, Java code may be used to perform any one of a variety of applications including multimedia, games or web based applications in thesystem 100, while non-Java code, which may comprise the O/S and other native applications, may still run on the system on theMPU 104. - The
JVM 108 generally comprises a combination of software and hardware. The software may include thecompiler 110 and the hardware may include theJSM 102. The JVM may include a class loader, Bytecode verifier, garbage collector, and a Bytecode interpreter loop to interpret the Bytecodes that are not executed on theJSM processor 102. - In accordance with preferred embodiments of the invention, the
JSM 102 may execute at least two types of instruction sets. One type of instruction set may comprise standard Java Bytecodes. As is well-known, Java is a stack-based programming language in which instructions generally target a stack. For example, an integer add (“IADD”) Java instruction pops two integers off the top of the stack, adds them together, and pushes the sum back on the stack. A “simple” Bytecode instruction is generally one in which theJSM 102 may perform an immediate operation either in a single cycle (e.g., an “iadd” instruction) or in several cycles (e.g., “dup2_x2”). A “complex” Bytecode instruction is one in which several memory accesses may be required to be made within the JVM data structure for various verifications (e.g., NULL pointer, array boundaries). As will be described in further detail below, one or more of the complex Bytecodes may be replaced by a “micro-sequence” comprising various other instructions. - Another type of instruction set executed by the
JSM 102 may include instructions other than standard Java instructions. In accordance with at least some embodiments of the invention, the other instruction set may include register-based and memory-based operations to be performed. This other type of instruction set generally complements the Java instruction set and, accordingly, may be referred to as a complementary instruction set architecture (“C-ISA”). By complementary, it is meant that a complex Java Bytecode may be replaced by a “micro-sequence” comprising C-ISA instructions. The execution of Java may be made more efficient and run faster by replacing some sequences of Bytecodes by preferably shorter and more efficient sequences of C-ISA instructions. The two sets of instructions may be used in a complementary fashion to obtain satisfactory code density and efficiency. As such, theJSM 102 generally comprises a stack-based architecture for efficient and accelerated execution of Java Bytecodes combined with a register-based architecture for executing register and memory based C-ISA instructions. Both architectures preferably are tightly combined and integrated through the C-ISA. Because various of the data structures described herein are generally JVM-dependent and thus may change from one JVM implementation to another, the software flexibility of the micro-sequence provides a mechanism for various JVM optimizations now known or later developed. -
FIG. 2 shows an exemplary block diagram of theJSM 102. As shown, the JSM includes acore 120 coupled todata storage 122 andinstruction storage 130. The core may include one or more components as shown. Such components preferably include a plurality ofregisters 140, three address generation units (“AGUs”) 142, 147, micro-translation lookaside buffers (micro-TLBs) 144, 156, amulti-entry micro-stack 146, an arithmetic logic unit (“ALU”) 148, amultiplier 150, decodelogic 152, and instruction fetchlogic 154. In general, operands may be retrieved fromdata storage 122 or from the micro-stack 146 and processed by theALU 148, while instructions may be fetched frominstruction storage 130 by fetchlogic 154 and decoded bydecode logic 152. Theaddress generation unit 142 may be used to calculate addresses based, at least in part, on data contained in theregisters 140. TheAGUs 142 may calculate addresses for C-ISA instructions. TheAGUs 142 may support parallel data accesses for C-ISA instructions that perform array or other types of processing. TheAGU 147 couples to the micro-stack 146 and may manage overflow and underflow conditions in the micro-stack preferably in parallel. The micro-TLBs 144, 156 generally perform the function of a cache for the address translation and memory protection information bits that are preferably under the control of the operating system running on theMPU 104. Thedecode logic 152 comprisesauxiliary registers 151. - Referring now to
FIG. 3 , theregisters 140 may include 16 registers designated as R0-R15. In some embodiments, registers R0-R5 and R8-R14 may be used as general purposes (“GP”) registers usable for any purpose by the programmer. Other registers, and some of the GP registers, may be used for specific functions. For example, in addition to use as a GP register, register R5 may be used to store the base address of a portion of memory in which Java local variables may be stored when used by the current Java method. The top of the micro-stack 146 can be referenced by the values in registers R6 and R7. The top of the micro-stack 146 has a matching address in external memory pointed to by register R6. The values contained in the micro-stack 146 are the latest updated values, while their corresponding values in external memory may or may not be up to date. Register R7 provides the data value stored at the top of the micro-stack 146. Register R15 may be used for status and control of theJSM 102. At least one bit (called the “Micro-Sequence-Active” bit) in status register R15 is used to indicate whether theJSM 102 is executing a simple instruction or a complex instruction through a micro-sequence. This bit controls, in particular, which program counter is used (PC or μPC) to fetch the next instruction, as will be explained below. - Referring again to
FIG. 2 , as noted above, theJSM 102 is adapted to process and execute instructions from at least two instruction sets, at least one having instructions from a stack-based instruction set (e.g., Java). The stack-based instruction set may include Java Bytecodes. Unless empty, Java Bytecodes may pop data from and push data onto the micro-stack 146. The micro-stack 146 preferably comprises the top n entries of a larger stack that is implemented indata storage 122. Although the value of n may vary in different embodiments, in accordance with at least some embodiments, the size n of the micro-stack may be the top eight entries in the larger, memory-based stack. The micro-stack 146 preferably comprises a plurality of gates in thecore 120 of theJSM 102. By implementing the micro-stack 146 in gates (e.g., registers) in thecore 120 of theprocessor 102, access to the data contained in the micro-stack 146 is generally very fast, although any particular access speed is not a limitation on this disclosure. - The
ALU 148 adds, subtracts, and shifts data. Themultiplier 150 may be used to multiply two values together in one or more cycles. The instruction fetchlogic 154 generally fetches instructions frominstruction storage 130. The instructions may be decoded bydecode logic 152. Because theJSM 102 is adapted to process instructions from at least two instruction sets, thedecode logic 152 generally comprises at least two modes of operation, one mode for each instruction set. As such, thedecode logic unit 152 may include a Java mode in which Java instructions may be decoded and a C-ISA mode in which C-ISA instructions may be decoded. - The
data storage 122 generally comprises data cache (“D-cache”) 124 and data random access memory (“DRAM”) 126. Reference may be made to U.S. Pat. No. 6,826,652, filed Jun. 9, 2000 and U.S. Pat. No. 6,792,508, filed Jun. 9, 2000, both incorporated herein by reference. Reference also may be made to U.S. Ser. No. 09/932,794 (Publication No. 20020069332), filed Aug. 17, 2001 and incorporated herein by reference. The stack (excluding the micro-stack 146), arrays and non-critical data may be stored in the D-cache 124, while Java local variables, critical data and non-Java variables (e.g., C, C++) may be stored in D-RAM 126. Theinstruction storage 130 may comprise instruction RAM (“I-RAM”) 132 and instruction cache (“I-cache”) 134. The I-RAM 132 may be used for “complex” micro-sequenced Bytecodes or micro-sequences, as described below. The I-cache 134 may be used to store other types of Java Bytecode and mixed Java/C-ISA instructions. - As noted above, the C-ISA instructions generally complement the standard Java Bytecodes. For example, the
compiler 110 may scan a series ofJava Bytecodes 112 and replace a complex Bytecode with a micro-sequence as explained previously. The micro-sequence may be created to optimize the function(s) performed by the replaced complex Bytecodes. -
FIG. 4 illustrates the operation of theJSM 102 to replace Java Bytecodes with micro-sequences.FIG. 4 shows some, but not necessarily all, components of the JSM. In particular, theinstruction storage 130, thedecode logic 152, and a micro-sequence vector table 162 are shown. Thedecode logic 152 receives instructions from theinstruction storage 130 and accesses the micro-sequence vector table 162. In general and as described above, thedecode logic 152 receives instructions (e.g., instructions 170) frominstruction storage 130 via instruction fetch logic 154 (FIG. 2 ) and decodes the instructions to determine the type of instruction for subsequent processing and execution. In accordance with the preferred embodiments, theJSM 102 either executes the Bytecode frominstructions 170 or replaces a Bytecode frominstructions 170 with a micro-sequence as described below. - The micro-sequence vector table 162 may be implemented in the
decode logic 152 or as separate logic in theJSM 102. The micro-sequence vector table 162 preferably includes a plurality ofentries 164. Theentries 164 may include one entry for each Bytecode that the JSM may receive. For example, if there are a total of 256 Bytecodes, the micro-sequence vector table 162 preferably comprises at least 256 entries. Eachentry 164 preferably includes at least two fields—afield 166 and an associatedfield 168.Field 168 may comprise a single bit that indicates whether theinstruction 170 is to be directly executed or whether the associatedfield 166 contains a reference to a micro-sequence. For example, abit 168 having a value of “0” (“not set”) may indicate thefield 166 is invalid and thus, the corresponding Bytecode frominstructions 170 is directly executable by the JSM.Bit 168 having a value of “1” (“set”) may indicate that the associatedfield 166 contains a reference to a micro-sequence. - If the
bit 168 indicates the associatedfield 166 includes a reference to a micro-sequence, the reference may comprise the full starting address ininstruction storage 130 of the micro-sequence or a part of the starting address that can be concatenated with a base address that may be programmable in the JSM. In the former case,field 166 may provide as many address bits as are required to access the full memory space. In the latter case, a register within the JSM registers 140 is programmed to hold the base address and the vector table 162 may supply only the offset to access the start of the micro-sequence. Most or all JSMinternal registers 140 and any other registers preferably are accessible by themain processor unit 104 and, therefore, may be modified by the JVM as necessary. Although not required, this latter addressing technique may be preferred to reduce the number of bits needed withinfield 166. At least aportion 180 of theinstruction 130 may be allocated for storage of micro-sequences and thus the starting address may point to a location inmicro-sequence storage 130 at which a particular micro-sequence can be found. Theportion 180 may be implemented in I-RAM 132 shown above inFIG. 2 . - Although the micro-sequence vector table 162 may be loaded and modified in accordance with a variety of techniques, the following discussion includes a preferred technique. The vector table 162 preferably comprises a JSM resource that is addressable via a
register 140. Asingle entry 164 or a block of entries within the vector table 162 may be loaded by information from the data cache 124 (FIG. 2 ). When loading multiple entries (e.g., all of the entries 164) in the table 162, a repeat loop of instructions may be executed. Prior to executing the repeat loop, a register (e.g., R0) preferably is loaded with the starting address of the block of memory containing the data to load into the table. Another register (e.g., R1) preferably is loaded with the size of the block to load into the table. Register R14 is loaded with the value that corresponds to the first entry in the vector table that is to be updated/loaded. - The repeated instruction loop preferably comprises two instructions that are repeated n times. The value n preferably is the value stored in register R1. The first instruction in the loop preferably performs a load from the start address of the block (R0) to the first entry in the vector table 162. The second instruction in the loop preferably adds an “immediate” value to the block start address. The immediate value may be “2” if each entry in the vector table is 16 bits wide. The loop repeats itself to load the desired portions of the total depending on the starting address.
- In operation, the
decode logic 152 uses a Bytecode frominstructions 170 as an index into micro-sequence vector table 162. Once thedecode logic 152 locates the indexedentry 164, thedecode logic 152 examines the associatedbit 168 to determine whether the Bytecode is to be replaced by a micro-sequence. If thebit 168 indicates that the Bytecode can be directly processed and executed by the JSM, then the instruction is so executed. If, however, thebit 168 indicates that the Bytecode is to be replaced by a micro-sequence, then thedecode logic 152 preferably changes this instruction into a “no operation” (NOP) and sets the micro-sequence-active bit (described above) in the status register R15. In another embodiment, the JSM's pipe may be stalled to fetch and replace this micro-sequenced instruction by the first instruction of the micro-sequence. Changing the micro-sequenced Bytecode into a NOP while fetching the first instruction of the micro-sequence permits the JSM to process multi-cycle instructions that are further advanced in the pipe without additional latency. The micro-sequence-active bit may be set at any suitable time such as when the micro-sequence enters the JSM execution stage (not specifically shown). - As described above, the
JSM 102 implements two program counters—the PC and the μPC. The PC and the μPC are stored inauxiliary registers 151, which in turn is stored in thedecode logic 152. In accordance with a preferred embodiment, one of these two program counters is the active program counter used to fetch and decode instructions. ThePC 186 may be the currently active program counter when thedecode logic 152 encounters a Bytecode to be replaced by a micro-sequence. Setting the status register's micro-sequence-active bit causes themicro-program counter 188 to become the active program counter instead of theprogram counter 186. Also, the contents of thefield 166 associated with the micro-sequenced Bytecode preferably are loaded into theμPC 188. At this point, theJSM 102 is ready to begin fetching and decoding the instructions comprising the micro-sequence. At or about the time the decode logic begins using theμPC 188, thePC 186 preferably is incremented by a suitable value to point thePC 186 to the next instruction following the Bytecode that is replaced by the micro-sequence. In at least some embodiments, the micro-sequence-active bit within the status register R15 may only be changed when the first instruction of the micro-sequence enters the execute phase ofJSM 102 pipe. The switch fromPC 186 to theμPC 188 preferably is effective immediately after the micro-sequenced instruction is decoded, thereby reducing the latency. - The micro-sequence may end with a predetermined value or Bytecode from the C-ISA called “RtuS” (return from micro-sequence) that indicates the end of the sequence. This C-ISA instruction causes a switch from the
μPC 188 to thePC 186 upon completion of the micro-sequence. Preferably, thePC 186 previously was incremented, as discussed above, so that the value of thePC 186 points to the next instruction to be decoded. The instruction may have a delayed effect or an immediate effect depending on the embodiment that is implemented. In embodiments with an immediate effect, the switch from theμPC 188 to thePC 186 is performed immediately after the instruction is decoded and the instruction after the RtuS instruction is the instruction pointed to by the address present in thePC 186. - As discussed above, one or more Bytecodes may be replaced with a micro-sequence or a group of other instructions. Such replacement instructions may comprise any suitable instructions for the particular application and situation at hand. At least some such suitable instructions are disclosed in U.S. Ser. No. 10/631,308 (Publication No. 20040024989), filed Jul. 31, 2003 and incorporated herein by reference.
- Replacement micro-sequence instructions also may be used to bookmark switch points when switching code execution threads. Referring to
FIG. 5 , the line marked “T1” denotes a first thread T1 that is processed by theJSM 102. The thread T1 comprises a plurality of Bytecode instructions, a plurality of micro-sequence instructions, or some combination thereof. As previously explained, the instructions that are executed in thread T1 are retrieved from theinstruction storage 130. More specifically, Bytecodes are retrieved from theBytecode storage 170 and micro-sequence instructions are retrieved frommicro-sequence storage 180. - While processing thread T1, the
decode logic 152 may encounter a sequence of JSM instructions that causes the processing of thread T1 to be paused and the processing of a separate thread T2 to be initialized. This sequence is executed in thread T1 at or immediately prior to switchpoint 502. Execution of this sequence causes processing of thread T1 to stop, and processing of a separate thread T2 (denoted by line “T2”) to begin in order to perform some separate task in thread T2. In some embodiments, instead of comprising a sequence of instructions (hereinafter referred to as “switch instructions”) that explicitly performs a thread switch, thread T1 may comprise a sequence of instructions that calls an operating system (OS) call (e.g., threadyield ( )), which OS call selects one of a plurality of threads to execute based on thread priorities as dictated by the OS. A thread switch also may be directly initialized by the OS. Specifically, if the OS is running on theMPU 104, the OS may use a sequence of MPU commands to initialize the thread switch. - Before the
JSM 102 switches from processing thread T1 to processing thread T2, however, information pertaining to the switch point 502 (i.e., “context” information) is stored by being pushed onto a T1 stack 123 (preferably a memory-based stack designated specifically for thread T1 and stored instorage 122,FIG. 2 ) of theJSM 102. In some embodiments, the context information may be pushed onto the micro-stack 146. Further, in preferred embodiments, the context information is a minimal amount of information, as described below. - Context information that is collected preferably comprises the values of the
PC 186,μPC 188 and status register (register R15) as they are at theswitch point 502. When thedecode logic 152 encounters a sequence of switch instructions while processing thread T1, the sequence causes the execution of thread T1 to be halted atswitch point 502, the context ofswitch point 502 to be saved, and the execution of thread T2 to be initialized. In some embodiments, commands sent from theMPU 104 may perform a function similar to that of a sequence of switch instructions. - Regardless of whether a switch from thread T1 to thread T2 is initialized by code in thread T1 or commands received from the
MPU 104, the switching processes are similar. As described above, the execution of thread T1 is first halted. Once theJSM 102 has stopped processing thread T1, theJSM 102 is made to store the context of theswitch point 502. The context of theswitch point 502 preferably comprises the minimum amount of information necessary for theJSM 102 to resume processing thread T1 atswitch point 502 after theJSM 102 has finished processing thread T2. TheJSM 102 stores the context of theswitch point 502 by retrieving thePC 186 and theμPC 188 from theauxiliary registers 151 and pushing them onto theT1 stack 123. TheJSM 102 also retrieves the value of the status register R15 and pushes that value onto theT1 stack 123 as well. These three values—thePC 186, theμPC 188 and the status register R15—together comprise the minimum amount of information needed for theJSM 102 to resume processing thread T1 atswitch point 502 after processing thread T2. - However, in some embodiments, it is preferable to also store a fourth value for efficiency purposes. Accordingly, the
JSM 102 pushes a fourth value onto theT1 stack 123, where the fourth value is variable. For example, the fourth value may be one of theregisters 140. The scope of disclosure is not limited to pushing thePC 186,μPC 188, status register and variable register onto the stack in any particular order, nor is the scope of disclosure limited to pushing these particular values onto the stack. As described above, any suitable number of values (e.g., a minimum amount of information) may be pushed onto the stack to store a context. - In some embodiments, the switch instructions in the thread T1 may be 32-bit instructions that, when executed, call a subroutine or some other portion of code comprising instructions that store the context of the
switch point 502 by pushing context values (e.g., PC, μPC, status register) onto theT1 stack 123.FIG. 6 shows an illustrative embodiment of such 32-bit instructions. Specifically,FIG. 6 shows a 32-bit instruction 599 that comprises information that describes the class of the 32-bit instruction 599 and further specifies the type of theinstruction 599. For example, as shown in the figure, bits 31:28 describe the class of the instruction and bits 27:24 and bits 3:0 describe the particular type of instruction being used. Bits 27:24 and bits 3:0 may specify, for example, that the instruction is a minimum-context push instruction which, when executed, causes various context values to be pushed onto the stack, as described above. Bits 23:2 are not of significance and preferably do not contain arguments or other relevant data. Instead, bits 23:2 may contain placeholder values (e.g., “0” bits). The scope of disclosure is not limited to the use of instructions as shown inFIG. 6 . Context values also may be pushed onto theT1 stack 123 by commands received from theMPU 104. - Each thread has its own RAM base address for storing local variables used by that thread. The micro-sequence may contain instructions that, when executed, cause the
JSM 102 to clean and invalidate theDRAM 126 to save the local variables being used by thread T1. More specifically, at least some of the contents of theDRAM 126 preferably are transferred to other areas of thestorage 122, such as another DRAM (not specifically shown) that may be located in thestorage 122. TheDRAM 126 then is invalidated to clear space in theDRAM 126 for local variables that are used by thread T2. After theDRAM 126 has been cleaned and invalidated, theJSM 102 also may push the RAM base address onto the main stack, so that the local variables used by thread T1 may be retrieved for later use. Also, because each thread pushes and pops different values onto the micro-stack 146, theJSM 102 may further clean and invalidate the micro-stack 146 in order to preserve the entries of the micro-stack 146 and to clear the micro-stack 146 for use by thread T2. In at least some embodiments, the entries of the micro-stack 146 may be copied and/or transferred to thedata cache 124. Further, in some embodiments, theJSM 102 may invalidate the current entries of the micro-stack 146, so that after a thread switch, the entries loaded into the micro-stack 146 replace the invalidated entries. - After the
PC 186, theμPC 188, the status register R15 and an optional fourth register have been pushed onto theT1 stack 123, theJSM 102 stores the stack pointer (i.e., register R6). The stack pointer may be defined as the address of the topmost entry onT1 stack 123 and may be stored in any suitable memory (e.g., storage 122). Once at least thePC 186,μPC 188, and the status register have been pushed onto theT1 stack 123, and once the stack pointer for theT1 stack 123 has been stored in memory, the context ofswitch point 502 has been stored. - Because the context has been stored, the
JSM 102 is ready to switch from thread T1 to thread T2. Similar to thread T1, thread T2 comprises a plurality of instructions (e.g., Bytecodes, micro-sequences or a combination thereof). Like thread T1, thread T2 may be executed multiple times. However, each time processing switches from thread T1 to thread T2, as the context of thread T1 is stored from theJSM 102 onto a stack, so should the context of thread T2 be loaded from a stack onto theJSM 102. The context of thread T2 may be found on top of theT2 stack 125. TheT2 stack 125 preferably is a memory-based stack, specifically designated for thread T2 and stored in thestorage 122. The thread T2 context may have been pushed onto theT2 stack 125 at the end of a previous iteration in a substantially similar fashion to the context-saving process described above in relation to thread T1, or, alternatively, the thread T2 context may have been pushed onto theT2 stack 125 during the creation of the thread T2. - Thus, to begin processing thread T2, the
JSM 102 loads the stack pointer forT2 stack 125 from thestorage 122 to register R6. The RAM base address is loaded from theT2 stack 125, thus loading the local variables for thread T2. TheJSM 102 also loads the context of thread T2 from theT2 stack 125 onto theauxiliary registers 151 and/or theregisters 140. In particular, theJSM 102 uses specific instructions to pop context values off of theT2 stack 125, where at least some of the specific instructions are indivisible. For example, a MCTXPOP instruction may be used to pop minimum context values off of theT2 stack 125. This MCTXPOP instruction, in at least some embodiments, is indivisible, mandatory for performing a context switch, and should not be preempted. In this way, theJSM 102 is initialized to the context of the previous iteration of thread T2. Thus, theJSM 102 effectively is able to resume processing where it “left off.” TheJSM 102 decodes and executes thread T2 in a similar fashion to thread T1. - After thread T2 has been executed, the
JSM 102 may resume processing thread T1 atswitch point 502. To resume processing thread T1 atswitch point 502, theJSM 102 loads the context information of thread T1 from theT1 stack 123. TheJSM 102 loads the stack pointer of thread T1 from thestorage 122 and into register R6. TheJSM 102 then pops the RAM base address off of theT1 stack 123 and uses the RAM base address to load the local variables for thread T1. TheJSM 102 also pops the status value,μPC 188 and thePC 186 off of theT1 stack 123. TheJSM 102 stores the status value to the register R15 and stores theμPC 188 and thePC 186 to the auxiliary registers 151. In this way, the context information that is stored on top of theT1 stack 123 is popped off the stack and is used by theJSM 102 to return to the context ofswitch point 502. TheJSM 102 may now resume processing thread T1 atswitch point 502. The thread switch from thread T2 to thread T1 may be controlled by a sequence of code being executed in thread T2 or, alternatively, by commands sent from theMPU 104. The thread switching technique described above may be applied to any suitable pair of threads in thesystem 100. -
FIG. 7 shows a flowchart summarizing the process used to switch from one thread to another thread. The process 600 may begin by processing thread T1 (block 602). The process 600 comprises monitoring for a sequence of code in thread T1, or commands from theMPU 104, that initialize a thread switch from thread T1 to thread T2 (block 604). If no such sequence is encountered or no such command is received from theMPU 104, the process 600 comprises continuing to process thread T1 (block 602). However, if such a sequence orMPU 104 command is encountered, then the process 600 comprises halting processing of thread T1 (block 606) and pushing either the full or minimum context to the T1 stack (block 608), as previously described. - The process 600 further comprises cleaning and invalidating the RAM (block 610), pushing the RAM base address onto the T1 stack (block 612), cleaning and invalidating the micro-stack (block 614), and storing the T1 stack pointer to any suitable memory (block 616). The context of thread T1 has now been saved. Before beginning to process thread T2, the context of thread T2 (if any) is to be loaded from the T2 stack. Specifically, the process 600 comprises loading the T2 stack pointer from memory (block 618), popping the RAM base address from the T2 stack (block 620), popping the full or minimum context from the T2 stack (block 622), and subsequently beginning processing of the thread T2 (block 624).
- In the embodiments described above, a minimum context (i.e., PC, μPC, status register) is pushed onto a stack to bookmark a switch point. While storing the minimum-context is faster than storing the full-context (i.e., all registers in the JSM core), in some embodiments, it may be desirable to perform a full-context store instead of a minimum-context store, for reasons previously described. Thus, in such embodiments, full contexts also may be stored and/or loaded, in which case most or all of the
registers 140 as well as most or all of theauxiliary registers 151 are stored and/or loaded with each thread switch. For instance, in cases where one or more register values other than thePC 186,μPC 188, and status register are affected in a second thread, it may be desirable to store all register values via a full-context store. In such cases, the 32-bit instructions described above and shown inFIG. 6 may comprise data (e.g., in bits 31:24 and 3:0) that causes a full-context store to be performed. Similarly, a 32-bit instruction may comprise data that causes a full-context load to be performed. Further, as also described above, a full-context store and/or load may be initialized by a command from theMPU 104 instead of by code being executed in thread T1. A full-context store and/or load is performed in a similar manner to a minimum-context store and/or load, with the exception being a difference in the number of registers stored and/or loaded. - As explained above, the technique of storing contexts during thread switches may be used to service commands received by the
JSM 102 from theMPU 104. For example, in performing a series of tasks, theMPU 104 may determine that delegating one or more tasks to theJSM 102 would be expeditious, so that theMPU 104 may allocate its resources to performing other tasks. In such a case, theMPU 104 sends a command to theJSM 102, instructing theJSM 102 to perform a particular task. The command is coupled with a parameter, which parameter preferably comprises the address of a micro-sequence. TheJSM 102, upon receiving the command and the associated parameter, stores the parameter in a suitable storage unit, such as aregister 140, anauxiliary register 151 or on any one of the stacks in theJSM 102. TheJSM 102 then uses the parameter (i.e., the micro-sequence address) to locate the micro-sequence in themicro-sequence storage 180. Upon locating the micro-sequence, theJSM 102 retrieves the micro-sequence and executes the micro-sequence, thus obeying the command sent from theMPU 104. The micro-sequence preferably is pre-programmed into themicro-sequence storage 180. - In obeying the command from the
MPU 104, theJSM 102 may be required to pause whatever task it is completing at the moment the command is received from theMPU 104. More specifically, theJSM 102 may be performing a particular task or executing a sequence of code in a first thread T1 when it is interrupted with the command from theMPU 104. In order for theJSM 102 to service the command, it must first pause the execution of the first thread T1 at a switch point and bookmark the switch point by storing the context of the first thread T1. TheJSM 102 then may service the command from theMPU 104 in a second thread T2. Once the command from theMPU 104 has been serviced, theJSM 102 may resume execution at the switch point in the first thread T1 by retrieving the stored context of the first thread T1. - The
JSM 102 stores contexts and retrieves contexts in a manner similar to that previously described. In particular, when storing the context, theJSM 102 stores either a full context or, preferably, a minimum context. When storing a full context, theJSM 102 pushes all available registers 140 (and optionally auxiliary registers 151) onto theT1 stack 123. When storing a minimum context, theJSM 102 pushes thePC 186, theμPC 188, the status register R15 and optionally a fourth register value onto theT1 stack 123. In either case, before shifting to the second thread T2, theJSM 102 also stores the value of the stack pointer (i.e., register R6) in any suitable memory (e.g., DRAM 126). As previously described, theJSM 102 stores the value of the stack pointer so that, when it is ready to resume executing thread T1, theJSM 102 is able to locate the context information that is on theT1 stack 123. Specifically, once theJSM 102 has serviced the command from theMPU 104 and is ready to resume executing thread T1 at the switch point, theJSM 102 uses the stack pointer to locate the context information on theT1 stack 123. Once the context information is located, theJSM 102 pops the context information off of the stack and stores the context information to the appropriate registers (e.g., registers 140 and/or auxiliary registers 151) in theJSM 102. TheJSM 102 then may resume executing in thread T1. - One task the
MPU 104 may delegate to theJSM 102 may be for theJSM 102 to transfer data from a source to a destination via direct memory access, thus causing theJSM 102 to act as a DMA controller. In some embodiments, theJSM 102 may transfer blocks of data, while in other embodiments, theJSM 102 may selectively transfer a plurality of individual portions (e.g., bytes) of data. - The
MPU 104 sends a command and a parameter to theJSM 102. The parameter comprises the address of a DMA micro-sequence stored in themicro-sequence storage 180. In addition, theMPU 104 sends information pertaining to the data that is to be transferred. Specifically, theMPU 104 sends a data source address, a data size, and a data destination address to theJSM 102. Although these addresses, parameters and other information may be transferred from theMPU 104 to theJSM 102 in any suitable manner, in some embodiments, theMPU 104 writes the data source address, data size, and data destination address to aregister 140, anauxiliary register 151, aT1 stack 123, aT2 stack 125, or a micro-stack 146. TheMPU 104 then may send the command and the DMA micro-sequence address to theJSM 102. Alternatively, the information pertaining to the data to be transferred may be pre-programmed into theJSM 102, and theMPU 104 may simply transfer the command and the DMA micro-sequence to theJSM 102. The memory location of the information pertaining to the data may be provided to the DMA micro-sequence so that the DMA micro-sequence may locate the information. Alternatively, the information pertaining to the data may be written by theMPU 104 to memory locations indicated by the micro-sequence on theJSM 102. TheJSM 102 then may first retrieve the source address, data size and destination address from these memory locations, since the micro-sequence comprises the addresses of these locations. - The command received from the
MPU 104 causes theJSM 102 to use the DMA micro-sequence address to locate and execute the DMA micro-sequence in C-ISA mode. When executed, the DMA micro-sequence causes theJSM 102 to act as a DMA controller in that it causes theJSM 102 to use the data source address, data size and data destination address to load, transfer and store the data. The DMA micro-sequence preferably comprises a loop containing at least two instructions:{ Repeat (X) MEMCOPY (AR1+AR3++V2, AR0++V1) }
where “Repeat (X)” causes the MEMCOPY instruction to be repeated X times. The number of iterations X corresponds to one of the parameters (i.e., data size) provided by theMPU 104. Where the “MEMCOPY” instruction causes data to be copied from the source address “AR1+AR3++V2” to the destination address “AR0++V1.” The source address “AR1+AR3++V2” comprises three parts. The first part of the source address, AR1, specifies a base address in memory. The second part of the source address, AR3, specifies an index by which the base address AR1 should be increased. The sum of AR1+AR3 is an address that specifies the precise location in memory from which to load data. The third part of the source address, ++V2, is used as a post-increment to increment the value AR1+AR3 with each iteration of the MEMCOPY instruction. The values AR1, AR3 preferably are provided to theJSM 102 by theMPU 104, and the value V2 preferably is hard-coded into the DMA micro-sequence. - Here, the destination address “AR0++V1” comprises two parts. The first part of the destination address, AR0, specifies the location in memory to which the data should be stored. The second part of the destination address, ++V1, is used as a post-increment to increment the value AR0 with each iteration of the MEMCOPY instruction. The value AR0 preferably is provided to the
JSM 102 by theMPU 104, and the value V1 preferably is hard-coded into the DMA micro-sequence. In this example, the values AR0, AR1, AR2 refer toauxiliary registers 151, although data may be loaded from and stored to any suitable memory location. - The MEMCOPY instruction is now discussed in detail. Each time the MEMCOPY instruction is executed, data is loaded from the source address AR1+AR3++V2 and is pushed onto the micro-stack 146, which micro-stack 146 preferably is a first-in, last-out (FILO) stack. Loading the data and pushing the data onto the micro-stack 146 preferably takes about 1 clock cycle. Also, each time the MEMCOPY instruction is executed, data previously pushed on the micro-stack 146 is popped off of the micro-stack 146 and is stored to the destination address AR0++V1. Popping the data off of the micro-stack 146 and storing the data to the destination address preferably takes about 1 clock cycle. The micro-stack 146 is used because, when loading and storing data during direct memory accesses, there may be delays associated with the
JSM 102 pipeline. The micro-stack 146 synchronizes the data loading and storing so that no data discrepancies or errors result from the delay associated with theJSM 102 pipeline. - In at least some embodiments, the loading and storing of data may be pipelined as shown in
FIG. 8 . As shown, in afirst clock cycle 1, a first datum is loaded from a source address and is pushed onto the micro-stack 146 (indicated by “802”). In asecond clock cycle 2, a post-increment (indicated by “806”) of the source and/or destination addresses is performed as previously described. The post-increment is performed inclock cycle 2 so that, when a second datum is loaded from a source address and is pushed onto the micro-stack 146 (indicated by “808”), the source address is not the same address as the address used to load the datum in clock cycle 1 (indicated by “802”), but instead is the next available source address. In athird clock cycle 3, the first datum is stored to a destination address (indicated by “804”), a post-increment (indicated by “812”) is performed, and a third datum is loaded from a corresponding source address and is pushed onto the micro-stack 146 (as indicated by “810”). - As previously described, a post-increment is performed to increment both the current source address and the current destination address used by the instruction MEMCOPY. For example, the post-increment in
clock cycle 3 is performed so that the datum stored in clock cycle 3 (indicated by “804”) is stored not to the same memory address to which a previous datum may have been stored, but is instead stored to the next available destination address. Similarly, the post-increment inclock cycle 3 also is performed so that the datum loaded in clock cycle 3 (indicated by “810”) is loaded not from the same location the datum inclock cycle 2 was loaded, but instead from the next available source address. This process continues until the MEMCOPY instruction has been repeated X number of times. In this way, theJSM 102 acts as a DMA controller to transfer the data located at the source address to the destination address. - This technique is summarized in
FIG. 9 . Theprocess 900 begins with theMPU 104 sending a command, a DMA micro-sequence address, and information pertaining to the necessary data transfer to the JSM 102 (block 902). As previously described, this information comprises the data source address, the data size that is used to determine the number of iterations, and the data destination address. TheJSM 102 receives the command and other information from theMPU 104, pauses the currently executing thread T1 at a switch point, and saves the context of the switch point, as described above (block 904). Once the context has been saved, theJSM 102 follows the command to retrieve and execute the DMA micro-sequence in a new thread T2 (block 906). The execution of the DMA micro-sequence causes theJSM 102 to repeat the MEMCOPY instruction a predetermined number of times (block 908). Each iteration of the MEMCOPY instruction causes theJSM 102 to load a new datum from a corresponding source address. Once the datum has been loaded, theJSM 102 pushes the datum onto theFILO micro-stack 146. TheJSM 102 then pops a previously-pushed datum off of the FILO micro-stack 146 and stores the datum to the corresponding destination address (block 910). Once the MEMCOPY instruction has been executed the predetermined number of times, the data transfer is complete. TheJSM 102 may restore the context and resume executing thread T1 at the switch point (block 912). -
System 100 may be implemented as amobile cell phone 415 such as that shown inFIG. 10 . As shown, the battery-operated, mobile communication device includes anintegrated keypad 412 anddisplay 414. TheJSM processor 102 andMPU processor 104 and other components may be included inelectronics package 410 connected to thekeypad 412,display 414, and radio frequency (“RF”)circuitry 416. TheRF circuitry 416 may be connected to anantenna 418. - While the preferred embodiments of the present invention have been shown and described, modifications thereof can be made by one skilled in the art without departing from the spirit and teachings of the invention. The embodiments described herein are exemplary only, and are not intended to be limiting. Many variations and modifications of the invention disclosed herein are possible and are within the scope of the invention. Accordingly, the scope of protection is not limited by the description set out above. Each and every claim is incorporated into the specification as an embodiment of the present invention.
Claims (25)
1. An electronic device, comprising:
a first processor adapted to process software instructions from a memory; and
a second processor coupled to the first processor, said second processor adapted to interrupt the first processor and to use the first processor as a direct memory access (DMA) controller;
wherein the second processor uses the first processor as a DMA controller by sending to the first processor a plurality of addresses;
wherein the first processor uses a first address of the plurality of addresses to retrieve a group of instructions which, when executed, causes the first processor to load a datum directly from a memory location and to transfer the datum to a different memory location.
2. The electronic device of claim 1 , wherein, after processing the group of instructions, the second processor ceases to use the first processor as a DMA controller and wherein the first processor resumes processing software instructions from the memory.
3. The electronic device of claim 1 , wherein the device is at least one of a battery-operated device or a mobile communication device.
4. The electronic device of claim 1 , wherein the second processor sends a command to the first processor, and wherein the command causes the first processor to retrieve and execute the group of instructions.
5. The electronic device of claim 1 , wherein, when executed, the group of instructions causes the first processor to:
use a second address of the plurality of addresses to load the datum directly from the memory location and to push the datum onto a stack; and
pop another datum off of the stack and to store the another datum directly to another memory location specified by a third address of the plurality of addresses.
6. The electronic device of claim 5 , wherein the first processor pauses a first execution thread at a switch point prior to executing the group of instructions in a second execution thread.
7. The electronic device of claim 6 , wherein, prior to executing the group of instructions in the second execution thread, the first processor pushes onto a separate stack data pertaining to the switch point, said data comprising information needed to resume execution of the first execution thread at the switch point.
8. The electronic device of claim 7 , wherein the data comprises only a minimum amount of information needed to resume execution of the first thread at the switch point.
9. The electronic device of claim 7 , wherein, after executing the group of instructions, the first processor pops the data off of the separate stack and stores the data to registers in the first processor.
10. The electronic device of claim 5 , wherein the stack is a first-in, last-out (FILO) stack.
11. The electronic device of claim 5 , wherein the stack prevents data discrepancies by synchronizing loading and storing of data.
12. A processor that decodes and executes software instructions from memory, comprising:
decode logic adapted to receive from another processor a plurality of addresses; and
fetch logic coupled to the decode logic and adapted to fetch a group of instructions from storage using a first address from the plurality of addresses;
wherein, when processed by the decode logic, the group of instructions causes the processor to be used as a direct memory access (DMA) controller by causing the processor to load a datum directly from a memory location and to transfer the datum to a different memory location.
13. The processor of claim 12 , wherein the group of instructions causes the processor to load the datum during a first clock cycle and to store the datum during a subsequent clock cycle.
14. The processor of claim 13 , wherein at least some of the plurality of addresses are modified by the processor during a second clock cycle in between the first clock cycle and the subsequent clock cycle.
15. The processor of claim 12 , wherein, when executed, the group of instructions causes the processor to:
load the datum directly from the memory location specified by a second address from the plurality of addresses and to push the datum onto a stack; and
pop the datum off of the stack and to store the datum to the different memory location specified by a third address from the plurality of addresses.
16. The processor of claim 15 , wherein the processor processes the group of instructions in a second thread after pausing execution of a first thread at a switch point.
17. The processor of claim 16 , wherein the processor pushes onto a separate stack data pertaining to the switch point.
18. The processor of claim 17 , wherein said data consists of a minimum amount of information needed to resume execution of the first thread at the switch point.
19. A method, comprising:
sending a first address from a first processor core to a second processor core, said second processor core adapted to decode and execute software instructions from memory; and
sending a command from the first processor core to the second processor core;
wherein the command interrupts the second processor core and causes the second processor core to fetch, from a location specified by the first address, a group of instructions;
wherein, when executed, the group of instructions causes the second processor core to be used as a direct memory access (DMA) controller.
20. The method of claim 19 further comprising sending a plurality of addresses from the first processor core to the second processor core, wherein executing the group of instructions comprises:
loading a first datum from a first memory location specified by a second address from the plurality of addresses and pushing the first datum onto a stack; and
when loading and pushing the first datum, popping a second datum from the stack and storing the second datum to a second memory location specified by a third address from the plurality of addresses.
21. The method of claim 20 further comprising incrementing at least one of the second address or the third address when loading and pushing the first datum.
22. The method of claim 19 , wherein the group of instructions is executed a predetermined number of times.
23. The method of claim 19 , wherein executing the group of instructions comprises executing the group of instructions in a new execution thread after pausing, at a switch point, an original execution thread running on the second processor core.
24. The method of claim 23 further comprising storing data pertaining to the switch point prior to executing the group of instructions.
25. The method of claim 24 , wherein said data comprises only contents of registers in the second processor core used by the group of instructions.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP04291918.3 | 2004-07-27 | ||
EP04291918A EP1622009A1 (en) | 2004-07-27 | 2004-07-27 | JSM architecture and systems |
Publications (1)
Publication Number | Publication Date |
---|---|
US20060026312A1 true US20060026312A1 (en) | 2006-02-02 |
Family
ID=34931294
Family Applications (37)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/116,893 Abandoned US20060026396A1 (en) | 2004-07-27 | 2005-04-28 | Memory access instruction with optional error check |
US11/116,897 Abandoned US20060026397A1 (en) | 2004-07-27 | 2005-04-28 | Pack instruction |
US11/116,918 Abandoned US20060026398A1 (en) | 2004-07-27 | 2005-04-28 | Unpack instruction |
US11/116,522 Active 2029-06-29 US8185666B2 (en) | 2004-07-27 | 2005-04-28 | Compare instruction |
US11/135,796 Abandoned US20060026392A1 (en) | 2004-07-27 | 2005-05-24 | Method and system of informing a micro-sequence of operand width |
US11/186,315 Active 2030-12-08 US8516496B2 (en) | 2004-07-27 | 2005-07-21 | Storing contexts for thread switching |
US11/186,330 Abandoned US20060026394A1 (en) | 2004-07-27 | 2005-07-21 | Optimizing data manipulation in media processing applications |
US11/186,239 Active 2027-12-15 US7574584B2 (en) | 2004-07-27 | 2005-07-21 | Splitting execution of a floating-point add instruction between an integer pipeline for performing mantissa addition and a hardware state machine |
US11/186,271 Active 2029-06-12 US7930689B2 (en) | 2004-07-27 | 2005-07-21 | Method and system for accessing indirect memories |
US11/186,063 Abandoned US20060026183A1 (en) | 2004-07-27 | 2005-07-21 | Method and system provide concurrent access to a software object |
US11/186,036 Active 2030-06-19 US8078842B2 (en) | 2004-07-27 | 2005-07-21 | Removing local RAM size limitations when executing software code |
US11/186,062 Abandoned US20060023517A1 (en) | 2004-07-27 | 2005-07-21 | Method and system for dynamic address translation |
US11/187,199 Abandoned US20060026200A1 (en) | 2004-07-27 | 2005-07-22 | Method and system for shared object data member zones |
US11/188,827 Active 2026-08-09 US7493476B2 (en) | 2004-07-27 | 2005-07-25 | Method and system for obtaining an immediate operand of a bytecode for use by a micro-sequence |
US11/188,923 Abandoned US20060026322A1 (en) | 2004-07-27 | 2005-07-25 | Interrupt management in dual core processors |
US11/188,311 Active 2026-10-10 US7533250B2 (en) | 2004-07-27 | 2005-07-25 | Automatic operand load, modify and store |
US11/188,503 Active 2027-01-25 US7587583B2 (en) | 2004-07-27 | 2005-07-25 | Method and system for processing a “WIDE” opcode when it is not used as a prefix for an immediately following opcode |
US11/188,309 Abandoned US20060026407A1 (en) | 2004-07-27 | 2005-07-25 | Delegating tasks between multiple processor cores |
US11/188,411 Active 2028-03-27 US7606977B2 (en) | 2004-07-27 | 2005-07-25 | Context save and restore with a stack-based memory structure |
US11/188,310 Active 2029-05-11 US8046748B2 (en) | 2004-07-27 | 2005-07-25 | Method and system to emulate an M-bit instruction set |
US11/188,592 Active 2029-02-28 US8024554B2 (en) | 2004-07-27 | 2005-07-25 | Modifying an instruction stream using one or more bits to replace an instruction or to replace an instruction and to subsequently execute the replaced instruction |
US11/188,502 Active 2029-03-09 US7757223B2 (en) | 2004-07-27 | 2005-07-25 | Method and system to construct a data-flow analyzer for a bytecode verifier |
US11/188,668 Active 2026-05-05 US7260682B2 (en) | 2004-07-27 | 2005-07-25 | Cache memory usable as scratch pad storage |
US11/188,551 Active 2032-03-09 US9201807B2 (en) | 2004-07-27 | 2005-07-25 | Method and system for managing virtual memory |
US11/188,336 Abandoned US20060026401A1 (en) | 2004-07-27 | 2005-07-25 | Method and system to disable the "wide" prefix |
US11/188,504 Active 2026-10-13 US7500085B2 (en) | 2004-07-27 | 2005-07-25 | Identifying code for compilation |
US11/188,667 Abandoned US20060026312A1 (en) | 2004-07-27 | 2005-07-25 | Emulating a direct memory access controller |
US11/188,491 Active 2027-06-12 US7546437B2 (en) | 2004-07-27 | 2005-07-25 | Memory usable in cache mode or scratch pad mode to reduce the frequency of memory accesses |
US11/188,670 Active 2031-03-01 US8380906B2 (en) | 2004-07-27 | 2005-07-25 | Method and system for implementing interrupt service routines |
US11/188,550 Abandoned US20060026201A1 (en) | 2004-07-27 | 2005-07-25 | Method and system for multiple object representation |
US11/189,211 Active 2028-02-02 US8024716B2 (en) | 2004-07-27 | 2005-07-26 | Method and apparatus for code optimization |
US11/189,411 Abandoned US20060026580A1 (en) | 2004-07-27 | 2005-07-26 | Method and related system of dynamic compiler resolution |
US11/189,367 Active 2026-10-25 US7624382B2 (en) | 2004-07-27 | 2005-07-26 | Method and system of control flow graph construction |
US11/189,245 Abandoned US20060026126A1 (en) | 2004-07-27 | 2005-07-26 | Method and system for making a java system call |
US11/189,422 Active 2029-04-16 US7743384B2 (en) | 2004-07-27 | 2005-07-26 | Method and system for implementing an interrupt handler |
US11/189,637 Active 2028-06-25 US7752610B2 (en) | 2004-07-27 | 2005-07-26 | Method and system for thread abstraction |
US11/189,410 Active 2027-04-17 US7543285B2 (en) | 2004-07-27 | 2005-07-26 | Method and system of adaptive dynamic compiler resolution |
Family Applications Before (26)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/116,893 Abandoned US20060026396A1 (en) | 2004-07-27 | 2005-04-28 | Memory access instruction with optional error check |
US11/116,897 Abandoned US20060026397A1 (en) | 2004-07-27 | 2005-04-28 | Pack instruction |
US11/116,918 Abandoned US20060026398A1 (en) | 2004-07-27 | 2005-04-28 | Unpack instruction |
US11/116,522 Active 2029-06-29 US8185666B2 (en) | 2004-07-27 | 2005-04-28 | Compare instruction |
US11/135,796 Abandoned US20060026392A1 (en) | 2004-07-27 | 2005-05-24 | Method and system of informing a micro-sequence of operand width |
US11/186,315 Active 2030-12-08 US8516496B2 (en) | 2004-07-27 | 2005-07-21 | Storing contexts for thread switching |
US11/186,330 Abandoned US20060026394A1 (en) | 2004-07-27 | 2005-07-21 | Optimizing data manipulation in media processing applications |
US11/186,239 Active 2027-12-15 US7574584B2 (en) | 2004-07-27 | 2005-07-21 | Splitting execution of a floating-point add instruction between an integer pipeline for performing mantissa addition and a hardware state machine |
US11/186,271 Active 2029-06-12 US7930689B2 (en) | 2004-07-27 | 2005-07-21 | Method and system for accessing indirect memories |
US11/186,063 Abandoned US20060026183A1 (en) | 2004-07-27 | 2005-07-21 | Method and system provide concurrent access to a software object |
US11/186,036 Active 2030-06-19 US8078842B2 (en) | 2004-07-27 | 2005-07-21 | Removing local RAM size limitations when executing software code |
US11/186,062 Abandoned US20060023517A1 (en) | 2004-07-27 | 2005-07-21 | Method and system for dynamic address translation |
US11/187,199 Abandoned US20060026200A1 (en) | 2004-07-27 | 2005-07-22 | Method and system for shared object data member zones |
US11/188,827 Active 2026-08-09 US7493476B2 (en) | 2004-07-27 | 2005-07-25 | Method and system for obtaining an immediate operand of a bytecode for use by a micro-sequence |
US11/188,923 Abandoned US20060026322A1 (en) | 2004-07-27 | 2005-07-25 | Interrupt management in dual core processors |
US11/188,311 Active 2026-10-10 US7533250B2 (en) | 2004-07-27 | 2005-07-25 | Automatic operand load, modify and store |
US11/188,503 Active 2027-01-25 US7587583B2 (en) | 2004-07-27 | 2005-07-25 | Method and system for processing a “WIDE” opcode when it is not used as a prefix for an immediately following opcode |
US11/188,309 Abandoned US20060026407A1 (en) | 2004-07-27 | 2005-07-25 | Delegating tasks between multiple processor cores |
US11/188,411 Active 2028-03-27 US7606977B2 (en) | 2004-07-27 | 2005-07-25 | Context save and restore with a stack-based memory structure |
US11/188,310 Active 2029-05-11 US8046748B2 (en) | 2004-07-27 | 2005-07-25 | Method and system to emulate an M-bit instruction set |
US11/188,592 Active 2029-02-28 US8024554B2 (en) | 2004-07-27 | 2005-07-25 | Modifying an instruction stream using one or more bits to replace an instruction or to replace an instruction and to subsequently execute the replaced instruction |
US11/188,502 Active 2029-03-09 US7757223B2 (en) | 2004-07-27 | 2005-07-25 | Method and system to construct a data-flow analyzer for a bytecode verifier |
US11/188,668 Active 2026-05-05 US7260682B2 (en) | 2004-07-27 | 2005-07-25 | Cache memory usable as scratch pad storage |
US11/188,551 Active 2032-03-09 US9201807B2 (en) | 2004-07-27 | 2005-07-25 | Method and system for managing virtual memory |
US11/188,336 Abandoned US20060026401A1 (en) | 2004-07-27 | 2005-07-25 | Method and system to disable the "wide" prefix |
US11/188,504 Active 2026-10-13 US7500085B2 (en) | 2004-07-27 | 2005-07-25 | Identifying code for compilation |
Family Applications After (10)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/188,491 Active 2027-06-12 US7546437B2 (en) | 2004-07-27 | 2005-07-25 | Memory usable in cache mode or scratch pad mode to reduce the frequency of memory accesses |
US11/188,670 Active 2031-03-01 US8380906B2 (en) | 2004-07-27 | 2005-07-25 | Method and system for implementing interrupt service routines |
US11/188,550 Abandoned US20060026201A1 (en) | 2004-07-27 | 2005-07-25 | Method and system for multiple object representation |
US11/189,211 Active 2028-02-02 US8024716B2 (en) | 2004-07-27 | 2005-07-26 | Method and apparatus for code optimization |
US11/189,411 Abandoned US20060026580A1 (en) | 2004-07-27 | 2005-07-26 | Method and related system of dynamic compiler resolution |
US11/189,367 Active 2026-10-25 US7624382B2 (en) | 2004-07-27 | 2005-07-26 | Method and system of control flow graph construction |
US11/189,245 Abandoned US20060026126A1 (en) | 2004-07-27 | 2005-07-26 | Method and system for making a java system call |
US11/189,422 Active 2029-04-16 US7743384B2 (en) | 2004-07-27 | 2005-07-26 | Method and system for implementing an interrupt handler |
US11/189,637 Active 2028-06-25 US7752610B2 (en) | 2004-07-27 | 2005-07-26 | Method and system for thread abstraction |
US11/189,410 Active 2027-04-17 US7543285B2 (en) | 2004-07-27 | 2005-07-26 | Method and system of adaptive dynamic compiler resolution |
Country Status (2)
Country | Link |
---|---|
US (37) | US20060026396A1 (en) |
EP (1) | EP1622009A1 (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070162640A1 (en) * | 2005-12-01 | 2007-07-12 | Charles Johns | Method and system for efficient context swapping |
US20080134322A1 (en) * | 2006-12-04 | 2008-06-05 | Texas Instruments Incorporated | Micro-Sequence Based Security Model |
US20120185628A1 (en) * | 2011-01-18 | 2012-07-19 | Texas Instruments Incorporated | Locking/Unlocking CPUs to Operate in Safety Mode or Performance Mode Without Rebooting |
US20130227254A1 (en) * | 2012-02-29 | 2013-08-29 | Nathaniel McCallum | Differential stack-based symmetric co-routines |
US9135054B1 (en) * | 2008-07-16 | 2015-09-15 | Apple Inc. | Method and apparatus to migrate stacks for thread execution |
Families Citing this family (278)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4386732B2 (en) | 2002-01-08 | 2009-12-16 | セブン ネットワークス, インコーポレイテッド | Mobile network connection architecture |
US8468126B2 (en) | 2005-08-01 | 2013-06-18 | Seven Networks, Inc. | Publishing data in an information community |
US7917468B2 (en) | 2005-08-01 | 2011-03-29 | Seven Networks, Inc. | Linking of personal information management data |
US7853563B2 (en) | 2005-08-01 | 2010-12-14 | Seven Networks, Inc. | Universal data aggregation |
US7249128B2 (en) * | 2003-08-05 | 2007-07-24 | International Business Machines Corporation | Performance prediction system with query mining |
EP1622009A1 (en) * | 2004-07-27 | 2006-02-01 | Texas Instruments Incorporated | JSM architecture and systems |
US8010082B2 (en) | 2004-10-20 | 2011-08-30 | Seven Networks, Inc. | Flexible billing architecture |
WO2006045102A2 (en) | 2004-10-20 | 2006-04-27 | Seven Networks, Inc. | Method and apparatus for intercepting events in a communication system |
US7706781B2 (en) | 2004-11-22 | 2010-04-27 | Seven Networks International Oy | Data security in a mobile e-mail service |
US7643818B2 (en) * | 2004-11-22 | 2010-01-05 | Seven Networks, Inc. | E-mail messaging to/from a mobile terminal |
FI117152B (en) | 2004-12-03 | 2006-06-30 | Seven Networks Internat Oy | E-mail service provisioning method for mobile terminal, involves using domain part and further parameters to generate new parameter set in list of setting parameter sets, if provisioning of e-mail service is successful |
WO2006061463A1 (en) * | 2004-12-10 | 2006-06-15 | Seven Networks International Oy | Database synchronization |
FI120165B (en) * | 2004-12-29 | 2009-07-15 | Seven Networks Internat Oy | Synchronization of a database through a mobile network |
US7752633B1 (en) | 2005-03-14 | 2010-07-06 | Seven Networks, Inc. | Cross-platform event engine |
US8438633B1 (en) | 2005-04-21 | 2013-05-07 | Seven Networks, Inc. | Flexible real-time inbox access |
US7796742B1 (en) | 2005-04-21 | 2010-09-14 | Seven Networks, Inc. | Systems and methods for simplified provisioning |
US7200700B2 (en) * | 2005-05-19 | 2007-04-03 | Inventec Corporation | Shared-IRQ user defined interrupt signal handling method and system |
WO2006136660A1 (en) | 2005-06-21 | 2006-12-28 | Seven Networks International Oy | Maintaining an ip connection in a mobile network |
WO2006136661A1 (en) * | 2005-06-21 | 2006-12-28 | Seven Networks International Oy | Network-initiated data transfer in a mobile network |
US8069166B2 (en) | 2005-08-01 | 2011-11-29 | Seven Networks, Inc. | Managing user-to-user contact with inferred presence information |
US7895597B2 (en) * | 2005-09-15 | 2011-02-22 | Nokia Corporation | Method, apparatus and computer program product enabling full pre-emptive scheduling of green threads on a virtual machine |
US8037476B1 (en) * | 2005-09-15 | 2011-10-11 | Oracle America, Inc. | Address level log-based synchronization of shared data |
US7873953B1 (en) * | 2006-01-20 | 2011-01-18 | Altera Corporation | High-level language code sequence optimization for implementing programmable chip designs |
US8265349B2 (en) * | 2006-02-07 | 2012-09-11 | Qualcomm Incorporated | Intra-mode region-of-interest video object segmentation |
US7769395B2 (en) | 2006-06-20 | 2010-08-03 | Seven Networks, Inc. | Location-based operations and messaging |
KR100809294B1 (en) | 2006-03-10 | 2008-03-07 | 삼성전자주식회사 | Apparatus and method for executing thread scheduling in virtual machine |
US7538760B2 (en) * | 2006-03-30 | 2009-05-26 | Apple Inc. | Force imaging input device and system |
KR20070109432A (en) * | 2006-05-11 | 2007-11-15 | 삼성전자주식회사 | Apparatus and method for kernel aware debugging |
US7594094B2 (en) * | 2006-05-19 | 2009-09-22 | International Business Machines Corporation | Move data facility with optional specifications |
US20080001717A1 (en) * | 2006-06-20 | 2008-01-03 | Trevor Fiatal | System and method for group management |
US8176491B1 (en) * | 2006-08-04 | 2012-05-08 | Oracle America, Inc. | Fast synchronization of simple synchronized methods |
US8400998B2 (en) * | 2006-08-23 | 2013-03-19 | Motorola Mobility Llc | Downlink control channel signaling in wireless communication systems |
US7885112B2 (en) | 2007-09-07 | 2011-02-08 | Sandisk Corporation | Nonvolatile memory and method for on-chip pseudo-randomization of data within a page and between pages |
US9069547B2 (en) | 2006-09-22 | 2015-06-30 | Intel Corporation | Instruction and logic for processing text strings |
US8201142B2 (en) * | 2006-09-29 | 2012-06-12 | Microsoft Corporation | Description language for structured graphs |
US7844959B2 (en) * | 2006-09-29 | 2010-11-30 | Microsoft Corporation | Runtime optimization of distributed execution graph |
US20080082644A1 (en) * | 2006-09-29 | 2008-04-03 | Microsoft Corporation | Distributed parallel computing |
US8292689B2 (en) * | 2006-10-02 | 2012-10-23 | Mattel, Inc. | Electronic playset |
US20080148241A1 (en) * | 2006-10-11 | 2008-06-19 | Scott Thomas Jones | Method and apparatus for profiling heap objects |
US8117400B2 (en) * | 2006-10-20 | 2012-02-14 | Freescale Semiconductor, Inc. | System and method for fetching an information unit |
US8069440B2 (en) * | 2006-10-27 | 2011-11-29 | Oracle America, Inc. | Adaptive code through self steered execution |
US20080141268A1 (en) * | 2006-12-12 | 2008-06-12 | Tirumalai Partha P | Utility function execution using scout threads |
US8429623B2 (en) * | 2007-01-16 | 2013-04-23 | Oracle America Inc. | Processing engine for enabling a set of code intended for a first platform to be executed on a second platform |
US8468494B2 (en) * | 2007-01-22 | 2013-06-18 | Oracle Taleo Llc | In-line editor |
US7698534B2 (en) * | 2007-02-21 | 2010-04-13 | Arm Limited | Reordering application code to improve processing performance |
US7949848B2 (en) * | 2007-03-08 | 2011-05-24 | Arm Limited | Data processing apparatus, method and computer program product for reducing memory usage of an object oriented program |
US8693494B2 (en) | 2007-06-01 | 2014-04-08 | Seven Networks, Inc. | Polling |
US8805425B2 (en) | 2007-06-01 | 2014-08-12 | Seven Networks, Inc. | Integrated messaging |
US10452820B2 (en) * | 2007-06-26 | 2019-10-22 | International Business Machines Corporation | Thread-based software license management |
US20090031110A1 (en) * | 2007-07-24 | 2009-01-29 | Via Technologies | Microcode patch expansion mechanism |
US20090031103A1 (en) * | 2007-07-24 | 2009-01-29 | Via Technologies | Mechanism for implementing a microcode patch during fabrication |
US20090031090A1 (en) * | 2007-07-24 | 2009-01-29 | Via Technologies | Apparatus and method for fast one-to-many microcode patch |
US20090031109A1 (en) * | 2007-07-24 | 2009-01-29 | Via Technologies | Apparatus and method for fast microcode patch from memory |
US20090031107A1 (en) * | 2007-07-24 | 2009-01-29 | Via Technologies | On-chip memory providing for microcode patch overlay and constant update functions |
US20090031108A1 (en) * | 2007-07-24 | 2009-01-29 | Via Technologies | Configurable fuse mechanism for implementing microcode patches |
US20090031121A1 (en) * | 2007-07-24 | 2009-01-29 | Via Technologies | Apparatus and method for real-time microcode patch |
US7752424B2 (en) * | 2007-08-08 | 2010-07-06 | Arm Limited | Null value checking instruction |
CN101855617A (en) * | 2007-09-19 | 2010-10-06 | Kpit库敏思信息系统有限公司 | Mechanism to enable plug and play hardware components for semi-automatic software migration |
US8453143B2 (en) * | 2007-09-19 | 2013-05-28 | Vmware, Inc. | Reducing the latency of virtual interrupt delivery in virtual machines |
US8336031B2 (en) * | 2007-09-28 | 2012-12-18 | Texas Instruments Incorporated | Method and system of performing thread scheduling |
US20090112570A1 (en) * | 2007-10-26 | 2009-04-30 | Microsoft Corporation | Declarative model interpretation |
US9798524B1 (en) * | 2007-12-04 | 2017-10-24 | Axway, Inc. | System and method for exposing the dynamic web server-side |
US8364181B2 (en) | 2007-12-10 | 2013-01-29 | Seven Networks, Inc. | Electronic-mail filtering for mobile devices |
US8793305B2 (en) | 2007-12-13 | 2014-07-29 | Seven Networks, Inc. | Content delivery to a mobile device from a content service |
US9002828B2 (en) | 2007-12-13 | 2015-04-07 | Seven Networks, Inc. | Predictive content delivery |
US8281109B2 (en) | 2007-12-27 | 2012-10-02 | Intel Corporation | Compressed instruction format |
US8291388B2 (en) * | 2008-01-09 | 2012-10-16 | International Business Machines Corporation | System, method and program for executing a debugger |
US8107921B2 (en) | 2008-01-11 | 2012-01-31 | Seven Networks, Inc. | Mobile virtual network operator |
US20090182657A1 (en) * | 2008-01-15 | 2009-07-16 | Omx Technology Ab | Distributed ranking and matching of messages |
DE102008005124A1 (en) * | 2008-01-18 | 2009-07-23 | Kuka Roboter Gmbh | Computer system, control device for a machine, in particular for an industrial robot, and industrial robots |
US8862657B2 (en) | 2008-01-25 | 2014-10-14 | Seven Networks, Inc. | Policy based content service |
US20090193338A1 (en) | 2008-01-28 | 2009-07-30 | Trevor Fiatal | Reducing network and battery consumption during content delivery and playback |
JP2009181558A (en) * | 2008-02-01 | 2009-08-13 | Panasonic Corp | Program conversion device |
US8356289B2 (en) * | 2008-03-26 | 2013-01-15 | Avaya Inc. | Efficient encoding of instrumented data in real-time concurrent systems |
US8205196B2 (en) * | 2008-04-08 | 2012-06-19 | Broadcom Corporation | Systems and methods for using operating system (OS) virtualisation for minimizing power consumption in mobile phones |
FR2930447B1 (en) * | 2008-04-25 | 2010-07-30 | Sod Conseils Rech Applic | THERAPEUTIC USE OF AT LEAST ONE BOTULINUM NEUROTOXIN FOR THE TREATMENT OF PAIN IN THE CASE OF DIABETIC NEUROPATHY |
US8359587B2 (en) * | 2008-05-01 | 2013-01-22 | Oracle America, Inc. | Runtime profitability control for speculative automatic parallelization |
US8677337B2 (en) * | 2008-05-01 | 2014-03-18 | Oracle America, Inc. | Static profitability control for speculative automatic parallelization |
US8739141B2 (en) * | 2008-05-19 | 2014-05-27 | Oracle America, Inc. | Parallelizing non-countable loops with hardware transactional memory |
US8140820B2 (en) * | 2008-05-21 | 2012-03-20 | Arm Limited | Data processing apparatus and method for handling address translation for access requests issued by processing circuitry |
US7870257B2 (en) * | 2008-06-02 | 2011-01-11 | International Business Machines Corporation | Enhancing real-time performance for java application serving |
US8787947B2 (en) | 2008-06-18 | 2014-07-22 | Seven Networks, Inc. | Application discovery on mobile devices |
WO2009153620A1 (en) * | 2008-06-19 | 2009-12-23 | Freescale Semiconductor, Inc. | A system, method and computer program product for scheduling a processing entity task |
US9058206B2 (en) * | 2008-06-19 | 2015-06-16 | Freescale emiconductor, Inc. | System, method and program product for determining execution flow of the scheduler in response to setting a scheduler control variable by the debugger or by a processing entity |
WO2009153621A1 (en) * | 2008-06-19 | 2009-12-23 | Freescale Semiconductor, Inc. | A system, method and computer program product for scheduling processor entity tasks in a multiple-processing entity system |
US8078158B2 (en) | 2008-06-26 | 2011-12-13 | Seven Networks, Inc. | Provisioning applications for a mobile device |
CN102867287B (en) * | 2008-08-07 | 2015-09-30 | 三菱电机株式会社 | Instrument state display device |
US8407678B2 (en) * | 2008-08-27 | 2013-03-26 | Red Hat, Inc. | Method of array interception using data-flow analysis |
US8276009B2 (en) | 2008-09-05 | 2012-09-25 | Broadcom Corporation | Operating system (OS) virtualisation and processor utilization thresholds for minimizing power consumption in mobile phones |
US9675443B2 (en) | 2009-09-10 | 2017-06-13 | Johnson & Johnson Vision Care, Inc. | Energized ophthalmic lens including stacked integrated components |
US8909759B2 (en) | 2008-10-10 | 2014-12-09 | Seven Networks, Inc. | Bandwidth measurement |
US8645923B1 (en) * | 2008-10-31 | 2014-02-04 | Symantec Corporation | Enforcing expected control flow in program execution |
US8612929B2 (en) * | 2008-12-10 | 2013-12-17 | Oracle America, Inc. | Compiler implementation of lock/unlock using hardware transactional memory |
US8528001B2 (en) * | 2008-12-15 | 2013-09-03 | Oracle America, Inc. | Controlling and dynamically varying automatic parallelization |
US8806457B2 (en) * | 2008-12-15 | 2014-08-12 | Apple Inc. | Deferred constant pool generation |
US7685586B1 (en) | 2009-03-19 | 2010-03-23 | International Business Machines Corporation | Global escape analysis using instantiated type analysis |
US7712093B1 (en) | 2009-03-19 | 2010-05-04 | International Business Machines Corporation | Determining intra-procedural object flow using enhanced stackmaps |
US8195923B2 (en) * | 2009-04-07 | 2012-06-05 | Oracle America, Inc. | Methods and mechanisms to support multiple features for a number of opcodes |
US7996595B2 (en) | 2009-04-14 | 2011-08-09 | Lstar Technologies Llc | Interrupt arbitration for multiprocessors |
US8260996B2 (en) * | 2009-04-24 | 2012-09-04 | Empire Technology Development Llc | Interrupt optimization for multiprocessors |
US8321614B2 (en) * | 2009-04-24 | 2012-11-27 | Empire Technology Development Llc | Dynamic scheduling interrupt controller for multiprocessors |
US8549404B2 (en) * | 2009-04-30 | 2013-10-01 | Apple Inc. | Auditioning tools for a media editing application |
DE102009019891B3 (en) * | 2009-05-04 | 2010-11-25 | Texas Instruments Deutschland Gmbh | Microcontroller- or microprocessor unit for multiple current consumption modes, has register or memory, which contains bit fields for defining selected current consumption modes |
US8458676B2 (en) * | 2009-06-30 | 2013-06-04 | International Business Machines Corporation | Executing platform-independent code on multi-core heterogeneous processors |
US8561046B2 (en) * | 2009-09-14 | 2013-10-15 | Oracle America, Inc. | Pipelined parallelization with localized self-helper threading |
US20110087861A1 (en) * | 2009-10-12 | 2011-04-14 | The Regents Of The University Of Michigan | System for High-Efficiency Post-Silicon Verification of a Processor |
US8234431B2 (en) * | 2009-10-13 | 2012-07-31 | Empire Technology Development Llc | Interrupt masking for multi-core processors |
KR101612780B1 (en) * | 2009-11-13 | 2016-04-18 | 삼성전자주식회사 | Computing system and method for controling memory of computing system |
US20110131381A1 (en) * | 2009-11-27 | 2011-06-02 | Advanced Micro Devices, Inc. | Cache scratch-pad and method therefor |
US9009692B2 (en) * | 2009-12-26 | 2015-04-14 | Oracle America, Inc. | Minimizing register spills by using register moves |
US8578355B1 (en) * | 2010-03-19 | 2013-11-05 | Google Inc. | Scenario based optimization |
TW201209697A (en) | 2010-03-30 | 2012-03-01 | Michael Luna | 3D mobile user interface with configurable workspace management |
US8752058B1 (en) * | 2010-05-11 | 2014-06-10 | Vmware, Inc. | Implicit co-scheduling of CPUs |
US20120005450A1 (en) * | 2010-07-02 | 2012-01-05 | International Business Machines Corporation | User control of file data and metadata blocks |
CA2806557C (en) | 2010-07-26 | 2014-10-07 | Michael Luna | Mobile application traffic optimization |
CA2806548C (en) | 2010-07-26 | 2015-03-31 | Seven Networks, Inc. | Distributed implementation of dynamic wireless traffic policy |
PL3407673T3 (en) | 2010-07-26 | 2020-05-18 | Seven Networks, Llc | Mobile network traffic coordination across multiple applications |
US8838783B2 (en) | 2010-07-26 | 2014-09-16 | Seven Networks, Inc. | Distributed caching for resource and mobile network traffic management |
US20120030652A1 (en) * | 2010-07-30 | 2012-02-02 | Jakub Jelinek | Mechanism for Describing Values of Optimized Away Parameters in a Compiler-Generated Debug Output |
JP6034787B2 (en) | 2010-08-27 | 2016-11-30 | ノボマー, インコーポレイテッド | Polymer compositions and methods |
US8843153B2 (en) | 2010-11-01 | 2014-09-23 | Seven Networks, Inc. | Mobile traffic categorization and policy for network use optimization while preserving user experience |
WO2012060995A2 (en) | 2010-11-01 | 2012-05-10 | Michael Luna | Distributed caching in a wireless network of content delivered for a mobile application over a long-held request |
US9060032B2 (en) | 2010-11-01 | 2015-06-16 | Seven Networks, Inc. | Selective data compression by a distributed traffic management system to reduce mobile data traffic and signaling traffic |
US8204953B2 (en) | 2010-11-01 | 2012-06-19 | Seven Networks, Inc. | Distributed system for cache defeat detection and caching of content addressed by identifiers intended to defeat cache |
EP2635973A4 (en) | 2010-11-01 | 2014-01-15 | Seven Networks Inc | Caching adapted for mobile application behavior and network conditions |
US8166164B1 (en) | 2010-11-01 | 2012-04-24 | Seven Networks, Inc. | Application and network-based long poll request detection and cacheability assessment therefor |
US8484314B2 (en) | 2010-11-01 | 2013-07-09 | Seven Networks, Inc. | Distributed caching in a wireless network of content delivered for a mobile application over a long-held request |
US9330196B2 (en) | 2010-11-01 | 2016-05-03 | Seven Networks, Llc | Wireless traffic management system cache optimization using http headers |
US8326985B2 (en) | 2010-11-01 | 2012-12-04 | Seven Networks, Inc. | Distributed management of keep-alive message signaling for mobile network resource conservation and optimization |
TW201220048A (en) * | 2010-11-05 | 2012-05-16 | Realtek Semiconductor Corp | for enhancing access efficiency of cache memory |
EP3422775A1 (en) | 2010-11-22 | 2019-01-02 | Seven Networks, LLC | Optimization of resource polling intervals to satisfy mobile device requests |
CA2798523C (en) | 2010-11-22 | 2015-02-24 | Seven Networks, Inc. | Aligning data transfer to optimize connections established for transmission over a wireless network |
US9323551B2 (en) * | 2011-01-07 | 2016-04-26 | International Business Machines Corporation | Modifying code sequence with replacement parts of which non-beginning parts trigger exception when jumped to |
GB2501416B (en) | 2011-01-07 | 2018-03-21 | Seven Networks Llc | System and method for reduction of mobile network traffic used for domain name system (DNS) queries |
US9135037B1 (en) | 2011-01-13 | 2015-09-15 | Google Inc. | Virtual network protocol |
US8874888B1 (en) | 2011-01-13 | 2014-10-28 | Google Inc. | Managed boot in a cloud system |
US8745329B2 (en) * | 2011-01-20 | 2014-06-03 | Google Inc. | Storing data across a plurality of storage nodes |
WO2012105174A1 (en) * | 2011-01-31 | 2012-08-09 | パナソニック株式会社 | Program generation device, program generation method, processor device, and multiprocessor system |
US8950862B2 (en) | 2011-02-28 | 2015-02-10 | Johnson & Johnson Vision Care, Inc. | Methods and apparatus for an ophthalmic lens with functional insert layers |
US9063818B1 (en) | 2011-03-16 | 2015-06-23 | Google Inc. | Automated software updating based on prior activity |
US8533796B1 (en) | 2011-03-16 | 2013-09-10 | Google Inc. | Providing application programs with access to secured resources |
US9237087B1 (en) | 2011-03-16 | 2016-01-12 | Google Inc. | Virtual machine name resolution |
US10451897B2 (en) | 2011-03-18 | 2019-10-22 | Johnson & Johnson Vision Care, Inc. | Components with multiple energization elements for biomedical devices |
US9889615B2 (en) | 2011-03-18 | 2018-02-13 | Johnson & Johnson Vision Care, Inc. | Stacked integrated component media insert for an ophthalmic device |
US9110310B2 (en) | 2011-03-18 | 2015-08-18 | Johnson & Johnson Vision Care, Inc. | Multiple energization elements in stacked integrated component devices |
US9698129B2 (en) | 2011-03-18 | 2017-07-04 | Johnson & Johnson Vision Care, Inc. | Stacked integrated component devices with energization |
US9804418B2 (en) | 2011-03-21 | 2017-10-31 | Johnson & Johnson Vision Care, Inc. | Methods and apparatus for functional insert with power layer |
WO2012129650A1 (en) * | 2011-03-25 | 2012-10-04 | Nanospeed Diagnostics Inc. | Lateral flow immunoassay for detecting vitamins |
US9053037B2 (en) * | 2011-04-04 | 2015-06-09 | International Business Machines Corporation | Allocating cache for use as a dedicated local storage |
US9084105B2 (en) | 2011-04-19 | 2015-07-14 | Seven Networks, Inc. | Device resources sharing for network resource conservation |
US20120278431A1 (en) | 2011-04-27 | 2012-11-01 | Michael Luna | Mobile device which offloads requests made by a mobile application to a remote entity for conservation of mobile device and network resources and methods therefor |
WO2012149434A2 (en) | 2011-04-27 | 2012-11-01 | Seven Networks, Inc. | Detecting and preserving state for satisfying application requests in a distributed proxy and cache system |
US8984581B2 (en) | 2011-07-27 | 2015-03-17 | Seven Networks, Inc. | Monitoring mobile application activities for malicious traffic on a mobile device |
US20130089721A1 (en) | 2011-08-02 | 2013-04-11 | Tracy Paolilli | Non-iridescent film with polymeric particles in primer layer |
US9075979B1 (en) | 2011-08-11 | 2015-07-07 | Google Inc. | Authentication based on proximity to mobile device |
US8966198B1 (en) | 2011-09-01 | 2015-02-24 | Google Inc. | Providing snapshots of virtual storage devices |
US8958293B1 (en) | 2011-12-06 | 2015-02-17 | Google Inc. | Transparent load-balancing for cloud computing services |
EP2789138B1 (en) | 2011-12-06 | 2016-09-14 | Seven Networks, LLC | A mobile device and method to utilize the failover mechanisms for fault tolerance provided for mobile traffic management and network/device resource conservation |
US8918503B2 (en) | 2011-12-06 | 2014-12-23 | Seven Networks, Inc. | Optimization of mobile traffic directed to private networks and operator configurability thereof |
EP2788889A4 (en) | 2011-12-07 | 2015-08-12 | Seven Networks Inc | Flexible and dynamic integration schemas of a traffic management system with various network operators for network traffic alleviation |
US9277443B2 (en) | 2011-12-07 | 2016-03-01 | Seven Networks, Llc | Radio-awareness of mobile device for sending server-side control signals using a wireless network optimized transport protocol |
US20130159511A1 (en) | 2011-12-14 | 2013-06-20 | Seven Networks, Inc. | System and method for generating a report to a network operator by distributing aggregation of data |
WO2013090821A1 (en) | 2011-12-14 | 2013-06-20 | Seven Networks, Inc. | Hierarchies and categories for management and deployment of policies for distributed wireless traffic optimization |
US9832095B2 (en) | 2011-12-14 | 2017-11-28 | Seven Networks, Llc | Operation modes for mobile traffic optimization and concurrent management of optimized and non-optimized traffic |
WO2013095337A1 (en) * | 2011-12-19 | 2013-06-27 | Intel Corporation | A system and deterministic method for servicing msi interrupts using direct cache access |
US8800009B1 (en) | 2011-12-30 | 2014-08-05 | Google Inc. | Virtual machine service access |
GB2499306B (en) | 2012-01-05 | 2014-10-22 | Seven Networks Inc | Managing user interaction with an application on a mobile device |
US8857983B2 (en) | 2012-01-26 | 2014-10-14 | Johnson & Johnson Vision Care, Inc. | Ophthalmic lens assembly having an integrated antenna structure |
US8983860B1 (en) | 2012-01-30 | 2015-03-17 | Google Inc. | Advertising auction system |
US9203864B2 (en) | 2012-02-02 | 2015-12-01 | Seven Networks, Llc | Dynamic categorization of applications for network access in a mobile network |
US9326189B2 (en) | 2012-02-03 | 2016-04-26 | Seven Networks, Llc | User as an end point for profiling and optimizing the delivery of content and data in a wireless network |
CN103294517B (en) | 2012-02-22 | 2018-05-11 | 国际商业机器公司 | Stack overflow protective device, stack protection method, dependent compilation device and computing device |
US8677449B1 (en) | 2012-03-19 | 2014-03-18 | Google Inc. | Exposing data to virtual machines |
US9973335B2 (en) * | 2012-03-28 | 2018-05-15 | Intel Corporation | Shared buffers for processing elements on a network device |
US8812695B2 (en) | 2012-04-09 | 2014-08-19 | Seven Networks, Inc. | Method and system for management of a virtual network connection without heartbeat messages |
US10263899B2 (en) | 2012-04-10 | 2019-04-16 | Seven Networks, Llc | Enhanced customer service for mobile carriers using real-time and historical mobile application and traffic or optimization data associated with mobile devices in a mobile network |
CN103377132B (en) * | 2012-04-16 | 2016-02-10 | 群联电子股份有限公司 | The method in diode-capacitor storage space, Memory Controller and memorizer memory devices |
US9134980B1 (en) * | 2012-05-01 | 2015-09-15 | Amazon Technologies, Inc. | Compiler optimization in a computing environment |
EP2844066A4 (en) * | 2012-05-02 | 2015-11-25 | Bedoukian Res Inc | Killing of bed bugs |
US9135170B2 (en) | 2012-05-15 | 2015-09-15 | Futurewei Technologies, Inc. | Memory mapping and translation for arbitrary number of memory units |
JP6050721B2 (en) * | 2012-05-25 | 2016-12-21 | 株式会社半導体エネルギー研究所 | Semiconductor device |
CN104350465B (en) * | 2012-06-11 | 2018-02-16 | 英派尔科技开发有限公司 | The dynamic optimization of Adjustable calculation machine program |
US8775631B2 (en) | 2012-07-13 | 2014-07-08 | Seven Networks, Inc. | Dynamic bandwidth adjustment for browsing or streaming activity in a wireless network based on prediction of user behavior when interacting with mobile applications |
CN102929981B (en) * | 2012-10-17 | 2016-09-21 | Tcl通力电子(惠州)有限公司 | Multimedia scanning file indexing means and device |
US9161258B2 (en) | 2012-10-24 | 2015-10-13 | Seven Networks, Llc | Optimized and selective management of policy deployment to mobile clients in a congested network to prevent further aggravation of network congestion |
KR20140054948A (en) * | 2012-10-30 | 2014-05-09 | 한국전자통신연구원 | Tool composition for supporting opencl application software development for embedded system and method thereof |
US9311243B2 (en) | 2012-11-30 | 2016-04-12 | Intel Corporation | Emulated message signaled interrupts in multiprocessor systems |
US10235208B2 (en) * | 2012-12-11 | 2019-03-19 | Nvidia Corporation | Technique for saving and restoring thread group operating state |
US9307493B2 (en) | 2012-12-20 | 2016-04-05 | Seven Networks, Llc | Systems and methods for application management of mobile device radio state promotion and demotion |
US8930920B2 (en) * | 2012-12-31 | 2015-01-06 | Oracle International Corporation | Self-optimizing interpreter and snapshot compilation |
US9250954B2 (en) * | 2013-01-17 | 2016-02-02 | Xockets, Inc. | Offload processor modules for connection to system memory, and corresponding methods and systems |
US9271238B2 (en) | 2013-01-23 | 2016-02-23 | Seven Networks, Llc | Application or context aware fast dormancy |
US8874761B2 (en) | 2013-01-25 | 2014-10-28 | Seven Networks, Inc. | Signaling optimization in a wireless network for traffic utilizing proprietary and non-proprietary protocols |
US8750123B1 (en) | 2013-03-11 | 2014-06-10 | Seven Networks, Inc. | Mobile device equipped with mobile network congestion recognition to make intelligent decisions regarding connecting to an operator network |
US9424165B2 (en) * | 2013-03-14 | 2016-08-23 | Applied Micro Circuits Corporation | Debugging processor hang situations using an external pin |
CN104079613B (en) * | 2013-03-29 | 2018-04-13 | 国际商业机器公司 | Method and system for sharing application program object between multi-tenant |
US9065765B2 (en) | 2013-07-22 | 2015-06-23 | Seven Networks, Inc. | Proxy server associated with a mobile carrier for enhancing mobile traffic management in a mobile network |
CN103632099B (en) * | 2013-09-29 | 2016-08-17 | 广州华多网络科技有限公司 | The Native api function acquisition methods do not derived and device |
GB2519103B (en) * | 2013-10-09 | 2020-05-06 | Advanced Risc Mach Ltd | Decoding a complex program instruction corresponding to multiple micro-operations |
US9539005B2 (en) | 2013-11-08 | 2017-01-10 | C.R. Bard, Inc. | Surgical fastener deployment system |
CN104679585B (en) * | 2013-11-28 | 2017-10-24 | 中国航空工业集团公司第六三一研究所 | Floating-point context switching method |
CN104699627B (en) * | 2013-12-06 | 2019-05-07 | 上海芯豪微电子有限公司 | A kind of caching system and method |
KR102219288B1 (en) | 2013-12-09 | 2021-02-23 | 삼성전자 주식회사 | Memory device supporting both cache and memory mode and operating method of the same |
US9542211B2 (en) * | 2014-03-26 | 2017-01-10 | Intel Corporation | Co-designed dynamic language accelerator for a processor |
US9600286B2 (en) | 2014-06-30 | 2017-03-21 | International Business Machines Corporation | Latent modification instruction for transactional execution |
US9336047B2 (en) | 2014-06-30 | 2016-05-10 | International Business Machines Corporation | Prefetching of discontiguous storage locations in anticipation of transactional execution |
US9348643B2 (en) | 2014-06-30 | 2016-05-24 | International Business Machines Corporation | Prefetching of discontiguous storage locations as part of transactional execution |
US9710271B2 (en) | 2014-06-30 | 2017-07-18 | International Business Machines Corporation | Collecting transactional execution characteristics during transactional execution |
US9448939B2 (en) | 2014-06-30 | 2016-09-20 | International Business Machines Corporation | Collecting memory operand access characteristics during transactional execution |
US10627651B2 (en) | 2014-08-21 | 2020-04-21 | Johnson & Johnson Vision Care, Inc. | Methods and apparatus to form biocompatible energization primary elements for biomedical devices with electroless sealing layers |
US9599842B2 (en) | 2014-08-21 | 2017-03-21 | Johnson & Johnson Vision Care, Inc. | Device and methods for sealing and encapsulation for biocompatible energization elements |
US10361405B2 (en) | 2014-08-21 | 2019-07-23 | Johnson & Johnson Vision Care, Inc. | Biomedical energization elements with polymer electrolytes |
US9793536B2 (en) | 2014-08-21 | 2017-10-17 | Johnson & Johnson Vision Care, Inc. | Pellet form cathode for use in a biocompatible battery |
US9383593B2 (en) | 2014-08-21 | 2016-07-05 | Johnson & Johnson Vision Care, Inc. | Methods to form biocompatible energization elements for biomedical devices comprising laminates and placed separators |
US10361404B2 (en) | 2014-08-21 | 2019-07-23 | Johnson & Johnson Vision Care, Inc. | Anodes for use in biocompatible energization elements |
US9941547B2 (en) | 2014-08-21 | 2018-04-10 | Johnson & Johnson Vision Care, Inc. | Biomedical energization elements with polymer electrolytes and cavity structures |
US10381687B2 (en) | 2014-08-21 | 2019-08-13 | Johnson & Johnson Vision Care, Inc. | Methods of forming biocompatible rechargable energization elements for biomedical devices |
US9715130B2 (en) | 2014-08-21 | 2017-07-25 | Johnson & Johnson Vision Care, Inc. | Methods and apparatus to form separators for biocompatible energization elements for biomedical devices |
US9811464B2 (en) * | 2014-12-11 | 2017-11-07 | Intel Corporation | Apparatus and method for considering spatial locality in loading data elements for execution |
US20160357965A1 (en) * | 2015-06-04 | 2016-12-08 | Ut Battelle, Llc | Automatic clustering of malware variants based on structured control flow |
CN104965409B (en) * | 2015-06-19 | 2017-06-09 | 北京甘为科技发展有限公司 | A kind of industrial circulating water system energy consumption self-learning optimization control method |
US9941146B2 (en) * | 2015-07-15 | 2018-04-10 | Chip Solutions, LLC | Semiconductor device and method |
US10417056B2 (en) | 2015-08-04 | 2019-09-17 | Oracle International Corporation | Systems and methods for performing concurrency restriction and throttling over contended locks |
US10104090B2 (en) | 2015-08-25 | 2018-10-16 | Oracle International Corporation | Restrictive access control for modular reflection |
US10503502B2 (en) * | 2015-09-25 | 2019-12-10 | Intel Corporation | Data element rearrangement, processors, methods, systems, and instructions |
GB2543304B (en) * | 2015-10-14 | 2020-10-28 | Advanced Risc Mach Ltd | Move prefix instruction |
US10620957B2 (en) * | 2015-10-22 | 2020-04-14 | Texas Instruments Incorporated | Method for forming constant extensions in the same execute packet in a VLIW processor |
JP2017130527A (en) * | 2016-01-19 | 2017-07-27 | 力祥半導體股▲フン▼有限公司UBIQ Semiconductor Corp. | Semiconductor device |
US10345620B2 (en) | 2016-02-18 | 2019-07-09 | Johnson & Johnson Vision Care, Inc. | Methods and apparatus to form biocompatible energization elements incorporating fuel cells for biomedical devices |
US10394528B2 (en) | 2016-03-30 | 2019-08-27 | Oracle International Corporation | Returning a runtime type loaded from an archive in a module system |
US10191753B2 (en) | 2016-03-30 | 2019-01-29 | Oracle International Corporation | Generating verification metadata and verifying a runtime type based on verification metadata |
US20170300521A1 (en) * | 2016-04-18 | 2017-10-19 | Sap Se | Concurrent accessing and processing of data during upgrade |
US10282184B2 (en) | 2016-09-16 | 2019-05-07 | Oracle International Corporation | Metadata application constraints within a module system based on modular dependencies |
US10387142B2 (en) | 2016-09-16 | 2019-08-20 | Oracle International Corporation | Using annotation processors defined by modules with annotation processors defined by non-module code |
US10262208B2 (en) * | 2016-09-23 | 2019-04-16 | Microsoft Technology Licensing, Llc | Automatic selection of cinemagraphs |
US10327200B2 (en) | 2016-09-28 | 2019-06-18 | Intel Corporation | Communication network management system and method |
US10565024B2 (en) * | 2016-10-19 | 2020-02-18 | Oracle International Corporation | Generic concurrency restriction |
KR20180071463A (en) * | 2016-12-19 | 2018-06-28 | 삼성전자주식회사 | Semiconductor memory device |
US10114795B2 (en) * | 2016-12-30 | 2018-10-30 | Western Digital Technologies, Inc. | Processor in non-volatile storage memory |
US10891326B2 (en) | 2017-01-05 | 2021-01-12 | International Business Machines Corporation | Representation of a data analysis using a flow graph |
US10318250B1 (en) * | 2017-03-17 | 2019-06-11 | Symantec Corporation | Systems and methods for locating functions for later interception |
US10848410B2 (en) | 2017-03-29 | 2020-11-24 | Oracle International Corporation | Ranking service implementations for a service interface |
US10740108B2 (en) | 2017-04-18 | 2020-08-11 | International Business Machines Corporation | Management of store queue based on restoration operation |
US10489382B2 (en) * | 2017-04-18 | 2019-11-26 | International Business Machines Corporation | Register restoration invalidation based on a context switch |
US10564977B2 (en) | 2017-04-18 | 2020-02-18 | International Business Machines Corporation | Selective register allocation |
US10572265B2 (en) | 2017-04-18 | 2020-02-25 | International Business Machines Corporation | Selecting register restoration or register reloading |
US10782979B2 (en) | 2017-04-18 | 2020-09-22 | International Business Machines Corporation | Restoring saved architected registers and suppressing verification of registers to be restored |
US10552164B2 (en) | 2017-04-18 | 2020-02-04 | International Business Machines Corporation | Sharing snapshots between restoration and recovery |
US10649785B2 (en) | 2017-04-18 | 2020-05-12 | International Business Machines Corporation | Tracking changes to memory via check and recovery |
US10540184B2 (en) | 2017-04-18 | 2020-01-21 | International Business Machines Corporation | Coalescing store instructions for restoration |
US10545766B2 (en) | 2017-04-18 | 2020-01-28 | International Business Machines Corporation | Register restoration using transactional memory register snapshots |
US11010192B2 (en) | 2017-04-18 | 2021-05-18 | International Business Machines Corporation | Register restoration using recovery buffers |
US10838733B2 (en) | 2017-04-18 | 2020-11-17 | International Business Machines Corporation | Register context restoration based on rename register recovery |
US10963261B2 (en) | 2017-04-18 | 2021-03-30 | International Business Machines Corporation | Sharing snapshots across save requests |
US10388039B2 (en) | 2017-05-31 | 2019-08-20 | International Business Machines Corporation | Accelerating data-driven scientific discovery |
WO2019040892A1 (en) * | 2017-08-24 | 2019-02-28 | Lutron Electronics Co., Inc. | Stack safety for independently defined operations |
US10497774B2 (en) * | 2017-10-23 | 2019-12-03 | Blackberry Limited | Small-gap coplanar tunable capacitors and methods for manufacturing thereof |
WO2019087889A1 (en) * | 2017-11-06 | 2019-05-09 | 本田技研工業株式会社 | Resin molded article unit and method for molding resin molded article unit |
US10592164B2 (en) | 2017-11-14 | 2020-03-17 | International Business Machines Corporation | Portions of configuration state registers in-memory |
US10552070B2 (en) * | 2017-11-14 | 2020-02-04 | International Business Machines Corporation | Separation of memory-based configuration state registers based on groups |
US10635602B2 (en) * | 2017-11-14 | 2020-04-28 | International Business Machines Corporation | Address translation prior to receiving a storage reference using the address to be translated |
US10496437B2 (en) | 2017-11-14 | 2019-12-03 | International Business Machines Corporation | Context switch by changing memory pointers |
US10901738B2 (en) | 2017-11-14 | 2021-01-26 | International Business Machines Corporation | Bulk store and load operations of configuration state registers |
US10664181B2 (en) | 2017-11-14 | 2020-05-26 | International Business Machines Corporation | Protecting in-memory configuration state registers |
US10761983B2 (en) * | 2017-11-14 | 2020-09-01 | International Business Machines Corporation | Memory based configuration state registers |
US10558366B2 (en) | 2017-11-14 | 2020-02-11 | International Business Machines Corporation | Automatic pinning of units of memory |
US10642757B2 (en) | 2017-11-14 | 2020-05-05 | International Business Machines Corporation | Single call to perform pin and unpin operations |
US10698686B2 (en) * | 2017-11-14 | 2020-06-30 | International Business Machines Corporation | Configurable architectural placement control |
US10761751B2 (en) | 2017-11-14 | 2020-09-01 | International Business Machines Corporation | Configuration state registers grouped based on functional affinity |
US11416251B2 (en) * | 2017-11-16 | 2022-08-16 | Arm Limited | Apparatus for storing, reading and modifying constant values |
US20190163492A1 (en) * | 2017-11-28 | 2019-05-30 | International Business Machines Corporation | Employing a stack accelerator for stack-type accesses |
US10613842B2 (en) * | 2018-04-30 | 2020-04-07 | International Business Machines Corporation | Simplifying a control flow graph based on profiling data |
WO2019229538A2 (en) * | 2018-05-30 | 2019-12-05 | 赛灵思公司 | Data conversion structure, method and on-chip implementation thereof |
US11106463B2 (en) * | 2019-05-24 | 2021-08-31 | Texas Instruments Incorporated | System and method for addressing data in memory |
US11080227B2 (en) * | 2019-08-08 | 2021-08-03 | SambaNova Systems, Inc. | Compiler flow logic for reconfigurable architectures |
JP2021166010A (en) * | 2020-04-08 | 2021-10-14 | 富士通株式会社 | Operation processing device |
EP4152150A4 (en) * | 2020-05-30 | 2023-06-28 | Huawei Technologies Co., Ltd. | Processor, processing method, and related device |
CN115421864B (en) * | 2022-09-14 | 2023-04-28 | 北京计算机技术及应用研究所 | Universal PowerPC architecture processor instruction set virtualization simulation method |
Citations (23)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5099417A (en) * | 1987-03-13 | 1992-03-24 | Texas Instruments Incorporated | Data processing device with improved direct memory access |
US5305441A (en) * | 1986-12-26 | 1994-04-19 | Hitachi,Ltd. | Data communication system prioritizing data transfer over microcomputer data interrupt processing |
US5390304A (en) * | 1990-09-28 | 1995-02-14 | Texas Instruments, Incorporated | Method and apparatus for processing block instructions in a data processor |
US5548737A (en) * | 1991-07-10 | 1996-08-20 | International Business Machines Corporation | Dynamic load balancing for a multiprocessor pipeline by sorting instructions based on predetermined execution time |
US5613162A (en) * | 1995-01-04 | 1997-03-18 | Ast Research, Inc. | Method and apparatus for performing efficient direct memory access data transfers |
US5634076A (en) * | 1994-10-04 | 1997-05-27 | Analog Devices, Inc. | DMA controller responsive to transition of a request signal between first state and second state and maintaining of second state for controlling data transfer |
US5642499A (en) * | 1988-11-30 | 1997-06-24 | Hitachi, Ltd. | Method and apparatus for controlling timing of execution of saving and restoring operations in a processor system |
US5708815A (en) * | 1995-05-05 | 1998-01-13 | Intel Corporation | DMA emulation via interrupt muxing |
US5754884A (en) * | 1996-05-20 | 1998-05-19 | Advanced Micro Devices | Method for improving the real-time functionality of a personal computer which employs an interrupt servicing DMA controller |
US6115777A (en) * | 1998-04-21 | 2000-09-05 | Idea Corporation | LOADRS instruction and asynchronous context switch |
US6341318B1 (en) * | 1999-08-10 | 2002-01-22 | Chameleon Systems, Inc. | DMA data streaming |
US6412029B1 (en) * | 1999-04-29 | 2002-06-25 | Agere Systems Guardian Corp. | Method and apparatus for interfacing between a digital signal processor and a baseband circuit for wireless communication system |
US6418540B1 (en) * | 1999-08-27 | 2002-07-09 | Lucent Technologies Inc. | State transfer with throw-away thread |
US6418489B1 (en) * | 1999-10-25 | 2002-07-09 | Motorola, Inc. | Direct memory access controller and method therefor |
US20020166004A1 (en) * | 2001-05-02 | 2002-11-07 | Kim Jason Seung-Min | Method for implementing soft-DMA (software based direct memory access engine) for multiple processor systems |
US6535958B1 (en) * | 1999-07-15 | 2003-03-18 | Texas Instruments Incorporated | Multilevel cache system coherence with memory selectively configured as cache or direct access memory and direct memory access |
US6668287B1 (en) * | 1999-12-15 | 2003-12-23 | Transmeta Corporation | Software direct memory access |
US6816921B2 (en) * | 2000-09-08 | 2004-11-09 | Texas Instruments Incorporated | Micro-controller direct memory access (DMA) operation with adjustable word size transfers and address alignment/incrementing |
US20040230717A1 (en) * | 2003-04-18 | 2004-11-18 | Terunobu Funatsu | Processing device |
US20040268007A1 (en) * | 2003-06-25 | 2004-12-30 | Nguyen Hung T. | Data processing systems including high performance buses and interfaces, and associated communication methods |
US20050223136A1 (en) * | 2003-03-05 | 2005-10-06 | Fujitsu Limited | System and method for controlling DMA data transfer |
US7073007B1 (en) * | 2003-07-22 | 2006-07-04 | Cisco Technology, Inc. | Interrupt efficiency across expansion busses |
US20060236000A1 (en) * | 2005-04-15 | 2006-10-19 | Falkowski John T | Method and system of split-streaming direct memory access |
Family Cites Families (257)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4080650A (en) * | 1976-07-28 | 1978-03-21 | Bell Telephone Laboratories, Incorporated | Facilitating return from an on-line debugging program to a target program breakpoint |
US4258419A (en) * | 1978-12-29 | 1981-03-24 | Bell Telephone Laboratories, Incorporated | Data processing apparatus providing variable operand width operation |
US4484271A (en) * | 1979-01-31 | 1984-11-20 | Honeywell Information Systems Inc. | Microprogrammed system having hardware interrupt apparatus |
US4312034A (en) * | 1979-05-21 | 1982-01-19 | Motorola, Inc. | ALU and Condition code control unit for data processor |
US4268419A (en) * | 1979-11-16 | 1981-05-19 | Uop Inc. | Support matrices for immobilized enzymes |
US4398243A (en) * | 1980-04-25 | 1983-08-09 | Data General Corporation | Data processing system having a unique instruction processor system |
US4598365A (en) * | 1983-04-01 | 1986-07-01 | Honeywell Information Systems Inc. | Pipelined decimal character execution unit |
US4729094A (en) * | 1983-04-18 | 1988-03-01 | Motorola, Inc. | Method and apparatus for coordinating execution of an instruction by a coprocessor |
US5021991A (en) * | 1983-04-18 | 1991-06-04 | Motorola, Inc. | Coprocessor instruction format |
JPH0827716B2 (en) * | 1985-10-25 | 1996-03-21 | 株式会社日立製作所 | Data processing device and data processing method |
US5155807A (en) * | 1986-02-24 | 1992-10-13 | International Business Machines Corporation | Multi-processor communications channel utilizing random access/sequential access memories |
JPS62221732A (en) * | 1986-03-24 | 1987-09-29 | Nec Corp | Register saving and recovery system |
US4821183A (en) * | 1986-12-04 | 1989-04-11 | International Business Machines Corporation | A microsequencer circuit with plural microprogrom instruction counters |
US5119484A (en) * | 1987-02-24 | 1992-06-02 | Digital Equipment Corporation | Selections between alternate control word and current instruction generated control word for alu in respond to alu output and current instruction |
US5142677A (en) * | 1989-05-04 | 1992-08-25 | Texas Instruments Incorporated | Context switching devices, systems and methods |
US5822578A (en) * | 1987-12-22 | 1998-10-13 | Sun Microsystems, Inc. | System for inserting instructions into processor instruction stream in order to perform interrupt processing |
US5313614A (en) * | 1988-12-06 | 1994-05-17 | At&T Bell Laboratories | Method and apparatus for direct conversion of programs in object code form between different hardware architecture computer systems |
JP3063006B2 (en) * | 1989-02-08 | 2000-07-12 | インテル・コーポレーション | Microprogrammed computer device and method for addressing microcode sequence memory |
US5167028A (en) * | 1989-11-13 | 1992-11-24 | Lucid Corporation | System for controlling task operation of slave processor by switching access to shared memory banks by master processor |
US5390329A (en) * | 1990-06-11 | 1995-02-14 | Cray Research, Inc. | Responding to service requests using minimal system-side context in a multiprocessor environment |
US5522072A (en) * | 1990-09-04 | 1996-05-28 | At&T Corp. | Arrangement for efficiently transferring program execution between subprograms |
US5826101A (en) * | 1990-09-28 | 1998-10-20 | Texas Instruments Incorporated | Data processing device having split-mode DMA channel |
US5537574A (en) * | 1990-12-14 | 1996-07-16 | International Business Machines Corporation | Sysplex shared data coherency method |
US5276835A (en) * | 1990-12-14 | 1994-01-04 | International Business Machines Corporation | Non-blocking serialization for caching data in a shared cache |
US5613128A (en) * | 1990-12-21 | 1997-03-18 | Intel Corporation | Programmable multi-processor interrupt controller system with a processor integrated local interrupt controller |
US5410710A (en) * | 1990-12-21 | 1995-04-25 | Intel Corporation | Multiprocessor programmable interrupt controller system adapted to functional redundancy checking processor systems |
US5507030A (en) * | 1991-03-07 | 1996-04-09 | Digitial Equipment Corporation | Successive translation, execution and interpretation of computer program having code at unknown locations due to execution transfer instructions having computed destination addresses |
WO1992022029A1 (en) * | 1991-05-24 | 1992-12-10 | British Technology Group Usa, Inc. | Optimizing compiler for computers |
US5355483A (en) * | 1991-07-18 | 1994-10-11 | Next Computers | Asynchronous garbage collection |
US5274815A (en) * | 1991-11-01 | 1993-12-28 | Motorola, Inc. | Dynamic instruction modifying controller and operation method |
US5187644A (en) * | 1991-11-14 | 1993-02-16 | Compaq Computer Corporation | Compact portable computer having an expandable full size keyboard with extendable supports |
EP0551531A1 (en) * | 1991-12-20 | 1993-07-21 | International Business Machines Corporation | Apparatus for executing ADD/SUB operations between IEEE standard floating-point numbers |
US5309567A (en) * | 1992-01-24 | 1994-05-03 | C-Cube Microsystems | Structure and method for an asynchronous communication protocol between master and slave processors |
US5257215A (en) * | 1992-03-31 | 1993-10-26 | Intel Corporation | Floating point and integer number conversions in a floating point adder |
JP2786574B2 (en) * | 1992-05-06 | 1998-08-13 | インターナショナル・ビジネス・マシーンズ・コーポレイション | Method and apparatus for improving the performance of out-of-order load operations in a computer system |
US5272660A (en) * | 1992-06-01 | 1993-12-21 | Motorola, Inc. | Method and apparatus for performing integer and floating point division using a single SRT divider in a data processor |
DE69322271T2 (en) * | 1992-06-29 | 1999-04-22 | Elonex Technologies Inc | MODULAR PORTABLE CALCULATOR |
US5828907A (en) * | 1992-06-30 | 1998-10-27 | Discovision Associates | Token-based adaptive video processing arrangement |
US5426783A (en) * | 1992-11-02 | 1995-06-20 | Amdahl Corporation | System for processing eight bytes or less by the move, pack and unpack instruction of the ESA/390 instruction set |
US5384722A (en) * | 1993-03-10 | 1995-01-24 | Intel Corporation | Apparatus and method for determining the Manhattan distance between two points |
US5825921A (en) * | 1993-03-19 | 1998-10-20 | Intel Corporation | Memory transfer apparatus and method useful within a pattern recognition system |
US5459798A (en) * | 1993-03-19 | 1995-10-17 | Intel Corporation | System and method of pattern recognition employing a multiprocessing pipelined apparatus with private pattern memory |
EP0651320B1 (en) * | 1993-10-29 | 2001-05-23 | Advanced Micro Devices, Inc. | Superscalar instruction decoder |
US5781750A (en) * | 1994-01-11 | 1998-07-14 | Exponential Technology, Inc. | Dual-instruction-set architecture CPU with hidden software emulation mode |
US5490272A (en) * | 1994-01-28 | 1996-02-06 | International Business Machines Corporation | Method and apparatus for creating multithreaded time slices in a multitasking operating system |
JPH07281890A (en) * | 1994-04-06 | 1995-10-27 | Mitsubishi Electric Corp | Instruction set and its executing method by microcomputer |
GB2289353B (en) * | 1994-05-03 | 1997-08-27 | Advanced Risc Mach Ltd | Data processing with multiple instruction sets |
JP3619939B2 (en) * | 1994-09-26 | 2005-02-16 | 株式会社ルネサステクノロジ | Central processing unit |
US5634046A (en) * | 1994-09-30 | 1997-05-27 | Microsoft Corporation | General purpose use of a stack pointer register |
JP3494489B2 (en) * | 1994-11-30 | 2004-02-09 | 株式会社ルネサステクノロジ | Instruction processing unit |
CN100412786C (en) * | 1994-12-02 | 2008-08-20 | 英特尔公司 | Microprocessor capable of compressing composite operation number |
US5560013A (en) * | 1994-12-06 | 1996-09-24 | International Business Machines Corporation | Method of using a target processor to execute programs of a source architecture that uses multiple address spaces |
US5638525A (en) * | 1995-02-10 | 1997-06-10 | Intel Corporation | Processor capable of executing programs that contain RISC and CISC instructions |
JP3218932B2 (en) * | 1995-07-06 | 2001-10-15 | 株式会社日立製作所 | Data prefetch code generation method |
US6643765B1 (en) * | 1995-08-16 | 2003-11-04 | Microunity Systems Engineering, Inc. | Programmable processor with group floating point operations |
US5953241A (en) * | 1995-08-16 | 1999-09-14 | Microunity Engeering Systems, Inc. | Multiplier array processing system with enhanced utilization at lower precision for group multiply and sum instruction |
US5933847A (en) * | 1995-09-28 | 1999-08-03 | Canon Kabushiki Kaisha | Selecting erase method based on type of power supply for flash EEPROM |
US5774737A (en) * | 1995-10-13 | 1998-06-30 | Matsushita Electric Industrial Co., Ltd. | Variable word length very long instruction word instruction processor with word length register or instruction number register |
US6035123A (en) * | 1995-11-08 | 2000-03-07 | Digital Equipment Corporation | Determining hardware complexity of software operations |
US5727227A (en) * | 1995-11-20 | 1998-03-10 | Advanced Micro Devices | Interrupt coprocessor configured to process interrupts in a computer system |
US5894578A (en) * | 1995-12-19 | 1999-04-13 | Advanced Micro Devices, Inc. | System and method for using random access memory in a programmable interrupt controller |
US5850558A (en) * | 1995-12-19 | 1998-12-15 | Advanced Micro Devices | System and method for referencing interrupt request information in a programmable interrupt controller |
US5892956A (en) * | 1995-12-19 | 1999-04-06 | Advanced Micro Devices, Inc. | Serial bus for transmitting interrupt information in a multiprocessing system |
US5850555A (en) * | 1995-12-19 | 1998-12-15 | Advanced Micro Devices, Inc. | System and method for validating interrupts before presentation to a CPU |
US5727217A (en) * | 1995-12-20 | 1998-03-10 | Intel Corporation | Circuit and method for emulating the functionality of an advanced programmable interrupt controller |
US6021469A (en) | 1996-01-24 | 2000-02-01 | Sun Microsystems, Inc. | Hardware virtual machine instruction processor |
US6038643A (en) * | 1996-01-24 | 2000-03-14 | Sun Microsystems, Inc. | Stack management unit and method for a processor having a stack |
EP0976050B1 (en) * | 1996-01-24 | 2002-06-12 | Sun Microsystems, Inc. | Processor with array access bounds checking |
US5842017A (en) * | 1996-01-29 | 1998-11-24 | Digital Equipment Corporation | Method and apparatus for forming a translation unit |
JPH09212371A (en) * | 1996-02-07 | 1997-08-15 | Nec Corp | Register saving and restoring system |
US5761515A (en) * | 1996-03-14 | 1998-06-02 | International Business Machines Corporation | Branch on cache hit/miss for compiler-assisted miss delay tolerance |
US5983313A (en) * | 1996-04-10 | 1999-11-09 | Ramtron International Corporation | EDRAM having a dynamically-sized cache memory and associated method |
US5923877A (en) * | 1996-05-01 | 1999-07-13 | Electronic Data Systems Corporation | Object-oriented programming memory management framework and method |
US5889999A (en) * | 1996-05-15 | 1999-03-30 | Motorola, Inc. | Method and apparatus for sequencing computer instruction execution in a data processing system |
US5778236A (en) * | 1996-05-17 | 1998-07-07 | Advanced Micro Devices, Inc. | Multiprocessing interrupt controller on I/O bus |
US6711667B1 (en) * | 1996-06-28 | 2004-03-23 | Legerity, Inc. | Microprocessor configured to translate instructions from one instruction set to another, and to store the translated instructions |
WO1998006030A1 (en) * | 1996-08-07 | 1998-02-12 | Sun Microsystems | Multifunctional execution unit |
US6061711A (en) * | 1996-08-19 | 2000-05-09 | Samsung Electronics, Inc. | Efficient context saving and restoring in a multi-tasking computing system environment |
US5909578A (en) * | 1996-09-30 | 1999-06-01 | Hewlett-Packard Company | Use of dynamic translation to burst profile computer applications |
US6438573B1 (en) * | 1996-10-09 | 2002-08-20 | Iowa State University Research Foundation, Inc. | Real-time programming method |
US5937193A (en) * | 1996-11-27 | 1999-08-10 | Vlsi Technology, Inc. | Circuit arrangement for translating platform-independent instructions for execution on a hardware platform and method thereof |
US6052699A (en) * | 1996-12-11 | 2000-04-18 | Lucent Technologies Inc. | Garbage collection without fine-grain synchronization |
US5796972A (en) * | 1997-01-14 | 1998-08-18 | Unisys Corporation | Method and apparatus for performing microcode paging during instruction execution in an instruction processor |
US5898850A (en) * | 1997-03-31 | 1999-04-27 | International Business Machines Corporation | Method and system for executing a non-native mode-sensitive instruction within a computer system |
US6003038A (en) * | 1997-03-31 | 1999-12-14 | Sun Microsystems, Inc. | Object-oriented processor architecture and operating method |
US5875336A (en) * | 1997-03-31 | 1999-02-23 | International Business Machines Corporation | Method and system for translating a non-native bytecode to a set of codes native to a processor within a computer system |
US6167488A (en) * | 1997-03-31 | 2000-12-26 | Sun Microsystems, Inc. | Stack caching circuit with overflow/underflow unit |
US6049810A (en) * | 1997-04-23 | 2000-04-11 | Sun Microsystems, Inc. | Method and apparatus for implementing a write barrier of a garbage collected heap |
US6199075B1 (en) * | 1997-05-30 | 2001-03-06 | Sun Microsystems, Inc. | Method and apparatus for generational garbage collection of a heap memory shared by multiple processors |
US5983337A (en) * | 1997-06-12 | 1999-11-09 | Advanced Micro Devices, Inc. | Apparatus and method for patching an instruction by providing a substitute instruction or instructions from an external memory responsive to detecting an opcode of the instruction |
US6006321A (en) * | 1997-06-13 | 1999-12-21 | Malleable Technologies, Inc. | Programmable logic datapath that may be used in a field programmable device |
US5892966A (en) * | 1997-06-27 | 1999-04-06 | Sun Microsystems, Inc. | Processor complex for executing multimedia functions |
US6321323B1 (en) * | 1997-06-27 | 2001-11-20 | Sun Microsystems, Inc. | System and method for executing platform-independent code on a co-processor |
US6513156B2 (en) * | 1997-06-30 | 2003-01-28 | Sun Microsystems, Inc. | Interpreting functions utilizing a hybrid of virtual and native machine instructions |
US6240440B1 (en) * | 1997-06-30 | 2001-05-29 | Sun Microsystems Incorporated | Method and apparatus for implementing virtual threads |
US6078744A (en) | 1997-08-01 | 2000-06-20 | Sun Microsystems | Method and apparatus for improving compiler performance during subsequent compilations of a source program |
US6366876B1 (en) * | 1997-09-29 | 2002-04-02 | Sun Microsystems, Inc. | Method and apparatus for assessing compatibility between platforms and applications |
US6006301A (en) * | 1997-09-30 | 1999-12-21 | Intel Corporation | Multi-delivery scheme interrupt router |
US6233733B1 (en) * | 1997-09-30 | 2001-05-15 | Sun Microsystems, Inc. | Method for generating a Java bytecode data flow graph |
KR100623403B1 (en) * | 1997-10-02 | 2006-09-13 | 코닌클리케 필립스 일렉트로닉스 엔.브이. | Data processing device for processing virtual machine instructions |
US6085208A (en) * | 1997-10-23 | 2000-07-04 | Advanced Micro Devices, Inc. | Leading one prediction unit for normalizing close path subtraction results within a floating point arithmetic unit |
US6061770A (en) * | 1997-11-04 | 2000-05-09 | Adaptec, Inc. | System and method for real-time data backup using snapshot copying with selective compaction of backup data |
US6341342B1 (en) * | 1997-11-04 | 2002-01-22 | Compaq Information Technologies Group, L.P. | Method and apparatus for zeroing a transfer buffer memory as a background task |
US6021484A (en) * | 1997-11-14 | 2000-02-01 | Samsung Electronics Co., Ltd. | Dual instruction set architecture |
US6862650B1 (en) | 1997-11-14 | 2005-03-01 | International Business Machines Corporation | Data processing system and method for managing memory of an interpretive system |
US6066181A (en) * | 1997-12-08 | 2000-05-23 | Analysis & Technology, Inc. | Java native interface code generator |
US6009261A (en) * | 1997-12-16 | 1999-12-28 | International Business Machines Corporation | Preprocessing of stored target routines for emulating incompatible instructions on a target processor |
US6081665A (en) * | 1997-12-19 | 2000-06-27 | Newmonics Inc. | Method for efficient soft real-time execution of portable byte code computer programs |
US6192368B1 (en) * | 1998-02-11 | 2001-02-20 | International Business Machines Corporation | Apparatus and method for automatically propagating a change made to at least one of a plurality of objects to at least one data structure containing data relating to the plurality of objects |
US5999732A (en) * | 1998-03-23 | 1999-12-07 | Sun Microsystems, Inc. | Techniques for reducing the cost of dynamic class initialization checks in compiled code |
US6052739A (en) | 1998-03-26 | 2000-04-18 | Sun Microsystems, Inc. | Method and apparatus for object-oriented interrupt system |
US6594708B1 (en) * | 1998-03-26 | 2003-07-15 | Sun Microsystems, Inc. | Apparatus and method for object-oriented memory system |
US6374286B1 (en) * | 1998-04-06 | 2002-04-16 | Rockwell Collins, Inc. | Real time processor capable of concurrently running multiple independent JAVA machines |
US6915307B1 (en) * | 1998-04-15 | 2005-07-05 | Inktomi Corporation | High performance object cache |
US6275903B1 (en) * | 1998-04-22 | 2001-08-14 | Sun Microsystems, Inc. | Stack cache miss handling |
US6192442B1 (en) * | 1998-04-29 | 2001-02-20 | Intel Corporation | Interrupt controller |
US6075942A (en) * | 1998-05-04 | 2000-06-13 | Sun Microsystems, Inc. | Encoding machine-specific optimization in generic byte code by using local variables as pseudo-registers |
US6148316A (en) * | 1998-05-05 | 2000-11-14 | Mentor Graphics Corporation | Floating point unit equipped also to perform integer addition as well as floating point to integer conversion |
US6397242B1 (en) * | 1998-05-15 | 2002-05-28 | Vmware, Inc. | Virtualization system including a virtual machine monitor for a computer with a segmented architecture |
US6480952B2 (en) | 1998-05-26 | 2002-11-12 | Advanced Micro Devices, Inc. | Emulation coprocessor |
US6745384B1 (en) * | 1998-05-29 | 2004-06-01 | Microsoft Corporation | Anticipatory optimization with composite folding |
US6205540B1 (en) | 1998-06-19 | 2001-03-20 | Franklin Electronic Publishers Incorporated | Processor with enhanced instruction set |
US6219678B1 (en) * | 1998-06-25 | 2001-04-17 | Sun Microsystems, Inc. | System and method for maintaining an association for an object |
US6202147B1 (en) * | 1998-06-29 | 2001-03-13 | Sun Microsystems, Inc. | Platform-independent device drivers |
EP0969377B1 (en) * | 1998-06-30 | 2009-01-07 | International Business Machines Corporation | Method of replication-based garbage collection in a multiprocessor system |
US6854113B1 (en) | 1998-08-28 | 2005-02-08 | Borland Software Corporation | Mixed-mode execution for object-oriented programming languages |
US6008621A (en) * | 1998-10-15 | 1999-12-28 | Electronic Classroom Furniture Systems | Portable computer charging system and storage cart |
US20020108025A1 (en) * | 1998-10-21 | 2002-08-08 | Nicholas Shaylor | Memory management unit for java environment computers |
US6684323B2 (en) * | 1998-10-27 | 2004-01-27 | Stmicroelectronics, Inc. | Virtual condition codes |
US6519594B1 (en) * | 1998-11-14 | 2003-02-11 | Sony Electronics, Inc. | Computer-implemented sharing of java classes for increased memory efficiency and communication method |
GB9825102D0 (en) | 1998-11-16 | 1999-01-13 | Insignia Solutions Plc | Computer system |
US6115719A (en) * | 1998-11-20 | 2000-09-05 | Revsoft Corporation | Java compatible object oriented component data structure |
US6530075B1 (en) * | 1998-12-03 | 2003-03-04 | International Business Machines Corporation | JIT/compiler Java language extensions to enable field performance and serviceability |
US6718457B2 (en) * | 1998-12-03 | 2004-04-06 | Sun Microsystems, Inc. | Multiple-thread processor for threaded software applications |
US20020073398A1 (en) * | 1998-12-14 | 2002-06-13 | Jeffrey L. Tinker | Method and system for modifying executable code to add additional functionality |
US7065633B1 (en) * | 1999-01-28 | 2006-06-20 | Ati International Srl | System for delivering exception raised in first architecture to operating system coded in second architecture in dual architecture CPU |
US6954923B1 (en) * | 1999-01-28 | 2005-10-11 | Ati International Srl | Recording classification of instructions executed by a computer |
US7111290B1 (en) * | 1999-01-28 | 2006-09-19 | Ati International Srl | Profiling program execution to identify frequently-executed portions and to assist binary translation |
US7275246B1 (en) * | 1999-01-28 | 2007-09-25 | Ati International Srl | Executing programs for a first computer architecture on a computer of a second architecture |
US7013456B1 (en) * | 1999-01-28 | 2006-03-14 | Ati International Srl | Profiling execution of computer programs |
US6385764B1 (en) * | 1999-01-29 | 2002-05-07 | International Business Machines Corporation | Method and apparatus for improving invocation speed of Java methods |
US6412109B1 (en) * | 1999-01-29 | 2002-06-25 | Sun Microsystems, Inc. | Method for optimizing java bytecodes in the presence of try-catch blocks |
US6848111B1 (en) | 1999-02-02 | 2005-01-25 | Sun Microsystems, Inc. | Zero overhead exception handling |
US6260157B1 (en) * | 1999-02-16 | 2001-07-10 | Kurt Schurecht | Patching of a read only memory |
US6738846B1 (en) * | 1999-02-23 | 2004-05-18 | Sun Microsystems, Inc. | Cooperative processing of tasks in a multi-threaded computing system |
US6308253B1 (en) * | 1999-03-31 | 2001-10-23 | Sony Corporation | RISC CPU instructions particularly suited for decoding digital signal processing applications |
US6412108B1 (en) | 1999-05-06 | 2002-06-25 | International Business Machines Corporation | Method and apparatus for speeding up java methods prior to a first execution |
US6510493B1 (en) * | 1999-07-15 | 2003-01-21 | International Business Machines Corporation | Method and apparatus for managing cache line replacement within a computer system |
US6510352B1 (en) | 1999-07-29 | 2003-01-21 | The Foxboro Company | Methods and apparatus for object-based process control |
US7000222B1 (en) * | 1999-08-19 | 2006-02-14 | International Business Machines Corporation | Method, system, and program for accessing variables from an operating system for use by an application program |
US6507947B1 (en) * | 1999-08-20 | 2003-01-14 | Hewlett-Packard Company | Programmatic synthesis of processor element arrays |
US6549959B1 (en) * | 1999-08-30 | 2003-04-15 | Ati International Srl | Detecting modification to computer memory by a DMA device |
US6671707B1 (en) * | 1999-10-19 | 2003-12-30 | Intel Corporation | Method for practical concurrent copying garbage collection offering minimal thread block times |
SE514318C2 (en) * | 1999-10-28 | 2001-02-12 | Appeal Virtual Machines Ab | Process for streamlining a data processing process using a virtual machine and using a garbage collection procedure |
US6711739B1 (en) * | 1999-11-08 | 2004-03-23 | Sun Microsystems, Inc. | System and method for handling threads of execution |
US6477666B1 (en) * | 1999-11-22 | 2002-11-05 | International Business Machines Corporation | Automatic fault injection into a JAVA virtual machine (JVM) |
DE69937611T2 (en) * | 1999-12-06 | 2008-10-23 | Texas Instruments Inc., Dallas | Intelligent buffer memory |
EP1111511B1 (en) * | 1999-12-06 | 2017-09-27 | Texas Instruments France | Cache with multiple fill modes |
US6691308B1 (en) * | 1999-12-30 | 2004-02-10 | Stmicroelectronics, Inc. | Method and apparatus for changing microcode to be executed in a processor |
US6986128B2 (en) * | 2000-01-07 | 2006-01-10 | Sony Computer Entertainment Inc. | Multiple stage program recompiler and method |
JP2001243079A (en) * | 2000-03-02 | 2001-09-07 | Omron Corp | Information processing system |
US6618737B2 (en) * | 2000-03-09 | 2003-09-09 | International Business Machines Corporation | Speculative caching of individual fields in a distributed object system |
US7171543B1 (en) * | 2000-03-28 | 2007-01-30 | Intel Corp. | Method and apparatus for executing a 32-bit application by confining the application to a 32-bit address space subset in a 64-bit processor |
US7093102B1 (en) * | 2000-03-29 | 2006-08-15 | Intel Corporation | Code sequence for vector gather and scatter |
US7086066B2 (en) * | 2000-03-31 | 2006-08-01 | Schlumbergersema Telekom Gmbh & Co. Kg | System and method for exception handling |
US6408383B1 (en) * | 2000-05-04 | 2002-06-18 | Sun Microsystems, Inc. | Array access boundary check by executing BNDCHK instruction with comparison specifiers |
US20030105945A1 (en) * | 2001-11-01 | 2003-06-05 | Bops, Inc. | Methods and apparatus for a bit rake instruction |
US20020099902A1 (en) * | 2000-05-12 | 2002-07-25 | Guillaume Comeau | Methods and systems for applications to interact with hardware |
US7159223B1 (en) * | 2000-05-12 | 2007-01-02 | Zw Company, Llc | Methods and systems for applications to interact with hardware |
US7020766B1 (en) * | 2000-05-30 | 2006-03-28 | Intel Corporation | Processing essential and non-essential code separately |
US20020099863A1 (en) * | 2000-06-02 | 2002-07-25 | Guillaume Comeau | Software support layer for processors executing interpreted language applications |
US6735687B1 (en) * | 2000-06-15 | 2004-05-11 | Hewlett-Packard Development Company, L.P. | Multithreaded microprocessor with asymmetrical central processing units |
US7093239B1 (en) * | 2000-07-14 | 2006-08-15 | Internet Security Systems, Inc. | Computer immune system and method for detecting unwanted code in a computer system |
US6662359B1 (en) * | 2000-07-20 | 2003-12-09 | International Business Machines Corporation | System and method for injecting hooks into Java classes to handle exception and finalization processing |
US6704860B1 (en) * | 2000-07-26 | 2004-03-09 | International Business Machines Corporation | Data processing system and method for fetching instruction blocks in response to a detected block sequence |
EP1182565B1 (en) | 2000-08-21 | 2012-09-05 | Texas Instruments France | Cache and DMA with a global valid bit |
US7000227B1 (en) | 2000-09-29 | 2006-02-14 | Intel Corporation | Iterative optimizing compiler |
GB2367653B (en) * | 2000-10-05 | 2004-10-20 | Advanced Risc Mach Ltd | Restarting translated instructions |
US6684232B1 (en) * | 2000-10-26 | 2004-01-27 | International Business Machines Corporation | Method and predictor for streamlining execution of convert-to-integer operations |
US6993754B2 (en) * | 2001-11-13 | 2006-01-31 | Hewlett-Packard Development Company, L.P. | Annotations to executable images for improved dynamic optimization functions |
GB0027053D0 (en) * | 2000-11-06 | 2000-12-20 | Ibm | A computer system with two heaps in contiguous storage |
EP1211598A1 (en) * | 2000-11-29 | 2002-06-05 | Texas Instruments Incorporated | Data processing apparatus, system and method |
US7085705B2 (en) * | 2000-12-21 | 2006-08-01 | Microsoft Corporation | System and method for the logical substitution of processor control in an emulated computing environment |
US7069545B2 (en) * | 2000-12-29 | 2006-06-27 | Intel Corporation | Quantization and compression for computation reuse |
US7185330B1 (en) | 2001-01-05 | 2007-02-27 | Xilinx, Inc. | Code optimization method and system |
US6988167B2 (en) * | 2001-02-08 | 2006-01-17 | Analog Devices, Inc. | Cache system with DMA capabilities and method for operating same |
US20020161957A1 (en) * | 2001-02-09 | 2002-10-31 | Guillaume Comeau | Methods and systems for handling interrupts |
US7080373B2 (en) * | 2001-03-07 | 2006-07-18 | Freescale Semiconductor, Inc. | Method and device for creating and using pre-internalized program files |
US6775763B2 (en) * | 2001-03-09 | 2004-08-10 | Koninklijke Philips Electronics N.V. | Bytecode instruction processor with switch instruction handling logic |
FR2822256B1 (en) * | 2001-03-13 | 2003-05-30 | Gemplus Card Int | VERIFICATION OF CONFORMITY OF ACCESS TO OBJECTS IN A DATA PROCESSING SYSTEM WITH A SECURITY POLICY |
GB2373349B (en) * | 2001-03-15 | 2005-02-23 | Proksim Software Inc | Data definition language |
US7184003B2 (en) * | 2001-03-16 | 2007-02-27 | Dualcor Technologies, Inc. | Personal electronics device with display switching |
US7017154B2 (en) | 2001-03-23 | 2006-03-21 | International Business Machines Corporation | Eliminating store/restores within hot function prolog/epilogs using volatile registers |
US6452426B1 (en) * | 2001-04-16 | 2002-09-17 | Nagesh Tamarapalli | Circuit for switching between multiple clocks |
US7032158B2 (en) * | 2001-04-23 | 2006-04-18 | Quickshift, Inc. | System and method for recognizing and configuring devices embedded on memory modules |
US6574708B2 (en) * | 2001-05-18 | 2003-06-03 | Broadcom Corporation | Source controlled cache allocation |
GB2376100B (en) * | 2001-05-31 | 2005-03-09 | Advanced Risc Mach Ltd | Data processing using multiple instruction sets |
GB2376097B (en) * | 2001-05-31 | 2005-04-06 | Advanced Risc Mach Ltd | Configuration control within data processing systems |
US7152223B1 (en) * | 2001-06-04 | 2006-12-19 | Microsoft Corporation | Methods and systems for compiling and interpreting one or more associations between declarations and implementations in a language neutral fashion |
US6961941B1 (en) * | 2001-06-08 | 2005-11-01 | Vmware, Inc. | Computer configuration for resource management in systems including a virtual machine |
AU2002327187A1 (en) * | 2001-07-02 | 2003-01-21 | Globespan Virata Incorporated | Communications system using rings architecture |
US6760908B2 (en) * | 2001-07-16 | 2004-07-06 | Namodigit Corporation | Embedded software update system |
US7107439B2 (en) * | 2001-08-10 | 2006-09-12 | Mips Technologies, Inc. | System and method of controlling software decompression through exceptions |
US7434030B2 (en) * | 2001-09-12 | 2008-10-07 | Renesas Technology Corp. | Processor system having accelerator of Java-type of programming language |
AU2002330027A1 (en) * | 2001-09-14 | 2003-04-01 | Sun Microsystems, Inc. | Method and apparatus for decoupling tag and data accesses in a cache memory |
JP2005504376A (en) * | 2001-09-25 | 2005-02-10 | コーニンクレッカ フィリップス エレクトロニクス エヌ ヴィ | Software support for virtual machine interpreter (VMI) acceleration hardware |
FR2831289B1 (en) * | 2001-10-19 | 2004-01-23 | St Microelectronics Sa | MICROPROCESSOR WITH EXTENDED ADDRESSABLE SPACE |
US7003778B2 (en) * | 2001-10-24 | 2006-02-21 | Sun Microsystems, Inc. | Exception handling in java computing environments |
US6915513B2 (en) * | 2001-11-29 | 2005-07-05 | Hewlett-Packard Development Company, L.P. | System and method for dynamically replacing code |
US7062762B2 (en) * | 2001-12-12 | 2006-06-13 | Texas Instruments Incorporated | Partitioning symmetric nodes efficiently in a split register file architecture |
US7363467B2 (en) * | 2002-01-03 | 2008-04-22 | Intel Corporation | Dependence-chain processing using trace descriptors having dependency descriptors |
US6912649B2 (en) * | 2002-03-13 | 2005-06-28 | International Business Machines Corporation | Scheme to encode predicted values into an instruction stream/cache without additional bits/area |
US7131120B2 (en) * | 2002-05-16 | 2006-10-31 | Sun Microsystems, Inc. | Inter Java virtual machine (JVM) resource locking mechanism |
US7065613B1 (en) * | 2002-06-06 | 2006-06-20 | Maxtor Corporation | Method for reducing access to main memory using a stack cache |
US6957322B1 (en) * | 2002-07-25 | 2005-10-18 | Advanced Micro Devices, Inc. | Efficient microcode entry access from sequentially addressed portion via non-sequentially addressed portion |
EP1387253B1 (en) * | 2002-07-31 | 2017-09-20 | Texas Instruments Incorporated | Dynamic translation and execution of instructions within a processor |
EP1387249B1 (en) * | 2002-07-31 | 2019-03-13 | Texas Instruments Incorporated | RISC processor having a stack and register architecture |
EP1391821A3 (en) * | 2002-07-31 | 2007-06-06 | Texas Instruments Inc. | A multi processor computing system having a java stack machine and a risc based processor |
US7051177B2 (en) * | 2002-07-31 | 2006-05-23 | International Business Machines Corporation | Method for measuring memory latency in a hierarchical memory system |
US7237236B2 (en) * | 2002-08-22 | 2007-06-26 | International Business Machines Corporation | Method and apparatus for automatically determining optimum placement of privileged code locations in existing code |
GB2392515B (en) * | 2002-08-28 | 2005-08-17 | Livedevices Ltd | Improvements relating to stack usage in computer-related operating systems |
US7165156B1 (en) * | 2002-09-06 | 2007-01-16 | 3Pardata, Inc. | Read-write snapshots |
US7246346B2 (en) * | 2002-09-17 | 2007-07-17 | Microsoft Corporation | System and method for persisting dynamically generated code in a directly addressable and executable storage medium |
US7146607B2 (en) * | 2002-09-17 | 2006-12-05 | International Business Machines Corporation | Method and system for transparent dynamic optimization in a multiprocessing environment |
US7313797B2 (en) * | 2002-09-18 | 2007-12-25 | Wind River Systems, Inc. | Uniprocessor operating system design facilitating fast context switching |
US7200721B1 (en) * | 2002-10-09 | 2007-04-03 | Unisys Corporation | Verification of memory operations by multiple processors to a shared memory |
US20040083467A1 (en) * | 2002-10-29 | 2004-04-29 | Sharp Laboratories Of America, Inc. | System and method for executing intermediate code |
US7155708B2 (en) * | 2002-10-31 | 2006-12-26 | Src Computers, Inc. | Debugging and performance profiling using control-dataflow graph representations with reconfigurable hardware emulation |
KR100503077B1 (en) * | 2002-12-02 | 2005-07-21 | 삼성전자주식회사 | A java execution device and a java execution method |
US7194736B2 (en) * | 2002-12-10 | 2007-03-20 | Intel Corporation | Dynamic division optimization for a just-in-time compiler |
US6883074B2 (en) * | 2002-12-13 | 2005-04-19 | Sun Microsystems, Inc. | System and method for efficient write operations for repeated snapshots by copying-on-write to most recent snapshot |
US7383550B2 (en) | 2002-12-23 | 2008-06-03 | International Business Machines Corporation | Topology aware grid services scheduler architecture |
JP3899046B2 (en) * | 2003-03-20 | 2007-03-28 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Compiler device, compiler program, recording medium, and compiling method |
JP3992102B2 (en) * | 2003-06-04 | 2007-10-17 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Compiler device, compilation method, compiler program, and recording medium |
US7194732B2 (en) * | 2003-06-26 | 2007-03-20 | Hewlett-Packard Development Company, L.P. | System and method for facilitating profiling an application |
US7917734B2 (en) * | 2003-06-30 | 2011-03-29 | Intel Corporation | Determining length of instruction with multiple byte escape code based on information from other than opcode byte |
US20050028132A1 (en) * | 2003-07-31 | 2005-02-03 | Srinivasamurthy Venugopal K. | Application specific optimization of interpreters for embedded systems |
US7321965B2 (en) * | 2003-08-28 | 2008-01-22 | Mips Technologies, Inc. | Integrated mechanism for suspension and deallocation of computational threads of execution in a processor |
US7207038B2 (en) * | 2003-08-29 | 2007-04-17 | Nokia Corporation | Constructing control flows graphs of binary executable programs at post-link time |
US7328436B2 (en) * | 2003-09-15 | 2008-02-05 | Motorola, Inc. | Dynamic allocation of internal memory at runtime |
US20050071611A1 (en) * | 2003-09-30 | 2005-03-31 | International Business Machines Corporation | Method and apparatus for counting data accesses and instruction executions that exceed a threshold |
US20050086662A1 (en) * | 2003-10-21 | 2005-04-21 | Monnie David J. | Object monitoring system in shared object space |
US7631307B2 (en) * | 2003-12-05 | 2009-12-08 | Intel Corporation | User-programmable low-overhead multithreading |
US7401328B2 (en) * | 2003-12-18 | 2008-07-15 | Lsi Corporation | Software-implemented grouping techniques for use in a superscalar data processing system |
US7380039B2 (en) * | 2003-12-30 | 2008-05-27 | 3Tera, Inc. | Apparatus, method and system for aggregrating computing resources |
US7370180B2 (en) * | 2004-03-08 | 2008-05-06 | Arm Limited | Bit field extraction with sign or zero extend |
US7802080B2 (en) * | 2004-03-24 | 2010-09-21 | Arm Limited | Null exception handling |
US20050262487A1 (en) * | 2004-05-11 | 2005-11-24 | International Business Machines Corporation | System, apparatus, and method for identifying authorization requirements in component-based systems |
US7376674B2 (en) * | 2004-05-14 | 2008-05-20 | Oracle International Corporation | Storage of multiple pre-modification short duration copies of database information in short term memory |
JP2005338987A (en) * | 2004-05-25 | 2005-12-08 | Fujitsu Ltd | Exception test support program and device |
EP1622009A1 (en) * | 2004-07-27 | 2006-02-01 | Texas Instruments Incorporated | JSM architecture and systems |
US20060031820A1 (en) * | 2004-08-09 | 2006-02-09 | Aizhong Li | Method for program transformation and apparatus for COBOL to Java program transformation |
US7818723B2 (en) | 2004-09-07 | 2010-10-19 | Sap Ag | Antipattern detection processing for a multithreaded application |
US7194606B2 (en) * | 2004-09-28 | 2007-03-20 | Hewlett-Packard Development Company, L.P. | Method and apparatus for using predicates in a processing device |
US7370129B2 (en) * | 2004-12-15 | 2008-05-06 | Microsoft Corporation | Retry strategies for use in a streaming environment |
US7877740B2 (en) * | 2005-06-13 | 2011-01-25 | Hewlett-Packard Development Company, L.P. | Handling caught exceptions |
US7899661B2 (en) * | 2006-02-16 | 2011-03-01 | Synopsys, Inc. | Run-time switching for simulation with dynamic run-time accuracy adjustment |
-
2004
- 2004-07-27 EP EP04291918A patent/EP1622009A1/en not_active Withdrawn
-
2005
- 2005-04-28 US US11/116,893 patent/US20060026396A1/en not_active Abandoned
- 2005-04-28 US US11/116,897 patent/US20060026397A1/en not_active Abandoned
- 2005-04-28 US US11/116,918 patent/US20060026398A1/en not_active Abandoned
- 2005-04-28 US US11/116,522 patent/US8185666B2/en active Active
- 2005-05-24 US US11/135,796 patent/US20060026392A1/en not_active Abandoned
- 2005-07-21 US US11/186,315 patent/US8516496B2/en active Active
- 2005-07-21 US US11/186,330 patent/US20060026394A1/en not_active Abandoned
- 2005-07-21 US US11/186,239 patent/US7574584B2/en active Active
- 2005-07-21 US US11/186,271 patent/US7930689B2/en active Active
- 2005-07-21 US US11/186,063 patent/US20060026183A1/en not_active Abandoned
- 2005-07-21 US US11/186,036 patent/US8078842B2/en active Active
- 2005-07-21 US US11/186,062 patent/US20060023517A1/en not_active Abandoned
- 2005-07-22 US US11/187,199 patent/US20060026200A1/en not_active Abandoned
- 2005-07-25 US US11/188,827 patent/US7493476B2/en active Active
- 2005-07-25 US US11/188,923 patent/US20060026322A1/en not_active Abandoned
- 2005-07-25 US US11/188,311 patent/US7533250B2/en active Active
- 2005-07-25 US US11/188,503 patent/US7587583B2/en active Active
- 2005-07-25 US US11/188,309 patent/US20060026407A1/en not_active Abandoned
- 2005-07-25 US US11/188,411 patent/US7606977B2/en active Active
- 2005-07-25 US US11/188,310 patent/US8046748B2/en active Active
- 2005-07-25 US US11/188,592 patent/US8024554B2/en active Active
- 2005-07-25 US US11/188,502 patent/US7757223B2/en active Active
- 2005-07-25 US US11/188,668 patent/US7260682B2/en active Active
- 2005-07-25 US US11/188,551 patent/US9201807B2/en active Active
- 2005-07-25 US US11/188,336 patent/US20060026401A1/en not_active Abandoned
- 2005-07-25 US US11/188,504 patent/US7500085B2/en active Active
- 2005-07-25 US US11/188,667 patent/US20060026312A1/en not_active Abandoned
- 2005-07-25 US US11/188,491 patent/US7546437B2/en active Active
- 2005-07-25 US US11/188,670 patent/US8380906B2/en active Active
- 2005-07-25 US US11/188,550 patent/US20060026201A1/en not_active Abandoned
- 2005-07-26 US US11/189,211 patent/US8024716B2/en active Active
- 2005-07-26 US US11/189,411 patent/US20060026580A1/en not_active Abandoned
- 2005-07-26 US US11/189,367 patent/US7624382B2/en active Active
- 2005-07-26 US US11/189,245 patent/US20060026126A1/en not_active Abandoned
- 2005-07-26 US US11/189,422 patent/US7743384B2/en active Active
- 2005-07-26 US US11/189,637 patent/US7752610B2/en active Active
- 2005-07-26 US US11/189,410 patent/US7543285B2/en active Active
Patent Citations (23)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5305441A (en) * | 1986-12-26 | 1994-04-19 | Hitachi,Ltd. | Data communication system prioritizing data transfer over microcomputer data interrupt processing |
US5099417A (en) * | 1987-03-13 | 1992-03-24 | Texas Instruments Incorporated | Data processing device with improved direct memory access |
US5642499A (en) * | 1988-11-30 | 1997-06-24 | Hitachi, Ltd. | Method and apparatus for controlling timing of execution of saving and restoring operations in a processor system |
US5390304A (en) * | 1990-09-28 | 1995-02-14 | Texas Instruments, Incorporated | Method and apparatus for processing block instructions in a data processor |
US5548737A (en) * | 1991-07-10 | 1996-08-20 | International Business Machines Corporation | Dynamic load balancing for a multiprocessor pipeline by sorting instructions based on predetermined execution time |
US5634076A (en) * | 1994-10-04 | 1997-05-27 | Analog Devices, Inc. | DMA controller responsive to transition of a request signal between first state and second state and maintaining of second state for controlling data transfer |
US5613162A (en) * | 1995-01-04 | 1997-03-18 | Ast Research, Inc. | Method and apparatus for performing efficient direct memory access data transfers |
US5708815A (en) * | 1995-05-05 | 1998-01-13 | Intel Corporation | DMA emulation via interrupt muxing |
US5754884A (en) * | 1996-05-20 | 1998-05-19 | Advanced Micro Devices | Method for improving the real-time functionality of a personal computer which employs an interrupt servicing DMA controller |
US6115777A (en) * | 1998-04-21 | 2000-09-05 | Idea Corporation | LOADRS instruction and asynchronous context switch |
US6412029B1 (en) * | 1999-04-29 | 2002-06-25 | Agere Systems Guardian Corp. | Method and apparatus for interfacing between a digital signal processor and a baseband circuit for wireless communication system |
US6535958B1 (en) * | 1999-07-15 | 2003-03-18 | Texas Instruments Incorporated | Multilevel cache system coherence with memory selectively configured as cache or direct access memory and direct memory access |
US6341318B1 (en) * | 1999-08-10 | 2002-01-22 | Chameleon Systems, Inc. | DMA data streaming |
US6418540B1 (en) * | 1999-08-27 | 2002-07-09 | Lucent Technologies Inc. | State transfer with throw-away thread |
US6418489B1 (en) * | 1999-10-25 | 2002-07-09 | Motorola, Inc. | Direct memory access controller and method therefor |
US6668287B1 (en) * | 1999-12-15 | 2003-12-23 | Transmeta Corporation | Software direct memory access |
US6816921B2 (en) * | 2000-09-08 | 2004-11-09 | Texas Instruments Incorporated | Micro-controller direct memory access (DMA) operation with adjustable word size transfers and address alignment/incrementing |
US20020166004A1 (en) * | 2001-05-02 | 2002-11-07 | Kim Jason Seung-Min | Method for implementing soft-DMA (software based direct memory access engine) for multiple processor systems |
US20050223136A1 (en) * | 2003-03-05 | 2005-10-06 | Fujitsu Limited | System and method for controlling DMA data transfer |
US20040230717A1 (en) * | 2003-04-18 | 2004-11-18 | Terunobu Funatsu | Processing device |
US20040268007A1 (en) * | 2003-06-25 | 2004-12-30 | Nguyen Hung T. | Data processing systems including high performance buses and interfaces, and associated communication methods |
US7073007B1 (en) * | 2003-07-22 | 2006-07-04 | Cisco Technology, Inc. | Interrupt efficiency across expansion busses |
US20060236000A1 (en) * | 2005-04-15 | 2006-10-19 | Falkowski John T | Method and system of split-streaming direct memory access |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070162640A1 (en) * | 2005-12-01 | 2007-07-12 | Charles Johns | Method and system for efficient context swapping |
US7590774B2 (en) * | 2005-12-01 | 2009-09-15 | Kabushiki Kaisha Toshiba | Method and system for efficient context swapping |
US20080134322A1 (en) * | 2006-12-04 | 2008-06-05 | Texas Instruments Incorporated | Micro-Sequence Based Security Model |
US8190861B2 (en) * | 2006-12-04 | 2012-05-29 | Texas Instruments Incorporated | Micro-sequence based security model |
US9135054B1 (en) * | 2008-07-16 | 2015-09-15 | Apple Inc. | Method and apparatus to migrate stacks for thread execution |
US20150363241A1 (en) * | 2008-07-16 | 2015-12-17 | Apple Inc. | Method and apparatus to migrate stacks for thread execution |
US10303523B2 (en) * | 2008-07-16 | 2019-05-28 | Apple Inc. | Method and apparatus to migrate stacks for thread execution |
US20120185628A1 (en) * | 2011-01-18 | 2012-07-19 | Texas Instruments Incorporated | Locking/Unlocking CPUs to Operate in Safety Mode or Performance Mode Without Rebooting |
US9405637B2 (en) * | 2011-01-18 | 2016-08-02 | Texas Instruments Incorporated | Locking/unlocking CPUs to operate in safety mode or performance mode without rebooting |
US10430205B2 (en) | 2011-01-18 | 2019-10-01 | Texas Instruments Incorporated | Locking/unlocking CPUs to operate in safety mode or performance mode without rebooting |
US20130227254A1 (en) * | 2012-02-29 | 2013-08-29 | Nathaniel McCallum | Differential stack-based symmetric co-routines |
US9483303B2 (en) * | 2012-02-29 | 2016-11-01 | Red Hat, Inc. | Differential stack-based symmetric co-routines |
Also Published As
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8516496B2 (en) | Storing contexts for thread switching | |
US20050033945A1 (en) | Dynamically changing the semantic of an instruction | |
US7840782B2 (en) | Mixed stack-based RISC processor | |
US8516502B2 (en) | Performing java interrupt with two program counters | |
US7360060B2 (en) | Using IMPDEP2 for system commands related to Java accelerator hardware | |
US7840784B2 (en) | Test and skip processor instruction having at least one register operand | |
EP1387253B1 (en) | Dynamic translation and execution of instructions within a processor | |
US20040024990A1 (en) | Processor that accommodates multiple instruction sets and multiple decode modes | |
US7634643B2 (en) | Stack register reference control bit in source operand of instruction | |
US8429383B2 (en) | Multi-processor computing system having a JAVA stack machine and a RISC-based processor | |
US7058765B2 (en) | Processor with a split stack | |
US7757067B2 (en) | Pre-decoding bytecode prefixes selectively incrementing stack machine program counter | |
US7162586B2 (en) | Synchronizing stack storage |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: TEXAS INSTRUMENTS INCORPORATED, TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CHAUVEL, GERARD;REEL/FRAME:016817/0214 Effective date: 20050718 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |