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

Guanzhou Hu

dblp:284/4980 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0003-4136-8912ORCID · corroborated

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

Systems, architecture and hardware · 3 · 2 since 2021Databases, data management, data science and information retrieval · 3 · 3 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
5 papers
Storage systems · 41% Memory systems · 22% Distributed systems · 21%
Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 77% Transaction processing and concurrency control · 23%
Artificial intelligence
2 papers
Graph learning · 88% Robot navigation and mapping · 12%

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

TopicWeightPapersLastEvidence papers
Distributed systems › distributed coordination
consensus and coordination
0.912025
Marlin: Efficient Coordination for Autoscaling Cloud DBMS · Proc. ACM Manag. Data 2025
Storage systems › file systems › file system design
persistent memory file system
0.712023
MadFS: Per-File Virtualization for Userspace Persistent Memory Filesystems · FAST 2023
Storage systems › file systems › file system design
user space file system
0.712023
MadFS: Per-File Virtualization for Userspace Persistent Memory Filesystems · FAST 2023
Machine learning › Graph learning › graph neural network training
distributed GNN training
0.512021
Dorylus: Affordable, Scalable, and Accurate GNN Training with Distributed CPU Servers and Serverless Threads · OSDI 2021
Machine learning › Graph learning
graph neural network training
0.512021
Dorylus: Affordable, Scalable, and Accurate GNN Training with Distributed CPU Servers and Serverless Threads · OSDI 2021
Memory systems
cache
0.512021
The Storage Hierarchy is Not a Hierarchy: Optimizing Caching on Modern Storage Devices with Orthus · FAST 2021
Cloud and datacenter computing
serverless computing
0.512021
Dorylus: Affordable, Scalable, and Accurate GNN Training with Distributed CPU Servers and Serverless Threads · OSDI 2021
Memory systems › cache management
storage caching
0.512021
The Storage Hierarchy is Not a Hierarchy: Optimizing Caching on Modern Storage Devices with Orthus · FAST 2021
Storage systems
storage hierarchy
0.512021
The Storage Hierarchy is Not a Hierarchy: Optimizing Caching on Modern Storage Devices with Orthus · FAST 2021
Embedded and real-time systems › sensor systems
data acquisition system
0.412020
BORA: a bag optimizer for robotic analysis · SC 2020
Storage systems
file systems
0.412020
BORA: a bag optimizer for robotic analysis · SC 2020
Distributed systems
middleware
0.412020
BORA: a bag optimizer for robotic analysis · SC 2020
Transaction processing and concurrency control
distributed commit protocols
0.312025
Marlin: Efficient Coordination for Autoscaling Cloud DBMS · Proc. ACM Manag. Data 2025
Storage systems › distributed storage
disaggregated storage
0.312025
Marlin: Efficient Coordination for Autoscaling Cloud DBMS · Proc. ACM Manag. Data 2025
Memory systems › non-volatile memory
persistent memory
0.212023
MadFS: Per-File Virtualization for Userspace Persistent Memory Filesystems · FAST 2023
Memory systems
non-volatile memory
0.112021
The Storage Hierarchy is Not a Hierarchy: Optimizing Caching on Modern Storage Devices with Orthus · FAST 2021

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

transactions · 1.7cross-node modifications · 1.7commit protocol · 1.7serverless computing · 1.0distributed training · 1.0hash-based label management · 0.9
YearPublicationVenuePosition
2025 Marlin: Efficient Coordination for Autoscaling Cloud DBMS
abstract
Modern cloud databases are shifting from converged architectures to storage disaggregation, enabling independent scaling and billing of compute and storage. However, cloud databases still rely on external, converged coordination services (e.g., ZooKeeper) for their control planes. These services are effectively lightweight databases optimized for low-volume metadata. As the control plane scales in the cloud, this approach faces similar limitations as converged databases did before storage disaggregation: scalability bottlenecks, low cost efficiency, and increased operational burden. We propose to disaggregate the cluster coordination to achieve the same benefits that storage disaggregation brought to modern cloud DBMSs. We present Marlin, a cloud-native coordination mechanism that fully embraces storage disaggregation. Marlin eliminates the need for external coordination services by consolidating coordination functionality into the existing cloud-native database it manages. To achieve failover without an external coordination service, Marlin allows cross-node modifications on coordination states. To ensure data consistency, Marlin employs transactions to manage both coordination and application states and introduces MarlinCommit, an optimized commit protocol that ensures strong transactional guarantees even under cross-node modifications. Our evaluations demonstrate that Marlin improves cost efficiency by up to 4.4x and reduces reconfiguration duration by up to 4.9x compared to converged coordination solutions.
Guanzhou Hu, Mahesh Balakrishnan 0001, Xiangyao Yu
Proc. ACM Manag. Data2
2023 MadFS: Per-File Virtualization for Userspace Persistent Memory Filesystems
Shawn Zhong, Chenhao Ye, Guanzhou Hu, Suyan Qu, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Michael M. Swift
FAST3
2021 The Storage Hierarchy is Not a Hierarchy: Optimizing Caching on Modern Storage Devices with Orthus
Zhihan Guo, Guanzhou Hu, Kaiwei Tu, Ramnatthan Alagappan, Rathijit Sen, Kwanghyun Park 0001, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
FAST3
2021 Dorylus: Affordable, Scalable, and Accurate GNN Training with Distributed CPU Servers and Serverless Threads
John Thorpe, Yifan Qiao 0002, Jon Eyolfson, Shen Teng, Guanzhou Hu, Jinliang Wei, Keval Vora, Ravi Netravali, Miryung Kim, Guoqing Harry Xu
OSDI5
2020 BORA: a bag optimizer for robotic analysis
abstract
We present BORA (Bag Optimizer for Robotic Analysis), a file system middleware that optimizes the acquisition of bags, which are specially formatted files used to store timestamped ROS (robot operating system) messages. BORA sits between ROS and an existing file system to conduct semantic-aware data pre-processing. In particular, it categorizes ROS bag data into multiple groups with each having a distinct label. BORA predigests data index constructions and reduces file open time via a hash-based label management scheme. It is also capable of providing ROS analytic applications with only data needed without a sequence of data searching and locating operations. We implement a BORA prototype, which is then integrated into three computing platforms: a single-node server, a four-node PVFS storage cluster, and a Tianhe-1A Supercomputer storage subsystem. Next, we evaluate the BORA prototype on the three platforms using four real-world ROS applications. Our experimental results show that compared to a traditional bag management scheme BORA improves data acquisition performance by up to 11x. In addition, it offers up to 10x data acquisition performance improvement and 3,100x bags open improvement under a swarm robotics data analysis scenario where data is retrieved across multiple bags simultaneously.
Jian Zhang 0070, Tao Xie 0004, Yuzhuo Jing, Guanzhou Hu, Si Chen 0009, Shu Yin 0001
SC5