MCMiao Cai

Miao Cai

*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


Miao Cai has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Feature Map Compression for Split Learning in Mobile Wireless Environment: Theory and Practice

    by Wenxuan Zhou, Zhihao Qu, Baoliu Ye, Shen-Huan Lyu, Miao Cai, Mingtao Ji, Song Guo

    Split Learning (SL) enables collaborative model training by distributing computation between resource constrained mobile edge devices and a central server. In this distributed framework, mobile edge devices compute the early layers of the model and transmit feature maps to the server. However, due to practical mobile wireless bandwidth limitations, these feature maps should be compressed before transmission. In this paper, we propose a lightweight Mask-Encoded Spar sification (MS) compressor that enhances Top-k sparsification with a narrow-bit mask, significantly reducing compression error while improving computational and communication efficiency. Our theoretical analyses reveal that feature map compression generally induces estimator bias in the gradients. Furthermore, we establish the relationships between compression error and convergence, as well as between the choice of cutlayer and output error. The first relationship demonstrates that reducing compression error facilitates convergence, confirming the advantage of MS, whereas the second provides theoretical guidance for determining the cutlayer, indicating that earlier layers are more sensitive to compression errors. Extensive experiments on vision and language models demonstrate that our method outperforms existing compression techniques in terms of compression error and model performance, achieving up to a 21.38× speedup in communication efficiency under wireless environments.


  • Open Access

    Scalable RDMA-accelerated Distributed Locks with Shared Stream Abstraction

    by Miao Cai, Junru Shen, Xiaojian Liao, Rong Gu, Yanchao Zhao, Hao Han, Bing Chen, Baoliu Ye

  • Open Access

    Achieving Both Performance and Reliability in An Asymmetric File System on Disaggregated Persistent Memory

    by Miao Cai, Junru Shen, Baoliu Ye

    The ultra-fast persistent memories (PMs) promise a practical solution toward high-performance distributed file systems. This article examines and reveals a cascade of performance and reliability issues in the current PM provision scheme, which not only underutilizes fast PM devices but also leads to severe consequences, such as throughput degradation, load imbalance, and even service outage. To remedy these, we introduce Ethane+, a rack-scale, distributed file system built on disaggregated persistent memory (DPM). Through resource separation using fast data connection technologies, DPM achieves efficient and cost-effective PM sharing while supporting strong fault isolation. To unleash such hardware potentials, Ethane+ incorporates an asymmetric file system architecture inspired by the imbalanced resource provision feature of DPM. It splits a file system into a control-plane FS and a data-plane FS, and designs these two planes with dual goals of best hardware utilization and hardening file system reliability. Evaluation results demonstrate that Ethane+ reaps the DPM hardware benefits, performs up to 60× better than modern distributed file systems, resists both software and hardware faults, and improves data-intensive application throughputs by up to 15×.

  • Open Access

    SLIN: A CPU-efficient, Hybrid Tree and Learned Index for String Data

    by Yuanyuan Song, Miao Cai, Baoliu Ye, Guo Cheng

    The learned index is a disruptive technique for big data management. The core idea of the learned index is to retrofit the data indexing in traditional index structures with machine learning (ML) models, providing fast data position prediction instead of slow index tree traversal. Yet, current learned indexes focus on fix-sized numeric data and all of them perform poorly for variable-length string data for two main reasons: 1) high computational overheads caused by lengthy string key prediction; 2) large ML model fitting errors due to variance in string prefixes. This paper introduces SLIN, a CPU-efficient, hybrid index for variable-length string data. SLIN features a hybrid tree and learned index structure that leverages the strength of each index to overcome the above-mentioned challenges. It proposes a string slice approach which converts variable-length strings into fix-sized integers, which facilitates using one-dimensional linear regression for key prediction to reduce computational overheads. Furthermore, it extracts the common prefix from string keys to decrease model fitting errors. Finally, we propose a strategy to adaptively choose the appropriate index to manage computational costs. Evaluations compare SLIN with state-of-the-art index structures. The experimental results show that SLIN achieves up to 2.47x higher throughputs and relatively small fitting errors.


  • Scaling Persistent In-Memory Key-Value Stores Over Modern Tiered, Heterogeneous Memory Hierarchies

    by Miao Cai, Junru Shen, Yifan Yuan, Zhihao Qu, Baoliu Ye

    Recent advances in ultra-fast non-volatile memories (e.g., 3D XPoint) and high-speed interconnect fabrics (e.g., RDMA) enable a high-performance tiered, heterogeneous memory system, effectively overcoming the cost, scaling, and capacity limitations in DRAM-based key-value stores. To fully unleash the performance potential of such memory systems, this paper presents BonsaiKV+, a key-value store that makes the best use of different components in a modern RDMA-enabled heterogeneous memory system. The core of BonsaiKV+ is a tri-layer architecture that achieves efficient, elastic scaling up/out using a set of novel mechanisms and techniques—pipelined tiered indexing, NVM congestion control mechanisms, fine-grained data striping, and NUMA-aware data management—to leverage hardware strengths and tackle device deficiencies. We compare BonsaiKV+ with state-of-the-art key-value stores using a variety of YCSB workloads. Evaluation results demonstrate that BonsaiKV+ outperforms others by up to 7.30$\times$, 18.89$\times$, and 13.67$\times$ in read-, write-, and scan-intensive scenarios, respectively.


  • Open Access

    Exploiting Flat Namespace to Improve File System Metadata Performance on Ultra-Fast, Byte-Addressable NVMs

    by Miao Cai, Junru Shen, Bin Tang, Hao Huang, Baoliu Ye

    The conventional file system provides a hierarchical namespace by structuring it as a directory tree. Tree-based namespace structure leads to inefficient file path walk and expensive namespace tree traversal, underutilizing ultra-low access latency and superior sequential performance provided by non-volatile memories (NVMs). This article proposes FlatFS+, an NVM file system that features a flat namespace architecture while providing a compatible hierarchical namespace view. FlatFS+ incorporates three novel techniques: the direct file path walk model, range-optimized B r tree, and compressed index key design with scan and write dual optimization, to fully exploit flat namespace to improve file system metadata performance on ultra-fast, byte-addressable NVMs. Evaluation results demonstrate that FlatFS+ achieves significant performance improvements for metadata-intensive benchmarks and real-world applications compared to other file systems.


  • SplitDB: Closing the Performance Gap for LSM-Tree-Based Key-Value Stores

    by Miao Cai, Xuzhen Jiang, Junru Shen, Baoliu Ye

    Log Structured Merge Tree (LSM tree) serves as the core data storage engine in modern key-value stores. Its adoption is rapidly accelerated with cloud computing and data center development. Acknowledging its widespread use, the LSM tree still faces severe performance issues such as write stall, write amplification, and read inefficiency. This article presents research on improving LSM-tree-based key-value store performance using emerging Non-Volatile Memory (NVM) technology. Our performance diagnosis reveals that the above-mentioned issues result primarily from intensive hot key-value data processing, which is compounded by slow storage devices. To address hotspot bottlenecks, we propose a split log-structured merge tree over hybrid storage by leveraging the intrinsic hot and cold data separation property of the LSM tree. Our approach promotes frequently accessed, small-sized high levels onto fast NVM and offloads the remaining cold, large-sized low levels into slow devices, effectively closing the performance gap for DRAM-disk-based LSM trees. Additionally, we optimize the split LSM tree read and write performance by proposing a variety of novel techniques. We build a hotspot-aware key-value database named SplitDB and perform extensive experiments. Experimental results demonstrate that SplitDB effectively prevents write stalls, achieves a 6-fold write reduction, and improves read throughputs by 3.5 times compared to state-of-the-art key-value databases.