CN112559187A - Method and system for dynamically allocating tasks to mobile edge computing server - Google Patents
Method and system for dynamically allocating tasks to mobile edge computing server Download PDFInfo
- Publication number
- CN112559187A CN112559187A CN202011525191.5A CN202011525191A CN112559187A CN 112559187 A CN112559187 A CN 112559187A CN 202011525191 A CN202011525191 A CN 202011525191A CN 112559187 A CN112559187 A CN 112559187A
- Authority
- CN
- China
- Prior art keywords
- task
- server
- edge server
- edge
- processing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000005265 energy consumption Methods 0.000 claims abstract description 20
- 238000004364 calculation method Methods 0.000 claims description 15
- 238000004590 computer program Methods 0.000 claims description 6
- 238000013500 data storage Methods 0.000 claims description 4
- 230000000977 initiatory effect Effects 0.000 claims description 3
- 238000005457 optimization Methods 0.000 description 4
- 238000013468 resource allocation Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000003190 augmentative effect Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method and a system for dynamically distributing tasks by a mobile edge computing server, wherein the method comprises the following steps: acquiring information of one or more tasks generated by a terminal in an area within a certain time period, wherein the information comprises the data volume of the tasks and the time delay requirement information of the tasks; judging whether the task can be processed in the local server according to the processing speed and/or the processing energy consumption and/or the congestion condition of the local server in the area; and if the task cannot be processed in the local server, selecting a proper edge server for the task to process according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server. The invention solves the problem of how to dynamically allocate the tasks to the proper servers according to the matching condition of the local server and the terminal tasks and the matching condition of the edge server and the terminal tasks.
Description
Technical Field
The invention belongs to the technical field of mobile edge computing, and particularly relates to a method and a system for dynamically allocating tasks by a mobile edge computing server.
Background
Along with application scenarios of 5G technology, such as augmented reality, virtual reality, industrial internet of things, telemedicine, etc., data traffic is large and there are usually high requirements on quality of service (QoS), and therefore a mobile edge computing system is proposed. In the mobile edge computing system, tasks generated by the application program of the terminal can be selected to run locally, and the tasks can also be unloaded to the edge server to run in a wireless transmission mode. How to perform task offloading and resource allocation is one of the most important issues in mobile edge computing. In the related art, for example, chinese patent "a hierarchical edge computing offloading method based on priority" with publication number CN111954236A proposes that an edge node closer to a user equipment and having fewer computing resources processes a simple task to quickly return warning information, a server farther from the user equipment and having more computing resources processes a complex task, and finally returns an accurate result, and provides a resource allocation and task scheduling optimization scheme based on service emergency priority for the problem that limited resource competition may increase time delay. Chinese patent CN111885147A, dynamic pricing method for resources in edge computing, proposes to divide the task of the mobile terminal and calculate it in local and edge servers respectively, after the terminal generates a task request, it first judges whether the task needs to be unloaded, then determines the unit price of the resource according to the system resource allowance, the resource is rich, the resource price is decreased, the resource is scarce, and the price is increased; determining the unloading size of the task according to the price; if the unloading is not needed, the calculation is directly carried out in the local terminal. A chinese patent CN111372314A, task offloading method and task offloading device based on mobile edge computing, proposes to obtain task information and system real-time parameter information of a task to be processed of a terminal device; determining an optimization objective equation with minimized system overhead according to the task information to be processed and the real-time parameter information of the system; the optimization objective equation is decomposed into two sub-problems: task offloading and channel allocation sub-problems and transmission power and edge server resource allocation sub-problems; solving the sub-problems to obtain a final task unloading scheme; and carrying out task unloading on the mobile edge computing scene according to the task unloading scheme.
The technical scheme obtains the unloading scheme from the aspects of service emergency priority, dynamic pricing and objective equation optimization. However, the above solutions can not select a server to process according to the matching situation between the server and the terminal task. At present, a technical scheme for dynamically allocating tasks to appropriate servers according to the matching condition of the local server and the terminal tasks and the matching condition of the edge server and the terminal tasks does not exist, and therefore a method and a system for dynamically allocating tasks to a mobile edge computing server are provided.
Disclosure of Invention
In order to solve the above problems, the present invention provides a method and a system for dynamically allocating tasks to a mobile edge computing server.
The invention relies on a mobile edge computing system. And the mobile terminal application program in the area generates a task information stream, and the local base station dynamically allocates tasks according to the task information.
The invention discloses a dynamic task allocation method of a mobile edge computing server, which is characterized in that:
acquiring information of one or more tasks generated by a terminal in an area within a certain time period, wherein the information comprises the data volume of the tasks and the time delay requirement information of the tasks;
judging whether the task can be processed in the local server according to the processing speed and/or the processing energy consumption and/or the congestion condition of the local server in the area;
and if the task cannot be processed in the local server, selecting a proper edge server for the task to process according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server.
Preferably, the data amount of the task is any one or more combination of data storage amount, data calculation amount and execution program amount required for processing the task.
Preferably, the delay requirement information of the task is any one or a combination of multiple items of a minimum delay requirement for ensuring normal operation of the terminal, a delay requirement set according to the type of the task, a delay requirement set according to the type of the terminal where the task is located, and a delay requirement set according to the position of the terminal where the task is located.
Preferably, the congestion condition includes any one or more of a task processing queuing condition of the server due to the fact that the task queue is full, a condition that the server cannot process the task due to a fault, a task processing queuing condition of the server due to occupation, and a task processing queuing condition of the server due to too long processing delay of the current task.
Preferably, the determining whether the task can be processed at the local server according to the processing speed and/or the processing energy consumption and/or the congestion condition of the local server in the area includes:
calculating a matching value of the local server and the task data volume according to the processing speed and/or the processing energy consumption and/or the matching degree of the congestion condition and the task data volume of the local server in the region;
calculating a matching value of the local server and the task delay requirement according to the processing speed and/or the processing energy consumption and/or the degree of matching between the congestion condition and the task delay requirement of the local server in the region;
calculating a matching value of the local server and the task information according to the matching value of the local server and the task data volume and/or the matching value of the local server and the task delay requirement;
and when the matching value of the local server and the task information is larger than a preset local matching threshold value, judging that the task can be processed at the local server.
Preferably, the selecting a suitable edge server for the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server comprises:
acquiring distance information between each edge server and a terminal where a task is located and/or congestion conditions of each edge server and/or processing capacity information of each edge server;
calculating a matching value of each edge server and the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the matching degree of the processing capacity of each edge server and the data volume and/or the time delay requirement of the task;
and selecting the edge server corresponding to the maximum matching value for processing by taking the task as a reference.
Preferably, the selecting a suitable edge server for the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server comprises:
acquiring distance information between each edge server and a terminal where a task is located and/or congestion conditions of each edge server and/or processing capacity information of each edge server;
calculating a matching value of each edge server and the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the matching degree of the processing capacity of each edge server and the data volume and/or the time delay requirement of the task;
sequentially distributing tasks with the maximum matching value to each edge server by taking each edge server as a reference for processing;
and judging whether a task does not select the edge server, if so, re-executing the steps aiming at the task which does not select the edge server.
Further preferably, the method further comprises the following steps: when the tasks distributed by the edge servers are repeated, the task is preferentially distributed to the edge server with the maximum matching value with the task, and the rest edge servers distribute the next task according to the matching value sequence.
A computer-readable storage medium storing a computer program for electronic data exchange, wherein the computer program causes a computer to perform the above method.
A system for dynamically assigning tasks to a mobile edge computing server, comprising:
a terminal;
a processor;
a memory;
and
one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the processor, the programs causing the computer to perform the method of claim above.
The method and the system have the advantages that:
(1) and judging whether the task is processed in the local server according to the processing speed and/or the processing energy consumption and/or the matching degree of the congestion condition and the task information of the local server in the region, and effectively judging whether the local server can process the task from multiple dimensions, so that the local server can process the task with smaller data volume and high time delay requirement preferentially.
(2) According to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server, selecting a proper edge server for the task to process, and selecting the most proper edge server for the task from multiple dimensions, so that the task processing efficiency is effectively improved;
(3) and sequentially distributing the task with the largest matching value to each edge server by taking each edge server as a reference for processing, and repeatedly executing until all the tasks are distributed to the edge servers, so that each task is distributed to each edge server for parallel processing, and the processing efficiency of multiple tasks is improved.
Drawings
FIG. 1 is a flowchart illustrating steps of a method for dynamically assigning tasks to a mobile edge computing server according to an embodiment of the present invention;
FIG. 2 is a block diagram of a system for dynamically assigning tasks by a mobile edge computing server according to an embodiment of the present invention.
Detailed Description
The following describes in detail preferred embodiments of the present invention.
The invention relies on a mobile edge computing system. And the mobile terminal application program in the area generates a task information stream, and the local base station dynamically allocates tasks according to the task information.
The embodiment of the method for dynamically allocating tasks by the mobile edge computing server of the invention has a flow chart as shown in fig. 1, and is characterized in that:
acquiring information of one or more tasks generated by a terminal in an area within a certain time period, wherein the information comprises the data volume of the tasks and the time delay requirement information of the tasks;
judging whether the task can be processed in the local server according to the processing speed and/or the processing energy consumption and/or the congestion condition of the local server in the area;
and if the task cannot be processed in the local server, selecting a proper edge server for the task to process according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server.
Preferably, the data amount of the task is any one or more combination of data storage amount, data calculation amount and execution program amount required for processing the task. In this embodiment, all tasks generated by an application program in a certain period of time by a terminal in an area are acquired, and the data amount of each task refers to any one or a combination of multiple items of data storage amount, data calculation amount, and execution program amount required for processing the task.
Preferably, the delay requirement information of the task is any one or a combination of multiple items of a minimum delay requirement for ensuring normal operation of the terminal, a delay requirement set according to the type of the task, a delay requirement set according to the type of the terminal where the task is located, and a delay requirement set according to the position of the terminal where the task is located. In this embodiment, all tasks generated by the application program in a certain period of time by the terminal in the area are acquired, and different delay requirement information is acquired according to different initiating terminals, terminal types, terminal positions or task types of each task. Therefore, the time delay requirement information of the task refers to any one or a combination of a minimum time delay requirement for ensuring normal work of the terminal, a time delay requirement set according to the type of the task, a time delay requirement set according to the type of the terminal where the task is located, and a time delay requirement set according to the position of the terminal where the task is located.
Preferably, the congestion condition includes any one or more of a task processing queuing condition of the server due to the fact that the task queue is full, a condition that the server cannot process the task due to a fault, a task processing queuing condition of the server due to occupation, and a task processing queuing condition of the server due to too long processing delay of the current task. In this embodiment, the local server or the edge server may have a congestion condition, and according to one or more reasons caused by the congestion, the congestion condition includes any one or a combination of a task processing queuing condition caused by the fact that the task queue of the server is full, a condition that the server cannot process a task caused by a fault, a task processing queuing condition caused by the fact that the server is occupied, and a task processing queuing condition caused by the fact that the current task processing delay of the server is too long.
Preferably, the determining whether the task can be processed at the local server according to the processing speed and/or the processing energy consumption and/or the congestion condition of the local server in the area includes:
calculating a matching value of the local server and the task data volume according to the processing speed and/or the processing energy consumption and/or the matching degree of the congestion condition and the task data volume of the local server in the region;
calculating a matching value of the local server and the task delay requirement according to the processing speed and/or the processing energy consumption and/or the degree of matching between the congestion condition and the task delay requirement of the local server in the region;
calculating a matching value of the local server and the task information according to the matching value of the local server and the task data volume and/or the matching value of the local server and the task delay requirement;
and when the matching value of the local server and the task information is larger than a preset local matching threshold value, judging that the task can be processed at the local server.
In this embodiment, the calculating the matching value between the local server and the task data volume according to the matching degree between the processing speed and/or the processing energy consumption and/or the congestion condition of the local server in the area includes calculating the data volume p that can be processed by the local server according to the processing speed and/or the processing energy consumption and/or the congestion condition of the local server (the data volume p that can be processed by the local server has a positive correlation with the processing speed of the local server and has a negative correlation with the processing energy consumption and the congestion condition of the local server), and training the local server according to the above relationship to obtain the matching value between the local server and the task data volumeThe data amount p) that can be processed, and then obtaining a matching value m between the local server and the task data amount according to whether the data amount p that can be processed by the local server meets the requirement and the unsatisfied degree of the task data amount q, where a value of m ranges from 0 to 1, and if the data amount p that can be processed by the local server is greater than or equal to the task data amount q, the value is 1, and if the data amount p that can be processed by the local server is less than the task data amount q, the value of m is calculated according to a difference value, and the larger the difference value is, the smaller the value of m is, for
o1 and o2 are calculation coefficients set in advance, or m ═ o3 · (q-p)o4+o5，o3、o4(o4<0) O5 is a calculation coefficient set in advance.
The calculating of the matching value of the local server and the task delay requirement according to the matching degree of the processing speed and/or the processing energy consumption and/or the congestion condition of the local server and the task delay requirement in the region comprises the steps of firstly calculating the delay t of the processing task of the local server according to the processing speed and/or the processing energy consumption and/or the congestion condition of the local server (the delay t of the processing task of the local server and the processing speed of the local server are in a negative correlation relationship and form a positive correlation relationship with the processing energy consumption and the congestion condition of the local server, obtaining the delay t of the processing task of the local server according to data training according to the relationship), then obtaining the matching value n of the delay requirement of the local server and the task according to whether the delay t of the processing task of the local server meets the delay requirement w of the task and the unsatisfied degree, wherein the value, if the time delay t of the local server for processing the task is less than or equal to the time delay requirement w of the task, the value is 1, if the time delay t of the local server for processing the task is greater than the time delay requirement w of the task, n is calculated according to the difference value, the larger the difference value is, the smaller the value of n is, for example
o6 and o7 are calculation coefficients set in advance, or m ═ o8 · (t-w)o9+o10，o8、o9(o9<0) O10 is a calculation coefficient set in advance.
And (3) calculating the matching value x of the local server and the task information according to the positive correlation relationship between the matching value x of the local server and the task information, the matching value m of the local server and the task data volume and the matching value n required by the local server and the task time delay.
Table a, a1 to A3 show different embodiments of calculating the matching value between the local server and the task information, where the matching value m between the local server and the task data amount and the matching value n between the local server and the task delay requirement, which are referred to in table a, are obtained by using the formulas of the above embodiments.
TABLE A different implementation manners for calculating matching values of the local server and the task information
And obtaining a matching value X of the local server and the task information according to any embodiment in the table A according to a local matching threshold value X set according to the local network requirement and the type of the terminal equipment in advance, and judging that the task can be processed in the local server when X is larger than X. In this embodiment, if the set local matching threshold X is 1 and the matching value X between the local server and certain task information is 1.6> X from a3 in table a, the task can be processed by the local server.
In a preferred embodiment, the selecting an appropriate edge server for the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server includes:
acquiring distance information between each edge server and a terminal where a task is located and/or congestion conditions of each edge server and/or processing capacity information of each edge server;
calculating a matching value of each edge server and the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the matching degree of the processing capacity of each edge server and the data volume and/or the time delay requirement of the task;
and selecting the edge server corresponding to the maximum matching value for processing by taking the task as a reference.
In this embodiment, the distance between the edge server and the terminal where the task is located is denoted as s, the congestion condition of the edge server is represented by a congestion degree ratio r, and the processing capacity of each edge server is represented by processing efficiency d;
the method for calculating the matching value of each edge server and the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the matching degree of the processing capacity of each edge server and the data volume and/or the time delay requirement of the task comprises the following steps:
calculating the processing data amount u and the processing time delay v of the edge server according to the distance s between the edge server and the terminal where the task is located and/or the congestion condition r of the edge server and/or the processing capacity d of the edge server; the data processing amount u of the edge server is inversely proportional to the distance s between the edge server and a terminal where a task is located and the congestion condition r of the edge server, and is proportional to the processing capacity d of the edge server;
obtaining a matching value a of the edge server and the task data amount according to whether the processing data amount u of the edge server meets the requirement of the task data amount q and the unsatisfied degree, wherein the value range of a is 0-1, if the processing data amount u of the edge server is greater than or equal to the task data amount q, the value is 1, if the processing data amount u of the edge server is less than the task data amount q, the value a is calculated according to the difference value, if the processing data amount u of the edge server is greater than or equal to the task data amount q, the value a is smaller
e1, e2 are calculation coefficients set in advance, or a ═ e3 · (q-u)e4+e5，e3、e4(e4<0) O5 is a calculation coefficient set in advance;
obtaining a matching value b of the edge server and the task time delay requirement according to whether the processing time delay v of the edge server meets the time delay requirement w of the task and the unsatisfied degree, wherein the value range of b is 0-1, if the processing time delay v of the edge server is less than or equal to the time delay requirement w of the task, the value of b is 1, if the processing time delay v of the edge server is greater than the time delay requirement w of the task, b is calculated according to a difference value, if the processing time delay v of the edge server is greater than the time delay requirement w of the task
e6, e7 are calculation coefficients set in advance, or b ═ e8 · (v-w)e9+e10，e8、e9(e9<0) E10 is a calculation coefficient set in advance;
calculating a matching value y of the edge server and the task according to the matching value of the edge server and the task data volume and/or the matching value of the edge server and the task time delay requirement; and calculating a positive correlation relation between the matching value y of the edge server and the task, the matching value a of the edge server and the task data volume and the matching value b of the edge server and the task delay requirement.
B1-B3 in table B show different embodiments of calculating the matching value between the edge server and the task, where the matching value a between the edge server and the task data amount and the matching value B between the edge server and the task delay requirement, which are referred to in table B, are obtained by using the formulas of the above embodiments.
Table B different embodiments for calculating matching values of local servers and task information
Obtaining the matching value y of each edge server and the task according to the calculation mode of any one of the table BijWherein i represents the number of the task, and j represents the number of each edge server; and selecting the edge server corresponding to the maximum matching value for processing by taking the task i as a reference.
In another preferred embodiment, the selecting a suitable edge server for the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server includes:
acquiring distance information between each edge server and a terminal where a task is located and/or congestion conditions of each edge server and/or processing capacity information of each edge server;
calculating a matching value of each edge server and the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the matching degree of the processing capacity of each edge server and the data volume and/or the time delay requirement of the task;
sequentially distributing tasks with the maximum matching value to each edge server by taking each edge server as a reference for processing;
and judging whether a task does not select the edge server, if so, re-executing the steps aiming at the task which does not select the edge server.
Further preferably, the method further comprises the following steps: when the tasks distributed by the edge servers are repeated, the task is preferentially distributed to the edge server with the maximum matching value with the task, and the rest edge servers distribute the next task according to the matching value sequence.
In this embodiment, each border clothing is obtained according to the calculation method described in any one of table BMatching value y of server and taskijWherein i represents the number of the task, and j represents the number of each edge server; firstly, acquiring a task with the maximum matching value corresponding to each edge server for each edge server, if the tasks distributed by a plurality of edge servers are repeated, preferentially distributing the task for the edge server with the maximum matching value with the task, and distributing the next task for the rest edge servers according to the sequence of the matching values; and judging whether a task does not select the edge server, if so, re-executing the steps aiming at the task which does not select the edge server.
A computer-readable storage medium storing a computer program for electronic data exchange, wherein the computer program causes a computer to perform the above method.
A system for dynamically allocating tasks to a mobile edge computing server, as shown in fig. 2, comprising:
a terminal;
a processor;
a memory;
and
one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the processor, the programs causing the computer to perform the above-described method.
Of course, those skilled in the art should realize that the above embodiments are only used for illustrating the present invention, and not as a limitation to the present invention, and that the changes and modifications of the above embodiments will fall within the protection scope of the present invention as long as they are within the scope of the present invention.
Claims (10)
1. A method for dynamically distributing tasks by a mobile edge computing server is characterized by comprising the following steps:
acquiring information of one or more tasks generated by a terminal in an area within a certain time period, wherein the information comprises the data volume of the tasks and the time delay requirement information of the tasks;
judging whether the task can be processed in the local server according to the processing speed and/or the processing energy consumption and/or the congestion condition of the local server in the area;
and if the task cannot be processed in the local server, selecting a proper edge server for the task to process according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server.
2. The method for dynamically allocating tasks by the mobile edge computing server as claimed in claim 1, wherein the data amount of the task is any one or more of a data storage amount, a data calculation amount and an execution program amount required for processing the task.
3. The method for dynamically allocating tasks by a mobile edge computing server according to claim 1, wherein the delay requirement information of the task is any one or a combination of multiple items of a minimum delay requirement for ensuring normal operation of the terminal, a delay requirement set according to a task type, a delay requirement set according to a terminal type initiating the task, and a delay requirement set according to a terminal position initiating the task.
4. The method according to claim 1, wherein the congestion condition comprises any one or more of a task processing queuing condition of the server due to a full task queue, a condition that the server cannot process the task due to a fault, a task processing queuing condition of the server due to being occupied, and a task processing queuing condition of the server due to a long processing delay of the current task.
5. The method for dynamically allocating tasks to the mobile edge computing server according to claim 1, wherein the step of determining whether the task can be processed by the local server according to the processing speed and/or the processing energy consumption and/or the congestion condition of the local server in the area comprises the steps of:
calculating a matching value of the local server and the task data volume according to the processing speed and/or the processing energy consumption and/or the matching degree of the congestion condition and the task data volume of the local server in the region;
calculating a matching value of the local server and the task delay requirement according to the processing speed and/or the processing energy consumption and/or the degree of matching between the congestion condition and the task delay requirement of the local server in the region;
calculating a matching value of the local server and the task information according to the matching value of the local server and the task data volume and/or the matching value of the local server and the task delay requirement;
and when the matching value of the local server and the task information is larger than a preset local matching threshold value, judging that the task can be processed at the local server.
6. The method for dynamically allocating tasks to the mobile edge computing server according to claim 1, wherein the method for selecting a suitable edge server for the task to process according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server comprises the steps of:
acquiring distance information between each edge server and a terminal where a task is located and/or congestion conditions of each edge server and/or processing capacity information of each edge server;
calculating a matching value of each edge server and the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the matching degree of the processing capacity of each edge server and the data volume and/or the time delay requirement of the task;
and selecting the edge server corresponding to the maximum matching value for processing by taking the task as a reference.
7. The method for dynamically allocating tasks to the mobile edge computing server according to claim 1, wherein the method for selecting a suitable edge server for the task to process according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the processing capacity of each edge server comprises the steps of:
acquiring distance information between each edge server and a terminal where a task is located and/or congestion conditions of each edge server and/or processing capacity information of each edge server;
calculating a matching value of each edge server and the task according to the distance between each edge server and the terminal where the task is located and/or the congestion condition of each edge server and/or the matching degree of the processing capacity of each edge server and the data volume and/or the time delay requirement of the task;
sequentially distributing tasks with the maximum matching value to each edge server by taking each edge server as a reference for processing;
and judging whether a task does not select the edge server, if so, re-executing the steps aiming at the task which does not select the edge server.
8. The method for dynamically assigning tasks according to claim 7, further comprising the steps of: when the tasks distributed by the edge servers are repeated, the task is preferentially distributed to the edge server with the maximum matching value with the task, and the rest edge servers distribute the next task according to the matching value sequence.
9. A computer-readable storage medium storing a computer program for electronic data exchange, wherein the computer program causes a computer to perform the method according to any one of claims 1-8.
10. A system for dynamically assigning tasks to a mobile edge computing server, comprising:
a terminal;
a processor;
a memory;
and
one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the processor, the programs causing the computer to perform the method of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011525191.5A CN112559187A (en) | 2020-12-22 | 2020-12-22 | Method and system for dynamically allocating tasks to mobile edge computing server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011525191.5A CN112559187A (en) | 2020-12-22 | 2020-12-22 | Method and system for dynamically allocating tasks to mobile edge computing server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112559187A true CN112559187A (en) | 2021-03-26 |
Family
ID=75031211
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011525191.5A Pending CN112559187A (en) | 2020-12-22 | 2020-12-22 | Method and system for dynamically allocating tasks to mobile edge computing server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112559187A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114047971A (en) * | 2021-11-09 | 2022-02-15 | 北京中电飞华通信有限公司 | Edge computing resource allocation method and device |
| CN114363328A (en) * | 2021-11-19 | 2022-04-15 | 三维通信股份有限公司 | Task coordination method and system for server cluster |
| CN116506507A (en) * | 2023-06-29 | 2023-07-28 | 天津市城市规划设计研究总院有限公司 | Data processing method based on client characteristics |
| CN116665423A (en) * | 2023-07-27 | 2023-08-29 | 国网山东省电力公司滨州市滨城区供电公司 | Cable channel construction monitoring and early warning system and method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111262906A (en) * | 2020-01-08 | 2020-06-09 | 中山大学 | Method for unloading mobile user terminal task under distributed edge computing service system |
| CN111679904A (en) * | 2020-03-27 | 2020-09-18 | 北京世纪互联宽带数据中心有限公司 | Task scheduling method and device based on edge computing network |
| US20200351336A1 (en) * | 2019-04-30 | 2020-11-05 | Verizon Patent And Licensing Inc. | Methods and Systems for Intelligent Distribution of Workloads to Multi-Access Edge Compute Nodes on a Communication Network |
-
2020
- 2020-12-22 CN CN202011525191.5A patent/CN112559187A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200351336A1 (en) * | 2019-04-30 | 2020-11-05 | Verizon Patent And Licensing Inc. | Methods and Systems for Intelligent Distribution of Workloads to Multi-Access Edge Compute Nodes on a Communication Network |
| CN111262906A (en) * | 2020-01-08 | 2020-06-09 | 中山大学 | Method for unloading mobile user terminal task under distributed edge computing service system |
| CN111679904A (en) * | 2020-03-27 | 2020-09-18 | 北京世纪互联宽带数据中心有限公司 | Task scheduling method and device based on edge computing network |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114047971A (en) * | 2021-11-09 | 2022-02-15 | 北京中电飞华通信有限公司 | Edge computing resource allocation method and device |
| CN114047971B (en) * | 2021-11-09 | 2023-12-08 | 北京中电飞华通信有限公司 | Edge computing resource allocation method and device |
| CN114363328A (en) * | 2021-11-19 | 2022-04-15 | 三维通信股份有限公司 | Task coordination method and system for server cluster |
| CN114363328B (en) * | 2021-11-19 | 2024-02-20 | 三维通信股份有限公司 | Task collaboration method and system for server cluster |
| CN116506507A (en) * | 2023-06-29 | 2023-07-28 | 天津市城市规划设计研究总院有限公司 | Data processing method based on client characteristics |
| CN116665423A (en) * | 2023-07-27 | 2023-08-29 | 国网山东省电力公司滨州市滨城区供电公司 | Cable channel construction monitoring and early warning system and method |
| CN116665423B (en) * | 2023-07-27 | 2023-10-31 | 国网山东省电力公司滨州市滨城区供电公司 | Cable channel construction monitoring and early warning system and method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112559187A (en) | Method and system for dynamically allocating tasks to mobile edge computing server | |
| CN108984301B (en) | Self-adaptive cloud resource allocation method and device | |
| CN111427679A (en) | Computing task scheduling method, system and device facing edge computing | |
| CN109582448B (en) | Criticality and timeliness oriented edge calculation task scheduling method | |
| WO2017127976A1 (en) | Method for training and scheduling incremental learning cloud system and related device | |
| CN111614754B (en) | Fog-calculation-oriented cost-efficiency optimized dynamic self-adaptive task scheduling method | |
| CN110502321A (en) | A kind of resource regulating method and system | |
| CN109743751B (en) | Resource allocation method and device for wireless access network | |
| CN112888005B (en) | MEC-oriented distributed service scheduling method | |
| CN111611076B (en) | Fair distribution method for mobile edge computing shared resources under task deployment constraint | |
| CN114780244A (en) | Container cloud resource elastic allocation method and device, computer equipment and medium | |
| CN109062683B (en) | Method, apparatus and computer readable storage medium for host resource allocation | |
| CN114356531A (en) | Edge calculation task classification scheduling method based on K-means clustering and queuing theory | |
| CN113596106A (en) | Time delay sensitive type slice resource scheduling method based on multi-edge server cooperation | |
| CN116915869A (en) | Cloud edge cooperation-based time delay sensitive intelligent service quick response method | |
| WO2019037368A1 (en) | Delivery task processing method and apparatus, electronic device, and computer storage medium | |
| CN112437449A (en) | Joint resource allocation method and area organizer | |
| WO2018205890A1 (en) | Task assignment method and system of distributed system, computer readable storage medium and computer device therefor | |
| CN114138453B (en) | Resource optimization allocation method and system suitable for edge computing environment | |
| CN114327897A (en) | Resource allocation method and device and electronic equipment | |
| CN113905448A (en) | Wireless network resource scheduling method, device and equipment | |
| CN114489463A (en) | Method and device for dynamically adjusting QOS (quality of service) of storage volume and computing equipment | |
| CN117640541B (en) | Cloud server resource allocation method, device, equipment and medium | |
| JP7384214B2 (en) | Analysis processing device, system, method and program | |
| WO2022168288A1 (en) | Resource allocating device, resource allocating method, control circuit and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |