Edge calculation task allocation method based on branch and bound method

A branch-and-bound method and task allocation technology, applied in digital transmission systems, electrical components, transmission systems, etc., can solve long network delays, network edge data security and privacy leakage, and large-scale data center energy consumption requirements are difficult to meet and other problems to achieve the effect of minimizing energy consumption and improving overall performance

Active Publication Date: 2020-02-21
XIANGTAN UNIV
View PDF4 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Traditional cloud computing mostly adopts centralized management methods, and the transmission of massive data from the edge of the network to the cloud computing center will cause a long network delay, which does not meet the needs of real-time applications
At the same time, if the intermediate network is attacked wh

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Edge calculation task allocation method based on branch and bound method
  • Edge calculation task allocation method based on branch and bound method
  • Edge calculation task allocation method based on branch and bound method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] The present invention will be described in further detail below in conjunction with the accompanying drawings.

[0030] Task set: the application program running on the terminal device is represented by a DAG task graph G=(T,P), and each member is defined as follows:

[0031] T={t 1 ,t 2 ,...,t m} represents the set of tasks that need to be executed by the edge server, the number of tasks in the task graph is m, in image 3 Among them, there are 6 tasks in total; P={P ij |t i ,t j ∈T} represents the set of communication edges between tasks, Pij means from task t i to task t j A directed edge of image 3 In the task t 1 to task t 2 A directed edge of P is 12 .

[0032] Edge network: The edge network composed of edge servers is represented by a mesh network N=(A,D), and each member is defined as follows:

[0033] A={a 1 ,a 2 ,...,a n} represents the set of edge servers, the number of edge servers is n, in image 3 In , there are 4 edge servers; D={d ij} ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

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 consumption value, and repeating the step until the last task. The method has the advantages of good convergence, small calculated amount and the like.

Description

technical field [0001] The present invention relates to the field of edge computing, in particular to an edge computing task assignment method based on a branch and bound method. Background technique [0002] As the demand for new industries such as the consumer Internet of Things and the Industrial Internet of Things continues to flourish, the centralized data processing technology centered on the cloud computing model can no longer efficiently process the large amount of data generated by edge devices. Edge computing is a new type of computing model that performs computing at the edge of the network, and the edge of edge computing refers to any computing resources and network resources between the path from the data source to the cloud computing center. For example, a gateway in a smart home can be viewed as the edge between electronic devices in the home and the cloud computing center. The basic principle of edge computing is to migrate computing tasks to edge devices th...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L12/24H04L29/08
CPCH04L41/0823H04L41/145H04L67/1097H04L41/0893H04L67/1001
Inventor 裴廷睿李梦瑶田淑娟邹娟曹江莲关屋大雄崔荣埈
Owner XIANGTAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap