Article
Version 1
Preserved in Portico This version is not peer-reviewed
A Global Resource Scheduling for Distributed Edge Computing
Version 1
: Received: 12 October 2023 / Approved: 13 October 2023 / Online: 13 October 2023 (07:48:18 CEST)
A peer-reviewed article of this Preprint also exists.
Tan, A.; Li, Y.; Wang, Y.; Yang, Y. Global Resource Scheduling for Distributed Edge Computing. Appl. Sci. 2023, 13, 12490. Tan, A.; Li, Y.; Wang, Y.; Yang, Y. Global Resource Scheduling for Distributed Edge Computing. Appl. Sci. 2023, 13, 12490.
Abstract
Recently, there has been a growing interest in distributed edge computing resource scheduling. For example, application scenarios such as intelligent traffic systems and Internet of Things(IoT) intelligent monitoring require the scheduling and migration of distributed resources. Distributed resource scheduling needs to consider the cost of resource scheduling, with the primary goal of finding the optimal strategy among various feasible solutions. There are different definitions for optimization objectives in different application scenarios, such as cost, transmission delay, energy consumption, etc. Current research mainly considers the optimization problem of local resource scheduling but needs more consideration of global resource scheduling. This paper defines a global resource scheduling problem for distributed edge computing and proves that the problem is NP-Hard. A heuristic solution strategy based on the Ant Colony Algorithm(ACO) was proposed, and Particle Swarm Optimization(PSO) was used to optimize the parameters of the ACO. Finally, an experimental comparative analysis was conducted to demonstrate that the algorithm proposed in this paper has good accuracy and iteration cost performance.
Keywords
resource scheduling; distributed systems; edge computing
Subject
Computer Science and Mathematics, Data Structures, Algorithms and Complexity
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
