DBScholar

Back to papers

Efficient, Scalable, and Fair Locking on Disaggregated Memory with Decentralized Coordination

Summary: DecLock separates lock-state maintenance on memory nodes from ownership transfer across compute nodes, using queued waiters and direct CN notifications to avoid NIC-heavy retries. It delivers scalable, fair locking under contention, improving throughput by up to 43.37× over RDMA-based locks. (summarized by gpt-5.6-luna on Aug 17 2026)

Paper ID
h14e3cf034016f151
Venue
VLDB
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,784 | 27.50%
DOI
10.14778/3819518.3819548

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{zhang_vldb26,
        title = {{Efficient, Scalable, and Fair Locking on Disaggregated Memory with Decentralized Coordination}},
        author = {Zhang, Hanze and Cheng, Ke and Chen, Rong and Wei, Xingda and Chen, Haibo},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {9},
        pages = {2248--2261},
        doi = {10.14778/3819518.3819548},
        url = {https://doi.org/10.14778/3819518.3819548},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers