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

Yuemin Wu

dblp:379/2366 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · conflict

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

Systems, architecture and hardware · 2 · 2 since 2021Software engineering, systems software and programming languages · 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 · 51% Cloud and datacenter computing · 29% Memory systems · 20%

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

TopicWeightPapersLastEvidence papers
Distributed systems › concurrency control
distributed lock management
1.012026
CXLock: Efficient and Scalable Lock Management for CXL-Enabled Distributed Systems · IEEE Trans. Computers 2026
Memory systems › memory interconnect
CXL
0.312026
CXLock: Efficient and Scalable Lock Management for CXL-Enabled Distributed Systems · IEEE Trans. Computers 2026
Memory systems › memory management
memory sharing
0.312026
CXLock: Efficient and Scalable Lock Management for CXL-Enabled Distributed Systems · IEEE Trans. Computers 2026
Distributed systems
fault tolerance
0.312025
EXIST: Enabling Extremely Efficient Intra-Service Tracing Observability in Datacenters · ASPLOS (2) 2025
Distributed systems › anomaly detection
performance anomaly diagnosis
0.312025
EXIST: Enabling Extremely Efficient Intra-Service Tracing Observability in Datacenters · ASPLOS (2) 2025

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

software-based coherency · 1.0manager-side arbitration · 1.0client-side queuing · 1.0
YearPublicationVenuePosition
2026 CXLock: Efficient and Scalable Lock Management for CXL-Enabled Distributed Systems
abstract
Efficient lock management is critical in distributed systems with shared resources, especially in the context of enhanced computational power and reduced processing time. While numerous studies have leveraged Remote Direct Memory Access (RDMA) for distributed locking, these network-based approaches suffer from high network latency and jitter. The emergence of the Compute Express Link (CXL) protocol provides high-speed, low-latency connections between host processors and memory devices, presenting a compelling alternative for the lock system design. This paper introduces CXLock, the industry’s first distributed lock management system based on CXL 2.0 switches. CXLock decouples lock management into client-side queuing and manager-side arbitration, resolving race conditions of multiple clients without using remote atomics. To handle the lack of hardware-enforced coherency in CXL 2.0, CXLock employs a software-based coherency model that enables memory sharing across multiple hosts with cacheable and write-back attributes. CXLock is implemented and evaluated on a real rack-scale hardware platform containing a CXL switch and multiple host nodes. The results show that CXLock delivers an average throughput improvement of 3.7× over the RDMA-based solutions. Moreover, CXLock reduces the lock grant latency by up to 76% in both contention-free and contended scenarios.
Yudi Qiu, Qixiao Liu, Wenpu Hu, Xinjun Yang, Yingqiang Zhang, Hao Chen 0080, Zipeng Ouyang, Yuemin Wu
IEEE Trans. Computers11
2025 EXIST: Enabling Extremely Efficient Intra-Service Tracing Observability in Datacenters
abstract
The complexity of online applications is rapidly increasing, bringing more sophisticated performance anomalies in today's cloud datacenter. To fully understand application behaviors, we should obtain both inter-service communication data via RPC-level tracing and intra-service execution traces via application-level tracing to precisely reason about event causality. However, the average time overhead of existing intra-service tracing schemes on the traced applications is generally about 5-10%, possibly reaching 18% in the worst case. To realize practical intra-service tracing in shared and stressed datacenters, one must achieve extreme tracing efficiency with an overhead at the per-mille level.
Xinkai Wang 0003, Xiaofeng Hou, Chao Li 0009, Yuancheng Li 0001, Du Liu, Guoyao Xu, Liping Zhang 0013, Yuemin Wu, Xiaopeng Yuan, Quan Chen 0002, Minyi Guo
ASPLOS (2)9