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

Changchen Gan

dblp:350/8910 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0009-0954-9685ORCID · reported

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

Systems, architecture and hardware · 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 · 44% Interconnection networks and networks-on-chip · 28% Memory systems · 28%

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

TopicWeightPapersLastEvidence papers
Memory systems
memory disaggregation
0.712023
Fast One-Sided RDMA-Based State Machine Replication for Disaggregated Memory · ACM Trans. Archit. Code Optim. 2023
Interconnection networks and networks-on-chip › remote direct memory access
RDMA-based replication
0.712023
Fast One-Sided RDMA-Based State Machine Replication for Disaggregated Memory · ACM Trans. Archit. Code Optim. 2023
Distributed systems › replication
state machine replication
0.712023
Fast One-Sided RDMA-Based State Machine Replication for Disaggregated Memory · ACM Trans. Archit. Code Optim. 2023
Distributed systems › fault tolerance
failure recovery
0.212023
Fast One-Sided RDMA-Based State Machine Replication for Disaggregated Memory · ACM Trans. Archit. Code Optim. 2023
Distributed systems
fault tolerance
0.212023
Fast One-Sided RDMA-Based State Machine Replication for Disaggregated Memory · ACM Trans. Archit. Code Optim. 2023

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

one-sided RDMA · 0.7log replication · 0.7
YearPublicationVenuePosition
2023 Fast One-Sided RDMA-Based State Machine Replication for Disaggregated Memory
abstract
Disaggregated memory architecture has risen in popularity for large datacenters with the advantage of improved resource utilization, failure isolation, and elasticity. Replicated state machines (RSMs) have been extensively used for reliability and consistency. In traditional RSM protocols, each replica stores replicated data and has the computing power to participate in some part of the protocols. However, traditional RSM protocols fail to work in the disaggregated memory architecture due to asymmetric resources on CPU nodes and memory nodes. This article proposes ECHO, a fast one-sided RDMA-based RSM protocol with lightweight log replication and remote applying, efficient linearizability guarantee, and fast coordinator failure recovery. ECHO enables all operations in the protocol to be efficiently executed using only one-sided RDMA, without the participation of any computing resource in the memory pool. To provide lightweight log replication and remote applying, ECHO couples the replicated log and the state machine to avoid dual-copy and performs remote applying by updating pointers. To enable efficient remote log state management, ECHO leverages a hitchhiked log state updating scheme to eliminate extra network round trips. To provide efficient linearizability guarantee, ECHO performs immediate remote applying after log replication and leverages the local locks at the coordinator to ensure linear consistency. Moreover, ECHO adopts a commit-aware log cache to make data visible immediately after being committed. To achieve fast failure recovery, ECHO leverages a commit point identification scheme to reduce the overhead of log consistency recovery. Experimental results demonstrate that ECHO outperforms the state-of-the-art RSM protocol (namely Sift) in multiple scenarios. For example, ECHO achieves 27%–52% higher throughput on typical write-intensive workloads. Moreover, ECHO reduces the consistency recovery time by three orders of magnitude for coordinator failure.
Jingwen Du, Fang Wang 0001, Dan Feng 0001, Changchen Gan, Yuchao Cao, Xiaomin Zou
ACM Trans. Archit. Code Optim.4