Demo Data from VLDB 2026 / reviewers in the wild / expert
Neo Zhou
dblp:303/0361
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2023
0009-0001-9006-0116ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 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
1 paper |
Distributed systems · 91% Cloud and datacenter computing · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
consensus |
0.5 | 1 | 2021 | Rabia: Simplifying State-Machine Replication Through Randomization · SOSP 2021 |
Distributed systems
fault tolerance |
0.5 | 1 | 2021 | Rabia: Simplifying State-Machine Replication Through Randomization · SOSP 2021 |
Distributed systems › replication
state machine replication |
0.5 | 1 | 2021 | Rabia: Simplifying State-Machine Replication Through Randomization · SOSP 2021 |
Cloud and datacenter computing › datacenter storage
datacenter replication |
0.1 | 1 | 2021 | Rabia: Simplifying State-Machine Replication Through Randomization · SOSP 2021 |
Methods — techniques the papers use, named apart from their topics
randomization · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and WriteabstractA distributed multi-writer multi-reader (MWMR) atomic register is an important primitive that enables a wide range of distributed algorithms. Hence, improving its performance can have large-scale consequences. Since the seminal work of ABD emulation in the message-passing networks, many researchers study fast implementations of atomic registers under various conditions. "Fast'' means that a read or a write can be completed with 1 round-trip time (RTT), by contacting a simple majority. In this work, we explore an atomic register with optimal resilience and ''optimistically fast'' read and write operations. That is, both operations can be fast if there is no concurrent write. Lewis Tseng, Neo Zhou, Cole Dumas, Tigran Bantikyan, Roberto Palmieri |
SPAA | 2 |
| 2021 | Rabia: Simplifying State-Machine Replication Through RandomizationabstractWe introduce Rabia, a simple and high performance framework for implementing state-machine replication (SMR) within a datacenter. The main innovation of Rabia is in using randomization to simplify the design. Rabia provides the following two features: (i) It does not need any fail-over protocol and supports trivial auxiliary protocols like log compaction, snapshotting, and reconfiguration, components that are often considered the most challenging when developing SMR systems; and (ii) It provides high performance, up to 1.5x higher throughput than the closest competitor (i.e., EPaxos) in a favorable setup (same availability zone with three replicas) and is comparable with a larger number of replicas or when deployed in multiple availability zones. Haochen Pan, Jesse Tuglu, Neo Zhou, Yicheng Shen, Xiong Zheng, Joseph Tassarotti, Lewis Tseng, Roberto Palmieri |
SOSP | 3 |