Cross-language compiler benchmarking: are we fast yet?

Marr, Stefan; Daloze, Benoit; Mössenböck, Hanspeter

doi:10.1145/2989225.2989232

Cited by 43 publications

(21 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section evaluates the run-time performance and trace sizes of our implementation in SOMns using the Savina benchmark suite for actors [17], and Acme-Air as an example for a web application. We also use the Are We Fast Yet benchmarks to provide a baseline for the SOMns performance [24].…”

Section: Discussionmentioning

confidence: 99%

Efficient and deterministic record & replay for actor languages

Aumayr

Marr

Béra

et al. 2018

Proceedings of the 15th International Conference on Managed Languages &Amp; Runtimes - ManLang '18

Self Cite

View full text Add to dashboard Cite

With the ubiquity of parallel commodity hardware, developers turn to high-level concurrency models such as the actor model to lower the complexity of concurrent software. However, debugging concurrent software is hard, especially for concurrency models with a limited set of supporting tools. Such tools often deal only with the underlying threads and locks, which obscures the view on e.g. actors and messages and thereby introduces additional complexity.To improve on this situation, we present a low-overhead record & replay approach for actor languages. It allows one to debug concurrency issues deterministically based on a previously recorded trace. Our evaluation shows that the average run-time overhead for tracing on benchmarks from the Savina suite is 10% (min. 0%, max. 20%). For Acme-Air, a modern web application, we see a maximum increase of 1% in latency for HTTP requests and about 1.4 MB/s of trace data. These results are a first step towards deterministic replay debugging of actor systems in production.

show abstract

Section: Discussionmentioning

confidence: 99%

Efficient and deterministic record & replay for actor languages

Aumayr

Marr

Béra

et al. 2018

Proceedings of the 15th International Conference on Managed Languages &Amp; Runtimes - ManLang '18

Self Cite

View full text Add to dashboard Cite

show abstract

“…Truffle [WW12] is a framework designed to ease the development of efficient interpreters on the JVM. Several works demonstrate the speedup offered by Truffle-based handcrafted interpreters [SWHJ16,MDM16]. This makes it appealing to explore its use in automatically optimized DSL interpreters.…”

Section: Trufflementioning

confidence: 99%

Automatic Generation of Truffle-based Interpreters for Domain-Specific Languages.

Leduc¹,

Jouneaux²,

Degueule³

et al. 2020

JOT

View full text Add to dashboard Cite

show abstract

“…In combination with the Graal just-in-time (JIT) compiler [50], languages implemented in Truffle can reach the peak performance of today's industrial-strength VMs [51], [52]. For instance, Graal.js, a JavaScript on top of Truffle reaches on average the same peak performance as V8 [53], [52] for a specific set of benchmarks. Truffle languages reach an average performance of about 2x slower than Java on HotSpot.…”

Section: Truffle and Graalmentioning

confidence: 99%

“…To analyze the inherent overhead we use a set of VM benchmarks designed for comparing different language implementations [52]. Since these benchmarks were originally designed for being run by a standard VM, this experiment measures the overhead of supporting reflective capabilities on the VM even if they are not used.…”

Section: Inherent Performancementioning

confidence: 99%

See 1 more Smart Citation

Fully Reflective Execution Environments: Virtual Machines for More Flexible Software

Chari

Garbervetsky

Marr

et al. 2019

IIEEE Trans. Software Eng.

Self Cite

View full text Add to dashboard Cite

VMs are complex pieces of software that implement programming language semantics in an efficient, portable, and secure way. Unfortunately, mainstream VMs provide applications with few mechanisms to alter execution semantics or memory management at run time. We argue that this limits the evolvability and maintainability of running systems for both, the application domain, e.g., to support unforeseen requirements, and the VM domain, e.g., to modify the organization of objects in memory. This work explores the idea of incorporating reflective capabilities into the VM domain and analyzes its impact in the context of software adaptation tasks. We characterize the notion of a fully reflective VM, a kind of VM that provides means for its own observability and modifiability at run time. This enables programming languages to adapt the underlying VM to changing requirements. We propose a reference architecture for such VMs and present TruffleMATE as a prototype for this architecture. We evaluate the mechanisms TruffleMATE provides to deal with unanticipated dynamic adaptation scenarios for security, optimization, and profiling aspects. In contrast to existing alternatives, we observe that TruffleMATE is able to handle all scenarios, using less than 50 lines of code for each, and without interfering with the application's logic.

show abstract

Cross-language compiler benchmarking: are we fast yet?

Abstract: The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the published version of record.

Cited by 43 publications

References 18 publications

Efficient and deterministic record & replay for actor languages

Efficient and deterministic record & replay for actor languages

Automatic Generation of Truffle-based Interpreters for Domain-Specific Languages.

Fully Reflective Execution Environments: Virtual Machines for More Flexible Software

Contact Info

Product

Resources

About