A discrete dwarf mongoose optimization algorithm to solve task assignment problems on smart farms

In this study, we propose a novel cloud-edge collaborative task assignment model for smart farms that consists of a cloud server, m edge servers, and n sensors. The edge servers rely solely on solar-generated energy, which is limited, whereas the cloud server has access to a limitless amount of ener...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cluster computing Jg. 27; H. 5; S. 6185 - 6204
Hauptverfasser: Xu, Minzhi, Li, Weidong, Zhang, Xuejie, Su, Qian
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.08.2024
Springer Nature B.V
Schlagworte:
Algorithms
Approximation
Cloud computing
Collaboration
Computer centers
Computer Communication Networks
Computer Science
Convex analysis
Deep learning
Edge computing
Energy consumption
Heuristic
Mathematical models
Mathematical programming
Neural networks
Operating Systems
Optimization
Optimization algorithms
Processor Architectures
Scheduling
Sensors
Servers
Smart grid
Smart sensors
Task scheduling
Cloud-edge collaborative
Dwarf mongoose algorithm
Unsplittable
Approximation algorithm
Heavy tasks
ISSN:1386-7857, 1573-7543
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this study, we propose a novel cloud-edge collaborative task assignment model for smart farms that consists of a cloud server, m edge servers, and n sensors. The edge servers rely solely on solar-generated energy, which is limited, whereas the cloud server has access to a limitless amount of energy supplied by the smart grid. Each entire task from a sensor is processed by either an edge server or the cloud server. We consider the task to be unsplittable. Building on the algorithm for the multimachine job scheduling problem, we develop a corresponding approximation algorithm. In addition, we propose a new discrete heuristic based on the dwarf mongoose optimization algorithmm, named the discrete dwarf mongoose optimization algorithm, and we utilize the proposed approximation algorithm to improve the convergence speed of this heuristic while yielding better solutions. In this study, we consider task sets with heavy tasks independently, where a heavy task is a task that requires many computing resources to process. If such tasks are assigned as ordinary tasks, the assignment results may be poor. Therefore, we propose a new method to solve this kind of problem.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1386-7857
1573-7543
DOI:10.1007/s10586-024-04271-3