JVM 2001 Abstract
Deterministic Execution of Java's Primitive Bytecode Operations
Fridtjof Siebert, University of Karlsruhe, and Andy Walter, Forschungszentrum Informatik (FZI)
For the application of Java in realtime and safety critical domains, an
analysis of the worst-case execution times of primitive Java operations
is necessary. All primitive operations must either execute in constant
time or have a reasonable upper bound for their execution time. The
that arise for a Java virtual machine and a Java compiler in this context
will be presented here. This includes the implementation of Java’s class
and interface model, class initialization, monitors and automatic memory
management. A new Java virtual machine and compiler that solves these
has been implemented and its performance has been analysed.
- View the full text of this paper in
HTML form and
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
- To become a USENIX Member, please see our Membership Information.