Academia.eduAcademia.edu

Figure 4 – uploaded by RICHARD LI

See full PDFdownloadDownload figure
Optimization conditions during synthesis: (1) FSM compiler (2) resource sharing. Table 4

Table 4 Optimization conditions during synthesis: (1) FSM compiler (2) resource sharing. Table 4

Related Figures (13)

Fig. 1. Operand descriptor format.
Fig. 1. Operand descriptor format.
Fig. 3. Different object structures and their relations. Each object has a unique o bject context and a reference always points to the base address of object header after the object is resolved. In an objec stored continuously and each context, all components are has a constant address offset to the object header, thus allowing the access of some com- ponents in parallel to reduce t object is accessed, the related from the operand descriptor he access overhead. When an operand descriptor is read table to verify whether the
Fig. 3. Different object structures and their relations. Each object has a unique o bject context and a reference always points to the base address of object header after the object is resolved. In an objec stored continuously and each context, all components are has a constant address offset to the object header, thus allowing the access of some com- ponents in parallel to reduce t object is accessed, the related from the operand descriptor he access overhead. When an operand descriptor is read table to verify whether the
Executing the Bytecode putfield in PicoJava II and jHISC Table 1 control to the invoked method. The more object contexts are switched, the more data are needed to push into the sys- tem stack. Generally, an internal method invocation only requires switching of the involved method contexts. A class method invocation requires one more, i.e., involved class context. And an instance method invocation requires switching of all the three kinds of contexts, namely involved method context, class context, and instance con- text. These are the reasons why we divide the Bytecode invokevirtual into the instructions ivkinternal and _ ivkin- stance to speed up its execution. method invocation occurs by asserting DoSometing(). The corresponding object context switches and the object structures are given in Fig. 4(b).
Executing the Bytecode putfield in PicoJava II and jHISC Table 1 control to the invoked method. The more object contexts are switched, the more data are needed to push into the sys- tem stack. Generally, an internal method invocation only requires switching of the involved method contexts. A class method invocation requires one more, i.e., involved class context. And an instance method invocation requires switching of all the three kinds of contexts, namely involved method context, class context, and instance con- text. These are the reasons why we divide the Bytecode invokevirtual into the instructions ivkinternal and _ ivkin- stance to speed up its execution. method invocation occurs by asserting DoSometing(). The corresponding object context switches and the object structures are given in Fig. 4(b).
Fig. 4. An internal method invocation (a) Java program (b) Object context switching.
Fig. 4. An internal method invocation (a) Java program (b) Object context switching.
Table 2
Table 2
Bytecodes implemented through software traps in jHISC Table 3
Bytecodes implemented through software traps in jHISC Table 3
Fig. 5. Block diagram of system architecture.
Fig. 5. Block diagram of system architecture.
Fig. 6. Pipeline control flow. In Fig. 5, the Instruction Queue & Translation unit con- sists of an instruction buffer, an instruction folding manag- er, and a stage controller. The instruction buffer is used to store the Bytecodes fetched from the instruction cache or external memory. The instruction folding manager classi- fies the Bytecodes in the instruction buffer according to heir opcodes and the type definitions, then checks their foldability, and converts the Bytecodes to the jHISC instructions by one to one or N to one. The folding model and algorithm are based on the EPOC model, which was proposed by Ton et al. [35,36]. For example, the Bytecode stream aload_4, getfield #5, istore_3 can be translated into he jHISC instruction gfld #5, R4, R3. Stage controller is used to control the whole stage of instruction pushing, pop- We synthesized the three systems with the same func- tional components under the consistent optimization con- ditions. Hence, we needed to delete the redundant logic in PicoJava II, such as Powerdown, Clock and Scan unit, and Floating-Point unit. The caches were generated by Xilinx CORE Generator and implemented by the internal block RAMs of FPGA in jHISC. As a result, the synthe- sized JOP core occupied 2271 LUTs (Look-Up Table), 13 block RAMs, and 21 32x1 ROMs in FPGA
Fig. 6. Pipeline control flow. In Fig. 5, the Instruction Queue & Translation unit con- sists of an instruction buffer, an instruction folding manag- er, and a stage controller. The instruction buffer is used to store the Bytecodes fetched from the instruction cache or external memory. The instruction folding manager classi- fies the Bytecodes in the instruction buffer according to heir opcodes and the type definitions, then checks their foldability, and converts the Bytecodes to the jHISC instructions by one to one or N to one. The folding model and algorithm are based on the EPOC model, which was proposed by Ton et al. [35,36]. For example, the Bytecode stream aload_4, getfield #5, istore_3 can be translated into he jHISC instruction gfld #5, R4, R3. Stage controller is used to control the whole stage of instruction pushing, pop- We synthesized the three systems with the same func- tional components under the consistent optimization con- ditions. Hence, we needed to delete the redundant logic in PicoJava II, such as Powerdown, Clock and Scan unit, and Floating-Point unit. The caches were generated by Xilinx CORE Generator and implemented by the internal block RAMs of FPGA in jHISC. As a result, the synthe- sized JOP core occupied 2271 LUTs (Look-Up Table), 13 block RAMs, and 21 32x1 ROMs in FPGA
Distribution of all operations Table 6
Distribution of all operations Table 6
Synthesized results
Synthesized results
Cycles needed by some main object and array manipulation Bytecodes
Cycles needed by some main object and array manipulation Bytecodes
Distribution of some object and array manipulation Bytecodes in the CaffeinMark
Distribution of some object and array manipulation Bytecodes in the CaffeinMark
Overall performance
Overall performance
Related topics:
Computer ScienceObject Oriented ProgrammingComputer HardwareLow Power ConsumptionEmbedded JavaElectrical and Electronic EngineeringEmbedded Device
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved