The Hyperion system: Compiling multithreaded Java bytecode for distributed execution

Abstract

A preliminary version of this work has been presented as a Distinguished Paper at the Euro-Par 2000 Conference, Munich, Germany, August 2000.International audienceOur work combines Java compilation to native code with a runtime library that executes Java threads in a distributed memory environment. This allows a Java programmer to view a cluster of processors as executing a single JAVA virtual machine. The separate processors are simply resources for executing Java threads with true parallelism, and the run-time system provides the illusion of a shared memory on top of the private memories of the processors. The environment we present is available on top of several UNIX systems and can use a large variety of communication interfaces thanks to the high portability of its run time system. To evaluate our approach, we compare serial C, serial Java, and multithreaded Java implementations of a branch and-bound solution to the minimal-cost map-coloring problem. All measurements have been carried out on two platforms using two different communication interfaces: SISCI/SCI and MPI BIP/Myrinet

An Annotation-Based Framework for Parallel Computing

“…Examples are cJVM [8], Hyperion [9], Jakal [10] and JESSICA2 [11]. These approaches rely on the Java thread model to introduce concurrency into sequential applications.…”

A Platform-Independent Distributed Runtime for Standard Multithreaded Java

“…(1−9) Some works (2,8,9) install a customized cluster-aware JVM on each participating node. Others, such as (1) and, (7) compile the code of a given application into native machine code while adding distributed shared memory (DSM) capabilities. Both these approaches sacrifice one of the most important features of Java: the cross-platform portability.…”

Optimizing Java-Specific Overheads: Java at the Speed of C?

“…Modern JVMs come with a just-in-time compiler (JIT) that combines Java's platform independence with improved application speed [4]. A more radical approach is to completely avoid byte-code interpretation by statically compiling byte code to executable programs [1,7,12]. Combinations of JIT and static compilation are also possible [11].…”