Edd Barrett

dblp:07/8898 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2017
0000-0001-7644-0748ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 4 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines › dynamic compilation
just-in-time compilation
0.312017
Virtual machine warmup blows hot and cold · Proc. ACM Program. Lang. 2017
Performance modeling and evaluation
benchmarking
0.312017
Virtual machine warmup blows hot and cold · Proc. ACM Program. Lang. 2017
Performance modeling and evaluation
statistical analysis
0.112017
Virtual machine warmup blows hot and cold · Proc. ACM Program. Lang. 2017

Methods — techniques the papers use, named apart from their topics

statistical analysis · 0.6changepoint analysis · 0.6
YearPublicationVenuePosition
2017 Virtual machine warmup blows hot and cold
abstract
Virtual Machines (VMs) with Just-In-Time (JIT) compilers are traditionally thought to execute programs in two phases: the initial warmup phase determines which parts of a program would most benefit from dynamic compilation, before JIT compiling those parts into machine code; subsequently the program is said to be at a steady state of peak performance. Measurement methodologies almost always discard data collected during the warmup phase such that reported measurements focus entirely on peak performance. We introduce a fully automated statistical approach, based on changepoint analysis, which allows us to determine if a program has reached a steady state and, if so, whether that represents peak performance or not. Using this, we show that even when run in the most controlled of circumstances, small, deterministic, widely studied microbenchmarks often fail to reach a steady state of peak performance on a variety of common VMs. Repeating our experiment on 3 different machines, we found that at most 43.5% of pairs consistently reach a steady state of peak performance.
Edd Barrett, Carl Friedrich Bolz-Tereick, Rebecca Killick, Sarah Mount, Laurence Tratt
Proc. ACM Program. Lang.1
2016 Fine-grained Language Composition: A Case Study
abstract
Although run-time language composition is common, it normally takes the form of a crude Foreign Function Interface (FFI). While useful, such compositions tend to be coarse-grained and slow. In this paper we introduce a novel fine-grained syntactic composition of PHP and Python which allows users to embed each language inside the other, including referencing variables across languages. This composition raises novel design and implementation challenges. We show that good solutions can be found to the design challenges; and that the resulting implementation imposes an acceptable performance overhead of, at most, 2.6x.
Edd Barrett, Carl Friedrich Bolz-Tereick, Lukas Diekmann, Laurence Tratt
ECOOP1
2015 Approaches to interpreter composition
abstract
In this paper, we compose six different Python and Prolog VMs into 4 pairwise compositions: one using C interpreters, one running on the JVM, one using meta-tracing interpreters, and one using a C interpreter and a meta-tracing interpreter. We show that programs that cross the language barrier frequently execute faster in a meta-tracing composition, and that meta-tracing imposes a significantly lower overhead on composed programs relative to mono-language programs.
Edd Barrett, Carl Friedrich Bolz-Tereick, Laurence Tratt
Comput. Lang. Syst. Struct.1
2012 Range Analysis of Binaries with Minimal Effort
Edd Barrett, Andy King
FMICS1