Optimization strategies for a java virtual machine interpreter on the cell broadband engine

Williams, Kathleen; Noll, Albert; Gal, Andreas; Gregg, David

doi:10.1145/1366230.1366265

Cited by 8 publications

(3 citation statements)

References 9 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is possible to further duplicate [55] handlers to get more BTB entries [23]. Recent work has also proposed new hardware support for indirect speculation [69] [63] or to directly address BTB entries [41]. Many JVMs mutate bytecode in-place [22] to replace symbolic references with indexes and offsets.…”

Section: Optimizing Fixed Format Interpretersmentioning

confidence: 99%

A fast in-place interpreter for WebAssembly

Titzer¹

2022

Preprint

View full text Add to dashboard Cite

WebAssembly (Wasm) is a compact, well-specified bytecode format that offers a portable compilation target with near-native execution speed. The bytecode format was specifically designed to be fast to parse, validate, and compile, positioning itself as a portable alternative to native code. It was pointedly not designed to be interpreted directly. Instead, design considerations at the time focused on competing with native code, utilizing optimizing compilers as the primary execution tier. Yet, in JIT scenarios, compilation time and memory consumption critically impact application startup, leading many Wasm engines to later deploy baseline (single-pass) compilers. Though faster, baseline compilers still take time and waste code space for infrequently executed code. A typical interpreter being infeasible, some engines resort to compiling Wasm not to machine code, but to a more compact, but easy to interpret format. This still takes time and wastes memory. Instead, we introduce in this article a fast in-place interpreter for WebAssembly, where no rewrite and no separate format is necessary. Our evaluation shows that in-place interpretation of Wasm code is space-efficient and fast, achieving performance on-par with interpreting a custom-designed internal format. This fills a hole in the execution tier space for Wasm, allowing for even faster startup and lower memory footprint than previous engine configurations.CCS Concepts: • Software and its engineering → Interpreters.

show abstract

Section: Optimizing Fixed Format Interpretersmentioning

confidence: 99%

A fast in-place interpreter for WebAssembly

Titzer¹

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Some of the more recent such research aims to effectively employ powerful dedicated and specialized co-processors like graphic cards. Notable VM designs in this direction are the CellVM [15], [30] for the Cell Broadband Engine, a VM with a distributed Java heap on a homogeneous TILE-64 system [28]; an extension of the JikesVM to detect and offload loops on CUDA devices [12]; and VMs for Intel's Larrabee GPGPU architecture [22]. Most of these designs are specific to VMs for Java-like languages which are based on a shared-memory concurrent programming model.…”

Section: Vm Support For High-level Concurrencymentioning

confidence: 99%

RELEASE: A High-Level Paradigm for Reliable Large-Scale Server Software

Boudeville

Cesarini²,

Chechina

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Erlang provides a fault-tolerant, reliable model for building concurrent, distributed system based on functional programming. In the RELEASE project the Erlang model is extended to Scalable Distributed Erlang -SD Erlang -supporting general-purpose computation in massively multicore systems. This paper outlines the RELEASE proposal, and indicates the progress of the project in its first six months.

show abstract

“…For the Cell BE, VM applicability has been evaluated. Besides porting and designing JVMs for this platform [29,37], some optimizations have been considered to utilize available computation power [5,45].…”

Section: Related Workmentioning

confidence: 99%

Virtual Machine Support for Many-Core Architectures: Decoupling Abstract from Concrete Concurrency Models

Marr

Haupt

Timbermont

et al. 2010

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The upcoming many-core architectures require software developers to exploit concurrency to utilize available computational power. Today's high-level language virtual machines (VMs), which are a cornerstone of software development, do not provide sufficient abstraction for concurrency concepts. We analyze concrete and abstract concurrency models and identify the challenges they impose for VMs. To provide sufficient concurrency support in VMs, we propose to integrate concurrency operations into VM instruction sets. Since there will always be VMs optimized for special purposes, our goal is to develop a methodology to design instruction sets with concurrency support. Therefore, we also propose a list of trade-offs that have to be investigated to advise the design of such instruction sets. As a first experiment, we implemented one instruction set extension for shared memory and one for non-shared memory concurrency. From our experimental results, we derived a list of requirements for a full-grown experimental environment for further research

show abstract

Optimization strategies for a java virtual machine interpreter on the cell broadband engine

Cited by 8 publications

References 9 publications

A fast in-place interpreter for WebAssembly

A fast in-place interpreter for WebAssembly

RELEASE: A High-Level Paradigm for Reliable Large-Scale Server Software

Virtual Machine Support for Many-Core Architectures: Decoupling Abstract from Concrete Concurrency Models

Contact Info

Product

Resources

About