MDMingkai Dong

Mingkai Dong

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Mingkai Dong has a total of 34 co-authors. Here are the top co-authors by number of shared publications:

  • Haibo Chen

    Shanghai Jiao Tong University, Shanghai, China

    7 shared publications
  • Fangnuo Wu

    Institute of Parallel and Distributed Systems; Institute of Artificial Intelligence Operating Systems; Engineering Research Center for Domain-specific Operating Systems, Ministry of Education, Shanghai Jiao Tong University, Shanghai, China

    3 shared publications
  • Tong Xin

    Institute of Parallel and Distributed Systems; Institute of Artificial Intelligence Operating Systems; Engineering Research Center for Domain-specific Operating Systems, Ministry of Education, Shanghai Jiao Tong University, Shanghai, China

    3 shared publications
  • Chunhai Fan

    Shanghai Jiao Tong University

    2 shared publications
  • Fei Wang

    State Key Laboratory of Synergistic Chem‐Bio Synthesis School of Chemistry and Chemical Engineering New Cornerstone Science Laboratory Frontiers Science Center for Transformative Molecules and National Center for Translational Medicine Shanghai Jiao Tong University Shanghai China

    2 shared publications
  • Gequan Mo

    School of Computer Science, Shanghai Jiao Tong University

    2 shared publications

Latest Publications

  • Open Access

    StarfishOS: Revisiting Single System Image on CXL with State-Partitioned Microkernel

    by Fangnuo Wu, Jingsheng Yan, Mingkai Dong, Wenjun Cai, Jingwei Xu, Tong Xin, Haibo Chen

    Single System Image (SSI) offers an attractive OS abstraction that enables single-machine applications to transparently execute on multiple machines with improved resource utilization. The emergence of Compute Express Link (CXL) shifts cross-machine synchronization from message passing to coherent shared memory, which may help overcome SSI's long-standing adoption barrier caused by inefficient cross-machine message passing. However, placing state in slow CXL memory degrades performance and makes the system vulnerable to partial failures, since inconsistent CXL-resident state may block or crash the whole system. This paper notes that microkernels' minimized kernelspace state and capability-based state management allow easier state partitioning to minimize state on CXL. To this end, we propose a state-partitioned microkernel, and realize it in StarfishOS, the first OS-level SSI that leverages CXL shared memory for both high efficiency and partial failure resilience by keeping CXL state minimal and recoverable. Evaluations show that applications can transparently scale on StarfishOS with zero code changes, and achieve up to 5.2× and 4.1× the throughput of their distributed and CXL-optimized versions, respectively. Moreover, StarfishOS utilizes all stranded CPU resources by running applications across machines. StarfishOS is open source and available at https://github.com/starfishos-org/starfishos.

  • Open Access

    ProbeFS: Hierarchical DNA File Systems via Biochemical Content Addressability and Parallelism

    by Ruihan Li, Yuankun Zhang, Mingkai Dong, Yaya Hao, Fei Wang, Chunhai Fan, Haibo Chen

    DNA storage offers exceptional density, durability, and energy efficiency, yet existing DNA file systems provide only flat storage abstractions with no hierarchical directory structure. Directly applying conventional hierarchy to DNA storage is impractical: hierarchy creates cross-file dependencies whose resolution demands multi-round DNA sequencing, either through sequential directory traversal at read time or cascading propagation at write time. We observe that two inherent biochemical properties of DNA—content-addressability via Watson-Crick base pairing and massive parallelism via concurrent molecular hybridization—can effectively address this overhead. We present ProbeFS, a hierarchical DNA file system co-designed with these properties. ProbeFS introduces path identifiers, a DNA encoding in which files sharing a common ancestor share subsequences, enabling (1) probe-based path resolution that locates files without directory traversal, (2) one-shot file retrieval that fetches entire directory subtrees in a single hybridization without knowing file identities in advance, and (3) chained delta updates that efficiently modify immutable DNA strands. Wet-lab experiments, thermodynamic simulations at scales up to 100K files, and in silico evaluation show that ProbeFS reduces read amplification by up to 5,124× and serialized sequencing rounds by up to 54×, achieving end-to-end retrieval latency of 1.3-2.7 hours—comparable to Amazon S3 Glacier Flexible Retrieval.

  • Open Access

    Towards density-optimal DNA storage with practical bijective coding

    by Jiasen Li, Mingkai Dong, Zhengwei Qi, Haibing Guan

    DNA storage is a promising solution to data explosion due to its high density and longevity. However, existing coding methods struggle to efficiently avoid error-prone sequences while retaining usable ones, leading to low density and high copy numbers. Here we show Siyuan Code, a DNA storage codec that achieves theoretically optimal density. Our method maps binary data to nearly all suitable low-error sequences in a one-to-one manner, using our data structure to catalog and avoid error-prone patterns. This allows operation under very strict biochemical constraints with minimal redundancy. Experiments demonstrate a storage density of 1.66 bits per nucleotide and a capacity of 41 exabytes per gram of DNA, with perfect data retrieval using only six copies per strand. Encoding and decoding speeds reach approximately 1 megabyte per second on commodity hardware, comparable to early USB flash drives. These results bring DNA storage closer to practical deployment.

  • Open Access

    On-device Semantic Selection Made Low Latency and Memory Efficient with Monolithic Forwarding

    by Jiahao Zhou, Chengliang Lin, Dingji Li, Mingkai Dong, Haibo Chen

  • Open Access

    SwitchFS: Asynchronous Metadata Updates for Distributed Filesystems with In-Network Coordination

    by Jingwei Xu, Mingkai Dong, Qiulin Tian, Ziyi Tian, Tong Xin, Haibo Chen

    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.


  • Open Access

    Whole-system Persistence Made Efficient with Tree-structured Checkpointing on Microkernel

    by Mingkai Dong, Fangnuo Wu, Gequan Mo, Haibo Chen

    Whole-system persistence promises simplified application deployment and near-instantaneous recovery. This can be implemented using single-level store (SLS) through periodic checkpointing of ephemeral state to persistent devices. However, traditional SLSs suffer from two main issues on checkpointing efficiency and external synchrony, which are critical for low-latency services with persistence need. In this paper, we note that the decentralized state of microkernel-based systems can be exploited to simplify and optimize state checkpointing. To this end, we propose TreeSLS, a whole-system persistent microkernel that simplifies the whole-system state maintenance to a capability tree and a failure-resilient checkpoint manager. TreeSLS further exploits the emerging non-volatile memory to minimize checkpointing pause time by eliminating the distinction between ephemeral and persistent devices. With efficient state maintenance, TreeSLS further proposes delayed external visibility to provide transparent external synchrony with little overhead. Evaluation on microbenchmarks and real-world applications (e.g., Memcached, Redis and RocksDB) show that TreeSLS can complete a whole-system persistence in around 100 μ s and even take a checkpoint every 1 ms with reasonable overhead to applications.


  • Open Access

    Parer: Boosting EROFS Image Creation With Parallelism and Reproducibility

    by Yifan Zhao, Tong Xin, Mingkai Dong

    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.

  • Top Cited Papers

    DNA-based programmable gate arrays for general-purpose DNA computing

    by Hui Lv, Nuli Xie, Mingqiang Li, Mingkai Dong, Chenyun Sun, Qian Zhang, Lei Zhao, Jiang Li, Xiaolei Zuo, Haibo Chen, et al.

    The past decades have witnessed the evolution of electronic and photonic integrated circuits, from application specific to programmable1,2. Although liquid-phase DNA circuitry holds the potential for massive parallelism in the encoding and execution of algorithms3,4, the development of general-purpose DNA integrated circuits (DICs) has yet to be explored. Here we demonstrate a DIC system by integration of multilayer DNA-based programmable gate arrays (DPGAs). We find that the use of generic single-stranded oligonucleotides as a uniform transmission signal can reliably integrate large-scale DICs with minimal leakage and high fidelity for general-purpose computing. Reconfiguration of a single DPGA with 24 addressable dual-rail gates can be programmed with wiring instructions to implement over 100 billion distinct circuits. Furthermore, to control the intrinsically random collision of molecules, we designed DNA origami registers to provide the directionality for asynchronous execution of cascaded DPGAs. We exemplify this by a quadratic equation-solving DIC assembled with three layers of cascade DPGAs comprising 30 logic gates with around 500 DNA strands. We further show that integration of a DPGA with an analog-to-digital converter can classify disease-related microRNAs. The ability to integrate large-scale DPGA networks without apparent signal attenuation marks a key step towards general-purpose DNA computing.