Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lurong Liu

dblp:330/7852 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-2002-5323ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Distributed systems · 52% Storage systems · 31% Memory systems · 17%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › distributed database
distributed transactions
1.222023
Localized Validation Accelerates Distributed Transactions on Disaggregated Persistent Memory · ACM Trans. Storage 2023
FORD: Fast One-sided RDMA-based Distributed Transactions for Disaggregated Persistent Memory · FAST 2022
Storage systems › non-volatile memory storage
disaggregated persistent memory
0.822023
Localized Validation Accelerates Distributed Transactions on Disaggregated Persistent Memory · ACM Trans. Storage 2023
FORD: Fast One-sided RDMA-based Distributed Transactions for Disaggregated Persistent Memory · FAST 2022
Memory systems
non-volatile memory
0.712023
Localized Validation Accelerates Distributed Transactions on Disaggregated Persistent Memory · ACM Trans. Storage 2023
Storage systems › distributed storage
remote replication
0.712023
Localized Validation Accelerates Distributed Transactions on Disaggregated Persistent Memory · ACM Trans. Storage 2023
Distributed systems
replication
0.712023
Localized Validation Accelerates Distributed Transactions on Disaggregated Persistent Memory · ACM Trans. Storage 2023
Distributed systems
transaction commit
0.712023
Localized Validation Accelerates Distributed Transactions on Disaggregated Persistent Memory · ACM Trans. Storage 2023
Memory systems › non-volatile memory
persistent memory
0.212022
FORD: Fast One-sided RDMA-based Distributed Transactions for Disaggregated Persistent Memory · FAST 2022

Methods — techniques the papers use, named apart from their topics

one-sided RDMA · 1.2parallel undo logging · 0.7localized validation · 0.7
YearPublicationVenuePosition
2023 Localized Validation Accelerates Distributed Transactions on Disaggregated Persistent Memory
abstract
Persistent memory (PM) disaggregation significantly improves the resource utilization and failure isolation to build a scalable and cost-effective remote memory pool in modern data centers. However, due to offering limited computing power and overlooking the bandwidth and persistence properties of real PMs, existing distributed transaction schemes, which are designed for legacy DRAM-based monolithic servers, fail to efficiently work on the disaggregated PM. In this article, we propose FORD, a F ast O ne-sided R DMA-based D istributed transaction system for the new disaggregated PM architecture. FORD thoroughly leverages one-sided remote direct memory access to handle transactions for bypassing the remote CPU in the PM pool. To reduce the round trips, FORD batches the read and lock operations into one request to eliminate extra locking and validations for the read-write data. To accelerate the transaction commit, FORD updates all remote replicas in a single round trip with parallel undo logging and data visibility control. Moreover, considering the limited PM bandwidth, FORD enables the backup replicas to be read to alleviate the load on the primary replicas, thus improving the throughput. To efficiently guarantee the remote data persistency in the PM pool, FORD selectively flushes data to the backup replicas to mitigate the network overheads. Nevertheless, the original FORD wastes some validation round trips if the read-only data are not modified by other transactions. Hence, we further propose a localized validation scheme to transfer the validation operations for the read-only data from remote to local as much as possible to reduce the round trips. Experimental results demonstrate that FORD significantly improves the transaction throughput by up to 3× and decreases the latency by up to 87.4% compared with state-of-the-art systems.
Yu Hua 0001, Pengfei Zuo, Lurong Liu
ACM Trans. Storage4
2022 FORD: Fast One-sided RDMA-based Distributed Transactions for Disaggregated Persistent Memory
Yu Hua 0001, Pengfei Zuo, Lurong Liu
FAST4