Demo Data from VLDB 2026 / reviewers in the wild / expert
Martin Küttler
dblp:188/9204
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2Systems, architecture and hardware · 1 · 1 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 |
Distributed systems · 83% High-performance computing · 17% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
fault tolerance |
0.4 | 1 | 2019 | Corrected trees for reliable group communication · PPoPP 2019 |
Distributed systems › consensus › byzantine broadcast
fault-tolerant broadcast |
0.4 | 1 | 2019 | Corrected trees for reliable group communication · PPoPP 2019 |
Distributed systems › group communication
reliable group communication |
0.4 | 1 | 2019 | Corrected trees for reliable group communication · PPoPP 2019 |
High-performance computing
collective communication |
0.1 | 1 | 2019 | Corrected trees for reliable group communication · PPoPP 2019 |
High-performance computing
supercomputing |
0.1 | 1 | 2019 | Corrected trees for reliable group communication · PPoPP 2019 |
Methods — techniques the papers use, named apart from their topics
logp-based simulation · 0.4graph-theoretic renumbering · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Corrected trees for reliable group communicationabstractDriven by ever increasing performance demands of compute-intensive applications, supercomputing systems comprise more and more nodes. This growth is a significant burden for fast group communication primitives and also makes those systems more susceptible to failures of individual nodes. In this paper we present a two-phase fault-tolerant scheme for group communication. Using broadcast as an example, we provide a full-spectrum discussion of our approach --- from a formal analysis to LogP-based simulations to a message-passing-based implementation running on a large cluster. Ultimately, we are able to reduce the complex problem of reliable and fault-tolerant collective group communication to a graph theoretical renumbering problem. Both, simulations and measurements, show our solution to achieve a latency reduction of 50% with up to six times fewer messages sent in comparison to existing schemes. Martin Küttler, Maksym Planeta, Jan Bierbaum, Carsten Weinhold, Hermann Härtig, Amnon Barak, Torsten Hoefler |
PPoPP | 1 |
| 2019 | Configuration of inter-process communication with probabilistic model checking
Linda Herrmann, Martin Küttler, Tobias Stumpf, Christel Baier, Hermann Härtig, Sascha Klüppelholz |
Int. J. Softw. Tools Technol. Transf. | 2 |
| 2017 | Towards Automated Configuration of Systems with Non-Functional ConstraintsabstractThe paper reports on first steps towards a systematic design process that ensures quantitative stochastic requirements like requirements on the expected energy consumption or resilience requirements by construction. The idea is to automatically extract a formal model from a configurable system and to use formal analysis techniques to automatically determine a configuration such that the system meets the quantitative requirements. As a proof of concept we present a tool that supports the automated synthesis of protocol parameters for IPC (interprocess communication). The tool takes as input a Lua script describing the communication structure of several processes. This script is annotated with quantitative information such as error probabilities and timing information. The output is a Markov chain specified in the input language of the prominent probabilistic model checker PRISM. This Markov chain yields the basis for quantitative formal analysis of failure scenarios caused by hardware faults in IPC channels. The results yield the basis for finding optimal values for protocol parameters that tune, e.g., the level of resiliency. As an initial demonstration of the tool, we analyze and adjust system parameters of a simple scenario with a few communicating processes and report on results. Though achieved under simplified assumptions, the results presented here are a proof-of-concept towards the vision of automated system configuration. Linda Herrmann, Martin Küttler, Tobias Stumpf, Christel Baier, Hermann Härtig, Sascha Klüppelholz |
HotOS | 2 |