Jochen Eisinger

dblp:75/3685 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2018
—ORCID · none

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

Software engineering, systems software and programming languages · 5 · 1 first-authorTheory of computation · 3 · 2 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.

Software engineering, system software, and programming languages
2 papers
Runtime systems and virtual machines · 60% Operating systems · 40%
Theoretical computer science
2 papers
Logic in computer science · 59% Automated reasoning and model checking · 22% Automata and formal languages · 19%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines
garbage collection
0.622018
Cross-component garbage collection · Proc. ACM Program. Lang. 2018
Idle time garbage collection scheduling · PLDI 2016
Operating systems › resource management
memory management
0.312018
Cross-component garbage collection · Proc. ACM Program. Lang. 2018
Runtime systems and virtual machines
managed runtime
0.112016
Idle time garbage collection scheduling · PLDI 2016
Automata and formal languages
automata-based reasoning
0.112006
Don't Care Words with an Application to the Automata-Based Approach for Real Addition · CAV 2006
Logic in computer science
first-order logic
0.112006
Don't Care Words with an Application to the Automata-Based Approach for Real Addition · CAV 2006
Logic in computer science › model theory
real addition
0.112006
Don't Care Words with an Application to the Automata-Based Approach for Real Addition · CAV 2006

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

heap snapshot analysis · 0.3cross-component tracing algorithm · 0.3frame time discrepancy metric · 0.2concurrent garbage collection · 0.2satisfiability modulo theories · 0.1quantifier elimination · 0.1automata-based approach · 0.1
YearPublicationVenuePosition
2018 Cross-component garbage collection
abstract
Embedding a modern language runtime as a component in a larger software system is popular these days. Communication between these systems often requires keeping references to each others' objects. In this paper we present and discuss the problem of cross-component memory management where reference cycles across component boundaries may lead to memory leaks and premature reclamation of objects may lead to dangling cross-component references. We provide a generic algorithm for effective, efficient, and safe garbage collection over component boundaries, which we call cross-component tracing. We designed and implemented cross-component tracing in the Chrome web browser where the JavaScript virtual machine V8 is embedded into the rendering engine Blink. Cross-component tracing from V8's JavaScript heap to Blink's C++ heap improves garbage collection latency and eliminates long-standing memory leaks for real websites in Chrome. We show how cross-component tracing can help web developers to reason about reachability and retainment of objects spanning both V8 and Blink components based on Chrome's heap snapshot memory tool. Cross-component tracing was enabled by default for all websites in Chrome version 57 and is also deployed in other widely used software systems such as Opera, Cobalt, and Electron.
Ulan Degenbaev, Jochen Eisinger, Kentaro Hara, Marcel Hlopko, Michael Lippautz, Hannes Payer
Proc. ACM Program. Lang.2
2016 Idle time garbage collection scheduling
abstract
Efficient garbage collection is increasingly important in today's managed language runtime systems that demand low latency, low memory consumption, and high throughput. Garbage collection may pause the application for many milliseconds to identify live memory, free unused memory, and compact fragmented regions of memory, even when employing concurrent garbage collection. In animation-based applications that require 60 frames per second, these pause times may be observable, degrading user experience. This paper introduces idle time garbage collection scheduling to increase the responsiveness of applications by hiding expensive garbage collection operations inside of small, otherwise unused idle portions of the application's execution, resulting in smoother animations. Additionally we take advantage of idleness to reduce memory consumption while allowing higher memory use when high throughput is required. We implemented idle time garbage collection scheduling in V8, an open-source, production JavaScript virtual machine running within Chrome. We present performance results on various benchmarks running popular webpages and show that idle time garbage collection scheduling can significantly improve latency and memory consumption. Furthermore, we introduce a new metric called frame time discrepancy to quantify the quality of the user experience and precisely measure the improvements that idle time garbage collection provides for a WebGL-based game benchmark. Idle time garbage collection is shipped and enabled by default in Chrome.
Ulan Degenbaev, Jochen Eisinger, Manfred Ernst, Ross McIlroy, Hannes Payer
PLDI2
2008 Don't care words with an application to the automata-based approach for real addition
Jochen Eisinger, Felix Klaedtke
Formal Methods Syst. Des.1
2007 Mechanizing the Powerset Construction for Restricted Classes of omega -Automata
Christian Dax, Jochen Eisinger, Felix Klaedtke
ATVA2
2007 LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals
Bernd Becker 0001, Christian Dax, Jochen Eisinger, Felix Klaedtke
CAV3
2006 Don't Care Words with an Application to the Automata-Based Approach for Real Addition
Jochen Eisinger, Felix Klaedtke
CAV1