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.

Jiazhao Sun

dblp:255/8804 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
0000-0002-3581-2477ORCID · corroborated

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

Systems, architecture and hardware · 3 · 1 first-author · 2 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
Interconnection networks and networks-on-chip · 60% Memory systems · 40%
Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems
memory disaggregation
1.122022
RACE: One-sided RDMA-conscious Extendible Hashing · ACM Trans. Storage 2022
One-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory · USENIX ATC 2021
Interconnection networks and networks-on-chip
remote direct memory access
1.122022
RACE: One-sided RDMA-conscious Extendible Hashing · ACM Trans. Storage 2022
One-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory · USENIX ATC 2021
Interconnection networks and networks-on-chip › remote direct memory access
one-sided RDMA
0.612022
RACE: One-sided RDMA-conscious Extendible Hashing · ACM Trans. Storage 2022
Information retrieval › hashing › hash table design
extendible hashing
0.322022
RACE: One-sided RDMA-conscious Extendible Hashing · ACM Trans. Storage 2022
One-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory · USENIX ATC 2021

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

lock-free concurrency control · 1.1extendible remote resizing · 1.1RDMA · 1.0
YearPublicationVenuePosition
2022 RACE: One-sided RDMA-conscious Extendible Hashing
abstract
Memory disaggregation is a promising technique in datacenters with the benefit of improving resource utilization, failure isolation, and elasticity. Hashing indexes have been widely used to provide fast lookup services in distributed memory systems. However, traditional hashing indexes become inefficient for disaggregated memory, since the computing power in the memory pool is too weak to execute complex index requests. To provide efficient indexing services in disaggregated memory scenarios, this article proposes RACE hashing, a one-sided RDMA-Conscious Extendible hashing index with lock-free remote concurrency control and efficient remote resizing. RACE hashing enables all index operations to be efficiently executed by using only one-sided RDMA verbs without involving any compute resource in the memory pool. To support remote concurrent access with high performance, RACE hashing leverages a lock-free remote concurrency control scheme to enable different clients to concurrently operate the same hashing index in the memory pool in a lock-free manner. To resize the hash table with low overheads, RACE hashing leverages an extendible remote resizing scheme to reduce extra RDMA accesses caused by extendible resizing and allow concurrent request execution during resizing. Extensive experimental results demonstrate that RACE hashing outperforms state-of-the-art distributed in-memory hashing indexes by 1.4–13.7× in YCSB hybrid workloads.
Pengfei Zuo, Qihui Zhou, Jiazhao Sun, Shuangwu Zhang, Yu Hua 0001, James Cheng, Rongfeng He, Huabing Yan
ACM Trans. Storage3
2021 One-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory
Pengfei Zuo, Jiazhao Sun, Shuangwu Zhang, Yu Hua 0001
USENIX ATC2
2019 HSPP: Load-Balanced and Low-Latency File Partition and Placement Strategy on Distributed Heterogeneous Storage with Erasure Coding
Jiazhao Sun, Yunchun Li
ICA3PP (2)1