Bojie Li

Bojie Li

Auto-generated profile, based on publicly available information

Bojie Li

Huawei Technologies Co. Ltd., China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 November 2019 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
GCGuo Chen
Guo Chen
YLYuanwei Lu
Yuanwei Lu
BLBojie Li
Bojie Li
KTKun Tan
Kun Tan
YXYongqiang Xiong
Yongqiang Xiong
TMThomas Moscibroda
Thomas Moscibroda
RDMA is becoming prevalent because of its low latency, high throughput and low CPU overhead. However, in current datacenters, RDMA remains a single path transport which is prone to failures and falls short to utilize the rich parallel network paths. Unlike previous multi-path approaches, which mainly focus on TCP, this paper presents a multi-path transport for RDMA, i.e. MP-RDMA, which efficiently utilizes the rich network paths in datacenters. MP-RDMA employs three novel techniques to address the challenge of limited RDMA NICs on-chip memory size: 1) a multi-path ACK-clocking mechanism to distribute traffic in a congestion-aware manner without incurring per-path states; 2) an out-of-order aware path selection mechanism to control the level of out-of-order delivered packets, thus minimizes the meta data required to them; 3) a synchronise mechanism to ensure in-order memory update whenever needed. With all these techniques, MP-RDMA only adds 66B to each connection state compared to single-path RDMA. Our evaluation with an FPGA-based prototype demonstrates that compared with single-path RDMA, MP-RDMA can significantly improve the robustness under failures (2x≈4x higher throughput under 0.5%≈10% link loss ratio) and improve the overall network utilization by up to 47%.

11 May 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
GCGuo Chen
Guo Chen
YLYuanwei Lu
Yuanwei Lu
YMYuan Meng
Yuan Meng
BLBojie Li
Bojie Li
KTKun Tan
Kun Tan
YZYouJian Zhao
YouJian Zhao
To achieve low TCP flow completion time (FCT) in data center networks (DCNs), it is critical and challenging to rapidly recover loss without adding extra congestion. Therefore, in this paper, we propose a novel loss recovery approach fast multi-path loss recovery (FUSO) that exploits multi-path diversity in DCN for transport loss recovery. In \name, when a multi-path transport sender suspects loss on one sub-flow, recovery packets are immediately sent over another sub-flow that is not or less lossy and has spare congestion window slots. \name is fast in that it does not need to wait for timeout on the lossy sub-flow, and it is cautious in that it does not violate the congestion control algorithm. Testbed experiments and simulations show that \name decreases the latency-sensitive flows' 99th percentile FCT by up to ~82.3% in a 1-Gb/s testbed, and up to ~87.9% in a 10 Gb/s large-scale simulated network.

17 August 2019
Verified
Conference Paper
Open access
PPPulin Pan
Pulin Pan
GCGuo Chen
Guo Chen
XWXizheng Wang
Xizheng Wang
HDHuichen Dai
Huichen Dai
BLBojie Li
Bojie Li
KTKun Tan
Kun Tan

30 November 2023 in ACM Transactions on Computer Systems
Verified
Journal Article
Open access
JZJie Zhao
Jie Zhao
JXJinchen Xu
Jinchen Xu
PDPeng Di
Peng Di
WNWang Nie
Wang Nie
JHJiahui Hu
Jiahui Hu
XJXuefeng Jin
Xuefeng Jin
Loop tiling and fusion are two essential transformations in optimizing compilers to enhance the data locality of programs. Existing heuristics either perform loop tiling and fusion in a particular order, missing some of their profitable compositions, or execute ad-hoc implementations for domain-specific applications, calling for a generalized and systematic solution in optimizing compilers. In this article, we present a so-called basteln (an abbreviation for backward slicing of tiled loop nests) strategy in polyhedral compilation to better model the interplay between loop tiling and fusion. The basteln strategy first groups loop nests by preserving their parallelism/tilability and next performs rectangular/parallelogram tiling to the output groups that produce data consumed outside the considered program fragment. The memory footprints required by each tile are then computed, from which the upward exposed data are extracted to determine the tile shapes of the remaining fusion groups. Such a tiling mechanism can construct complex tile shapes imposed by the dependences between these groups, which are further merged by a post-tiling fusion algorithm for enhancing data locality without losing the parallelism/tilability of the output groups. The basteln strategy also takes into account the amount of redundant computations and the fusion of independent groups, exhibiting a general applicability. We integrate the basteln strategy into two optimizing compilers, with one a general-purpose optimizer and the other a domain-specific compiler for deploying deep learning models. The experiments are conducted on CPU, GPU, and a deep learning accelerator to demonstrate the effectiveness of the approach for a wide class of application domains, including deep learning, image processing, sparse matrix computation, and linear algebra. In particular, the basteln strategy achieves a mean speedup of 1.8× over cuBLAS/cuDNN and 1.1× over TVM on GPU when used to optimize deep learning models; it also outperforms PPCG and TVM by 11% and 20%, respectively, when generating code for the deep learning accelerator.

14 November 2026
Verified
Conference Paper
Open access
HSHuijun Shen
Huijun Shen
BLBojie Li
Bojie Li
HPHaixin Pang
Haixin Pang
PHPeihao Huang
Peihao Huang
XLXingtong Lin
Xingtong Lin
GCGuo Chen
Guo Chen