Xuhao Luo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xuhao Luo has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Aishwarya Ganesan
University of Illinois Urbana-Champaign, Urbana, IL, USA
3 shared publications - Ramnatthan Alagappan
University of Illinois Urbana-Champaign, Urbana, IL, USA
3 shared publications - Jiyu Hu
University of Illinois Urbana-Champaign, Urbana, USA
2 shared publications - Shreesha Gopalakrishna Bhat
University of Illinois Urbana-Champaign, Urbana, IL, USA
2 shared publications Keeton Kimberly
Google Inc
1 shared publication
Latest Publications
- Open Access
- 2 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44 (4) , 1-2
Introduction to the Special Section on SOSP 2024
- 2 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44 (4) , 1-2
Open AccessIntroduction to the Special Section on SOSP 2024
- Open Access
- 19 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44 (4) , 1-33
LazyLog: A New Shared Log Abstraction and Design for Modern Low-Latency Applications
Shared logs offer linearizable total order across storage shards. However, they enforce this order eagerly upon ingestion, leading to high latencies. We observe that in many modern shared-log applications, while linearizable ordering is necessary, it is not required eagerly when ingesting data but only later when data is consumed. Further, readers are naturally decoupled in time from writers in these applications. Based on this insight, we propose LazyLog, a novel shared log abstraction. LazyLog lazily binds records (across shards) to linearizable global positions and enforces this before a log position can be read. Such lazy ordering enables low ingestion latencies. Given the time decoupling, LazyLog can establish the order well before reads arrive, minimizing overhead upon reads. We build two LazyLog systems that provide linearizable total order across shards. Our experiments show that LazyLog systems deliver significantly lower latencies than conventional, eager-ordering shared logs.
- 19 August 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44 (4) , 1-33
Open AccessLazyLog: A New Shared Log Abstraction and Design for Modern Low-Latency Applications
Shared logs offer linearizable total order across storage shards. However, they enforce this order eagerly upon ingestion, leading to high latencies. We observe that in many modern shared-log applications, while linearizable ordering is necessary, it is not required eagerly when ingesting data but only later when data is consumed. Further, readers are naturally decoupled in time from writers in these applications. Based on this insight, we propose LazyLog, a novel shared log abstraction. LazyLog lazily binds records (across shards) to linearizable global positions and enforces this before a log position can be read. Such lazy ordering enables low ingestion latencies. Given the time decoupling, LazyLog can establish the order well before reads arrive, minimizing overhead upon reads. We build two LazyLog systems that provide linearizable total order across shards. Our experiments show that LazyLog systems deliver significantly lower latencies than conventional, eager-ordering shared logs.
- Open Access
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 296-312
LazyLog: A New Shared Log Abstraction for Low-Latency Applications | Proceedings of the ACM SIGOPS 30th Symposium on Operating Systems Principles
Shared logs offer linearizable total order across storage shards. However, they enforce this order eagerly upon ingestion, leading to high latencies. We observe that in many modern shared-log applications, while linearizable ordering is necessary, it is not required eagerly when ingesting data but only later when data is consumed. Further, readers are naturally decoupled in time from writers in these applications. Based on this insight, we propose LazyLog, a novel shared log abstraction. LazyLog lazily binds records (across shards) to linearizable global positions and enforces this before a log position can be read. Such lazy ordering enables low ingestion latencies. Given the time decoupling, LazyLog can establish the order well before reads arrive, minimizing overhead upon reads. We build two LazyLog systems that provide linearizable total order across shards. Our experiments show that LazyLog systems deliver significantly lower latencies than conventional, eager-ordering shared logs.
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 296-312
Open AccessLazyLog: A New Shared Log Abstraction for Low-Latency Applications | Proceedings of the ACM SIGOPS 30th Symposium on Operating Systems Principles
Shared logs offer linearizable total order across storage shards. However, they enforce this order eagerly upon ingestion, leading to high latencies. We observe that in many modern shared-log applications, while linearizable ordering is necessary, it is not required eagerly when ingesting data but only later when data is consumed. Further, readers are naturally decoupled in time from writers in these applications. Based on this insight, we propose LazyLog, a novel shared log abstraction. LazyLog lazily binds records (across shards) to linearizable global positions and enforces this before a log position can be read. Such lazy ordering enables low ingestion latencies. Given the time decoupling, LazyLog can establish the order well before reads arrive, minimizing overhead upon reads. We build two LazyLog systems that provide linearizable total order across shards. Our experiments show that LazyLog systems deliver significantly lower latencies than conventional, eager-ordering shared logs.
- Open Access
- 22 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 590-607
SplitFT: Fault Tolerance for Disaggregated Datacenters via Remote Memory Logging
- 22 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 590-607
Open AccessSplitFT: Fault Tolerance for Disaggregated Datacenters via Remote Memory Logging