Edge calculation task allocation method based on branch and bound method
The invention provides an edge calculation task allocation method based on a branch and bound method, and belongs to the field of edge calculation. According to the method, the total energy consumption of task allocation is minimized on the premise of considering constraints such as task completion...
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 provides an edge calculation task allocation method based on a branch and bound method, and belongs to the field of edge calculation. According to the method, the total energy consumption of task allocation is minimized on the premise of considering constraints such as task completion time and DAG parallel system reliability requirements. Firstly, the optimization problem is relaxed,and a temporary solution is obtained through an interior point method; taking a discrete value of a decision variable of a first task in the temporary solution and meeting the constraint that one task can only be executed in one edge server; wherein only one decision variable is taken as 1 and the other decision variables are taken as 0, traversing the value taking condition from the first edge server to the last edge server, continuously solving the remaining tasks by adopting an interior point method, calculating the energy consumption values of different solutions, taking the solution withthe minimum energy consum |
---|