Skip to Main content Skip to Navigation
Conference papers

Compiling multithreaded Java bytecode for distributed execution

Abstract : Our work combines Java compilation to native code with a run-time 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 concurrency 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 network protocols 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 network protocols: SISCI/SCI and MPI-BIP/Myrinet.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Gabriel Antoniu Connect in order to contact the contributor
Submitted on : Monday, February 7, 2011 - 10:48:41 AM
Last modification on : Saturday, September 11, 2021 - 3:17:43 AM
Long-term archiving on: : Sunday, May 8, 2011 - 2:55:28 AM


Publisher files allowed on an open archive




Gabriel Antoniu, Luc Bougé, Philip Hatcher, Mark Macbeth, Keith Mcguigan, et al.. Compiling multithreaded Java bytecode for distributed execution. Euro-Par 2000: Parallel Processing, Aug 2000, Munchen, Germany. pp.1039-1052, ⟨10.1007/3-540-44520-X_148⟩. ⟨inria-00563684⟩



Les métriques sont temporairement indisponibles