Dynamic Task Decomposition and Long-Term Guarantee Mechanism for Spatial Distributed Computing

Abstract

With improving satellite computing capabilities, low earth orbit (LEO) satellites can be a supplement of ground networks. However, resource-limited LEO satellites face challenges in providing computationally intensive services as demand for computing power increases. Rapid movement of LEO satellites also poses a challenge in maintaining computation in the required area. To address these problems, this paper proposes a distributed computing strategy based on dynamic task decomposition. When making decisions of task decomposition, the strategy considers the resource utilization of the satellite network and the relationship between sub-tasks, and flexibly decomposes and aggregates tasks. Additionally, it proposes a long-term computing guarantee mechanism to keep the computation within user regions. The mechanism makes decisions based on real-time network topology and task decomposition relationship. It modularizes satellite handover process, and adjusts compression rate and service switching methods based on network conditions to minimize interruption during handover. The experimental results indicate that the strategy ensures long-term distributed computing. The average service time has increased by 110%, user satisfaction has improved about 20%, and both handover cost and inter-task communication cost have decreased by 15%.

Keywords

• satellite handover; computation residency; distributed computing; task decomposition