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

Lan Anh Nguyen

dblp:271/5075 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0002-0076-5260ORCID · corroborated

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

Systems, architecture and hardware · 2 · 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
Storage systems · 65% Memory systems · 22% Distributed systems · 13%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management › storage management
file systems
0.812024
ScaleCache: A Scalable Page Cache for Multiple Solid-State Drives · EuroSys 2024
Operating systems › resource management › memory management
page cache
0.812024
ScaleCache: A Scalable Page Cache for Multiple Solid-State Drives · EuroSys 2024
Storage systems › file systems
distributed file system
0.812024
ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing · HPDC 2024
Storage systems
file systems
0.812024
ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing · HPDC 2024
Storage systems
flash and SSD
0.812024
ScaleCache: A Scalable Page Cache for Multiple Solid-State Drives · EuroSys 2024
Memory systems › cache management › storage caching
page cache
0.812024
ScaleCache: A Scalable Page Cache for Multiple Solid-State Drives · EuroSys 2024
Distributed systems › peer-to-peer systems
IPFS
0.212024
ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing · HPDC 2024
Distributed systems
peer-to-peer systems
0.212024
ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing · HPDC 2024

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

direct page flush · 1.5parallel garbage collection · 0.8parallel DAG construction · 0.8concurrent data structures · 0.8concurrent data structure · 0.8DAG caching · 0.8
YearPublicationVenuePosition
2024 ScaleCache: A Scalable Page Cache for Multiple Solid-State Drives
abstract
This paper presents a scalable page cache called ScaleCache for improving SSD scalability. Specifically, we first propose a concurrent data structure of page cache based on XArray (ccXArray) to enable access and update the page cache concurrently. Second, we introduce a direct page flush (dflush) which directly flushes pages to storage devices in a parallel and opportunistic manner. We implement ScaleCache with two techniques in the Linux kernel and evaluate it on a 64-core machine with eight NVMe SSDs. Our evaluations show that ScaleCache improves the performance of Linux file systems by up to 6.81× and 4.50× compared with the existing scheme and scalable scheme for multiple SSDs, respectively.
Kiet Tuan Pham, Seokjoo Cho, Sangjin Lee 0003, Lan Anh Nguyen, Hyeongi Yeo, Ipoom Jeong, Sungjin Lee 0001, Nam Sung Kim, Yongseok Son
EuroSys4
2024 ScaleDFS: Accelerating Decentralized and Private File Sharing via Scaling Directed Acyclic Graph Processing
abstract
This paper introduces a novel file system, ScaleDFS, designed to accelerate decentralized file sharing for a private network, leveraging the potential of scaling file management based on directed acyclic graph (DAG) on modern hardware. Specifically, in ScaleDFS, we first design a DAG builder that parallelizes the construction of DAG nodes for a file while preserving critical orders to speed up the uploading process. Second, we introduce a DAG reader that retrieves leaf DAG nodes in parallel without graph traversal assisted by a devised DAG cache to accelerate the downloading process. Finally, we present a DAG remover that rapidly identifies obsolete DAG nodes/data and removes them in parallel to mitigate the garbage collection overhead without compromising consistency. We implement ScaleDFS based on IPFS and demonstrate that ScaleDFS outperforms IPFS by up to 3.7×, 1.8×, and 12.6× in realistic file, private blockchain, and gateway workloads, respectively.
Mansub Song, Lan Anh Nguyen, Sunggon Kim, Hyeonsang Eom, Yongseok Son
HPDC2