Compiling Multithreaded Java Bytecode for Distributed Execution (Distinguished Paper)

Authors:
Gabriel Antoniu;Luc Bougé;Philip J. Hatcher;Mark MacBeth;Keith McGuigan;Raymond Namyst
Affiliations:
-;-;-;-;-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 7
Cited 2

Active messages: a mechanism for integrated communication and computation

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
The Java Language Specification

The Java Language Specification
A Framework for Parallel Programming in JAVA

HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Efficient Communications in Multithreaded Runtime Systems

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
cJVM: A Single System Image of a JVM on a Cluster

ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Harissa: a flexible and efficient java environment mixing bytecode and compiled code

COOTS'97 Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3
Toba: java for applications a way ahead of time (WAT) compiler

COOTS'97 Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3

Lithium: A Structured Parallel Programming Environment in Java

ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Remote Object Detection in Cluster-Based Java

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

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.