Demo Data from SIGIR 2026 / reviewers in the wild / expert
Oleg Aleksandrovich Golev
dblp:374/8991
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0008-7878-9992ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software 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 · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
edge computing |
0.9 | 1 | 2025 | Running Consistent Applications Closer to Users with Radical for Lower Latency · SOSP 2025 |
Distributed systems › consistency models
linearizability |
0.9 | 1 | 2025 | Running Consistent Applications Closer to Users with Radical for Lower Latency · SOSP 2025 |
Distributed systems
replication |
0.9 | 1 | 2025 | Running Consistent Applications Closer to Users with Radical for Lower Latency · SOSP 2025 |
Distributed systems
consensus |
0.3 | 1 | 2025 | Running Consistent Applications Closer to Users with Radical for Lower Latency · SOSP 2025 |
Methods — techniques the papers use, named apart from their topics
write intents · 0.9speculative execution · 0.9locking · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Running Consistent Applications Closer to Users with Radical for Lower LatencyabstractRunning applications close to users—in nearby datacenters, at edge points of presence, or in on-premises clusters—is attractive, as it reduces end-to-end latency. Moving strong consistent applications closer to users is difficult, as they incur high latencies either when accessing, or coordinating, their storage system. This restricts such applications to running co-located with their data, in a datacenter. Radical allows these applications to leverage the latency benefits that come from running near users. Radical uses its new LVI protocol to perform all necessary coordination in a single request. This request guarantees linearizability with a combination of locks, a validation step, and write intents. Radical hides the latency of the LVI request by overlapping it with speculative execution of the application. Our evaluation shows that Radical achieves 84–89% of the latency improvement obtainable by moving out of the datacenter, while providing Linearizability. Nicolaas Kaashoek, Oleg Aleksandrovich Golev, Austin T. Li, Amit Levy 0001, Wyatt Lloyd |
SOSP | 2 |