A computing power resource scheduling method, system, device and storage medium based on edge computing

Abstract

The present invention relates to the field of edge computing technology, and specifically relates to a computing power resource scheduling method, system, device and storage medium based on edge computing, including: scheduling the first task requirement and the second task requirement with the shortest processing time as the objective function according to the first processing frequency, the second processing frequency and the third processing frequency; the scheduling includes a first scheduling and a second scheduling; the first scheduling includes scheduling the self-processing and the request authenticator processing of the first task requirement according to the first processing frequency; the second scheduling includes scheduling the self-processing, the edge server processing and the return of the request of the unauthenticated person for the second task requirement and the request processing of the unauthenticated person according to the second processing frequency and the third processing frequency. The present invention schedules with the shortest processing time as the objective function by comprehensively considering the task requirements and processing frequencies of unauthenticated persons, authenticated persons and edge servers, thereby ensuring the efficient utilization of computing power resources.

Description

Technical Field

[0001] The present invention relates to the technical field of edge computing, and in particular, to a computing power resource scheduling method, system, device, and storage medium based on edge computing. Background Art

[0002] With the rapid development of technologies such as the Internet of Things, big data, and artificial intelligence, edge computing, as a new computing model, is gradually becoming a key technology for solving problems such as high data processing latency and large bandwidth consumption. Edge computing deploys computing resources on the edge side of the network, enabling data to be preliminarily processed and analyzed without being transmitted back to the cloud, thereby significantly reducing the latency of data processing and improving the response speed.

[0003] In the scenario of edge computing, the effective scheduling of computing power resources has become a key issue. Since the computing power resources of edge servers are limited, how to reasonably allocate these resources to meet the needs of different users has become a difficult problem to be solved urgently. Especially in a complex network environment, there are multiple types of users, including authenticated users who have passed security authentication and unauthenticated users who have not been authenticated. For authenticated users, since they have passed security authentication, they can directly perform task scheduling with the edge server. For unauthenticated users, since their identities have not been confirmed, they cannot perform task scheduling with the edge server.

[0004] Therefore, how to intelligently schedule the task requirements of authenticated and unauthenticated users is a current research direction. Summary of the Invention

[0005] (I) Object of the Invention

[0006] The object of the present invention is to provide a computing power resource scheduling method, system, device, and storage medium based on edge computing that can improve processing efficiency.

[0007] (II) Technical Solution

[0008] To solve the above problems, the present invention provides a computing power resource scheduling method based on edge computing. The computing power resource scheduling method is based on an edge server, an authenticated user, and an unauthenticated user;

[0009] The authenticated user is connected to the edge server, and the unauthenticated user is connected to the authenticated user;

[0010] The unauthenticated user uses the computing power resources of the edge server through the authenticated user;

[0011] The computing power resource scheduling method includes:

[0012] Obtain the first task requirement and the first processing frequency of the unauthenticated user;

[0013] Obtain the second task requirements and the second processing frequency of the authenticator;

[0014] Obtain the third processing frequency of the edge server;

[0015] According to the first processing frequency, the second processing frequency and the third processing frequency, schedule the first task requirements and the second task requirements with the shortest processing time as the objective function;

[0016] The scheduling includes the first scheduling and the second scheduling;

[0017] The first scheduling includes scheduling for self-processing and requesting the authenticator to process the first task requirements according to the first processing frequency;

[0018] The second scheduling includes scheduling for self-processing, edge server processing and returning the requests of the unauthenticated person for the second task requirements and the requests of the unauthenticated person according to the second processing frequency and the third processing frequency.

[0019] On the other hand, preferably, the objective function is represented by the following formula:

[0020] ;

[0021] ;

[0022] Wherein, T represents the processing time, and the processing time is the larger of the processing requirement times of the unauthenticated person, the authenticator and the edge server. T1 represents the processing requirement time of the unauthenticated person, T2 represents the processing requirement time of the authenticator, and T3 represents the processing requirement time of the edge server; T i represents the time when the i-th task requirement processed by the unauthenticated person is completed. n represents the number of task requirements processed by the unauthenticated person. T j represents the time when the j-th task requirement processed by the authenticator is completed. m represents the number of task requirements processed by the authenticator. T r represents the time when the r-th task requirement processed by the edge server is completed. s represents the number of task requirements processed by the edge server.

[0023] On the other hand, preferably, the time when the i-th task requirement processed by the unauthenticated person is completed is represented by the following formula:

[0024] ;

[0025] Wherein, T i represents the time when the i-th task requirement processed by the unauthenticated person is completed. D 1-erepresents the task volume of the e-th task requirement in the first task requirement, f1 represents the first processing frequency, and A1 represents self-processing by the unauthenticated person; V1 represents the data transmission speed between the unauthenticated person and the authenticated person, and A2 represents the authenticated person returning it to the unauthenticated person for processing.

[0026] On the other hand, preferably, the time taken to complete the processing of the j-th task requirement by the authenticated person is expressed by the following formula:

[0027] ;

[0028] where, T j represents the time taken to complete the processing of the j-th task requirement by the authenticated person, D 1-e represents the task volume of the e-th task requirement in the first task requirement, V1 represents the data transmission speed between the unauthenticated person and the authenticated person, f2 represents the second processing frequency, represents the data volume after processing the e-th task requirement in the first task requirement, A3 represents the authenticated person helping the unauthenticated person to process; D 2-g represents the task volume of the g-th task requirement in the second task requirement, f2 represents the second processing frequency, and B1 represents self-processing by the authenticated person.

[0029] On the other hand, preferably, the time taken to complete the processing of the r-th task requirement by the edge server is expressed by the following formula:

[0030] ;

[0031] where, T r represents the time taken to complete the processing of the r-th task requirement by the edge server, D 1-e represents the task volume of the e-th task requirement in the first task requirement, V1 represents the data transmission speed between the unauthenticated person and the authenticated person, represents the data volume after processing the e-th task requirement in the first task requirement, f3 represents the third processing frequency, D 2-g represents the task volume of the g-th task requirement in the second task requirement, represents the data volume after processing the g-th task requirement in the second task requirement, B2 represents the edge server helping the authenticated person to process; V2 represents the data transmission speed between the authenticated person and the edge server, and A4 represents the edge server helping the unauthenticated person to process.

[0032] On the other hand, preferably, the data transmission speed between the unauthenticated person and the authenticated person is calculated by the following formula:

[0033] ;

[0034] Among them, V1 represents the data transmission speed between the unauthenticated party and the authenticator, K1 represents the network bandwidth between the unauthenticated party and the authenticator, P1 represents the power for the migration of the task requirements of the unauthenticated party, h1 represents the channel gain between the unauthenticated party and the authenticator, represents the white noise power between the unauthenticated party and the authenticator, D represents the data packet size of the task requirements, and L1 represents the network latency between the unauthenticated party and the authenticator.

[0035] On the other hand of the present invention, preferably, the data transmission speed between the authenticator and the edge server is calculated using the following formula:

[0036] ;

[0037] Among them, V2 represents the data transmission speed between the authenticator and the edge server, K2 represents the network bandwidth between the authenticator and the edge server, P2 represents the power for the migration of the task requirements of the authenticator, h2 represents the channel gain between the authenticator and the edge server, represents the white noise power between the authenticator and the edge server, D represents the data packet size of the task requirements, and L2 represents the network latency between the authenticator and the edge server.

[0038] On the other hand of the present invention, preferably, a computing power resource scheduling system based on edge computing

[0039] The computing power resource scheduling system is based on an edge server, an authenticator, and an unauthenticated party;

[0040] The authenticator is connected to the edge server, and the unauthenticated party is connected to the authenticator;

[0041] The unauthenticated party uses the computing power resources of the edge server through the authenticator;

[0042] The computing power resource scheduling system includes:

[0043] A first acquisition module: acquiring the first task requirements and the first processing frequency of the unauthenticated party;

[0044] A second acquisition module: acquiring the second task requirements and the second processing frequency of the authenticator;

[0045] A third acquisition module: acquiring the third processing frequency of the edge server;

[0046] A scheduling module: scheduling the first task requirements and the second task requirements with the shortest processing time as the objective function according to the first processing frequency, the second processing frequency, and the third processing frequency;

[0047] The scheduling includes a first scheduling and a second scheduling;

[0048] The first scheduling includes scheduling for self - processing and requesting the authenticator to process the first task requirement according to the first processing frequency;

[0049] The second scheduling includes scheduling for self - processing, edge - server processing, and returning the requests of unauthenticated users for processing the second task requirement and the requests of unauthenticated users according to the second processing frequency and the third processing frequency.

[0050] On the other hand, preferably, an apparatus includes a memory and a processor. The memory stores a computer program, and when the processor executes the computer program, the steps of the method described above are implemented.

[0051] On the other hand, preferably, a storage medium is used to store a computer program, and the computer program causes a computer to execute the method described above.

[0052] (III) Beneficial effects

[0053] The above - mentioned technical solution of the present invention has the following beneficial technical effects:

[0054] By comprehensively considering the task requirements and processing frequencies of unauthenticated users, authenticators, and edge servers, and taking the shortest processing time as the objective function for scheduling, the present invention ensures the efficient utilization of computing power resources. It avoids the waste of computing power resources caused by fixed priorities or simple polling in traditional methods. For unauthenticated users, even if they are not directly connected to the edge server, they can obtain the required computing power resources through the authenticator, thus ensuring the smooth completion of their tasks. This helps to improve user satisfaction and trust. Brief description of the drawings

[0055] Figure 1 It is a flowchart of an embodiment of the computing power resource scheduling method based on edge computing of the present invention. Detailed implementation manners

[0056] To make the objectives, technical solutions, and advantages of the present invention clearer, the present invention will be further described in detail below with reference to specific implementation manners and the accompanying drawings. It should be understood that these descriptions are exemplary and are not intended to limit the scope of the present invention. In addition, in the following description, the descriptions of well - known structures and technologies are omitted to avoid unnecessarily confusing the concepts of the present invention.

[0057] Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0058] In addition, the technical features involved in different embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0059] The present invention will be described in more detail below with reference to the accompanying drawings. In the respective drawings, the same elements are denoted by like reference numerals. For the sake of clarity, the various parts in the drawings are not drawn to scale.

[0060] Embodiment 1

[0061] A computing power resource scheduling method based on edge computing. In an edge computing system, based on the actual requirements of data processing, a decision is made on whether to migrate user terminal data to an edge server for processing, so as to utilize the powerful computing power of the edge server to quickly complete tasks. This can not only reduce the computing burden of the user terminal itself, but also effectively reduce the latency of task processing and improve the user experience.

[0062] The computing power resource scheduling method of this embodiment is based on an edge server, an authenticator, and an unauthenticator; the edge server provides services through hardware such as GPUs, etc. The authenticator is a user terminal authenticated by the edge server, such as a computer, and the unauthenticator is a user terminal that has not been authenticated by the edge server, such as a mobile phone. The authenticator can directly use the computing resources of the edge server, and the unauthenticator can only decide whether to use the computing resources of the edge server through the authenticator;

[0063] The authenticator is connected to the edge server, and the unauthenticator is connected to the authenticator;

[0064] The unauthenticator uses the computing power resources of the edge server through the authenticator;

[0065] Figure 1 Shows the overall flowchart of an embodiment of the present invention, as Figure 1 shown, the computing power resource scheduling method includes:

[0066] Obtain the first task requirement and the first processing frequency of the unauthenticator; First, the task requirements of the unauthenticator (such as a mobile phone) will be collected, which includes the specific type of the task (such as image processing, video analysis, natural language processing, etc.) and the required processing resources. At the same time, the system will obtain the first processing frequency of the unauthenticator, that is, the number of instructions that the local device of the unauthenticator can execute per second, which helps to evaluate its local processing ability.

[0067] Obtain the second task requirement and the second processing frequency of the authenticator; For the user terminal (such as a computer) that has been authenticated by the edge server, the system will collect its second task requirement and the second processing frequency. These information also include the task type and the processing resource requirements, as well as the processing ability of the authenticator device.

[0068] Obtaining a third processing frequency of the edge server; the third processing frequency is the number of instructions executed per second when the edge server processes data;

[0069] According to the first processing frequency, the second processing frequency and the third processing frequency, the first task demand and the second task demand are scheduled with the shortest processing time as the objective function;

[0070] The scheduling includes a first scheduling and a second scheduling;

[0071] The first scheduling includes scheduling self-processing and requesting authenticator processing of the first task requirement according to the first processing frequency; making a decision based on the first task requirement and the first processing frequency of the unauthenticated person. If the task is relatively simple and the processing capacity of the unauthenticated person's device is sufficient, the task will be processed locally by the unauthenticated person. If the task is complex or the processing requirements exceed the local capacity of the unauthenticated person, a request will be sent to a nearby authenticator to seek their help.

[0072] The second scheduling includes scheduling the second task requirements and the unauthenticated request processing for self-processing, edge server processing, and returning the unauthenticated request according to the second processing frequency and the third processing frequency. After receiving the unauthenticated request, the authenticator will make a decision based on its own second task requirements and second processing frequency, as well as the third processing frequency of the edge server. If the authenticator is currently lightly loaded and the edge server has sufficient computing power, the authenticator will accept the unauthenticated request and the authenticator device will process the task or the edge server will process the task. If the authenticator itself has a heavy task and the edge server resources are tight, it will choose to return the unauthenticated request.

[0073] Once the task is dispatched to the appropriate processing unit (whether it is the local device of the unauthenticated user, the device of the authenticated user, or the edge server), the unit will start to execute the task. After the task is completed, the result will be returned to the requester (unauthenticated or authenticated) in a predetermined manner.

[0074] Furthermore, in this embodiment, the objective function is expressed by the following formula:

[0075] ;

[0076] ;

[0077] Among them, T represents the processing time, which is the larger value among the processing required times of the unauthenticated party, the authenticator, and the edge server. It is the variable to be optimized in the objective function, representing the longest time required to complete all task requirements, which is the longest processing time among the unauthenticated party, the authenticator, and the edge server. T1 represents the processing required time of the unauthenticated party, T2 represents the processing required time of the authenticator, and T3 represents the processing required time of the edge server; T i represents the completion time of the i-th task requirement processed by the unauthenticated party, n represents the number of task requirements processed by the unauthenticated party, T j represents the completion time of the j-th task requirement processed by the authenticator, m represents the number of task requirements processed by the authenticator, T r represents the completion time of the r-th task requirement processed by the edge server, and s represents the number of task requirements processed by the edge server.

[0078] Furthermore, in this embodiment, the completion time of the i-th task requirement processed by the unauthenticated party is expressed by the following formula:

[0079] ;

[0080] Among them, T i represents the completion time of the i-th task requirement processed by the unauthenticated party, D 1-e represents the task volume of the e-th task requirement in the first task requirement, f1 represents the first processing frequency, A1 represents the unauthenticated party's self-processing; V1 represents the data transmission speed between the unauthenticated party and the authenticator, and A2 represents the authenticator's returning for the unauthenticated party to process. All task requirements processed by the unauthenticated party are from the first task requirement. The unauthenticated party's processing of the first task requirement includes two cases. One is direct processing, and the other is processing after being returned by the authenticator. The case of direct processing is A1, and the case of processing after being returned is A2. In the case of A2, the transmission time of the task requirement between the unauthenticated party and the authenticator needs to be added.

[0081] Furthermore, in this embodiment, the completion time of the j-th task requirement processed by the authenticator is expressed by the following formula:

[0082] ;

[0083] Among them, T j represents the completion time of the j-th task requirement processed by the authenticator, D 1-e represents the task volume of the e-th task requirement in the first task requirement, V1 represents the data transmission speed between the unauthenticated party and the authenticator, and f2 represents the second processing frequency. represents the data volume after processing the e-th task requirement in the first task requirement. A3 represents that the authenticator processes on behalf of the unauthenticated user; D 2-g represents the task volume of the g-th task requirement in the second task requirement. f2 represents the second processing frequency. B1 represents that the authenticator processes by itself. The tasks processed by the authenticator include some or all of the second task requirement and some content of the first task requirement of the unauthenticated request. The content of the second task requirement processed by the authenticator is B1, and the content of the first task requirement processed by the authenticator is A3. In the case of A3, the time for the transmission of the task requirement and the processing result between the unauthenticated user and the authenticator needs to be added.

[0084] Furthermore, in this embodiment, the time when the r-th task requirement processed by the edge server is completed is represented by the following formula:

[0085] ;

[0086] where, T r represents the time when the r-th task requirement processed by the edge server is completed. D 1-e represents the task volume of the e-th task requirement in the first task requirement. V1 represents the data transmission speed between the unauthenticated user and the authenticator. represents the data volume after processing the e-th task requirement in the first task requirement. f3 represents the third processing frequency. D 2-g represents the task volume of the g-th task requirement in the second task requirement. represents the data volume after processing the g-th task requirement in the second task requirement. B2 represents that the edge server processes on behalf of the authenticator; V2 represents the data transmission speed between the authenticator and the edge server. A4 represents that the edge server processes on behalf of the unauthenticated user. In the case where the edge server processes the first task requirement, which is A4, the time needs to add the time for the transmission of the task requirement and the processing result. In the case where the edge server processes the second task requirement, which is B2, the time needs to add the time for the transmission of the task requirement and the processing result between the authenticator and the edge server.

[0087] Furthermore, in this embodiment, the data transmission speed between the unauthenticated user and the authenticator is calculated by the following formula:

[0088] ;

[0089] where, V1 represents the data transmission speed between the unauthenticated user and the authenticator. K1 represents the network bandwidth between the unauthenticated user and the authenticator. P1 represents the power for the migration of the unauthenticated user's task requirement. h1 represents the channel gain between the unauthenticated user and the authenticator. represents the white noise power between the unauthenticated user and the authenticator. D represents the data packet size of the task requirement. L1 represents the network delay between the unauthenticated user and the authenticator.

[0090] Further, in this embodiment, the data transmission speed between the authenticator and the edge server is calculated using the following formula:

[0091] ;

[0092] where V2 represents the data transmission speed between the authenticator and the edge server, K2 represents the network bandwidth between the authenticator and the edge server, P2 represents the power for the migration of the authenticator's task requirements, h2 represents the channel gain between the authenticator and the edge server, represents the white noise power between the authenticator and the edge server, D represents the packet size of the task requirements, and L2 represents the network latency between the authenticator and the edge server.

[0093] Network bandwidth is the key to improving data transmission speed. If the network bandwidth is limited, even if other parameters are ideal, the data transmission speed will be restricted. The network bandwidth can be tested through network management tools. The task migration power is directly affected by the complexity of the task and the required resources, which directly affect data transmission and can be obtained through experience. The channel gain reflects the intensity change of the signal during transmission and can be obtained through a wireless network analysis tool or by using a known pilot signal through a tested channel. The white noise power can be measured through signal processing tools. In practical engineering applications, if the frequency range where the power spectral density of the noise is uniformly distributed is much larger than the working frequency band of the communication system, it can be regarded as white noise. The packet size can be obtained by capturing and analyzing network packets through network packet capture tools such as Wireshark or libraries in programming languages (such as the Scapy library in Python), and the network latency can be measured through the ping command or by using the iperf tool. These tools can provide information about the network latency.

[0094] Embodiment 2

[0095] A computing power resource scheduling system based on edge computing,

[0096] The computing power resource scheduling system is based on an edge server, an authenticator, and an unauthenticated user;

[0097] The authenticator is connected to the edge server, and the unauthenticated user is connected to the authenticator;

[0098] The unauthenticated user uses the computing power resources of the edge server through the authenticator;

[0099] The computing power resource scheduling system includes:

[0100] A first acquisition module: acquiring the first task requirements and the first processing frequency of the unauthenticated user;

[0101] The second acquisition module: acquires the second task requirement and the second processing frequency of the authenticator;

[0102] The third acquisition module: acquires the third processing frequency of the edge server;

[0103] The scheduling module: schedules the first task requirement and the second task requirement with the shortest processing time as the objective function according to the first processing frequency, the second processing frequency, and the third processing frequency;

[0104] The said scheduling includes the first scheduling and the second scheduling;

[0105] The first scheduling includes scheduling for self-processing and requesting the authenticator to process the first task requirement according to the first processing frequency;

[0106] The second scheduling includes scheduling for self-processing, edge server processing, and returning the request of the unauthenticated person to process the second task requirement and the request of the unauthenticated person according to the second processing frequency and the third processing frequency.

[0107] Embodiment III

[0108] A device includes a memory and a processor. The memory stores a computer program, and when the processor executes the computer program, the steps of the method described above are implemented.

[0109] Embodiment IV

[0110] A storage medium is used to store a computer program, and the computer program causes a computer to execute the method described above.

[0111] It should be understood that the above specific embodiments of the present invention are only used for exemplary illustration or explanation of the principle of the present invention, and do not constitute a limitation on the present invention. Therefore, any modifications, equivalent replacements, improvements, etc. made without departing from the spirit and scope of the present invention should be included within the protection scope of the present invention. In addition, the appended claims of the present invention are intended to cover all changes and modifications that fall within the scope and boundary of the appended claims, or equivalent forms of such scope and boundary.

[0112] The present invention has been described above with reference to the embodiments of the present invention. However, these embodiments are only for the purpose of illustration and not for the purpose of limiting the scope of the present invention. The scope of the present invention is defined by the appended claims and their equivalents. Without departing from the scope of the present invention, those skilled in the art can make various substitutions and modifications, and these substitutions and modifications should all fall within the scope of the present invention.

[0113] Although the embodiments of the present invention have been described in detail, it should be understood that various changes, substitutions, and modifications can be made to the embodiments of the present invention without departing from the spirit and scope of the present invention.

[0114] Obviously, the above embodiments are merely examples given for clear illustration and are not limitations on the embodiments. For those of ordinary skill in the art, other different forms of changes or alterations can be made based on the above description. It is not necessary and impossible to enumerate all the embodiments here. And the obvious changes or alterations derived therefrom still fall within the protection scope of the present invention.

Claims

1. A computing power resource scheduling method based on edge computing, characterized in that the computing power resource scheduling method is based on an edge server, an authenticator, and an unauthenticated entity; the authenticator is connected to the edge server, and the unauthenticated entity is connected to the authenticator; the unauthenticated entity uses the computing power resources of the edge server through the authenticator; the computing power resource scheduling method includes: obtaining a first task requirement and a first processing frequency of the unauthenticated entity; obtaining a second task requirement and a second processing frequency of the authenticator; obtaining a third processing frequency of the edge server; scheduling the first task requirement and the second task requirement with the shortest processing time as the objective function according to the first processing frequency, the second processing frequency, and the third processing frequency; the scheduling includes a first scheduling and a second scheduling; the first scheduling includes scheduling for self-processing and requesting the authenticator to process the first task requirement according to the first processing frequency; the second scheduling includes scheduling for self-processing, edge server processing, and returning the request of the unauthenticated entity for processing the second task requirement and the request of the unauthenticated entity according to the second processing frequency and the third processing frequency; the objective function is represented by the following formula: ； ； Among them, T represents the processing time, which is the maximum of the processing required times of the unauthenticated party, the authenticator, and the edge server. T1 represents the processing required time of the unauthenticated party, T2 represents the processing required time of the authenticator, and T3 represents the processing required time of the edge server; T i represents the time when the i-th task requirement processed by the unauthenticated party is completed. n represents the number of task requirements processed by the unauthenticated party, T j represents the time when the j-th task requirement processed by the authenticator is completed. m represents the number of task requirements processed by the authenticator, T r represents the time when the r-th task requirement processed by the edge server is completed. s represents the number of task requirements processed by the edge server; the time for completing the processing of the i-th task requirement processed by the unauthenticated entity is represented by the following formula: ； the time for completing the processing of the j-th task requirement processed by the authenticator is represented by the following formula: ； the time for completing the processing of the r-th task requirement processed by the edge server is represented by the following formula: ； Among them, D 1-e represents the task volume of the e-th task requirement in the first task requirement, f1 represents the first processing frequency, and A1 represents self-processing by the unauthenticated person; V1 represents the data transmission speed between the unauthenticated person and the authenticator, and A2 represents the authenticator returning it to the unauthenticated person for processing; f2 represents the second processing frequency, represents the data volume after processing the e-th task requirement in the first task requirement, and A3 represents the authenticator helping the unauthenticated person to process; D 2-g represents the task volume of the g-th task requirement in the second task requirement, B1 represents self-processing by the authenticator; f3 represents the third processing frequency, represents the data volume after processing the g-th task requirement in the second task requirement, B2 represents the edge server helping the authenticator to process; V2 represents the data transmission speed between the authenticator and the edge server, and A4 represents the edge server helping the unauthenticated person to process.

2. The computing power resource scheduling method according to claim 1, wherein the data transmission speed between the unauthenticated entity and the authenticator is calculated by the following formula: ； Among them, V1 represents the data transmission speed between the unauthenticated party and the authenticator, K1 represents the network bandwidth between the unauthenticated party and the authenticator, P1 represents the power for the task demand migration of the unauthenticated party, h1 represents the channel gain between the unauthenticated party and the authenticator, represents the white noise power between the unauthenticated party and the authenticator, D represents the data packet size of the task demand, and L1 represents the network latency between the unauthenticated party and the authenticator.

3. The computing power resource scheduling method according to claim 1, wherein the data transmission speed between the authenticator and the edge server is calculated by the following formula: ； Among them, V2 represents the data transmission speed between the authenticator and the edge server, K2 represents the network bandwidth between the authenticator and the edge server, P2 represents the power for the migration of the authenticator's task requirements, h2 represents the channel gain between the authenticator and the edge server, represents the white noise power between the authenticator and the edge server, D represents the data packet size of the task requirements, and L2 represents the network latency between the authenticator and the edge server.

4. A computing power resource scheduling system based on edge computing, characterized in that the computing power resource scheduling system is based on an edge server, an authenticator, and an unauthenticated entity; the authenticator is connected to the edge server, and the unauthenticated entity is connected to the authenticator; the unauthenticated entity uses the computing power resources of the edge server through the authenticator; the computing power resource scheduling system includes: a first acquisition module: obtaining a first task requirement and a first processing frequency of the unauthenticated entity; a second acquisition module: obtaining a second task requirement and a second processing frequency of the authenticator; a third acquisition module: obtaining a third processing frequency of the edge server; a scheduling module: scheduling the first task requirement and the second task requirement with the shortest processing time as the objective function according to the first processing frequency, the second processing frequency, and the third processing frequency; the scheduling includes a first scheduling and a second scheduling; the first scheduling includes scheduling for self-processing and requesting the authenticator to process the first task requirement according to the first processing frequency; the second scheduling includes scheduling for self-processing, edge server processing, and returning the request of the unauthenticated entity for processing the second task requirement and the request of the unauthenticated entity according to the second processing frequency and the third processing frequency; the objective function is represented by the following formula: ； ； Among them, T represents the processing time, which is the maximum of the processing required times of the unauthenticated user, the authenticator, and the edge server. T1 represents the processing required time of the unauthenticated user, T2 represents the processing required time of the authenticator, and T3 represents the processing required time of the edge server; T i represents the time when the i-th task requirement processed by the unauthenticated user is completed. n represents the number of task requirements processed by the unauthenticated user, T j represents the time when the j-th task requirement processed by the authenticator is completed. m represents the number of task requirements processed by the authenticator, T r represents the time when the r-th task requirement processed by the edge server is completed. s represents the number of task requirements processed by the edge server; the time for completing the processing of the i-th task requirement processed by the unauthenticated entity is represented by the following formula: ； The time when the j-th task requirement processed by the authenticator is completed is expressed by the following formula: ； The time when the r-th task requirement processed by the edge server is completed is expressed by the following formula: ； Among them, D 1-e represents the task volume of the e-th task requirement in the first task requirement, f1 represents the first processing frequency, A1 represents self-processing by the unauthenticated person; V1 represents the data transmission speed between the unauthenticated person and the authenticator, A2 represents the authenticator returning for the unauthenticated person to process; f2 represents the second processing frequency, represents the data volume after processing the e-th task requirement in the first task requirement, A3 represents the authenticator helping the unauthenticated person to process; D 2-g represents the task volume of the g-th task requirement in the second task requirement, B1 represents self-processing by the authenticator; f3 represents the third processing frequency, represents the data volume after processing the g-th task requirement in the second task requirement, B2 represents the edge server helping the authenticator to process; V2 represents the data transmission speed between the authenticator and the edge server, A4 represents the edge server helping the unauthenticated person to process.

5. A device, characterized in that, It includes a memory and a processor. The memory stores a computer program, and when the processor executes the computer program, it implements the steps of the method described in any one of claims 1 to 3.

6. A storage medium, characterized in that, For storing a computer program, the computer program causes a computer to execute the method described in any one of claims 1 to 3.

Images