usenix conference policies
Deterministic Execution of Java's Primitive Bytecode Operations
Abstract:
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 difficulties 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 difficulties has been implemented and its performance has been analysed.
BibTeX
@inproceedings {271005,
author = {Fridtjof Siebert and Andy Walter},
title = {Deterministic Execution of Java{\textquoteright}s Primitive Bytecode Operations},
booktitle = {Java (TM) Virtual Machine Research and Technology Symposium (JVM 01)},
year = {2001},
address = {Monterey, CA},
url = {https://www.usenix.org/conference/jvm-01/deterministic-execution-javas-primitive-bytecode-operations},
publisher = {USENIX Association},
month = apr
}
author = {Fridtjof Siebert and Andy Walter},
title = {Deterministic Execution of Java{\textquoteright}s Primitive Bytecode Operations},
booktitle = {Java (TM) Virtual Machine Research and Technology Symposium (JVM 01)},
year = {2001},
address = {Monterey, CA},
url = {https://www.usenix.org/conference/jvm-01/deterministic-execution-javas-primitive-bytecode-operations},
publisher = {USENIX Association},
month = apr
}
connect with us