This paper describes some recent research on PVM (Parallel Virtual Machine). One of the new features added in PVM 3.0 is multiprocessor integration. This is the ability to run PVM applications on the nodes of several diierent distributed memory multiprocessors as though they constitute one large parallel computer. We describe how multiprocessor integration is accomplished in PVM 3.0 and illustr...

This paper describes the design, implementation, and experimental evaluation of a modular and extensible Java r © Virtual Machine (JVM) infrastructure, called Jupiter. The infrastructure is intended to serve as a vehicle for our research on scalable JVM architectures for a 128-processor cluster of PC workstations, with support for shared memory in software. Jupiter is constructed, using a build...

Using clusters of workstations is becoming a very popular method to solve both large and small scientiic problems. One of the driving forces behind this shift is the availability of portable robust software to utilize and manage a cluster of workstations. PVM (Parallel Virtual Machine) is a byproduct of the heterogeneous network research project going on at Oak Ridge National Laboratory and Uni...

Integrated circuit technology has enabled computers to have increasingly large physical memories. Existing memory management techniques partition this memory into blocks or`pages' of approximately 4,000 characters in size. However, as the size of physical memory increases , managing an increasingly large number of these pages becomes time-consuming and hence a source of computer system ineecien...

Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scanning is particularly difficult within an incremental garbage collector that needs to be deterministic or give hard realtime guarantees. Here, a method that allows exact root scanning is presented. The basic idea is to ...

Multiple virtual machine (VM) workloads are increasingly common, given the growth of managed enterprise application systems and consolidated virtual servers. Until now, there has been no principled approach to partitioning memory resource between multiple co-located VMs. In this paper, we develop a general framework for multi-VM heap sizing, based on the principle of utility maximization from m...

The rising interest in Java for High Performance Computing (HPC) is based on the appealing features of this language for programming multi-core cluster architectures, particularly the built-in networking and multithreading support, and the continuous increase in Java Virtual Machine (JVM) performance. However, its adoption in this area is being delayed by the lack of analysis of the existing pr...

This paper describes the design and presents the preliminary performance evaluation of JavaSplit, a portable runtime for distributed execution of multithreaded Java programs. JavaSplit transparently distributes threads and objects of an application among the participating nodes. Thus, it gains augmented computational power and increased memory capacity without modifying the Java multithreaded p...

We propose exposing best-effort atomic execution, as provided by a simple hardware transactional memory (HTM), in a managed runtime’s bytecode interface. Dynamic language implementations built on such a runtime can generate more efficient, code, using speculation to eliminate the overhead and obstructions to optimization incurred by code needed to preserve rarely used language semantics. In thi...