Node load balancing scheduling method for edge computing environment

An edge computing and load balancing technology, applied in the field of wireless communication, can solve problems such as node idleness and node overload, and achieve the effect of reducing possibility and improving task execution efficiency

Inactive Publication Date: 2021-06-01
SHANGHAI JIAO TONG UNIV
View PDF9 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this scheduling method does not take the current load of nodes as a node selection index. Due to the uneven distribution of terminals, some nodes may be overloaded, while some nodes are idle.

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
  • Node load balancing scheduling method for edge computing environment
  • Node load balancing scheduling method for edge computing environment
  • Node load balancing scheduling method for edge computing environment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0013] Such as figure 1 As shown, this embodiment specifically includes the following steps:

[0014] Step 1: Obtain the task type, latest completion time, required computing resources and I / O resources sent by the receiving terminal.

[0015] The task types include: calculation-intensive and I / O-intensive, for the i-th task, there is a calculation coefficient c i and I / O factor m i , when it is computationally intensive, then: c i ≥m i , when it is I / O intensive, then: m i ≥c i , and c i +m i =2.

[0016] Step 2: Calculate the propagation distance that can be reached before the task's latest completion time.

[0017] The propagation distance R=(T i -T n )sv, where: v is the propagation speed of electromagnetic waves in the optical fiber is 2.0×10 5 km / s, T i is the latest completion time of the task, T n is the current time, s(s<1) is the loss coefficient.

[0018] Step 3: Obtain n node indicators within the distance that the task can propagate in the edge comp...

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 discloses a node load balancing scheduling method in an edge computing environment. The method comprises the following steps: acquiring a CPU utilization rate and an I/O resource utilization rate of edge nodes around a base station according to the latest completion time of a task sent by a base station receiving terminal; calculating the average load rate of the obtained surrounding nodes, and calculating the load rate of each node; putting the nodes with the load rates smaller than or equal to the average load rate into the first queue in a positive sequence, putting the nodes with the load rates larger than the average load rate into the second queue in a positive sequence, and finally putting the current task into the nodes of the first queue or the nodes of the second queue meeting the current task resource to be executed. According to the method, the nodes are screened, so that the problem of load imbalance caused by only selecting the nearest node in a common method is avoided; when the nodes are released for the tasks, the adopted measurement index is the load rate instead of the load, so the tasks can be allocated to the nodes with fewer resources under the condition that the resource difference between the nodes is very large, and the load balancing is really achieved.

Description

technical field [0001] The present invention relates to a technology in the field of wireless communication, in particular to a node load balancing scheduling method in an edge computing environment. Background technique [0002] Edge computing is a new distributed multi-deployment architecture. Compared with cloud computing, all terminals have similar distances and propagation delays from computing nodes. The existing task scheduling method is to select a node from the edge nodes that are closer to the task initiation site as the node to process the task. When selecting a node, it is necessary to consider the propagation delay, the amount of transmitted data, the network environment, the computing power of the node, and Factors such as the latest completion time of the task. However, this scheduling method does not take the current load of nodes as a node selection index. Due to the uneven distribution of terminals, some nodes may be overloaded and some nodes may be idle. ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/08G06F9/50
CPCH04L67/1008G06F9/5083H04L67/1001
Inventor 祝钰轩唐新怀
Owner SHANGHAI JIAO TONG 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