YLYina Lv

Yina Lv

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yina Lv has a total of 71 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Waltz: Temperature-Aware Cooperative Compression for High-Performance Compression-Based CSDs

    by Dingcui Yu, Yunpeng Song, Yiyang Huang, Yumiao Zhao, Yina Lv, Chundong Wang, Youtao Zhang, Liang Shi

    Data compression is widely adopted for modern solid-state drives (SSDs) to mitigate SSD lifetime issues. Researchers have proposed compression schemes at different system layers, including device-side solutions like CCSDs ( c ompression-based c omputational S SD s) and compression supported by host-side, like F2FS (flash-friendly file system). As storage performance increases, the surging power density makes thermal management a critical challenge. We conduct quantitative studies to understand how host-side and device-side compression schemes affect the temperature and performance of SSD-based storage systems. From our experiments, device-side compression, facilitated by a hardware compression engine, can raise the temperature of CCSDs to intolerable levels, resulting in throttling and service shutdown. In contrast, host-side compression causes software-stack overhead, which often results in large performance degradation and resource consumption. To ensure efficient data compression with high performance and better temperature control, we propose Waltz, a temperature-aware cooperative compression method that schedules (de)compression tasks at the host and device sides by monitoring device temperature. Furthermore, we introduce two variants (Waltzs and Waltzp) for space and performance optimization, respectively. Waltz is implemented within F2FS, achieving high performance while extending SSD lifetime and preventing overheating-induced in-flight shutdowns.

  • Open Access

    ConZone+: Practical Zoned Flash Storage Emulation for Consumer Devices

    by Dingcui Yu, Zonghuan Yan, Jialin Liu, Yumiao Zhao, Yanyun Wang, Haodong Xia, Xinghui Duan, Yina Lv, Liang Shi

    Consumer flash storage uses block interfaces, leading to performance and endurance issues like large mapping table overhead and write amplification. While zoned abstraction solves these problems in enterprise devices, it introduces new challenges for consumer devices with limited volatile memory and suboptimal file system design. These challenges highlight the need for a better understanding and new designs for zoned storage in consumer devices. We propose ConZone+, a practical and accurate emulation framework designed for consumer-grade zoned flash storage. Unlike existing enterprise-focused emulators, ConZone+ models unique consumer constraints (e.g., limited mapping caches and write buffers, hybrid flash media) and hybrid mapping. Furthermore, to enable system-level emulation, ConZone+ supports block interface for metadata area in file system and provides several useful scripts to assist users. Finally, ConZone+ introduces several enhancements on the firmware logic, including a configurable per-chip command queue, variable zone sizes, and compatibility with non-power-of-two block sizes. Users can explore the internal architecture and management strategies of consumer-grade zoned flash storage and integrate their optimizations into system software with ConZone+. To evaluate the accuracy of ConZone+, we configure it referencing a mobile phone equipped with zoned flash storage and compare its performance to that. The evaluation results show that the average performance deviations are limited to 12.8% for writes and 10% for reads. In addition, we conduct several case studies using ConZone+ to explore the firmware design and the adaptability of the log-structured features of F2FS and the transaction processing of SQLite.

  • Open Access

    WILL: Write Invalidation Skipping for QLC NAND by Leveraging Data Lifespan and Latency Awareness

    by Beichen Ning, Yina Lv, Tianyu Ren, Bin Gao, Xiangyu Yao, Jie Zhang, Qiao Li, Chun Jason Xue

  • Open Access

    FreeZone: An On-Device Out-of-Order Writes Reordering Scheme for Consumer Zoned Storage

    by Dingcui Yu, Mengyang Ma, Tianyu Ren, Hongyu Zhu, Xinghui Duan, Yina Lv, Lei Qiao, Liang Shi

  • Open Access

    CrossFS: Improving Cross-Domain File System Performance with CRDT-Based Metadata Synchronization

    by Qiwen Ke, Yina Lv, Zhihao Zhang, Zhirong Shen, Yue Yu, Hailiang Chen, Zhenlong Song, Xinbiao Gan, Jiaxin Li, Dongsheng Li, et al.

    Modern data-intensive applications increasingly demand efficient and scalable file systems that can operate across distributed and cross-domain environments. However, existing file systems are inefficient in metadata management, synchronization efficiency, and system scalability under high-concurrency and metadata-intensive workloads in cross-domain environments. To address these challenges, this article introduces CrossFS (CFS), a cross-domain distributed file system that enhances consistency guarantees and metadata indexing. Specifically, CFS leverages conflict-free replicated data types (CRDTs) to synchronize metadata, achieving strong eventual consistency with minimal synchronization overhead, even across network partitions. Furthermore, CFS employs a Hybrid Tree indexing structure, tailored for distributed environments, which optimizes metadata operations by reducing query latency by up to 33.4% and write amplification by 30.7%. Additionally, CFS achieves adaptive caching strategies and a hybrid synchronization model that effectively balances consistency latency with data availability. Extensive evaluations show that CFS outperforms CephFS and GlusterFS, achieving up to 33.9% higher metadata throughput, 36% lower latency, and 42% better data operation efficiency.


  • Open Access

    Nemo: A Low-Write-Amplification Cache for Tiny Objects on Log-Structured Flash Devices

    by Xufeng Yang, Tingting Tan, Jingxin Hu, Congming Gao, Mingyang Liu, Tianyang Jiang, Jian Chen, Linbo Long, Yina Lv, Jiwu Shu

  • Open Access

    Phoenix: A Refactored I/O Stack for GPU Direct Storage without Phony Buffers

    by Jianqin Yan, Shi Qiu, Yina Lv, Yifan Hu, Hao Chen, Zhirong Shen, Xin Yao, Renhai Chen, Jiwu Shu, Gong Zhang, et al.


  • Open Access

    Rethinking LSM-tree based Key-Value Stores: A Survey

    by Yina Lv, Qiao Li, Quanqing Xu, Congming Gao, Chuanhui Yang, Xiaoli Wang, Chun Jason Xue

    LSM-tree is a widely adopted data structure in modern key-value store systems that optimizes write performance in write-heavy applications by using append writes to achieve sequential writes. However, the unpredictability of LSM-tree compaction introduces significant challenges, including performance variability during peak workloads and in resource-constrained environments, write amplification caused by data rewriting during compactions, read amplification from multi-level queries, trade-off between read and write performance, as well as efficient space utilization to mitigate space amplification. Prior studies on LSM-tree optimizations have addressed the above challenges; however, in recent years, research on LSM-tree optimization has continued to propose. The goal of this survey is to review LSM-tree optimization, focusing on representative works in the past five years. This survey first studies existing solutions on how to mitigate the performance impact of LSM-tree flush and compaction and how to improve basic key-value operations. In addition, distributed key-value stores serve multi-tenants, ranging from tens of thousands to millions of users with diverse requirements. We then analyze the new challenges and opportunities in these modern architectures and across various application scenarios. Unlike the existing survey papers, this survey provides a detailed discussion of the state-of-the-art work on LSM-tree optimizations and gives future research directions.

  • Revisiting Multiple ECC on High-Density NAND Flash memory

    by Yunpeng Song, Yina Lv, Wentong Li, Jialin Liu, Liang Shi

    Three-dimensional nand flash memory using the advanced multibit-per-cell technique is widely adopted due to its high density. However, it faces the problem of deteriorating read performance and energy consumption due to decreased reliability. Low-density parity-check code (LDPC) is typically adopted as an error correction code (ECC) to encode data and provide fault tolerance. To reduce the cost, LDPC with a high code rate is always adopted. However, LDPC will lead to read retry operations when the accessed data are not successfully decoded, and such retry-induced performance degradation is serious, especially for modern high-density flash memory. In this work, a reliability-aware differential ECC (READECC) approach is proposed to reduce redundancy protection and storage cost of LDPC with a low code rate and optimize the read performance. The basic idea is to adopt LDPC with a suitable code rate considering both data access characteristics and flash reliability characteristics. First, hot reads are identified based on the frequency of being accessed. Second, based on the reliability variation characteristics, the life of flash memory is divided into three reliability periods. As the reliability period shifts, the code rate of the LDPC adjusts adaptively to minimize redundancy protection. Third, an adaptive-sized logical page approach is further proposed to support LDPC with strong error correction capability (a low code rate) with a low storage cost. Through careful design and evaluation on 3-D triple-level-cell nand flash memory, READECC achieves encouraging optimizations with a negligible cost.


  • Open Access

    DISS: A Novel Data Invalidation Scheme for Swap-Data on Flash Storage Systems

    by Dingcui Yu, Longfei Luo, Han Wang, Yina Lv, Liang Shi

    Storage swapping has been a critical technique used to relieve memory pressure and improve user experience. However, it generates lots of data writes in flash storage, deteriorating the lifetime and performance. In this paper, inspired by empirical studies on swap data access characteristics, we propose a novel data invalidation scheme, namely DISS, which includes two methods. First, a cross-layer swap-data invalidation method is proposed to invalidate swapped-in data at a low cost. Second, a swap data separation method is proposed to schedule swap data and file-backed data into different places. Experimental results show that DISS achieves encouraging flash lifetime and performance optimization.