IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i7p1183-d1627713.html
   My bibliography  Save this article

Multi-Satellite Task Parallelism via Priority-Aware Decomposition and Dynamic Resource Mapping

Author

Listed:
  • Shangpeng Wang

    (School of Computer Science and Engineering, Central South University, Changsha 410083, China)

  • Chenyuan Zhang

    (School of Computer Science and Engineering, Central South University, Changsha 410083, China)

  • Zihan Su

    (School of Computer Science and Engineering, Central South University, Changsha 410083, China)

  • Limin Liu

    (School of Computer Science and Engineering, Central South University, Changsha 410083, China)

  • Jun Long

    (School of Computer Science and Engineering, Central South University, Changsha 410083, China
    Big Data Institute, Central South University, Changsha 410083, China)

Abstract

Multi-satellite collaborative computing has achieved task decomposition and collaborative execution through inter-satellite links (ISLs), which has significantly improved the efficiency of task execution and system responsiveness. However, existing methods focus on single-task execution and lack multi-task parallel processing capability. Most methods ignore task priorities and dependencies, leading to excessive waiting times and poor scheduling results. To address these problems, this paper proposes a task decomposition and resource mapping method based on task priorities and resource constraints. First, we introduce a graph theoretic model to represent the task dependency and priority relationships explicitly, combined with a novel algorithm for task decomposition. Meanwhile, we construct a resource allocation model based on game theory and combine it with deep reinforcement learning to achieve resource mapping in a dynamic environment. Finally, we adopt the theory of temporal logic to formalize the execution order and time constraints of tasks and solve the dynamic scheduling problem through mixed-integer nonlinear programming to ensure the optimality and real-time updating of the scheduling scheme. The experimental results demonstrate that the proposed method improves resource utilization by up to about 24% and reduces overall execution time by up to about 42.6% in large-scale scenarios.

Suggested Citation

  • Shangpeng Wang & Chenyuan Zhang & Zihan Su & Limin Liu & Jun Long, 2025. "Multi-Satellite Task Parallelism via Priority-Aware Decomposition and Dynamic Resource Mapping," Mathematics, MDPI, vol. 13(7), pages 1-30, April.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1183-:d:1627713
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1183/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/7/1183/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1183-:d:1627713. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.