Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Christopher Hodsdon

dblp:188/9937 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2026
0009-0004-9480-230XORCID · reported

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

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 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
2 papers
Distributed systems · 100%
Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
consensus
1.012026
Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation · EuroSys 2026
Distributed systems › consensus
geo-distributed consensus
1.012026
Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation · EuroSys 2026
Distributed systems
replication
1.012026
Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation · EuroSys 2026
Distributed systems › replication
state machine replication
1.012026
Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation · EuroSys 2026
Distributed systems › fault tolerance › failure models
crash failures
0.312026
Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation · EuroSys 2026
Distributed systems
fault tolerance
0.312026
Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation · EuroSys 2026
Transaction processing and concurrency control › transaction models
read-only transaction
0.212016
The SNOW Theorem and Latency-Optimal Read-Only Transactions · OSDI 2016
Distributed systems
consistency models
0.212016
The SNOW Theorem and Latency-Optimal Read-Only Transactions · OSDI 2016

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

counterfactual evaluation · 1.0
YearPublicationVenuePosition
2026 Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation
abstract
Geo-distributed replicated state machines (RSMs) are at the heart of many production distributed systems, offering linearizability and fault tolerance via consensus protocols. Most existing protocols target crash fault tolerance, however, and are vulnerable to fail-slow faults, where a single slow replica can significantly degrade system latency. Existing protocols that tolerate fail-slow faults do so with much higher normal-case latency in geo-distributed settings.
Christopher Hodsdon, Zijian Qin, Khiem Ngo, Siddhartha Sen 0001, Ethan Katz-Bassett, Wyatt Lloyd
EuroSys1
2016 The SNOW Theorem and Latency-Optimal Read-Only Transactions
Haonan Lu, Christopher Hodsdon, Khiem Ngo, Shuai Mu 0001, Wyatt Lloyd
OSDI2