Efficiently Adapting Java Binaries in Limited Memory Contexts

DMCA

Efficiently Adapting Java Binaries in Limited Memory Contexts

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Pramod G. Joisha , Samuel P. Midkiff , Mauricio J. Serrano , Manish Gupta

BibTeX

@MISC{Joisha_efficientlyadapting,
    author = {Pramod G. Joisha and Samuel P. Midkiff and Mauricio J. Serrano and Manish Gupta},
    title = {Efficiently Adapting Java Binaries in Limited Memory Contexts},
    year = {}
}

OpenURL

Abstract

This paper presents a compilation framework that allows executable code to be shared across different Java Virtual Machine (JVM) instances. All fully compliant JVMs that target servers rely on run-time compilation, since dynamic Java features prevent a static compiler from being fully Java compatible. These JVMs are burdened with large memory footprints (because of the size of the increasingly complicated compilers) and high startup costs. Fully compliant JVMs on handheld devices often rely on interpretation—since the overhead of an on-device compiler cannot be supported—and therefore suffer from slower execution speeds and increased energy costs. Quasi-static compilation was proposed as a solution to these difficulties by reusing precompiled binary images after performing validation checks and adapting them to a new execution context, falling back to interpretation or dynamic compilation only when necessary to maintain Java semantics. Our previous quasi-static system required that the executable binary be duplicated and modified during adaptation to the new execution context. This is a major burden both for scalable servers and embedded systems. In this paper, we describe a new approach that allows this adaptation to be done on an indirection table, leaving the executable code unmodified. On embedded devices, this allows the executable to be stored in ROM with only the much smaller indirection table being written to writable memory. On scalable servers, this allows a single image of the executable to be shared by multiple JVMs, improving scalability. Furthermore, we describe a technique for dynamically linking classes that uses traps to detect when a class should be linked and initialized, rather than explicit run-time tests and code modification. We ∗ This work was done while the authors were at the IBM T. J. Watson Research Center

Keyphrases

limited memory context adapting java binary indirection table scalable server new execution context executable code run-time test major burden run-time compilation compilation framework new approach single image java semantics on-device compiler cannot multiple jvms high startup cost handheld device dynamic compilation compliant jvms static compiler embedded device energy cost dynamic java watson research center fully compliant jvms large memory footprint writable memory execution speed validation check code modification previous quasi-static system quasi-static compilation target server precompiled binary image different java virtual machine

DMCA