GZGong Zhang

Gong Zhang

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Gong Zhang has a total of 199 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    DAG-KV: DAG-Guided KV Propagation for Structure-Aware Knowledge Reuse

    by Wenbin Zhu, Zhaoyan Shen, Qian Wei, Shujian Zhao, Xin Yao, Xi Peng, Wei Zhang, Renhai Chen, Gong Zhang, Hongjun Dai, et al.

  • Open Access

    KBest: Efficient Vector Search on Kunpeng CPU

    by Kaihao Ma, Meiling Wang, Senkevich Oleg, Zijian Li, Daihao Xue, Dmitriy Malyshev, Yangming Lv, Shihai Xiao, Xiao Yan, Radionov Alexander, et al.

  • Open Access

    HyTorC: Hybrid Address Translation for SSDs Supporting Compression

    by Yu Zhang, Renhai Chen, Gong Zhang, Peng Wang, Yao Xin, Huang Keji, André Brinkmann

    High-capacity solid-state drives (SSDs) with expected capacities of one PByte and more will address cloud storage and archiving environments previously dominated by magnetic disks. These new applications are very cost-sensitive, so unnecessary overhead must be reduced as much as possible without sacrificing the performance advantages of SSDs. An expensive component within a scale-up SSD is the on-device memory to map host logical page numbers to flash pages. This article, therefore, proposes HyTorC, which builds on the idea of S-FTL to represent sequentially stored logical pages using bitmaps instead of providing one entry per logical page. HyTorC extends this idea by introducing, for the first time in an FTL, compression of these bitmaps using run-length encoding, and by investigating the effects of background scrubbing to realign randomly written pages into contiguous runs. This background scrubbing allows HyTorC to keep large portions of the mapping table in block mapping mode, further reducing the memory footprint. HyTorC retains the flexibility of the page mapping scheme and supports compression of logical blocks within the SSD, allowing multiple compressed logical pages to be stored within a single physical page. HyTorC is fully implemented in an open-channel SSD. Our tests show that HyTorC can reduce memory consumption by an average of 98.9% over standard page mapping, 95.6% over the DFTL scheme, 87.3% over S-FTL, and 56.5% over the learned index-based approach LeaFTL for the Alibaba Cloud block traces, and by 98.6% over standard page mapping, 95.5% over the DFTL scheme, 84.1% over S-FTL, and 61.5% over LeaFTL for the Microsoft Research Cambridge traces. HyTorC focuses on the memory footprint of the FTL and not on performance. However, the performance evaluation shows that HyTorC achieves similar performance compared to page mapping and FTLs based on learned indexes.

  • Epiphron: Resource-Efficient Distributed Key-Value Storage

    by Ruidong Zhu, Zili Zhang, Bingyang Wu, Xin Yao, Renhai Chen, Gong Zhang, Xuanzhe Liu, Xin Jin

    In-memory key-value storage necessitates a substantial quantity of computation and storage resources for both performance and scalability, thereby diminishing the resources available for user applications. The emergence of programmable network hardware, including SmartNICs and programmable switches, provides the opportunity to offload operations from server CPUs. We present Epiphron, a novel distributed in-memory key-value store architecture that co-designs with off-path SmartNICs and programmable switches. Facing the limited performance of off-path SmartNICs, Epiphron successfully achieves high resource efficiency while keeping load balancing and fault tolerance by $(i)$ hybridizing erasure coding with replication in storage management, $(ii)$ accelerating read operations with a new data plane design (conflict detection and RDMA-compatible forwarding) on programmable switches, $(iii)$ employing a network protocol extended from one-sided RDMA. We evaluate Epiphron on Barefoot Tofino switches, NVIDIA BlueField-2 SmartNICs, and commodity servers. The experimental results demonstrate that compared to existing solutions, Epiphron improves throughput by up to 2.2× and consumes 47% less memory while completely bypassing server CPUs.


  • Open Access

    M2F: Automated Formalization of Mathematical Literature at Scale

    by Zichen Wang, Wanli Ma, Zhenyu Ming, Gong Zhang, Kun Yuan, Zaiwen Wen

    Automated formalization of mathematics enables mechanical verification but remains limited to isolated theorems and short snippets. Scaling to textbooks and research papers is largely unaddressed, as it requires managing cross-file dependencies, resolving imports, and ensuring that entire projects compile end-to-end. We present M2F (Math-to-Formal), the first agentic framework for end-to-end, project-scale autoformalization in Lean. The framework operates in two stages. The statement compilation stage splits the document into atomic blocks, orders them via inferred dependencies, and repairs declaration skeletons until the project compiles, allowing placeholders in proofs. The proof repair stage closes these holes under fixed signatures using goal-conditioned local edits. Throughout both stages, M2F keeps the verifier in the loop, committing edits only when toolchain feedback confirms improvement. In approximately three weeks, M2F converts long-form mathematical sources into a project-scale Lean library of 153,853 lines from 479 pages textbooks on real analysis and convex analysis, fully formalized as Lean declarations with accompanying proofs. This represents textbook-scale formalization at a pace that would typically require months or years of expert effort. On FATE-H, we achieve $96\%$ proof success (vs.\ $80\%$ for a strong baseline). Together, these results demonstrate that practical, large-scale automated formalization of mathematical literature is within reach. The full generated Lean code from our runs is available at https://github.com/optsuite/ReasBook.git.

  • Cross-Rack Update Bandwidth for Rack-Aware Storage Systems

    by Zhengyi Jiang, Bin Yu, Zhongyi Huang, Linqi Song, Bo Bai, Gong Zhang, Hanxu Hou

    Rack-aware storage systems organize the storage nodes in racks such that the cross-rack communication cost is much more expensive than the intra-rack communication cost. In this paper, we primarily investigate the cross-rack update bandwidth defined as the average amount of symbols transferred across different racks during an update process of one single node. It is critical to design erasure codes that minimize the cross-rack update bandwidth. Our main contributions are as follows. First, we establish the model of cross-rack update bandwidth of irregular array codes over rack-aware storage systems. Second, we derive the tight lower bound on cross-rack update bandwidth, and define minimum cross-rack update bandwidth (MCUB) codes as the irregular array codes that can achieve our tight lower bound. Third, we derive the tight lower bound on redundancy defined as the total number of parity symbols for MCUB codes, and define minimum redundancy MCUB (MR-MCUB) codes as the MCUB codes that can achieve the redundancy lower bound. Fourth, we present explicit constructions of MR-MCUB codes that achieve both the minimum cross-rack update bandwidth and the minimum redundancy, which means that the two lower bounds are tight. Last, we define intra-rack update bandwidth as the average amount of symbols incurred within one rack in an update process, and derive the lower bound of intra-rack update bandwidth of MCUB codes. Moreover, we show that our MCUB codes constructions can also achieve the lower bound of intra-rack update bandwidth.

  • Automatic Sketch-Oriented Compiler for Query-Driven Network Telemetry

    by Jinbo Sun, Haifeng Sun, Qun Huang, Wei Wang, Jiaheng Li, Fuliang Li, Yungang Bao, Xin Yao, Gong Zhang

  • Open Access

    Towards In-Depth Root Cause Localization for Microservices with Multi-Agent Recursion-of-Thought

    by Lingzhe Zhang, Tong Jia, Kangjin Wang, Chiming Duan, Minghua He, Rongqian Wang, Xi Peng, Meiling Wang, Gong Zhang, Renhai Chen, et al.


  • Region Partitioning-Based Scalable Real-Time Network Verification via Native Distributed Architecture

    by Bo He, Mingxiao Ma, Yuehan Zhang, Lingqi Guo, Chenyang Zhao, Qi Qi, Zirui Zhuang, Haifeng Sun, Gong Zhang, Jianxin Liao, et al.

    Data plane verification (DPV) is critical in ensuring correct network operation, but practical deployment demands solutions that simultaneously achieve real-time responsiveness and massive scalability. Conventional centralized DPV approaches fundamentally struggle with these requirements due to inherent architectural constraints: the single verification server becomes both a computational bottleneck during rapid verification cycles and a collection bottleneck when gathering real-time data plane updates across large-scale networks. As network scale increases, these limitations manifest as either unacceptable verification latency or incomplete data plane visibility—precisely when robust DPV is essential for preventing packet loss and security violations. This paper introduces Atlas*, a novel distributed data plane verification (DPV) system designed to address fundamental scalability and real-time performance challenges in network verification. Atlas* achieves this through a hierarchical architecture that strategically distributes verification tasks across specialized components, combined with innovative parallel processing techniques to maximize computational efficiency. Simultaneously, Atlas* optimizes communication latency between distributed components through a region partitioning algorithm. Extensive evaluations in simulated environments and production deployments demonstrate Atlas*’s capability to perform fast, scalable verification while maintaining lightweight resource allocation. Empirical results show Atlas* achieves 2-7x speedup compared to existing state-of-the-art solutions, with performance advantages progressively increasing as network scale expands.