<--- Back to Details
First PageDocument Content
Assembly languages / Compiler optimizations / Instruction scheduling / Instruction-level parallelism / Very long instruction word / Java bytecode / Speculative execution / Instruction set / INT / Computer architecture / Computing / Computer engineering
Date: 2003-07-07 12:15:52
Assembly languages
Compiler optimizations
Instruction scheduling
Instruction-level parallelism
Very long instruction word
Java bytecode
Speculative execution
Instruction set
INT
Computer architecture
Computing
Computer engineering

Journal of Instruction Level Parallelism[removed]Submitted 10/02; Accepted 04/03

Add to Reading List

Source URL: www.jilp.org

Download Document from Source Website

File Size: 187,58 KB

Share Document on Facebook

Similar Documents

Computing / Software engineering / Computer programming / Concurrent programming languages / High-level programming languages / Type theory / Programming languages / Program analysis / Java virtual machine / Type system / Go / Java

A Specification of Java Loading and Bytecode Verification Allen Goldberg Kestrel Institute 3260 Hillview Av. Palo Alto, CA 94304

DocID: 1xUOd - View Document

Aachen Department of Computer Science Technical Report Modular Termination Proofs of Recursive Java Bytecode Programs

DocID: 1t6jP - View Document

JaBEE - Framework for Object-oriented Java Bytecode Compilation and Execution on Graphics Processor Units Wojciech Zaremba Yuan Lin

DocID: 1sleh - View Document

Fakultät Informatik Institut für Technische Informatik, Professur für VLSI-Entwurfssysteme, Diagnostik und Architektur APPLICATION REQUIREMENTS AND EFFICIENCY OF EMBEDDED JAVA BYTECODE MULTI-CORES JTRES 2010

DocID: 1rRT9 - View Document

Theoretical computer science / Computing / Software engineering / Logic in computer science / Automated theorem proving / Static program analysis / Termination analysis / Rewriting / KeY / Automated reasoning / Bytecode / Christoph Walther

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

DocID: 1rrok - View Document