PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 15, 2026Mathematics0 citationsOpen Access

Task Scheduling Optimization in Cloud-Edge Collaborative Architecture via a Multi-Strategy Artificial Lemming Algorithm

View Full Paper
YZYue ZhangJWJianfeng Wang

Key Points

  • This research aims to improve task scheduling performance in cloud-edge collaborative architectures using an optimized algorithm.
  • Proposed a multi-strategy artificial lemming algorithm integrating high-order Chebyshev polynomials and chaotic mapping.
  • Introduced an Adaptive Spatial Search Mechanism to enhance exploration during scheduling.
  • Implemented a Bernstein-Guided Correction Strategy to improve exploitation capabilities and stability.
  • The proposed MALA reduces total scheduling cost by at least 3% compared to baseline algorithms.
  • The scheduling response time is indirectly shortened, improving overall performance.
  • Enhanced stability of cloud-edge scheduling is observed with the proposed optimizations.

Abstract

In the cloud computing environment, various heterogeneous architectures have emerged, and the cloud-edge collaborative task scheduling architecture has come into being under this background. However, the complexity of cloud-edge heterogeneous architecture significantly restricts the improvement of scheduling performance. Therefore, researchers propose solving this problem by leveraging intelligent optimization algorithms. The Artificial Lemming Algorithm has received extensive attention due to its strong robustness. However, when dealing with the problem of cloud-edge collaborative task scheduling, there are still some drawbacks, such as long system response time and unstable scheduling performance. In response to the above problems, this paper proposes a multi-strategy artificial lemming algorithm. Specifically, by coordinating high-order Chebyshev polynomials with chaotic mapping to enhance the richness of the initial population, the scheduling response time is indirectly shortened. Secondly, the Adaptive Spatial Search Mechanism is introduced to make up for the deficiencies in the exploration stage, enhance the algorithm’s exploration ability, and thereby improve the optimization effect of scheduling satisfaction. Furthermore, the Bernstein-Guided Correction Strategy is introduced to enhance the exploitation capability of the algorithm to improve the stability of cloud-edge scheduling. The experimental results demonstrate that compared with the baseline algorithms, the proposed MALA reduces the total scheduling cost by at least 3% across cloud-edge collaborative resource scheduling problems of different scales.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zhang et al. (2026) studied this question.

synapsesocial.com/papers/6a06b998e7dec685947ac552https://doi.org/10.3390/math14101659
Ask AI
Helpful
Bookmark
Share
View Full Paper