Skip to content
Open access

Dynamic Scheduling Algorithm for Edge-cloud Collaborative Computing Resources Based on 5G NR-U and Distributed Large Model

Sep 2026 · Tsinghua Science and Technology · 0 citations

TL;DR

The proposed MADDPG algorithm outperforms benchmark algorithms such as CO (Cloud-Only), GO (Greedy Offloading), SEP (Static Expert Partitioning), DDPG (Deep Deterministic Policy Gradient), COMA (Counterfactual Multi-Agent Policy Gradients), and MAPPO (Multi-Agent Proximal Policy Optimization) in terms of average iteration latency, system throughput, and communication energy consumption.

Abstract

With the deployment of 5G NR-U (5th Generation New Radio in Unlicensed Spectrum) in unlicensed spectrum and the rise of sparse large-scale models (exemplified by Switch Transformers) in edge computing, edge-cloud collaborative training faces the dual challenges of dynamic spectrum contention and heterogeneous load distribution. This paper addresses the coupled uncertainty of time-varying 5G NR-U channels and the random arrival of expert tasks in MoE (Mixture of Experts) by introducing a dynamic scheduling algorithm for edge-cloud collaboration based on MADDPG (Multi-Agent Deep Deterministic Policy Gradient). This algorithm models each edge server as an agent and, based on local observations, jointly decides on task offloading targets (terminal, edge, or cloud), expert cache replacement, and 5G NR-U contention window parameters through a continuous action space, achieving cross-layer collaborative optimization of communication and computing cache resources. A centralized critic network is used for global training, and the reward function integrates average iterative latency, communication energy consumption, system throughput, and load balancing. On a simulation platform comprising eight heterogeneous edge nodes and one cloud center, three scenarios—baseline, high-interference, and burst load—were implemented for validation. Experimental results show that the proposed MADDPG algorithm outperforms benchmark algorithms such as CO (Cloud-Only), GO (Greedy Offloading), SEP (Static Expert Partitioning), DDPG (Deep Deterministic Policy Gradient), COMA (Counterfactual Multi-Agent Policy Gradients), and MAPPO (Multi-Agent Proximal Policy Optimization) in terms of average iteration latency (minimum 78 ms), system throughput (maximum 185 K tokens/s), expert load balancing (minimum standard deviation 15.3), and communication energy consumption (minimum 52 J). It demonstrates superior adaptability, robustness, and collaborative efficiency under scenarios of severe channel fluctuations and burst load, providing a feasible intelligent scheduling solution for efficient training of sparse large models in dynamic edge environments.

Read PDF

Similar papers

2026

Topology-Aware Task Offloading and Resource Allocation in Edge Cloud Computing Enabled IIoT With Agentic AI

Edge cloud computing in the Industrial Internet of Things (IIoT) enables latency-sensitive tasks from IIoT terminals to be offloaded to distributed edge data centers (EDCs). This paper proposes an agentic artificial intelligence (AI)-assisted Stackelberg game framework to address the task offloading and resource alloca...

Zitian Zhang, Wang-Ping Xu, Da-Wei Xie et al. · 0 citations
Conference Aug 2026

Computing Assignment and Radio Resource Allocation for Edge-End Collaborative Inference in Mobile Edge Computing

The growing usage of AI and large models has driven increasing demand for edge-end collaborative inference in mobile edge computing. However, inefficient resource utilization still prevents effective support for such services, especially reflected in difficulty of coordinating numerous computation requests with limited...

Hao Luo, Hui Tian, Hui-Qing Ao et al. · 0 citations
#edge computing Open access Sep 2026

Service-Level Agreement-Aware Scheduling Algorithm Based on Heterogeneous Computing Collaboration in Smart Video Surveillance Scenarios

Experimental results show that the proposed algorithm coordinates heterogeneous computing resources between the cloud center and the edge and exhibits earlier empirical reward stabilization and lower task-violation rates than the compared learning-based baselines under the tested workload conditions.

Jian Song, Jing Wang, Jun-Fei Yan et al. · 0 citations
Conference Aug 2026

Online Adaptive Learning for Fair Joint Hybrid Precoding and Task Scheduling in Dynamic Wireless - Computing Power Networks

Emerging 6G applications impose heterogeneous, time-varying requirements on both wireless spectral resources and distributed computing resources. Existing works address hybrid precoding (HP) design and computing power network (CPN) task scheduling in isolation, and predominantly rely on static, offline optimization tha...

Jia-Qi Huang, Bei-Bei Zhang, Xin-Yuan Li et al. · 0 citations
Open access 2026

On-Orbit Computing and Caching: A Distributed Regret Learning Approach

A distributed game-theoretic framework for joint task offloading and service caching in STINs, providing provable equilibrium guarantees is developed, formulated as a non-cooperative stochastic game among IoT devices that autonomously determine their computing, association, and satellite caching strategies.

Filothei Linardatou, Maria Diamanti, E. Tsiropoulou et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.