Fei Lei

Fei Lei


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
21 June 2023
Verified
Conference Paper
Open access
RWRuiqi Wang
Ruiqi Wang
DDDezun Dong
Dezun Dong
FLFei Lei
Fei Lei
JMJunchao Ma
Junchao Ma
KWKe Wu
Ke Wu
KLKai Lu
Kai Lu
The allreduce operation is the most commonly used collective operation in distributed or parallel applications. It aggregates data collected from distributed hosts and broadcasts the aggregated result back to them. In-network computing can accelerate allreduce by offloading this operation into network devices. However, existing in-network solutions face the challenge of high throughput, performance of aggregating large message and producing repeatable results. In this work, we propose a simple and effective router microarchitecture for in-network allreduce, which uses an RDMA protocol to improve its throughput. We further discuss strategies to tackle the aforementioned challenges. Our approach not only shows advantages in comparison with the state-of-the-art in-network solutions, but also accelerates allreduce at a near-optimal level compared to host-based algorithms, as demonstrated through experiments.


27 November 2018 in Electronics
Verified
Journal Article
Open access
PDF file
XSXing Su
Xing Su
FLFei Lei
Fei Lei
The Basic Linear Algebra Subprograms (BLAS) is a fundamental numerical software and GEneral Matrix Multiply (GEMM) is the most important computational kernel routine in the BLAS library. On multi-core and many-core processors, the whole workload of GEMM is partitioned and scheduled to multiple threads to exploit the parallel hardware. Generally, the workload is equally partitioned among threads and all threads are expected to accomplish their work in roughly the same time. However, this is not the case on Non-Uniform Memory Access (NUMA) architectures. The NUMA effect may cause threads to run at different speeds, and the overall executing times of GEMM is determined by the slowest thread. In this paper, we propose a hybrid-grained dynamic load-balancing method to reduce the harm of the NUMA effect by allowing fast threads to steal work from slow ones. We evaluate the proposed method on Phytium 2000+, an emerging 64-core high-performance processor based on Arm’s AArch64 architecture. Results show that our method reduces the synchronization overhead by 51.5% and achieves an improvement of GEMM performance by 1.9%.

29 July 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
FLFei Lei
Fei Lei
DDDezun Dong
Dezun Dong
XLXiangke Liao
Xiangke Liao
Interconnection networks play an essential role in the architecture of high-performance computing (HPC) systems. In this article, we explore the Galaxyfly family to build flexible-scale interconnection networks. Galaxyfly is guaranteed to retain a small constant diameter while achieving a flexible tradeoff between network scale and bisection bandwidth. Galaxyfly not only supports small-scale interconnection networks with smaller diameter but also lowers the demands for high-radix routers and is able to utilize routers with moderate radix to build exascale interconnection networks. We analyze the constructible configuration of Galaxyfly and evaluate the properties of Galaxyfly. We conduct extensive simulations and analysis to evaluate the performance, cost, and power consumption of Galaxyfly on physical layout against state-of-the-art topologies. The results show that our design achieves better performance than most existing topologies under typical HPC workloads, and is cost-effective to deploy for exascale HPC systems.

29 June 2023
Verified
Conference Paper
Open access
BLBinyan Lan
Binyan Lan
FLFei Lei
Fei Lei
KWKe Wu
Ke Wu
DDDezun Dong
Dezun Dong

20 November 2025 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
JMJunchao Ma
Junchao Ma
DDDezun Dong
Dezun Dong
FLFei Lei
Fei Lei
XLXiao Liquan
Xiao Liquan