Longbao Dai

dblp:345/4859 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
8since 2021 · last 2026
0000-0002-3914-7507ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 6 · 1 first-author · 6 since 2021Computer networks · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Characterizing and Mitigating I/O Bottlenecks in LLM Inference on Disaggregated HPC Systems
Fanzi Zeng, Kenli Li, Haoran Kong, Longbao Dai
APPT7
2025 SA-MVSNet: Spatial-aware Multi-view Stereo Network with Attention Cost Volume
abstract
Deep learning-based multi-view stereo (MVS) methods enable dense point cloud reconstruction in texture-rich areas. However, existing methods incur significant computational costs to capture pixel dependencies for complete reconstruction in low-texture regions. Additionally, discrete depth layers in occluded environments hinder the cost volume’s ability to model object information effectively. To address these issues, we propose a spatial-aware multi-view stereo network with attention cost volume, termed SA-MVSNet. The network introduces the pixel-driven spatial interaction (PDSI) module, which integrates the hierarchical spatial location enhancement mechanism (HSLE) and the spatial context aggregation mechanism (SCA). Leveraging an efficient parallel architecture, the PDSI module captures pixel-level spatial dependencies with the HSLE and strengthens global contextual information through the SCA. This design improves the network’s ability to represent features in low-texture regions while maintaining high inference efficiency. Furthermore, SA-MVSNet incorporates an attention weight generation branch that refines the cost volume by aggregating multi-scale depth cues, effectively mitigating the impact of occlusion. Experiments on the DTU dataset and the Tanks and Temples dataset show that our method outperforms other learning-based methods, achieving superior performance and strong generalization ability.
Haoran Kong, Fanzi Zeng, Longbao Dai, Jingyang Hu, Jiang-hao Cai, Jianxia Chen, Ruihui Li, Hongbo Jiang 0001
IROS3
2025 Collaborative optimization of offloading and pricing strategies in dynamic MEC system via Stackelberg game
Jing Mei, Cuibin Zeng, Zhao Tong 0001, Longbao Dai, Keqin Li 0001
J. Syst. Archit.4
2025 Throughput-Aware Cooperative Task Offloading in Dynamic Mobile Edge Computing Systems
abstract
With the commercialization of fifth-generation (5G) mobile communication technology and the rapid proliferation of mobile devices (MDs), demand for data computation is surging. This growth increases the reliance of MDs on low latency and high throughput. For this purpose, Mobile Edge Computing (MEC) enhances the user's data processing capability by offloading computation tasks to servers at the network edge. However, achieving high efficiency in task offloading is challenging due to factors such as decision complexity, network dynamics, and user data privacy protection. Additionally, energy causal constraints and the coupling between offloading proportions and resource distribution cannot be ignored. In this paper, we first establish a dynamic task offloading problem to optimize the long-term throughput of the system. Using perturbed Lyapunov optimization, we transform MD delay and energy threshold constraints into the stability control of corresponding virtual queues. Then, we propose the Lyapunov-guided federated deep reinforcement learning (DRL) online task offloading algorithm called LyFOTO, which combines a federated learning (FL) framework and an Actor-Critic (AC) model. Under favorable communication conditions, the LyFOTO algorithm adaptively boosts system throughput; under poorer conditions, it properly delays task offloading, without violating queue backlog constraints. Through mathematical analysis, we discuss the performance of the LyFOTO algorithm. Simulation experiments validate that LyFOTO effectively balances system throughput and device battery energy. Finally, Comparative results show that LyFOTO outperforms other benchmark algorithms in maximizing system throughput while ensuring task backlog and energy threshold constraints.
Longbao Dai, Fanzi Zeng, Haoran Kong, Jiang-hao Cai, Hongbo Jiang 0001, Keqin Li 0001
IEEE Trans. Mob. Comput.1
2024 Lyapunov-guided deep reinforcement learning for delay-aware online task offloading in MEC systems
Longbao Dai, Jing Mei, Zhibang Yang, Zhao Tong 0001, Cuibin Zeng, Keqin Li 0001
J. Syst. Archit.1
2023 Lyapunov optimized energy-efficient dynamic offloading with queue length constraints
Jing Mei, Longbao Dai, Zhao Tong 0001, Lianming Zhang, Keqin Li 0001
J. Syst. Archit.2
2023 Stackelberg game-based task offloading and pricing with computing capacity constraint in mobile edge computing
Zhao Tong 0001, Jing Mei, Longbao Dai, Kenli Li 0001, Keqin Li 0001
J. Syst. Archit.4
2023 Throughput-Aware Dynamic Task Offloading Under Resource Constant for MEC With Energy Harvesting Devices
abstract
With the explosive increase of Internet of Things (IoT) devices, an increasing number of computation-intensive applications are emerging in IoT system. However, most IoT devices are limited by size and location, equipped with low-performance CPUs and low-capacity batteries, which cannot go well with computation-intensive applications. Mobile edge computing (MEC) is considered as a promising solution to provide computation-intensive and latency-sensitive services in IoT system, but it is still challenging to improve the throughput and extend the battery life of IoT devices under communication constraints. This paper focuses on the task offloading problem for an MEC system with multiple energy harvesting (EH) devices. To accommodate the system dynamics and ensure the system stability in terms of task queue and battery level, we apply Lyapunov optimization theory, and design a computation tasks maximum offloading algorithm to maximize the system throughput. The algorithm can determine the offloading decision in real-time without knowing any statistical information about the system. We first give a series of mathematical analysis to verify the system stability and discuss the performance of the algorithm. In addition, a number of simulation experiments are conducted to present the efficiency of the algorithm.
Jing Mei, Longbao Dai, Zhao Tong 0001, Keqin Li 0001
IEEE Trans. Netw. Serv. Manag.2