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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Khiem Ngo

dblp:189/0001 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0003-6776-1314ORCID · corroborated

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

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-authorSecurity and privacy · 1 · 1 first-author · 1 since 2021

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
3 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
replication
1.422026
Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation · EuroSys 2026
Tolerating Slowdowns in Replicated State Machines using Copilots · OSDI 2020
Distributed systems › replication
state machine replication
1.422026
Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation · EuroSys 2026
Tolerating Slowdowns in Replicated State Machines using Copilots · OSDI 2020
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
fault tolerance
0.422026
Avicenna: Masking Slowdowns in Replicated State Machines with Counterfactual Evaluation · EuroSys 2026
Tolerating Slowdowns in Replicated State Machines using Copilots · OSDI 2020
Distributed systems › fault tolerance › failure models
crash failures
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.0slowdown tolerance · 0.4copilots · 0.4
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
EuroSys3
2021 K2: Reading Quickly from Storage Across Many Datacenters
abstract
The infrastructure available to large-scale and medium-scale web services now spans dozens of geographically dispersed datacenters. Deploying across many datacenters has the potential to significantly reduce end-user latency by serving users nearer their location. However, deploying across many datacenters requires the backend storage system be partially replicated. In turn, this can sacrifice the low latency benefits of many datacenters, especially when a storage system provides guarantees on what operations will observe. We present the K2 storage system that provides lower latency for large-scale and medium-scale web services using partial replication of data over many datacenters with strong guarantees: causal consistency, read-only transactions, and write-only transactions. K2 provides the best possible worst-case latency for partial replication, a single round trip to remote datacenters, and often avoids sending any requests to far away datacenters using a novel replication approach, write-only transaction algorithm, and read-only transaction algorithm.
Khiem Ngo, Haonan Lu, Wyatt Lloyd
DSN1
2020 Tolerating Slowdowns in Replicated State Machines using Copilots
Khiem Ngo, Siddhartha Sen 0001, Wyatt Lloyd
OSDI1
2016 The SNOW Theorem and Latency-Optimal Read-Only Transactions
Haonan Lu, Christopher Hodsdon, Khiem Ngo, Shuai Mu 0001, Wyatt Lloyd
OSDI3