Calculation power resource scheduling method, system and device based on edge calculation and storage medium

Abstract

The invention relates to the technical field of edge computing, in particular to a computing power resource scheduling method, system and device based on edge computing and a storage medium, comprising: scheduling a first task demand and a second task demand by taking the shortest processing time as an objective function according to a first processing frequency, a second processing frequency and a third processing frequency; the scheduling comprises first scheduling and second scheduling; the first scheduling comprises scheduling of performing self-processing on the first task demand and requesting authenticator processing according to the first processing frequency; the second scheduling comprises the scheduling of self-processing the second task demand and the request processing of the unauthenticated person, processing the edge server and returning the request of the unauthenticated person according to the second processing frequency and the third processing frequency. According to the method, task requirements and processing frequencies of an unauthenticated person, an authenticated person and an edge server are comprehensively considered, and scheduling is carried out by taking the shortest processing time as an objective function, so that efficient utilization of computing power resources is ensured.

Description

Technical Field

[0001] The present invention relates to the field of edge computing technology, and in particular to a computing 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 to solve problems such as high latency and high bandwidth consumption in big data processing. Edge computing deploys computing resources on the edge of the network, so that data can be initially processed and analyzed without being sent back to the cloud, thereby significantly reducing the latency of data processing and improving response speed.

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

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

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

[0006] (II) Technical solution To solve the above problems, the present invention provides a computing resource scheduling method based on edge computing, wherein the computing resource scheduling method is based on edge servers, authenticated users, and unauthenticated users; The authenticator is connected to the edge server, and the unauthenticated user is connected to the authenticator; The unauthenticated person uses the computing resources of the edge server through the authenticator; The computing resource scheduling method comprises: Acquire a first task requirement and a first processing frequency of the unauthenticated person; Acquire a second task requirement and a second processing frequency of the authenticator; Obtaining a third processing frequency of the edge server; 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; The scheduling includes a first scheduling and a second scheduling; The first scheduling includes scheduling self-processing and requesting authenticator processing of the first task requirement according to the first processing frequency; The second scheduling includes scheduling the self-processing, edge server processing, and returning of unauthenticated requests for the second task requirements and unauthenticated request processing according to the second processing frequency and the third processing frequency.

[0007] In another aspect of the present invention, preferably, the objective function is expressed by the following formula: ; ; Where T represents the processing time, which is the larger of the processing time required by the unauthenticated user, the authenticator, and the edge server. 1 It represents the time for unauthenticated users to process requests, T 2 Indicates the time it takes for the authenticator to process the request, T 3 Indicates the time it takes for the edge server to process the request; T i represents the time it takes for the unauthenticated user to complete the i-th task requirement, n represents the number of task requirements processed by the unauthenticated user, T j represents the time it takes for the jth task requirement processed by the authenticator to be completed, m represents the number of task requirements processed by the authenticator, T r It represents the time when the rth task demand processed by the edge server is completed, and s represents the number of task demands processed by the edge server.

[0008] In another aspect of the present invention, preferably, the time required to complete the i-th task processed by the unauthenticated person is expressed by the following formula: ; Among them, T i represents the time to complete the i-th task requirement processed by the unauthenticated user, D 1-e represents the task quantity of the e-th task requirement in the first task requirement, f 1 represents the first processing frequency, A 1 Indicates that unauthenticated persons handle the issue by themselves; V 1 Indicates the data transmission speed between the unauthenticated and authenticated parties, A 2 Indicates that the authenticated user returns the request to the unauthenticated user for processing.

[0009] In another aspect of the present invention, preferably, the time for completing the j-th task requirement processed by the authenticator is expressed by the following formula: ; Among them, T j represents the time when the jth task requirement processed by the authenticator is completed, D 1-e represents the task volume of the e-th task requirement in the first task requirement, V 1 Indicates the data transmission speed between the unauthenticated party and the authenticated party, f 2 represents the second processing frequency, A represents the amount of data after processing the e-th task requirement in the first task requirement. 3 It means that the authenticated person helps the unauthenticated person to handle the problem; D 2-g represents the task amount of the gth task requirement in the second task requirement, f 2 represents the second processing frequency, B 1 Indicates that the authenticator handles it by himself.

[0010] In another aspect of the present invention, preferably, the time for completing the processing of the rth task requirement processed by the edge server is expressed by the following formula: ; Among them, T r represents the time when the edge server completes the processing of the rth task requirement, D 1-e represents the task volume of the e-th task requirement in the first task requirement, V 1 Indicates the data transmission speed between the unauthenticated and authenticated parties. represents the amount of data processed by the e-th task requirement in the first task requirement, f 3 represents the third processing frequency, D 2-g represents the task amount of the gth task requirement in the second task requirement, represents the amount of data after processing the gth task requirement in the second task requirement, B 2 Indicates that the edge server helps the authenticator process; V 2 Indicates the data transmission speed between the authenticator and the edge server, A 4 Indicates that the edge server helps unauthenticated users.

[0011] In another aspect of the present invention, preferably, the data transmission speed between the unauthenticated person and the authenticated person is calculated using the following formula: ; Among them, V 1 Indicates the data transmission speed between the unauthenticated and authenticated parties, K 1 represents the network bandwidth between the unauthenticated and authenticated users, P 1represents the power of task demand migration for unauthenticated users, h 1 represents the channel gain between the unauthenticated and authenticated parties, represents the white noise power between the unauthenticated and authenticated parties, D represents the data packet size required by the task, and L 1 Indicates the network delay between the unauthenticated party and the authenticated party.

[0012] In another aspect of the present invention, preferably, the data transmission speed between the authenticator and the edge server is calculated using the following formula: ; Among them, V 2 represents the data transmission speed between the authenticator and the edge server, K 2 represents the network bandwidth between the authenticator and the edge server, P 2 represents the power of the authenticator's task demand migration, h 2 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 required by the task, and L 2 Indicates the network delay between the authenticator and the edge server.

[0013] In another aspect of the present invention, preferably, a computing resource scheduling system based on edge computing, The computing resource scheduling system is based on edge servers, authenticated users and unauthenticated users; The authenticator is connected to the edge server, and the unauthenticated user is connected to the authenticator; The unauthenticated person uses the computing resources of the edge server through the authenticator; The computing resource scheduling system includes: A first acquisition module: acquiring a first task requirement and a first processing frequency of the unauthenticated person; A second acquisition module: acquiring a second task requirement and a second processing frequency of the authenticator; A third acquisition module: acquiring a third processing frequency of the edge server; Scheduling module: scheduling the first task requirement and the second task requirement according to the first processing frequency, the second processing frequency and the third processing frequency, taking the shortest processing time as the objective function; The scheduling includes a first scheduling and a second scheduling; The first scheduling includes scheduling self-processing and requesting authenticator processing of the first task requirement according to the first processing frequency; The second scheduling includes scheduling the self-processing, edge server processing, and returning of unauthenticated requests for the second task requirements and unauthenticated request processing according to the second processing frequency and the third processing frequency.

[0014] In another aspect of the present invention, preferably, a device comprises a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above method when executing the computer program.

[0015] Another aspect of the present invention is preferably a storage medium for storing a computer program, wherein the computer program enables a computer to execute the method as described above.

[0016] (III) Beneficial effects The above technical solution of the present invention has the following beneficial technical effects: The present invention comprehensively considers the task requirements and processing frequencies of unauthenticated users, authenticators, and edge servers, and performs scheduling with the shortest processing time as the objective function, thereby ensuring efficient use of computing resources. This avoids the waste of computing 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 resources through the authenticator, thereby ensuring the smooth completion of their tasks. This helps to improve user satisfaction and trust. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] Figure 1 It is a flowchart of an embodiment of a computing power resource scheduling method based on edge computing of the present invention. DETAILED DESCRIPTION

[0018] In order to make the purpose, technical scheme and advantages of the present invention clearer, the present invention is further described in detail below in conjunction with specific embodiments and with reference to the accompanying drawings. It should be understood that these descriptions are only exemplary and are not intended to limit the scope of the present invention. In addition, in the following description, the description of well-known structures and technologies is omitted to avoid unnecessary confusion of the concept of the present invention.

[0019] Obviously, the described embodiments are only some embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

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

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

[0022] Embodiment 1 A computing resource scheduling method based on edge computing. In the edge computing system, based on the actual needs of data processing, a decision is made on whether to migrate user terminal data to the edge server for processing, thereby using the powerful computing power of the edge server to quickly complete the task. This can not only reduce the computing burden of the user terminal itself, but also effectively reduce the delay of task processing and improve the user experience.

[0023] The computing resource scheduling method of this embodiment is based on edge servers, authenticators and unauthenticators; the edge server provides services through hardware such as GPU, 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; The authenticator is connected to the edge server, and the unauthenticated user is connected to the authenticator; The unauthenticated person uses the computing resources of the edge server through the authenticator; Figure 1 FIG. 1 shows an overall flow chart of an embodiment of the present invention, as shown in FIG. Figure 1 As shown, the computing power resource scheduling method includes: Obtain the first task requirement and first processing frequency of the unauthenticated user: First, the task requirements of the unauthenticated user (such as a mobile phone) are collected, including the specific type of task (such as image processing, video analysis, natural language processing, etc.) and the required processing resources. At the same time, the system obtains the first processing frequency of the unauthenticated user, that is, the number of instructions that the unauthenticated user's local device can execute per second, which helps to evaluate its local processing capabilities.

[0024] Obtain the second task requirement and second processing frequency of the authenticator; for user terminals (such as computers) that have been authenticated by the edge server, the system will collect their second task requirements and second processing frequencies. This information also includes the task type and processing resource requirements, as well as the processing capabilities of the authenticator's device.

[0025] 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; 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; The scheduling includes a first scheduling and a second scheduling; 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.

[0026] 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.

[0027] 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.

[0028] Furthermore, in this embodiment, the objective function is expressed by the following formula: ; ; Where T represents the processing time, which is the larger of the processing time of the unauthenticated user, the authenticator, and the edge server. It is the variable to be optimized by the objective function and represents the longest time required to complete all task requirements. This time is the longest processing time among the unauthenticated user, the authenticator, and the edge server. T 1 It indicates the time it takes for an unauthenticated user to process a request, T 2 Indicates the time it takes for the authenticator to process the request, T 3 Indicates the time it takes for the edge server to process the request; T i represents the time it takes for the unauthenticated user to complete the i-th task requirement, n represents the number of task requirements processed by the unauthenticated user, T j represents the time it takes for the jth task requirement processed by the authenticator to be completed, m represents the number of task requirements processed by the authenticator, T rIt represents the time when the rth task demand processed by the edge server is completed, and s represents the number of task demands processed by the edge server.

[0029] Furthermore, in this embodiment, the time required to complete the processing of the i-th task processed by the unauthenticated user is expressed by the following formula: ; Among them, T i represents the time to complete the i-th task requirement processed by the unauthenticated user, D 1-e represents the task quantity of the e-th task requirement in the first task requirement, f 1 represents the first processing frequency, A 1 Indicates that unauthenticated persons handle the issue by themselves; V 1 Indicates the data transmission speed between the unauthenticated and authenticated parties, A 2 Indicates that the authenticated user returns the request to the unauthenticated user for processing. The task requirements processed by the unauthenticated user are all in the first task requirements. There are two situations for the unauthenticated user to process the first task requirements: one is direct processing, and the other is processing it by the authenticated user after the request is returned. The direct processing situation is A 1 , the case of processing after return is A 2 , A 2 In the case of , the time required for the task to be transmitted between the unauthenticated and authenticated parties must be added.

[0030] Furthermore, in this embodiment, the time required to complete the j-th task processed by the authenticator is expressed by the following formula: ; Among them, T j represents the time when the jth task requirement processed by the authenticator is completed, D 1-e represents the task volume of the e-th task requirement in the first task requirement, V 1 Indicates the data transmission speed between the unauthenticated party and the authenticated party, f 2 represents the second processing frequency, A represents the amount of data after processing the e-th task requirement in the first task requirement. 3 It means that the authenticated person helps the unauthenticated person to handle the problem; D 2-g represents the task amount of the gth task requirement in the second task requirement, f 2 represents the second processing frequency, B 1 Indicates that the authenticator handles the task by itself. The task handled by the authenticator includes part or all of the second task requirements and part of the first task requirements of the unauthenticated request. The content of the second task requirement handled by the authenticator is B 1 , the content of the first task requirement handled by the authenticator is A 3 , A 3In the case of , the task requirements and the time for transmitting the processing results between the unauthenticated and the authenticated party must be added.

[0031] Further, in this embodiment, the time for completing the processing of the rth task requirement processed by the edge server is expressed by the following formula: ; Among them, T r represents the time when the edge server completes the processing of the rth task requirement, D 1-e represents the task volume of the e-th task requirement in the first task requirement, V 1 Indicates the data transmission speed between the unauthenticated and authenticated parties. represents the amount of data processed by the e-th task requirement in the first task requirement, f 3 represents the third processing frequency, D 2-g represents the task amount of the gth task requirement in the second task requirement, represents the amount of data after processing the gth task requirement in the second task requirement, B 2 Indicates that the edge server helps the authenticator process; V 2 Indicates the data transmission speed between the authenticator and the edge server, A 4 Indicates that the edge server helps unauthenticated users. The edge server handles the first task requirement as A. 4 , the time needs to be added to the task requirements and the time for the transmission of the processing results. The edge server processes the second task requirement in B 2 ,The time needs to be added with the task requirements and the time for the transmission of processing results between the authenticator and the edge server.

[0032] Furthermore, in this embodiment, the data transmission speed between the unauthenticated person and the authenticated person is calculated using the following formula: ; Among them, V 1 Indicates the data transmission speed between the unauthenticated and authenticated parties, K 1 represents the network bandwidth between the unauthenticated and authenticated users, P 1 represents the power of task demand migration for unauthenticated users, h 1 represents the channel gain between the unauthenticated and authenticated parties, represents the white noise power between the unauthenticated and authenticated parties, D represents the data packet size required by the task, and L 1 Indicates the network delay between the unauthenticated party and the authenticated party.

[0033] Furthermore, in this embodiment, the data transmission speed between the authenticator and the edge server is calculated using the following formula: ; Among them, V 2 represents the data transmission speed between the authenticator and the edge server, K 2 represents the network bandwidth between the authenticator and the edge server, P 2 represents the power of the authenticator's task demand migration, h 2 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 required by the task, and L 2 Indicates the network delay between the authenticator and the edge server.

[0034] 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 limited. The network bandwidth can be tested through network management tools. Task migration power is directly affected by the complexity of the task and the resources required for data transmission, which can be obtained through experience. Channel gain reflects the change in signal strength during transmission. Channel gain can be obtained through wireless network analysis tools or through channels tested with known pilot signals. White noise power can be measured through signal processing tools. In actual engineering applications, if the frequency range in which the power spectrum density of noise is uniformly distributed is much larger than the working frequency band of the communication system, it can be regarded as white noise. Network packet capture tools such as Wireshark or libraries in programming languages ​​(such as Python's Scapy library) can be used to capture and analyze network packets to obtain the size of the packet. Network latency can be measured through the ping command or using the iperf tool. These tools can provide information about network latency.

[0035] Embodiment 2 A computing resource scheduling system based on edge computing. The computing resource scheduling system is based on edge servers, authenticated users and unauthenticated users; The authenticator is connected to the edge server, and the unauthenticated user is connected to the authenticator; The unauthenticated person uses the computing resources of the edge server through the authenticator; The computing resource scheduling system includes: A first acquisition module: acquiring a first task requirement and a first processing frequency of the unauthenticated person; A second acquisition module: acquiring a second task requirement and a second processing frequency of the authenticator; A third acquisition module: acquiring a third processing frequency of the edge server; Scheduling module: scheduling the first task requirement and the second task requirement according to the first processing frequency, the second processing frequency and the third processing frequency, taking the shortest processing time as the objective function; The scheduling includes a first scheduling and a second scheduling; The first scheduling includes scheduling self-processing and requesting authenticator processing of the first task requirement according to the first processing frequency; The second scheduling includes scheduling the self-processing, edge server processing, and returning of unauthenticated requests for the second task requirements and unauthenticated request processing according to the second processing frequency and the third processing frequency.

[0036] Embodiment 3 A device comprises a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the above method when executing the computer program.

[0037] Embodiment 4 A storage medium is used to store a computer program, wherein the computer program enables a computer to execute the method as described above.

[0038] It should be understood that the above specific embodiments of the present invention are only used to illustrate or explain the principles of the present invention, and do not constitute a limitation of the present invention. Therefore, any modifications, equivalent substitutions, improvements, etc. made without departing from the spirit and scope of the present invention should be included in 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 boundaries of the appended claims, or the equivalent forms of such scope and boundaries.

[0039] The present invention has been described above with reference to the embodiments of the present invention. However, these embodiments are for illustrative purposes only and are not intended to limit 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, a person skilled in the art may make various substitutions and modifications, which should all fall within the scope of the present invention.

[0040] Although the embodiments of the present invention have been described in detail, it should be understood that the various changes, substitutions, and alterations could be made hereto without departing from the spirit and scope of the invention.

[0041] Obviously, the above embodiments are merely examples for the purpose of clear explanation, and are not intended to limit the implementation methods. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the implementation methods here. The obvious changes or modifications derived therefrom are still within the scope of protection of the present invention.

Claims

1. A computing resource scheduling method based on edge computing, characterized in that: The computing resource scheduling method is based on edge servers, authenticated users and unauthenticated users; The authenticator is connected to the edge server, and the unauthenticated user is connected to the authenticator; The unauthenticated person uses the computing resources of the edge server through the authenticator; The computing resource scheduling method comprises: Acquire a first task requirement and a first processing frequency of the unauthenticated person; Acquire a second task requirement and a second processing frequency of the authenticator; Obtaining a third processing frequency of the edge server; 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; The scheduling includes a first scheduling and a second scheduling; The first scheduling includes scheduling self-processing and requesting authenticator processing of the first task requirement according to the first processing frequency; The second scheduling includes scheduling the self-processing, edge server processing, and returning of unauthenticated requests for the second task requirements and unauthenticated request processing according to the second processing frequency and the third processing frequency.

2. The computing resource scheduling method according to claim 1, characterized in that: The objective function is expressed using the following formula: ； ； Wherein, T represents the processing time, which is the larger of the processing time of the unauthenticated user, the authenticator and the edge server, T1 represents the processing time of the unauthenticated user, T2 represents the processing time of the authenticator, and T3 represents the processing time of the edge server; T i represents the time it takes for the unauthenticated user to complete the i-th task requirement, n represents the number of task requirements processed by the unauthenticated user, T j represents the time it takes for the jth task requirement processed by the authenticator to be completed, m represents the number of task requirements processed by the authenticator, T r It represents the time when the rth task demand processed by the edge server is completed, and s represents the number of task demands processed by the edge server.

3. The computing resource scheduling method according to claim 2, characterized in that: The time required to complete the i-th task processed by the unauthenticated user is expressed by the following formula: ； Among them, T i represents the time to complete the i-th task requirement processed by the unauthenticated user, D 1-e represents the task amount of the e-th task requirement in the first task requirement, f1 represents the first processing frequency, A1 represents the 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 the data to the unauthenticated person for processing.

4. The computing resource scheduling method according to claim 2, characterized in that: The time required to complete the jth task processed by the authenticator is expressed by the following formula: ； Among them, T j represents the time when the jth task requirement processed by the authenticator is completed, D 1-e represents the task amount 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 amount of data processed by the e-th task requirement in the first task requirement, A3 represents the authenticated user helping the unauthenticated user to process; D 2-g represents the task amount of the gth task requirement in the second task requirement, f2 represents the second processing frequency, and B1 represents the authenticator's self-processing.

5. The computing resource scheduling method according to claim 2, characterized in that: The time required to complete the processing of the rth task processed by the edge server is expressed by the following formula: ； Among them, T r represents the time when the edge server completes the processing of the rth task requirement, 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 and authenticated parties, represents the amount of data after processing the e-th task requirement in the first task requirement, f3 represents the third processing frequency, D 2-g represents the task amount of the gth task requirement in the second task requirement, It represents the amount of data after processing the gth 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 to process.

6. The computing resource scheduling method according to claim 4, characterized in that: The data transmission speed between the unauthenticated party and the authenticated party is calculated using the following formula: ； Among them, V1 represents the data transmission speed between the unauthenticated and the authenticated, K1 represents the network bandwidth between the unauthenticated and the authenticated, P1 represents the power of the unauthenticated task demand migration, h1 represents the channel gain between the unauthenticated and the authenticated, represents the white noise power between the unauthenticated and the authenticated, D represents the data packet size required by the task, and L1 represents the network delay between the unauthenticated and the authenticated.

7. The computing resource scheduling method according to claim 4, characterized in that: The data transmission speed between the authenticator and the edge server is calculated using 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 of the authenticator task demand migration, 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 required by the task, and L2 represents the network delay between the authenticator and the edge server.

8. A computing resource scheduling system based on edge computing, characterized in that: The computing resource scheduling system is based on edge servers, authenticated users and unauthenticated users; The authenticator is connected to the edge server, and the unauthenticated user is connected to the authenticator; The unauthenticated person uses the computing resources of the edge server through the authenticator; The computing resource scheduling system includes: A first acquisition module: acquiring a first task requirement and a first processing frequency of the unauthenticated person; A second acquisition module: acquiring a second task requirement and a second processing frequency of the authenticator; A third acquisition module: acquiring a third processing frequency of the edge server; Scheduling module: scheduling the first task requirement and the second task requirement according to the first processing frequency, the second processing frequency and the third processing frequency, taking the shortest processing time as the objective function; The scheduling includes a first scheduling and a second scheduling; The first scheduling includes scheduling self-processing and requesting authenticator processing of the first task requirement according to the first processing frequency; The second scheduling includes scheduling the self-processing, edge server processing, and returning of unauthenticated requests for the second task requirements and unauthenticated request processing according to the second processing frequency and the third processing frequency.

9. A device, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method according to any one of claims 1 to 7 when executing the computer program.

10. A storage medium, characterized in that: Used to store a computer program, wherein the computer program causes a computer to execute the method according to any one of claims 1 to 7.

Images