CN114245288A - Task scheduling method of service equipment, service equipment and storage medium - Google Patents
Task scheduling method of service equipment, service equipment and storage medium Download PDFInfo
- Publication number
- CN114245288A CN114245288A CN202111274925.1A CN202111274925A CN114245288A CN 114245288 A CN114245288 A CN 114245288A CN 202111274925 A CN202111274925 A CN 202111274925A CN 114245288 A CN114245288 A CN 114245288A
- Authority
- CN
- China
- Prior art keywords
- terminals
- predicted
- determining
- task
- tasks
- 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 85
- 230000006870 function Effects 0.000 claims description 38
- 230000004044 response Effects 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 5
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 230000005012 migration Effects 0.000 abstract description 4
- 238000013508 migration Methods 0.000 abstract description 4
- 230000008569 process Effects 0.000 description 9
- 238000004364 calculation method Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000003993 interaction Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 238000004458 analytical method Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000014759 maintenance of location Effects 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000013507 mapping Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000007943 implant Substances 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/025—Services making use of location information using location based information parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
Abstract
The application relates to the field of service equipment task scheduling, and discloses a service equipment task scheduling method, service equipment and a storage medium. The method comprises the following steps: determining the predicted movement tracks of a plurality of terminals in the signal coverage range; respectively determining the predicted stay time of the plurality of terminals in the signal coverage range according to the predicted movement tracks of the plurality of terminals; and scheduling the tasks initiated by the terminals according to the predicted stay time of the terminals. By means of the method, the number of times of migration between the terminal service devices can be reduced, and signal quality of the terminal is improved.
Description
Technical Field
The present application relates to the field of task scheduling of service devices, and in particular, to a task scheduling method of a service device, and a computer-readable storage medium.
Background
At present, with the development of networks, the service requirements on service equipment are increasingly increased. Common service devices include servers, base stations, routers, and the like. Since the service device has a certain load capacity, only a certain number of tasks can be connected to the service device, and therefore, it is important to reasonably schedule the tasks on the service device.
In service device task scheduling, a mobile edge calculation method is often used. The mobile edge computing can utilize the wireless access network to provide services and cloud computing functions required by a telecommunication user IT (Internet technology) nearby, so as to create a telecommunication service environment with high performance, low delay and high bandwidth, accelerate the rapid downloading of various contents, services and applications in the network and enable consumers to enjoy uninterrupted high-quality network experience. The mobile edge computing effectively integrates the wireless network technology and the internet technology, and adds functions of computing, storing, processing and the like on the wireless network side, so that an open platform is constructed to implant applications, information interaction between the wireless network and a service server is opened through a wireless Application Program Interface (API), the wireless network and services are integrated, and a traditional wireless base station is upgraded into an intelligent base station. Deployment strategies (particularly geographic locations) with simultaneous mobile edge computing can achieve the advantages of low latency, high bandwidth. The mobile edge computing can also acquire wireless network information and more accurate position information in real time to provide more accurate service.
However, the conventional multi-user multi-task scheduling method in the edge computing environment has many defects, such as: the traditional method mainly considers taking the instantaneous position of the user as the input of a model for offline unloading decision, but in practical situations, the edge user generally has high mobility, so that the decision making based on the instantaneous position only has high uncertainty.
Disclosure of Invention
The method includes determining a predicted movement track according to a terminal historical movement track in a signal range of service equipment, obtaining predicted stay time of a terminal in a signal coverage range according to the predicted movement track, and scheduling a plurality of terminal tasks in the signal coverage range according to the predicted stay time. The method can reduce the number of times of migration between the terminal service devices and improve the signal quality of the terminal.
In order to solve the technical problem, the application adopts a technical scheme that: a task scheduling method is provided, which comprises the following steps:
determining the predicted movement tracks of a plurality of terminals in the signal coverage range; respectively determining the predicted stay time of the plurality of terminals in the signal coverage range according to the predicted movement tracks of the plurality of terminals; and scheduling the tasks initiated by the terminals according to the predicted stay time of the terminals.
The determining of the predicted movement trajectories of the plurality of terminals within the signal coverage area includes: obtaining historical movement tracks of a plurality of terminals, wherein the historical movement tracks at least comprise track point sequences; fitting the track point sequence to obtain a fitting function; and determining the predicted movement tracks of the plurality of terminals in the signal coverage range according to the fitting function.
Wherein, fitting the track point sequence to obtain a fitting function comprises: dividing the track point sequence into a longitude sequence and a latitude sequence; and respectively fitting the longitude sequence and the latitude sequence to obtain a longitude fitting function and a latitude fitting function.
The method for determining the predicted movement tracks of the plurality of terminals in the signal coverage range according to the fitting function comprises the following steps: and predicting the longitude and latitude of the next moment of the plurality of terminals in the signal coverage range according to the longitude fitting function and the latitude fitting function so as to determine the corresponding predicted movement locus.
The method comprises the steps that according to predicted movement tracks of a plurality of terminals, predicted stay time of the plurality of terminals in a signal coverage range is determined respectively, wherein the predicted stay time comprises the steps of; determining starting time corresponding to the current positions of a plurality of terminals; respectively determining the termination time corresponding to the positions of the plurality of terminals out of the signal coverage range according to the predicted movement tracks of the plurality of terminals; and respectively determining the predicted stay time of the plurality of terminals in the signal coverage area according to the starting time and the ending time.
The scheduling of tasks initiated by a plurality of terminals according to the predicted stay time of the plurality of terminals includes: determining the selection states of tasks initiated by the terminals according to the predicted stay time of the terminals, wherein the selection states comprise selected states and unselected states; and scheduling the tasks initiated by the terminals according to the selection states of the tasks initiated by the terminals.
The method for determining the selection states of the tasks initiated by the terminals according to the predicted stay time of the terminals comprises the following steps: sequencing tasks initiated by a plurality of terminals according to the sequence of predicted residence time of the terminals from large to small to form a task queue; determining the selection states of a preset number of tasks in the task queue as selected; and determining that the selection states of the tasks except the tasks with the preset number in the task queue are not selected.
Wherein the set number is determined by the load capacity of the service device.
The method for scheduling the tasks initiated by the terminals according to the selection states of the tasks initiated by the terminals comprises the following steps: responding to the selection state of the target task changed from unselected to selected, and distributing the target task to the service equipment; or in response to the selection state of the target task changing from selected to unselected, the target task is unloaded.
Wherein, the method also comprises: confirming the load condition of the service equipment; and responding to the full load condition of the service equipment, and executing the step of scheduling tasks initiated by the plurality of terminals according to the predicted stay time of the plurality of terminals.
Wherein, the method also comprises the following steps: acquiring a task allocation request aiming at a target task initiated by a target terminal; in response to that the allocation state of the target task is unallocated, determining the predicted stay time of the target terminal in all service equipment signal ranges meeting set conditions; and distributing the target task to the service equipment with the maximum predicted stay time.
The method for determining the predicted residence time of the target terminal in all service equipment signal ranges meeting the set conditions comprises the following steps: acquiring all connectable and non-fully loaded service equipment information sent by a target terminal; and determining the predicted stay time of the target terminal in the signal range of all connectable and unloaded service equipment according to the service equipment information.
In order to solve the above problem, another technical solution adopted by the present application is: there is provided a service device comprising a processor and a memory coupled to the processor, the memory having a computer program stored therein, the processor being configured to execute the computer program to implement the method.
In order to solve the above problem, another technical solution adopted by the present application is: a computer-readable storage medium is provided, in which a program data is stored behind the computer-readable storage medium, which program data, when being executed by a processor, is adapted to carry out the above-mentioned method.
The beneficial effect of this application is: different from the situation of the prior art, the task scheduling method provided by the application is provided. The method comprises the steps of determining predicted movement tracks of a plurality of terminals in a signal coverage range; respectively determining the predicted stay time of the plurality of terminals in the signal coverage range according to the predicted movement tracks of the plurality of terminals; and scheduling the tasks initiated by the terminals according to the predicted stay time of the terminals. By the mode, compared with the prior art that the instantaneous geographic position of the terminal is used as the basis of task scheduling in the mobile edge calculation, the scheme adopts the method that the stay time of the terminal in the area is predicted as the basis of task scheduling; the stay time is the predicted future stay time, so that the task of the terminal can be scheduled according to the long-time position of the terminal, the problem that the terminal is continuously switched among a plurality of service devices when the position is frequently changed is avoided, the signal quality of the terminal is further improved, further, the frequent processing calculation of the service devices is avoided through the distribution of the task advance task, the load pressure of the service devices is reduced, and the processing efficiency of the service devices is improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts. Wherein:
fig. 1 is a first flowchart of a task scheduling method for a service device according to an embodiment of the present application;
FIG. 2 is a schematic flowchart illustrating a method for determining a predicted movement trajectory according to an embodiment of the present application;
FIG. 3 is a schematic flow chart illustrating a method for determining a fitting function according to an embodiment of the present disclosure;
FIG. 4 is a schematic flow chart of a method for determining residence time according to an embodiment of the present disclosure;
fig. 5 is a flowchart illustrating an embodiment of a task scheduling method according to an embodiment of the present application;
fig. 6 is a schematic flowchart of a task scheduling method according to another embodiment of the present application;
fig. 7 is a second flow chart of a task scheduling method for a service device according to a second embodiment of the present application;
fig. 8 is a third flow diagram of a task scheduling method for a service device according to the second embodiment of the present application;
fig. 9 is a fourth flowchart illustrating a task scheduling method of a service device according to a second embodiment of the present application;
fig. 10 is a schematic structural diagram of an embodiment of a service device according to a third embodiment of the present application;
fig. 11 is a schematic structural diagram of an embodiment of a computer-readable storage medium provided in the fourth embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not limiting of the application. It should also be noted that, for ease of description, only some, but not all, of the methods and processes associated with the present application are illustrated in the accompanying drawings. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "comprising" and "having," as well as any variations thereof, in this application are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
The first embodiment is as follows:
referring to fig. 1, fig. 1 is a first flowchart of a task scheduling method of a service device according to an embodiment of the present application. The task scheduling method of the service device in this embodiment specifically includes steps 11 to 13:
step 11: determining the predicted movement tracks of a plurality of terminals in the signal coverage range;
the service device generally has a plurality of terminals within a signal coverage area, and the terminals have a movable attribute, so that the positions of the plurality of terminals are not fixed. The historical movement trajectory of each terminal may be determined from the interaction of the signal with the serving device, and thus a predicted movement trajectory of each terminal may be determined.
Step 12: respectively determining the predicted stay time of the plurality of terminals in the signal coverage range according to the predicted movement tracks of the plurality of terminals;
the predicted movement track comprises a plurality of position information, namely a plurality of predicted track points, and each track corresponds to different time. The time when the terminal just leaves the signal coverage range of the service equipment can be obtained from the predicted track point, so that the predicted residence time of the plurality of terminals in the signal coverage range can be determined according to the time when the plurality of terminals leave the signal coverage range and the current time.
Step 13: and scheduling the tasks initiated by the terminals according to the predicted stay time of the terminals.
The stay time of the plurality of terminals in the signal coverage range of the service equipment is different, and the stay time in the coverage range means that the terminal does not leave the signal coverage range in a short time, so that the task of the terminal can be selected to be connected to the service equipment; a short stay in coverage means that the terminal will leave the signal coverage in a short time, and the serving device therefore offloads the terminal's task.
Optionally, the service device may include: servers, base stations, routers, etc.
The method comprises the steps of determining predicted movement tracks of a plurality of terminals in a signal coverage range; respectively determining the predicted stay time of the plurality of terminals in the signal coverage range according to the predicted movement tracks of the plurality of terminals; and scheduling the tasks initiated by the terminals according to the predicted stay time of the terminals. Through the mode, compared with the prior art that the instantaneous geographic position of the terminal is used as the basis of task scheduling in the mobile edge calculation, the method adopts the stay time of the predicted terminal in the area as the basis of task scheduling; the stay time is the predicted future stay time, so that the task of the terminal can be scheduled according to the long-time position of the terminal, the problem that the terminal is continuously switched among a plurality of service devices when the position is frequently changed is avoided, the signal quality of the terminal is further improved, further, the frequent processing calculation of the service devices is avoided through the distribution of the task advance task, the load pressure of the service devices is reduced, and the processing efficiency of the service devices is improved.
In determining predicted movement trajectories of a plurality of terminals within a signal coverage range, the application provides a method for determining the predicted movement trajectories. Referring to fig. 2, fig. 2 is a schematic flowchart illustrating a method for determining a predicted movement trajectory according to an embodiment of the present disclosure. The present embodiment specifically includes steps 111 to 113:
step 111: obtaining historical movement tracks of a plurality of terminals, wherein the historical movement tracks at least comprise track point sequences;
when the terminal is in the signal coverage range of the service equipment, the terminal and the service equipment continuously perform information interaction, wherein the information comprises geographical position information. Therefore, the service device can obtain the geographical location information of the terminal in real time. The service equipment acquires a track point containing geographical position information at preset time intervals and forms a historical track point sequence. And updating the historical track point sequence every preset time.
Optionally, the geographical location information includes: longitude information, latitude information, and altitude information.
Optionally, the service device may further obtain the historical track point sequence by obtaining historical moving track points stored in the terminal. The terminal can store the position information of the historical movement track in the moving process and upload the position information to the service equipment through the interaction of the service equipment and the terminal, so that the historical movement track point of the terminal is obtained.
Step 112: fitting the track point sequence to obtain a fitting function;
the method adopts a polynomial fitting method to fit the track point sequence. The polynomial fitting is to adopt a polynomial expansion to fit all observation points in a small analysis area containing a plurality of analysis grid points to obtain an objective analysis field of observation data. The expansion coefficients are typically determined using a least squares fit. According to the method, the historical track point sequence obtained by the service equipment is utilized, and a fitting function is obtained by adopting a polynomial fitting method.
Step 113: and determining the predicted movement tracks of the plurality of terminals in the signal coverage range according to the fitting function.
After the fitting function is obtained, the corresponding time is input, so that the position information corresponding to the time can be obtained, and the predicted movement tracks of the plurality of terminals in the signal coverage range can be predicted.
Wherein the predicted movement track continuously changes along with the historical movement track.
In the process of fitting a track point sequence to obtain a fitting function, the application provides a method for determining the fitting function. Referring to fig. 3, fig. 3 is a schematic flowchart of a method for determining a fitting function according to an embodiment of the present disclosure. This embodiment specifically includes steps 1121 through 1122:
step 1121: dividing the track point sequence into a longitude sequence and a latitude sequence;
each historical track point contains longitude information and latitude information, so that the longitude information in each track point is combined together to form a longitude sequence, and the latitude information in each track point is combined together to form a latitude sequence.
Step 1122: and respectively fitting the longitude sequence and the latitude sequence to obtain a longitude fitting function and a latitude fitting function.
Mapping the longitude sequence and the latitude sequence into the rectangular plane coordinate system does not conform to the basic function mapping relation, so that the fitting function can be solved by utilizing the one-to-one correspondence relation of time and longitude and time and latitude.
Let the polynomial be:
wherein k represents the number of historical track points, m represents the order of the polynomial, a0,a1,…,akRepresenting a polynomial parameter.
And substituting the longitude sequence of the k points and the corresponding time of each longitude value into a polynomial to obtain:
wherein x is1,…,xkIndicates the time, y, to which the k longitude values respectively correspond1,…,ykRepresenting a sequence of longitudes, R1,…,RkIndicating the error sequence.
The above formula can also be expressed as:
calculating a for minimizing sigma by least square methodj(j ═ 0,1, …, m), where
The above equation can be solved by solving the matrix XA ═ Y, a ═ aj(j ═ 0,1, …, m) is solved, i.e. a ═ X-1Y is, wherein
Through the solving process, the fitting parameter A is obtained, and therefore a longitude fitting function is obtained.
Similarly, the latitude sequence and the time corresponding to each latitude value are introduced into a polynomial and solved through the steps, so that a latitude fitting function can be obtained.
After the longitude fitting function and the latitude fitting function are obtained, the longitude and the latitude corresponding to the future time can be obtained by bringing the future time value into the longitude fitting function and the latitude fitting function, and therefore the predicted track sequences of the multiple terminals are obtained.
According to the embodiment, the historical track point sequence is divided into the longitude sequence and the latitude sequence, and the longitude fitting function and the latitude fitting function are obtained by fitting the historical track point sequence respectively by using the polynomial, so that the predicted track sequence is obtained.
In the step of respectively determining the predicted stay time of a plurality of terminals in a signal coverage range according to the predicted movement tracks of the plurality of terminals, the application provides a stay time determining method. Referring to fig. 4, fig. 4 is a schematic flow chart of a method for determining residence time according to an embodiment of the present disclosure. The present embodiment specifically includes steps 121 to 123:
step 121: determining starting time corresponding to the current positions of a plurality of terminals;
step 122: respectively determining the termination time corresponding to the positions of the plurality of terminals out of the signal coverage range according to the predicted movement tracks of the plurality of terminals;
according to the predicted moving track points, the time corresponding to the track points when the plurality of terminals just leave the signal coverage range can be obtained, and the time is the termination time;
step 123: and respectively determining the predicted stay time of the plurality of terminals in the signal coverage area according to the starting time and the ending time.
And subtracting the starting time from the ending time of the plurality of terminals to obtain the predicted stay time of the plurality of terminals in the signal coverage area.
The longer the predicted stay time is, the lower the possibility that the terminal leaves the signal coverage area is, and the service equipment preferentially selects the task corresponding to the terminal; the shorter the predicted stay time is, the higher the possibility that the terminal leaves the signal coverage area is, the service device delays selecting the task corresponding to the terminal.
Through the embodiments 1-4, the predicted stay time of a plurality of terminals can be obtained, and the tasks initiated by the plurality of terminals are scheduled according to the predicted stay time. Referring to fig. 5, fig. 5 is a flowchart illustrating an embodiment of a task scheduling method according to an embodiment of the present application. The present embodiment specifically includes steps 131 to 132:
step 131: determining the selection states of tasks initiated by the terminals according to the predicted stay time of the terminals, wherein the selection states comprise selected states and unselected states;
in the above embodiments, the predicted dwell times for a plurality of terminals within the signal coverage have been calculated, each terminal may initiate a task or tasks, and the serving device is configured to determine the selection status of each task as selected or unselected.
Step 132: and scheduling the tasks initiated by the terminals according to the selection states of the tasks initiated by the terminals.
According to the selection states of the tasks initiated by the plurality of terminals and the stay time of the terminals corresponding to the plurality of tasks in the signal coverage range, the tasks can be sequenced to form a task degree column, a preset number of tasks before selection are connected to the service equipment, and task scheduling is carried out according to the initial states and the selected states of the tasks initiated by the plurality of terminals.
In the process of determining the selection state of a plurality of terminals for initiating tasks according to the predicted stay time of the plurality of terminals, the application also provides a task scheduling method. Referring to fig. 6, fig. 6 is a schematic flowchart of a task scheduling method according to another embodiment of the present application. This embodiment specifically includes steps 1311 to 1312:
step 1311: sequencing tasks initiated by a plurality of terminals according to the arrangement of the predicted residence time of the terminals from large to small to form a task queue;
the predicted stay times of a plurality of terminals can be obtained by the embodiment 4, and the terminals are arranged in descending order according to the predicted stay times. The number of tasks corresponding to each terminal is different, and one or more tasks may be provided, so that the tasks of the plurality of terminals are arranged in a descending order according to the predicted retention time of the corresponding terminals to form a task queue.
Step 1312: determining the selection states of a preset number of tasks in the task queue as selected; and determining that the selection states of the tasks except the tasks with the preset number in the task queue are not selected.
Each service device has a certain load capacity, in the task scheduling process, the state of the tasks in the task queues with the front load capacity and the maximum predicted stay time is determined as selected, the selection state of other tasks except the tasks in the task queues with the front load capacity is determined as unselected, and the set number is determined by the load capacity.
Scheduling tasks initiated by a plurality of terminals according to the selection state of each task by the service equipment, and if the selection state of the target task is changed from unselected to selected, distributing the target task to the service equipment; if the selection state of the target task is changed from the selected state to the unselected state, unloading the target task from the service equipment; and if the selection state of the target task is selected all the time, not performing any operation on the target task. The terminal tasks can be scheduled in the above mode.
Example two:
referring to fig. 7, fig. 7 is a second flowchart of a task scheduling method of a service device according to a second embodiment of the present application. The present embodiment specifically includes steps 21 to 22:
step 21: confirming the load condition of the service equipment;
before task scheduling, detecting whether the load condition of the service equipment is full or not. Normally, the tasks initiated by the terminal can be directly allocated when the service device is not fully loaded. And under the condition that the service equipment is fully loaded, tasks initiated by a plurality of terminals need to be sequenced according to the predicted stay time and then are scheduled.
Step 22: and responding to the full load condition of the service equipment, and executing the step of scheduling tasks initiated by the plurality of terminals according to the predicted stay time of the plurality of terminals.
When the load condition of the service device is full, since many terminals are not connected to the service device in the signal coverage range of the service device, a predicted movement track needs to be determined according to the historical movement tracks of all terminals in the signal coverage range; calculating the predicted retention time according to the predicted movement track of the terminal; arranging tasks initiated by each terminal from large to small according to the predicted residence time of the corresponding terminal to obtain a task queue; determining the selection states of the tasks initiated by the terminals with the front load capacity as selected, and determining the selection states of the tasks except the tasks initiated by the terminals with the front load capacity as unselected; and according to the selection state of each terminal, the service equipment carries out task scheduling on the terminal.
The service device detects again at regular intervals that the load condition of the current service device is as full as it is, that is, whether the number of tasks allocated to the service device has reached the load capacity of the service device. And if the service equipment is fully loaded, reallocating all terminal tasks in the signal coverage range of the service equipment.
Setting the time interval has the following advantages: the state of service equipment does not need to be frequently detected, service resources are saved, and meanwhile, the jitter migration of part of tasks and the resource consumption are avoided; the method can also be used for migrating the terminal task which is about to go out of the coverage range in the signal coverage range of the service equipment to the more suitable service equipment in advance, and can also avoid disconnection caused by the fact that the terminal task is separated from the service range of the service equipment.
In many cases, the tasks of such terminals need to be allocated when the terminal enters the signal coverage of a new service device or has been offloaded by other service devices. For such a situation, please refer to fig. 8, where fig. 8 is a third flowchart of a task scheduling method for a service device according to the second embodiment of the present application. The present embodiment specifically includes steps 31 to 33:
step 31: acquiring a task allocation request aiming at a target task initiated by a target terminal;
step 32: in response to that the allocation state of the target task is unallocated, determining the predicted stay time of the target terminal in all service equipment signal ranges meeting set conditions;
the allocation state of the target task is unallocated, in-allocation and allocated, wherein the allocation states of the tasks initiated by the terminal newly entering the coverage area of the service equipment signal and the tasks initiated by the unloaded terminal are unallocated; when an unallocated task makes an allocation request and a service device responds to the request, the response service device sets the state of the unallocated task to be in allocation; the state of the task is set as allocated when the predicted dwell time is calculated and the state of the terminal task is determined to be selected.
After a task allocation request is made for an unallocated task, the service device including the terminal in each signal coverage area can calculate the predicted stay time of the terminal in each service device signal coverage area.
Step 33: and distributing the target task to the service equipment with the maximum predicted stay time.
In a plurality of selectable service devices, the longer the stay time is, the longer the service device can provide service for the task, the more stable the connection is, and therefore the target task is allocated to the service device with the largest predicted stay time.
In a process of determining predicted retention time of the target terminal in all service device signal ranges satisfying the set condition in response to that the allocation state of the target task is unallocated, referring to fig. 9, fig. 9 is a fourth flowchart illustrating a task scheduling method for a service device according to a second embodiment of the present application. This embodiment specifically includes steps 321 to 322:
step 321: acquiring all connectable and non-fully loaded service equipment information sent by a target terminal;
and after the target terminal sends the task allocation request, the response service equipment responds to the request. And determining the predicted movement track of the target terminal in the response service equipment. The target terminal detects all service equipment capable of generating information interaction, wherein the service equipment comprises full service equipment and non-full service equipment, determines all connectable and non-full service equipment, and uploads the service equipment information meeting the condition to response service equipment.
Step 322: and determining the predicted stay time of the target terminal in the signal range of all connectable and unsatisfied service equipment according to the service equipment information.
And calculating the predicted stay time of the terminal in the signal coverage range of all connectable and non-fully loaded service equipment bureaus on the response service equipment, selecting the service equipment with the maximum predicted stay time, and returning the selection result to the target terminal. And the target terminal provides a task allocation request to the finally selected service equipment and allocates the task to the service equipment.
When the service equipment is fully loaded, the service equipment enters a waiting stage after scheduling the task initiated by the terminal once. And executing the step of scheduling tasks initiated by the terminals again at regular intervals until the service equipment detects that a new terminal task request appears, stopping waiting, and executing the step of determining the optimal service equipment on the response service equipment according to the predicted stay time of all connectable and non-fully loaded service equipment.
Example three:
based on the above embodiments, referring to fig. 10, fig. 10 is a schematic structural diagram of an embodiment of a service device provided in the third embodiment of the present application.
The service device 100 includes a processor 110 and a memory 120. Wherein the processor 110 and the memory 120 are coupled. The memory 120 stores therein a computer program for executing the above-described task scheduling method.
Example four:
referring to fig. 11 in particular, fig. 11 is a schematic structural diagram of an embodiment of a computer-readable storage medium provided in the fourth embodiment of the present application.
Different from the situation of the prior art, the application provides a task scheduling method. Firstly, determining the predicted movement tracks of a plurality of terminals in a signal coverage range; respectively determining the predicted stay time of the plurality of terminals in the signal coverage range according to the predicted movement tracks of the plurality of terminals; and scheduling the tasks initiated by the terminals according to the predicted stay time of the terminals. The method and the device for scheduling the tasks of the terminal use historical track points of the terminal to obtain predicted track points, determine predicted stay time in a signal coverage range of the service equipment according to the predicted track points, and schedule the tasks initiated by the terminal according to the predicted stay time. The method considers that the terminal has high mobility, detects the load condition of the service equipment at regular time intervals, and adopts the method to schedule the tasks if the terminal is fully loaded. In general, the method and the device can overcome the defect of driving the task scheduling of the terminal according to the proximity of the geographic position, effectively improve the service rate of the terminal and effectively reduce the terminal migration times.
The above description is only an example of the present application and is not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings, or which are directly or indirectly applied to other related technical fields, are intended to be included within the scope of the present application.
Claims (10)
1. A task scheduling method of a service device, the method comprising:
determining the predicted movement tracks of a plurality of terminals in the signal coverage range;
respectively determining the predicted stay time of the plurality of terminals in the signal coverage range according to the predicted movement tracks of the plurality of terminals;
and scheduling tasks initiated by the plurality of terminals according to the predicted stay time of the plurality of terminals.
2. The method of claim 1, wherein determining the predicted movement trajectories of the plurality of terminals within the signal coverage area comprises:
obtaining historical movement tracks of the plurality of terminals, wherein the historical movement tracks at least comprise track point sequences;
fitting the track point sequence to obtain a fitting function;
and determining the predicted movement tracks of the plurality of terminals in the signal coverage range according to the fitting function.
3. The method of claim 2,
the fitting the track point sequence to obtain a fitting function includes:
dividing the track point sequence into a longitude sequence and a latitude sequence;
respectively fitting the longitude sequence and the latitude sequence to obtain a longitude fitting function and a latitude fitting function;
the determining the predicted movement trajectories of the plurality of terminals within the signal coverage range according to the fitting function includes:
and predicting the longitude and latitude of the next moment of the plurality of terminals in the signal coverage range according to the longitude fitting function and the latitude fitting function so as to determine a corresponding predicted movement track.
4. The method of claim 1,
respectively determining the predicted residence time of the plurality of terminals in the signal coverage range according to the predicted movement tracks of the plurality of terminals, wherein the predicted residence time comprises the predicted residence time;
determining starting time corresponding to the current positions of the plurality of terminals; and
respectively determining the termination time corresponding to the positions of the plurality of terminals leaving the signal coverage range according to the predicted movement tracks of the plurality of terminals;
and respectively determining the predicted stay time of the plurality of terminals in the signal coverage range according to the starting time and the ending time.
5. The method of claim 1,
the scheduling the tasks initiated by the plurality of terminals according to the predicted stay time of the plurality of terminals includes:
determining selection states of tasks initiated by the plurality of terminals according to the predicted stay time of the plurality of terminals, wherein the selection states comprise selected states and unselected states;
and scheduling the tasks initiated by the terminals according to the selection states of the tasks initiated by the terminals.
6. The method of claim 5,
the determining the selection state of the tasks initiated by the plurality of terminals according to the predicted stay time of the plurality of terminals includes:
sequencing the tasks initiated by the terminals according to the sequence of the predicted residence time of the terminals from large to small to form a task queue;
determining the selection states of a preset number of tasks in the task queue as selected; and
and determining that the selection states of the tasks except the tasks with the preset number in the task queue are not selected.
7. The method of claim 5,
the scheduling the tasks initiated by the plurality of terminals according to the selection states of the tasks initiated by the plurality of terminals includes:
responding to the selection state of a target task changed from unselected to selected, and distributing the target task to the service equipment; or
And in response to the selection state of the target task changing from selected to unselected, unloading the target task.
8. The method of claim 1,
the method further comprises the following steps:
acquiring a task allocation request aiming at a target task initiated by a target terminal;
in response to the fact that the allocation state of the target task is unallocated, determining the predicted stay time of the target terminal in all service equipment signal ranges meeting set conditions;
and distributing the target task to the service equipment with the maximum predicted stay time.
9. A service device, characterized in that the device comprises a processor and a memory coupled to the processor, in which memory a computer program is stored, the processor being adapted to execute the computer program for implementing the method according to any of claims 1-8.
10. A computer-readable storage medium, in which program data are stored which, when being executed by a processor, are adapted to carry out the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111274925.1A CN114245288A (en) | 2021-10-29 | 2021-10-29 | Task scheduling method of service equipment, service equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111274925.1A CN114245288A (en) | 2021-10-29 | 2021-10-29 | Task scheduling method of service equipment, service equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114245288A true CN114245288A (en) | 2022-03-25 |
Family
ID=80743403
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111274925.1A Pending CN114245288A (en) | 2021-10-29 | 2021-10-29 | Task scheduling method of service equipment, service equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114245288A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114900224A (en) * | 2022-04-15 | 2022-08-12 | 中国电子科技集团公司第十研究所 | Method for measuring and controlling satellite by aircraft handover target and related equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008138255A1 (en) * | 2007-05-14 | 2008-11-20 | Huawei Technologies Co., Ltd. | Route process method, route processor and router |
| CN107450982A (en) * | 2017-06-07 | 2017-12-08 | 上海交通大学 | A kind of method for scheduling task based on system mode |
| CN107688496A (en) * | 2017-07-24 | 2018-02-13 | 上海壹账通金融科技有限公司 | Task distribution formula processing method, device, storage medium and server |
| CN109634730A (en) * | 2018-11-26 | 2019-04-16 | 平安科技（深圳）有限公司 | Method for scheduling task, device, computer equipment and storage medium |
| CN113254188A (en) * | 2021-07-07 | 2021-08-13 | 北京航空航天大学杭州创新研究院 | Scheduling optimization method and device, electronic equipment and storage medium |
| CN113407251A (en) * | 2021-05-26 | 2021-09-17 | 北京工业大学 | Method and device for unloading mobile edge network service |
-
2021
- 2021-10-29 CN CN202111274925.1A patent/CN114245288A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008138255A1 (en) * | 2007-05-14 | 2008-11-20 | Huawei Technologies Co., Ltd. | Route process method, route processor and router |
| CN107450982A (en) * | 2017-06-07 | 2017-12-08 | 上海交通大学 | A kind of method for scheduling task based on system mode |
| CN107688496A (en) * | 2017-07-24 | 2018-02-13 | 上海壹账通金融科技有限公司 | Task distribution formula processing method, device, storage medium and server |
| CN109634730A (en) * | 2018-11-26 | 2019-04-16 | 平安科技（深圳）有限公司 | Method for scheduling task, device, computer equipment and storage medium |
| CN113407251A (en) * | 2021-05-26 | 2021-09-17 | 北京工业大学 | Method and device for unloading mobile edge network service |
| CN113254188A (en) * | 2021-07-07 | 2021-08-13 | 北京航空航天大学杭州创新研究院 | Scheduling optimization method and device, electronic equipment and storage medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114900224A (en) * | 2022-04-15 | 2022-08-12 | 中国电子科技集团公司第十研究所 | Method for measuring and controlling satellite by aircraft handover target and related equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111491332B (en) | Dynamic service migration method and device | |
| CN107734558A (en) | A kind of control of mobile edge calculations and resource regulating method based on multiserver | |
| CN108781229A (en) | Control the method and server of the reorientation of MEC applications | |
| CN114157337B (en) | Low-orbit satellite inter-satellite switching prediction method based on time-varying graph | |
| CN104796422A (en) | Online customer service staff equilibrium assignment method and online customer service staff equilibrium assignment device | |
| CN112291335B (en) | Optimized task scheduling method in mobile edge calculation | |
| US20180375957A1 (en) | Access scheduling method and apparatus for terminal, and computer storage medium | |
| CN108632055A (en) | The method and apparatus and communication system of network-control | |
| CN106911487B (en) | Method and device for voice chat | |
| US20130148596A1 (en) | Resource management system and method of centralized base station in mobile communication network | |
| CN114363962A (en) | Collaborative edge server deployment and resource scheduling method, storage medium and system | |
| CN114245288A (en) | Task scheduling method of service equipment, service equipment and storage medium | |
| US20160269297A1 (en) | Scaling the LTE Control Plane for Future Mobile Access | |
| CN104506457A (en) | Bandwidth adjusting method and system and intelligent pipeline platform | |
| CN110515728B (en) | Server scheduling method and device, electronic equipment and machine-readable storage medium | |
| CN114513838A (en) | Moving edge calculation method, frame, and medium | |
| CN112291796B (en) | Cell network capacity expansion method, device, equipment and storage medium | |
| CN106604328B (en) | The region MECC switching method and system | |
| CN106411971B (en) | Load adjusting method and device | |
| CN109600432B (en) | Dynamic access method for content center mobile edge network user | |
| CN114666409B (en) | Service migration method based on cache management in edge computing environment | |
| CN110224861A (en) | The implementation method of adaptive dynamic heterogeneous network selection policies based on study | |
| CN114466365A (en) | Spectrum resource acquisition method, spectrum resource acquisition device and computer readable storage medium | |
| CN113366814B (en) | Method for managing resource allocation in edge computing system | |
| CN111726835B (en) | Voice call method and device and electronic equipment |
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 |