A high performance cluster JVM presenting a pure single system image

Aridor, Yariv; Factor, Michael; Teperman, Avi; Eilam, Tamar; Schuster, Assaf

doi:10.1145/337449.337543

Cited by 20 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, automatic partitioning systems such as J-Orchestra do not change the runtime system, but only the application. Traditional DSM systems like Munin [Carter et al 1991], Orca [Bal et al 1998;Bal and Kaashoek 1993], and, in the Java world, cJVM [Aridor et al 1999[Aridor et al , 2000, and Java/DSM [Yu and Cox 1997] use a specialized runtime environment in order to detect access to remote data and ensure data consistency. Also, DSMs have usually focused on parallel applications and require programmer intervention to achieve high performance.…”

Section: Related Workmentioning

confidence: 99%

J-Orchestra

Tilevich

Smaragdakis

2009

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

J-Orchestra is a system that enhances centralized Java programs with distribution capabilities. Operating at the bytecode level, J-Orchestra transforms a centralized Java program (i.e., running on a single Java Virtual Machine (JVM)) into a distributed one (i.e., running across multiple JVMs). This transformation effectively separates distribution concerns from the core functionality of a program. J-Orchestra follows a semiautomatic transformation process. Through a GUI, the user selects program elements (at class granularity) and assigns them to network locations. Based on the user's input, the J-Orchestra backend automatically partitions the program through compiler-level techniques, without changes to the JVM or to the Java Runtime Environment (JRE) classes. By means of bytecode engineering and code generation, J-Orchestra substitutes method calls with remote method calls, direct object references with proxy references, etc. It also translates Java language features (e.g., static methods and fields, inheritance, inner classes, new object construction, etc.) for efficient distributed execution.We detail the main technical issues that J-Orchestra addresses, including its mechanism for program transformation in the presence of unmodifiable code (e.g., in JRE classes) and the translation of concurrency and synchronization constructs to work correctly over the network. We further discuss a case study of transforming a large, commercial, third-party application for efficient execution in a client server environment and outline the architectural characteristics of centralized programs that are amenable to automated distribution with J-Orchestra.Various aspects of the work described here were discussed in prior publications: Liogkas et al.

show abstract

Section: Related Workmentioning

confidence: 99%

J-Orchestra

Tilevich

Smaragdakis

2009

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

show abstract

“…This section presents systems that provide a shared-memory abstraction, through transparent changes made to the internals of the basic JVM, i.e., without modifying either the semantics or the syntax of Java. Two systems fall into this class: MultiJav [19], and cJVM [20][21][22]. Basically, these systems differ in the way that DSM is implemented.…”

Section: Environmentsmentioning

confidence: 99%

“…cJVM [20][21][22] has been developed at IBM Haifa Research Laboratory. cJVM supports the idea of SSI view of a cluster.…”

Section: Multijavmentioning

confidence: 99%

Java for high‐performance network‐based computing: a survey

Lobosco

Amorim

Loques

2002

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYThere has been an increasing research interest in extending the use of Java towards high-performance demanding applications such as scalable Web servers, distributed multimedia applications, and large-scale scientific applications. However, extending Java to a multicomputer environment and improving the low performance of current Java implementations pose great challenges to both the systems developer and application designer. In this survey, we describe and classify 14 relevant proposals and environments that tackle Java's performance bottlenecks in order to make the language an effective option for highperformance network-based computing. We further survey significant performance issues while exposing the potential benefits and limitations of current solutions in such a way that a framework for future research efforts can be established. Most of the proposed solutions can be classified according to some combination of three basic parameters: the model adopted for inter-process communication, language extensions, and the implementation strategy. In addition, where appropriate to each individual proposal, we examine other relevant issues, such as interoperability, portability, and garbage collection.

show abstract

“…c, WM [3,4] cJVM is a DSM system being developed by IBM Haifa. It achieves a single system image by modifying the JVM.…”

Section: Related Workmentioning

confidence: 99%

Implementation of a portable software DSM in Java

Sohda

Nakada²,

Matsuoka

2001

Proceedings of the 2001 Joint ACM-ISCOPE Conference on Java Grande

View full text Add to dashboard Cite

Rapid commoditization of advanced hardware and progress of networking technology is now making wide area high-performance computing a.k.a, the 'Grid' Computing a reality. Since a Grid will consist of vastly heterogeneous sets of compute nodes, especially commodity clusters, some have articulated the use of Java as a suitable technology to satisfy portability across different machines. Since Java's natural model of parallelism is shared memory multithreading, one will have to support distributed shared memory (DSM) in a portable manner; however, none of the previous work on implementing Java on DSM has been a portable solution. Instead, we propose a software architecture whose goal is to achieve portability of DSM implementations across different commodity clustering platforms, while restricting the programming model somewhat, and implemented a prototype system, JDSM. Benchmark resuits show that the current implementation on Java incurs increased memory coherency maintenance cost compared to C-based DSMs, thus limiting scalability to some degree, and we are currently working on a solution to alleviate this cost.

show abstract

A high performance cluster JVM presenting a pure single system image

Cited by 20 publications

References 15 publications

J-Orchestra

J-Orchestra

Java for high‐performance network‐based computing: a survey

Implementation of a portable software DSM in Java

Contact Info

Product

Resources

About