Xuhao Luo

Xuhao Luo

Auto-generated profile, based on publicly available information

Xuhao Luo

Computer Sciences, University of Wisconsin--Madison

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 November 2024
Verified
Conference Paper
Open access
XLXuhao Luo
Xuhao Luo
SBShreesha G. Bhat
Shreesha G. Bhat
JHJiyu Hu
Jiyu Hu
RARamnatthan Alagappan
Ramnatthan Alagappan
AGAishwarya Ganesan
Aishwarya Ganesan
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 in ACM Transactions on Computer Systems
Verified
Journal Article
Open access
XLXuhao Luo
Xuhao Luo
SBShreesha Gopalakrishna Bhat
Shreesha Gopalakrishna Bhat
JHJiyu Hu
Jiyu Hu
RARamnatthan Alagappan
Ramnatthan Alagappan
AGAishwarya Ganesan
Aishwarya Ganesan
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.

2 October 2026 in ACM Transactions on Computer Systems
Verified
Journal Article
Open access
AAArpaci-Dusseau Andrea
Arpaci-Dusseau Andrea
KKKeeton Kimberly
Keeton Kimberly