Calculation task dynamic allocation method under single-fog-node multi-terminal scene
The invention belongs to the technical field of fog computing task dynamic allocation methods, and particularly relates to a computing task dynamic allocation method under a single-fog-node multi-terminal scene, which comprises the following steps of: S1, establishing a (0-1) integer programming mod...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The invention belongs to the technical field of fog computing task dynamic allocation methods, and particularly relates to a computing task dynamic allocation method under a single-fog-node multi-terminal scene, which comprises the following steps of: S1, establishing a (0-1) integer programming model according to a task allocation problem of joint optimization of time delay and energy consumption; s2, an improved binary system beetle antennae search algorithm is adopted for optimal solution searching, a particle swarm optimization algorithm, a polling algorithm, a random algorithm, an all-unloading method and an all-in-terminal-equipment execution method are selected as baseline algorithms for simulation experiments, and simulation results show that the optimal solution can be obtained through optimal solution searching; whether the number of the terminal devices changes or the computing power of the fog node and the terminal devices changes, the algorithm has the best performance on the task dynamic allocat |
---|