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.

Tong Xin 0005

dblp:166/9948-5 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0005-4333-4435ORCID · conflict

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

Systems, architecture and hardware · 1 · 1 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
1 paper
Storage systems · 88% Distributed systems · 12%
Computer networks
1 paper
Software-defined and programmable networks · 100%

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

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › programmable data plane
in-network coordination
1.012026
SwitchFS: Asynchronous Metadata Updates for Distributed Filesystems with In-Network Coordination · EuroSys 2026
Software-defined and programmable networks
programmable data plane
1.012026
SwitchFS: Asynchronous Metadata Updates for Distributed Filesystems with In-Network Coordination · EuroSys 2026
Storage systems › file systems
distributed file system
1.012026
SwitchFS: Asynchronous Metadata Updates for Distributed Filesystems with In-Network Coordination · EuroSys 2026
Storage systems
metadata management
1.012026
SwitchFS: Asynchronous Metadata Updates for Distributed Filesystems with In-Network Coordination · EuroSys 2026
Distributed systems
distributed coordination
0.312026
SwitchFS: Asynchronous Metadata Updates for Distributed Filesystems with In-Network Coordination · EuroSys 2026
Storage systems › file systems
POSIX semantics
0.312026
SwitchFS: Asynchronous Metadata Updates for Distributed Filesystems with In-Network Coordination · EuroSys 2026

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

programmable switch co-design · 2.0batching and consolidation · 2.0
YearPublicationVenuePosition
2026 SwitchFS: Asynchronous Metadata Updates for Distributed Filesystems with In-Network Coordination
abstract
Distributed filesystem metadata updates are typically synchronous. This creates inherent challenges for access efficiency, load balancing, and directory contention, especially under dynamic and skewed workloads. This paper argues that synchronous updates are overly conservative. We propose SwitchFS with asynchronous metadata updates that allow operations to return early and defer directory updates until reads, both hiding latency and amortizing overhead. The key challenge lies in efficiently maintaining the synchronous POSIX semantics of metadata updates. To address this, SwitchFS is co-designed with a programmable switch, leveraging the limited on-switch resources to track directory states with negligible overhead. This allows SwitchFS to aggregate and apply delayed updates efficiently, using batching and consolidation before directory reads. Evaluation shows that SwitchFS achieves up to 13.34× and 3.85× higher throughput, and 61.6% and 57.3% lower latency than two state-of-the-art distributed filesystems, Emulated-InfiniFS and Emulated-CFS, respectively, under skewed workloads. For real-world workloads, SwitchFS improves end-to-end throughput by 21.1×, 1.1×, and 0.3× over CephFS, Emulated-InfiniFS, and Emulated-CFS, respectively.
Mingkai Dong 0002, Qiulin Tian, Ziyi Tian, Tong Xin 0005, Haibo Chen 0001
EuroSys5
2024 Parer: Boosting EROFS Image Creation With Parallelism and Reproducibility
abstract
The Enhanced Read-Only File System (EROFS) has become a popular choice for read-only file systems in a variety of settings, such as mobile devices and cloud services. As EROFS is increasingly applied to diverse contexts, the time-consuming process of creating EROFS images has emerged as a critical factor, often representing a bottleneck in application deployment. However, the process of parallelizing the creation of these images is fraught with challenges, owing to the constraints of fixed-size output compression, the requirement of reproducibility, and the added complexity of de-duplication features. In this paper, we introduce Parer, a parallelized version of mkfs.erofs designed to ensure reproducibility. Parer utilizes a global order-preserving mechanism to assure consistent and reproducible outcomes and employs epoch-based de-duplication to mitigate dependencies during compression. Our evaluation indicates that Parer can reduce the time of creating an EROFS image by up to 79%, while only increasing the image’s size by 3.42% on average. This work has gained recognition from the community and is being synchronized upstream.
Tong Xin 0005, Mingkai Dong 0002
Internetware2