Compiling multithreaded Java bytecode for distributed execution - Archive ouverte HAL Access content directly
Conference Papers Year : 2000

Compiling multithreaded Java bytecode for distributed execution

(1) , (1) , (2) , (2) , (2) , (1)


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.
Fichier principal
Vignette du fichier
Europar2000.pdf (213.76 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

inria-00563684 , version 1 (07-02-2011)



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⟩
102 View
349 Download



Gmail Facebook Twitter LinkedIn More