The Jikes Research Virtual Machine project: Building an open-source research community

Alpern, Bowen; Augart, S.; Blackburn, Stephen M.; Butrico, Maria; Cocchi, Anthony; Cheng, Perry; Dolby, Julian; Fink, Stephen J.; Grove, David; Hind, Michael; McKinley, Kathryn S.; Mergen, Mark; Moss, J. Eliot B.; Ngo, Tram A.; Sarkar, Vivek; Trapp, Marcus

doi:10.1147/sj.442.0399

Cited by 206 publications

(125 citation statements)

References 16 publications

Supporting

Mentioning

122

Contrasting

Unclassified

Order By: Relevance

“…During simulation, multiprogrammed workloads are run within a Java virtual machine, ported from the Jikes RVM [1], ensuring each single benchmark is executed within a single processor core in the simulator. The benchmarks chosen exhibit varying cache utility profiles, with three benchmarks fitting into each of the categories, high-utility (ft, heap, mg), low-utility (sor, sparse, series), and saturating-utility (crypt, cg, lu), as described in Section II.…”

Section: Experimental Methodologymentioning

confidence: 99%

An adaptive bloom filter cache partitioning scheme for multicore architectures

Nikas

Horsnell

Garside

2008

2008 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation

View full text Add to dashboard Cite

Abstract-This paper investigates the problem of partitioning the last-level shared cache of multicore architectures. Contention for such a shared resource has been shown to severely degrade performance when running multiple applications. As architectures incorporate more cores, multiple application workloads become increasingly attractive, further exacerbating contention at the last-level cache. Today, cache replacement policies, extensively studied for uniprocessor systems, are being employed within new multicore architectures with little, if any, adaptation. However the parameters in these new systems are likely to be different. The least recently used (LRU) policy, for example, which is widely accepted as the best replacement policy in uniprocessor caches, often results in poor resource sharing in a multicore system, signalling the importance of reevaluating the effectiveness of these policies in the new architectures. This paper proposes Adaptive Bloom Filter Cache Partitioning (ABFCP), a low-cost, dynamic cache partitioning mechanism capable of better resource sharing at the last-level cache than LRU, improving the performance of an eight-core system on average by 5.92% over the LRU policy. Moreover, the proposed scheme provides the equivalent performance benefits that could be gained from almost a 50% increase in the last-level cache and shows increasing benefit as the number of cores rises.

show abstract

Section: Experimental Methodologymentioning

confidence: 99%

An adaptive bloom filter cache partitioning scheme for multicore architectures

Nikas

Horsnell

Garside

2008

2008 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation

View full text Add to dashboard Cite

show abstract

“…ByteSTM is built by modifying Jikes RVM (version 3.1.2) [3] using the Optimizing compiler. Jikes RVM has two types of compilers: the Optimizing compiler and the Baseline compiler.…”

Section: Design and Implementationmentioning

confidence: 99%

ByteSTM: Virtual Machine-Level Java Software Transactional Memory

Mohamedin

Ravindran

Palmieri

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present ByteSTM, a virtual machine-level Java STM implementation that is built by extending the Jikes RVM. ByteSTM implements two STM algorithms, TL2 and RingSTM. We modify Jikes RVM's Optimizing compiler to transparently support implicit transactions. Being implemented at the VM-level, it accesses memory directly and handles memory uniformly, and avoids Java garbage collection by manually managing memory for transactional metadata. Our experimental studies reveal throughput improvement over other non-VM STMs in the range of 7%-66% on micro-benchmarks and 7%-76% on macro-benchmarks.

show abstract

“…Our method is implemented in the JikesRVM open source JIT compiler for Java [4], and evaluated on x86. We do believe that it would be easy to port it to multi-language JIT frameworks like the ECMA-335 CLI standard.…”

Section: Outline Of the Papermentioning

confidence: 99%

“…We implemented split register allocation in JikesRVM version 3.0.1 [4], relying on CPLEX 3 for the offline resolution of optimal allocation problems.…”

Section: Experimental Evaluationmentioning

confidence: 99%

Split Register Allocation: Linear Complexity Without the Performance Penalty

Diouf

Cohen

Rastello

et al. 2010

High Performance Embedded Architectures and Compilers

View full text Add to dashboard Cite

Abstract. Just-in-time compilers are becoming ubiquitous, spurring the design of more efficient algorithms and more elaborate intermediate representations. They rely on continuous, feedback-directed (re-)compilation frameworks to adaptively select a limited set of hot functions for aggressive optimization. To date, (quasi-)linear complexity has remained a driving force in the design of just-in-time optimizers. This paper describes a split register allocator showing that linear complexity does not imply reduced code quality. We present a split compiler design, where more expensive ahead-of-time analyses guide lightweight just-in-time optimizations. A split register allocator can be very aggressive in its offline stage, producing a semantic summary through bytecode annotations that can be processed by a lightweight online stage. The challenges are fourfold: (sub-)linear-size annotation, linear-time online processing, and minimal loss of code quality, portability of the annotation. We propose a split register allocator meeting these challenges. A compact annotation derived from an optimal integer linear program (ILP) formulation of register allocation drives a linear-time algorithm near optimality. We study the robustness of this algorithm to variations in the number of physical registers. Our method is implemented in JikesRVM and evaluated on standard benchmarks.

show abstract

The Jikes Research Virtual Machine project: Building an open-source research community

Cited by 206 publications

References 16 publications

An adaptive bloom filter cache partitioning scheme for multicore architectures

An adaptive bloom filter cache partitioning scheme for multicore architectures

ByteSTM: Virtual Machine-Level Java Software Transactional Memory

Split Register Allocation: Linear Complexity Without the Performance Penalty

Contact Info

Product

Resources

About