Demo Data from EDBT 2026 / reviewers in the wild / expert
Christopher Bahn
dblp:161/0130
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
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 · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
distributed coordination |
0.2 | 1 | 2015 | Extensible distributed coordination · EuroSys 2015 |
Distributed systems › distributed algorithms
distributed synchronization |
0.2 | 1 | 2015 | Extensible distributed coordination · EuroSys 2015 |
Methods — techniques the papers use, named apart from their topics
dynamic extension · 0.2access control · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Extensible distributed coordinationabstractMost services inside a data center are distributed systems requiring coordination and synchronization in the form of primitives like distributed locks and message queues. We argue that extensibility is a crucial feature of the coordination infrastructures used in these systems. Without the ability to extend the functionality of coordination services, applications might end up using sub-optimal coordination algorithms, possibly leading to low performance. Adding extensibility, however, requires mechanisms that constrain extensions to be able to make reasonable security and performance guarantees. We propose a scheme that enables extensions to be introduced and removed dynamically in a secure way. To avoid performance overheads due to poorly designed extensions, it constrains the access of extensions to resources. Evaluation results for extensible versions of ZooKeeper and DepSpace show that it is possible to increase the throughput of a distributed queue by more than an order of magnitude (17x for ZooKeeper, 24x for DepSpace) while keeping the underlying coordination kernel small. Tobias Distler, Christopher Bahn, Alysson Neves Bessani, Frank Fischer 0004, Flavio Paiva Junqueira |
EuroSys | 2 |