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

Linhui Liu

dblp:381/2567 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0009-0009-0793-9874ORCID · reported

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

Systems, architecture and hardware · 2 · 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
1 paper
Storage systems · 80% Cloud and datacenter computing · 20%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.812024
Ada-WL: An Adaptive Wear-Leveling Aware Data Migration Approach for Flexible SSD Array Scaling in Clusters · IEEE Trans. Computers 2024
Storage systems
data migration
0.812024
Ada-WL: An Adaptive Wear-Leveling Aware Data Migration Approach for Flexible SSD Array Scaling in Clusters · IEEE Trans. Computers 2024
Storage systems
flash and SSD
0.812024
Ada-WL: An Adaptive Wear-Leveling Aware Data Migration Approach for Flexible SSD Array Scaling in Clusters · IEEE Trans. Computers 2024
Storage systems
storage reliability
0.812024
Ada-WL: An Adaptive Wear-Leveling Aware Data Migration Approach for Flexible SSD Array Scaling in Clusters · IEEE Trans. Computers 2024
Storage systems › flash and SSD › flash memory management
wear leveling
0.812024
Ada-WL: An Adaptive Wear-Leveling Aware Data Migration Approach for Flexible SSD Array Scaling in Clusters · IEEE Trans. Computers 2024

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

model reference adaptive control · 0.8kalman filter · 0.8
YearPublicationVenuePosition
2024 GCC: Optimizing Space Efficiency and Read Latency of SSDs with Workload-Aware Garbage Collection Aided Compression
abstract
Data compression is increasingly employed to enhance throughput and space efficiency in flash-based storage systems, which are critical for data-intensive applications. Current intra-SSD compression techniques operate transparently with respect to the file system and contribute to improving the lifetime of SSDs. These approaches typically avoid compressing read-hot data to reduce the latency penalties associated with decompression. However, the read-hot data remain uncompressed even after turning into cold data, thereby reducing overall compression effectiveness and diminishing space efficiency. Moreover, when previously compressed cold data become read-hot, it necessitates frequent decompression, which increases the read latency. To address the above problems, we propose a novel Garbage Collection aided Compression (GCC) scheme, to optimize space efficiency and mitigate read latency for compression-supported SSDs. The key idea of GCC is exploiting the valid page migration during garbage collection to enable background compression and decompression. Throughout the garbage collection process, the migrated valid pages can potentially be compressed or decompressed, which progressively improves space efficiency and minimizes the need for decompression during read operations. Performance evaluations conducted using MQSim simulator demonstrate that, compared to the typical compression schemes, GCC reduces the read and write latency by 25.27% and 9.43% on average and improves the space efficiency by 15.01% on average.
Linhui Liu, Yunfei Gu, Chentao Wu, Jie Li 0002, Minyi Guo
ICCD1
2024 Ada-WL: An Adaptive Wear-Leveling Aware Data Migration Approach for Flexible SSD Array Scaling in Clusters
abstract
Recently, the flash-based Solid State Drive (SSD) array has been widely implemented in real-world large-scale clusters. With the increasing number of users in upper-tier applications and the burst of Input/Output requests in this data explosive era, data centers need to continuously scale up to meet real-time data storage needs. However, the classical disk array scaling methods are designed based on HDDs, ignoring the wear leveling and garbage collection characteristics of SSD. This leads to penalties due to the vast lifetime gap between extended SSDs and the original in-use SSDs while scaling the SSD array, including extra triggered wear leveling I/O, latency in average response time, etc.To address these problems, we propose an Adaptive Wear-Leveling aware data migration approach for flexible SSD array scaling in clusters. It manages the interdisk wear leveling based on Model Reference Adaptive Control, which includes an SSD behavior emulator, Kalman filter estimator, and adaptive law. To demonstrate the effectiveness of this approach, we conducted several simulations and implementations on actual hardware. The evaluation results show that Ada-WL has the self-adaptability to optimize the wear leveling management parameters for various states of SSD arrays, diverse workloads, and scaling performed multiple times, significantly improving performance for SSD array scaling.
Yunfei Gu, Linhui Liu, Chentao Wu, Jie Li 0002, Minyi Guo
IEEE Trans. Computers2