Edge computing power resource scheduling method and device and computer equipment

Abstract

The invention discloses an edge computing power resource scheduling method and device and computer equipment. The method comprises the following steps: generating a resource quantity of edge computing power resources and an offer matrix according to resource provider information, and generating a bidding matrix according to resource demander information, the resource demander information comprising resource demander bidding and distance parameters; the resource provider information at least comprises the amount of computing power resources which can be provided by the resource provider and the price of the resource provider, and the distance parameter is determined according to the transmission distance between the resource demander and the resource provider; a first transaction contract is generated according to the resource quantity, the price asking matrix and the bidding matrix, the transaction contract is used for representing a scheduling rule for scheduling the edge computing power resources from the resource provider to the resource demander, a second transaction contract is generated according to the default data, the second transaction contract is executed, and after the second transaction contract is executed, the edge computing power resources are demanded to the resource demander. And carrying out secondary allocation on the remaining resources.

Description

Technical Field

[0001] The present application relates to the technical field of edge computing, and in particular, to a method, device, and computer device for scheduling edge computing power resources. Background Art

[0002] In recent years, due to the rapid growth in the number of mobile devices, cloud computing, which is relatively far from mobile devices, cannot meet applications with strict requirements for latency or mobility, such as vehicle-mounted networks and radio access networks. To overcome these weaknesses in cloud computing, the EC (Edge Computing) paradigm can play an important role. In EC, the latency requirements of resource-consuming applications can vary significantly. Taking the intelligent transportation system as an example, real-time traffic information processing has obvious peak periods and requires strict low-latency guarantees. On the other hand, emergency events only require a short time to process and have accurate latency requirements. In the development of edge computing, effective resource management and pricing mechanisms are a major challenge, and the design of auction mechanisms, as an important tool to address this challenge, is often used in resource trading mechanisms to improve the benefits of both trading parties. However, in related technologies, the scheduling of edge computing resources requires real-time auction matching and pricing. Since the two parties of resource scheduling need to first perform auction matching and then perform resource scheduling, the latency of resource scheduling is very long and the resource utilization rate is low. Summary of the Invention

[0003] Embodiments of the present application provide a method, device, and computer device for scheduling edge computing power resources to at least solve the technical problem in related technologies that the resource scheduling latency is relatively long due to the need to first perform auction matching.

[0004] According to one aspect of the embodiments of the present application, an edge computing power resource scheduling method is provided, including: receiving resource demander information and resource provider information respectively, generating a resource quantity and a asking price matrix of edge computing power resources according to the resource provider information, and generating a bidding matrix according to the resource demander information, wherein the resource demander information includes: the resource demander's bid and a distance parameter, and the resource provider information at least includes the computing power resource quantity that the resource provider can provide and the resource provider's asking price, and the distance parameter is determined according to the transmission distance between the resource demander and the resource provider; generating a first transaction contract according to the resource quantity, the asking price matrix and the bidding matrix, wherein the transaction contract is used to represent the scheduling rule for the edge computing power resources to be scheduled by the resource provider to the resource demander, and the first transaction contract includes: the resource quantity to be traded, the unit price that the resource demander should pay, and the unit price that the resource provider should receive; receiving the default data of the resource demander and the resource provider, and generating a second transaction contract according to the default data, wherein the second transaction contract is obtained by modifying the first transaction contract based on the default data, and the default data is determined according to the difference between the contract content that the resource demander and the resource provider can actually execute and the content of the first transaction contract; executing the second transaction contract, and after the second transaction contract is executed, sending the remaining resource sharing platform to the sharing platform, and the sharing platform is used for secondary allocation of the remaining resources.

[0005] Optionally, matching to obtain the first transaction contract according to the resource quantity, the asking price matrix and the bidding matrix includes: traversing the resource demander list of the target resource provider, and obtaining the highest resource demander's bid of the resource demander from the resource demander list; obtaining the resource provider's asking price of the target resource provider from the resource quantity and the asking price matrix of the target resource provider; comparing the resource provider's bid of the target resource provider with the highest resource demander's bid, and when the comparison result indicates that the highest resource demander's bid is not less than the resource provider's bid of the target resource provider, and both the resource quantity that the target resource provider can provide and the resource quantity required by the resource demander corresponding to the highest resource demander's bid are not zero, determining that the target resource provider matches the resource demander corresponding to the highest resource demander's bid; when the target resource provider matches the resource demander corresponding to the highest resource demander's bid, determining to generate the first transaction contract between the target resource provider and the resource demander corresponding to the highest resource demander's bid.

[0006] Optionally, determining to sign the first transaction contract between the target resource provider and the resource demander corresponding to the highest resource demand bid includes: determining the resource demander corresponding to the highest resource demand bid as the target resource demander, and selecting the smaller resource quantity from the resource quantity that the target resource provider can provide and the resource quantity required by the target resource demander as the transaction quantity in the first transaction contract; determining the unit price to be paid by the target resource demander determined according to the resource demander bid in the first transaction contract; determining the unit price to be received by the target resource provider in the first transaction contract as the difference between the unit price to be paid by the target resource demander and the distance cost, where the distance cost is determined according to the distance parameter; generating the first transaction contract based on the transaction quantity, the unit price to be received by the target resource provider, the unit price to be paid by the target resource demander, the penalty to be paid by the resource demander in case of default, and the penalty to be paid by the resource provider in case of default.

[0007] Optionally, receiving the default data of the resource demander and the resource provider and generating a second transaction contract according to the default data includes: receiving the default data, where the default data includes: resource demander default data and resource provider default data, the resource demander default data is used to represent the difference between the actual resource quantity required by the resource demander and the transaction quantity in the first transaction contract, and the resource provider default data is used to represent the difference between the actual resource quantity that the resource provider can provide and the transaction quantity in the first transaction contract. Wherein, in the case that the resource quantity corresponding to the default data is greater than the preset threshold, the first transaction contract is regenerated; determining the penalty that the resource demander needs to pay to the platform and the resource provider and the penalty that the resource provider needs to pay to the platform and the resource demander based on the default data; determining the actual transaction quantity according to the default data; obtaining the unit price to be paid by the resource demander in the second transaction contract; determining the second transaction contract according to the actual transaction quantity, the penalty that the resource demander needs to pay to the platform and the resource provider, the penalty that the resource provider needs to pay to the platform and the resource demander, the unit price to be received by the target resource provider, and the unit price to be paid by the resource demander.

[0008] Optionally, determining the unit price to be paid by the target resource demander determined according to the resource demander bid in the first transaction contract includes: determining the average value of the resource demander bid and the asking price of the resource provider of the target resource provider as the futures trading price; determining the unit price to be paid by the target resource demander as the sum of the futures trading price and the distance cost.

[0009] Optionally, obtaining the unit price that the resource demander in the second transaction contract should pay includes: obtaining the unit price that all resource demanders of the target resource provider should pay; determining the unit price that the resource demander in the second transaction contract should pay according to the unit price that all resource demanders should pay.

[0010] Optionally, the method further includes: in the case where both the resource demander and the resource provider are in default, matching and offsetting the quantity of resources in default by both the resource demander and the resource provider in descending order of distance cost; after matching, in the case where the resource demander is still in default, determining the fines that the resource demander needs to pay to the platform and the resource provider according to the remaining default data of the resource demander and the default probability of the resource demander; after matching, in the case where the resource provider is still in default, determining the fines that the resource provider needs to pay to the platform and the resource demander according to the remaining default data of the resource provider and the default probability of the resource provider.

[0011] Optionally, after the second transaction contract is executed and the remaining resources are put into the sharing platform, the method further includes: receiving identity conversion information, which is determined by the resource demander and the resource provider according to their respective remaining resources and is used to convert the identities of the resource demander and the resource provider; after completing the identity conversion, selecting the resource demander with the highest bid from multiple resource demanders to conduct a transaction with the resource provider.

[0012] According to another aspect of the embodiments of the present application, an edge computing power resource scheduling device is further provided, including: a receiving module, configured to receive resource demander information and resource provider information respectively, generate a resource quantity and a asking price matrix of edge computing power resources according to the resource provider information, and generate a bidding matrix according to the resource demander information, where the resource demander information includes: a resource demander's bid and a distance parameter, and the resource provider information at least includes the computing power resources that the resource provider can provide and the resource provider's asking price, and the distance parameter is determined according to the transmission distance between the resource demander and the resource provider; a first generating module, configured to generate a first transaction contract according to the resource quantity, the asking price matrix and the bidding matrix, where the transaction contract is used to represent the scheduling rule for the edge computing power resources to be scheduled from the resource provider to the resource demander, and the first transaction contract includes: the resource quantity to be traded, the unit price that the resource demander should pay, and the unit price that the resource provider should receive; a second generating module, configured to receive the default data of the resource demander and the resource provider, and generate a second transaction contract according to the default data, where the second transaction contract is obtained by modifying the first transaction contract based on the default data, and the default data is determined according to the difference between the contract content that the resource demander and the resource provider can actually execute and the content of the first transaction contract; an execution module, configured to execute the second transaction contract, and after the execution of the second transaction contract is completed, send the remaining resource sharing platform to the sharing platform, and the sharing platform is used for secondary allocation of the remaining resources.

[0013] According to yet another aspect of the embodiments of the present application, a computer device is further provided, including: a memory and a processor, where the memory is used to store program instructions; the processor is connected to the memory and is configured to execute the above-mentioned edge computing power resource scheduling method.

[0014] According to still another aspect of the embodiments of the present application, a non-volatile storage medium is further provided, and the non-volatile storage medium includes a stored computer program, where the device where the non-volatile storage medium is located executes the above-mentioned edge computing power resource scheduling method by running the computer program.

[0015] According to still another aspect of the embodiments of the present application, a computer program product is further provided, including computer instructions, and when the computer instructions are executed by a processor, the above-mentioned edge computing power resource scheduling method is implemented.

[0016] In the embodiments of the present application, by separately receiving resource demander information and resource provider information, generating a resource quantity and a asking price matrix of edge computing power resources according to the resource provider information, and generating a bidding matrix according to the resource demander information, wherein the resource demander information includes: the resource demander's bid and a distance parameter, and the resource provider information at least includes the computing power resources that the resource provider can provide and the resource provider's asking price, and the distance parameter is determined according to the transmission distance between the resource demander and the resource provider; generating a first transaction contract according to the resource quantity, the asking price matrix and the bidding matrix, wherein the transaction contract is used to represent the scheduling rule for the edge computing power resources to be scheduled by the resource provider to the resource demander, and the first transaction contract includes: the resource quantity to be traded, the unit price that the resource demander should pay, and the unit price that the resource provider should receive; receiving the default data of the resource demander and the resource provider, and generating a second transaction contract according to the default data, wherein the second transaction contract is obtained by modifying the first transaction contract based on the default data, and the default data is determined according to the difference between the contract content that the resource demander and the resource provider can actually execute and the content of the first transaction contract; executing the second transaction contract, and after the execution of the second transaction contract is completed, sending the remaining resource sharing platform to the sharing platform, and the sharing platform is used for secondary allocation of the remaining resources, so as to achieve the purpose that the edge computing server formulates a first transaction contract in advance according to its own resource demand status, and then performs resource scheduling according to the second transaction contract reflecting its actual situation before the formal scheduling, thereby achieving the technical effect of pre-auction matching and shortening the resource scheduling delay, and further solving the technical problem in the related art that the resource scheduling delay is relatively long due to the need to perform auction matching first. Description of the Drawings

[0017] The drawings described herein are used to provide a further understanding of the present application, and constitute a part of the present application. The illustrative embodiments and descriptions thereof of the present application are used to explain the present application, and do not constitute an improper limitation of the present application. In the drawings:

[0018] Figure 1 is a hardware structure block diagram of a computer terminal for implementing a method for scheduling edge computing power resources according to an embodiment of the present application;

[0019] Figure 2 is a flowchart of a method for scheduling edge computing power resources according to an embodiment of the present application;

[0020] Figure 3 is a schematic diagram of the scheduling of computing power resources of an edge computing server according to an embodiment of the present application;

[0021] Figure 4It is a flowchart for determining an edge computing power resource scheduling rule according to an embodiment of the present application;

[0022] Figure 5 It is a flowchart for the on-site scheduling stage of edge computing power according to an embodiment of the present application;

[0023] Figure 6 It is a structural diagram of an edge computing power resource scheduling device according to an embodiment of the present application. Detailed implementation manners

[0024] In order to enable those skilled in the art to better understand the solution of the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application.

[0025] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and do not have to be used to describe a specific order or sequence. It should be understood that such data can be interchanged under appropriate circumstances so that the embodiments of the present application described here can be implemented in an order other than those illustrated or described here. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device including a series of steps or units does not have to be limited to those steps or units clearly listed, but may include other steps or units not clearly listed or inherent to these processes, methods, products or devices.

[0026] The information collected in the embodiments of the present application is information and data authorized by the user or fully authorized by all parties, and the collection, storage, use, processing, transmission, provision, disclosure and application of relevant data, etc., all comply with the relevant laws, regulations and standards of the relevant regions, take necessary confidentiality measures, do not violate public order and good customs, and provide corresponding operation entrances for users to choose to authorize or reject the results of automated decision-making; if the user chooses to reject, the expert decision-making process will be entered.

[0027] To solve the problems existing in the related art, an embodiment of the present application provides an edge computing power resource scheduling method, which can run on Figure 1 the computer terminal shown below, and the following is an explanation of the computer terminal.

[0028] The embodiment of the edge computing power resource scheduling method provided by the embodiment of the present application can be executed on a mobile terminal, a computer terminal or a similar computing device.Figure 1 The figure shows a hardware block diagram of a computer terminal for implementing an edge computing power resource scheduling method. As Figure 1 shown, the computer terminal 10 may include one or more processors (the processors may include, but are not limited to, processing devices such as a microprocessor MCU or a programmable logic device FPGA, shown as 102a, 102b, ……, 102n in the figure), a memory 104 for storing data, and a transmission module 106 for communication functions connected by wired and / or wireless networks. In addition, it may further include: a display, a keyboard, a cursor control device, an input / output interface (I / O interface), a universal serial bus (USB) port (which may be included as one of the ports of the I / O interface), a network interface, and a BUS bus. Those of ordinary skill in the art can understand that Figure 1 the structure shown is only schematic and does not limit the structure of the above-mentioned electronic device. For example, the computer terminal 10 may further include more or fewer components than Figure 1 shown in the figure, or have a different configuration from Figure 1 shown in the figure.

[0029] It should be noted that the above one or more processors and / or other data processing circuits are generally referred to as "data processing circuits" in this article. The data processing circuit may be embodied in software, hardware, firmware, or any combination thereof, in whole or in part. In addition, the data processing circuit may be a single independent processing module, or be incorporated in whole or in part into any one of the other elements in the computer terminal 10. As involved in the embodiments of the present application, the data processing circuit is a kind of processor control (such as the selection of a variable resistance terminal path connected to an interface).

[0030] The memory 104 can be used to store software programs and modules of application software, such as the program instructions / data storage device corresponding to the edge computing power resource scheduling method in the embodiments of the present application. The processor executes various functional applications and data processing by running the software programs and modules stored in the memory 104, that is, implements the above-mentioned edge computing power resource scheduling method. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memories. In some instances, the memory 104 may further include a memory remotely located relative to the processor, and these remote memories can be connected to the computer terminal 10 through a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an enterprise intranet, a local area network, a mobile communication network, and combinations thereof.

[0031] The transmission module 106 is used to receive or send data via a network. Specific examples of the above-mentioned network may include a wireless network provided by the communication provider of the computer terminal 10. In one example, the transmission module 106 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission module 106 can be a Radio Frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0032] The display can be, for example, a touch-screen liquid crystal display (LCD), which enables the user to interact with the user interface of the computer terminal 10.

[0033] It should be noted here that in some alternative embodiments, the above Figure 1 illustrated computer terminal may include hardware elements (including circuits), software elements (including computer code stored on a computer-readable medium), or a combination of both hardware elements and software elements. It should be pointed out that Figure 1 is only an example of a specific specific instance and is intended to illustrate the types of components that may exist in the above computer terminal.

[0034] Under the above operating environment, an embodiment of an edge computing power resource scheduling method is provided in an embodiment of the present application. It should be noted that the steps illustrated in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions, and although the logical order is illustrated in the flowchart, in some cases, the steps shown or described can be executed in a different order than here.

[0035] Figure 2 is a flowchart of an edge computing power resource scheduling method according to an embodiment of the present application. As Figure 2 shown, the method includes the following steps:

[0036] Step S202, respectively receive resource demander information and resource provider information, generate a resource quantity and asking price matrix of edge computing power resources according to the resource provider information, and generate a bidding matrix according to the resource demander information, wherein the resource demander information includes: the resource demander's bid and distance parameter, and the resource provider information at least includes the computing power resources that the resource provider can provide and the resource provider's asking price, and the distance parameter is determined according to the transmission distance between the resource demander and the resource provider;

[0037] In step S202, within the target area where the edge computing servers are deployed, there are multiple edge computing servers ES = {ES1, ES2,..., ES ID}, where each edge computing server has its own fixed number. In the first stage, the edge computing server determines its role as a computing power resource demander or a computing power resource provider according to its historical resource usage. Let represent the set of resource demanders. Each is represented by a six-tuple where BID n represents the fixed number of each resource demander ES. represents the role of the current edge computing server. When the n with the number BID (the edge computing server with the number BID n ) is a resource demander, is a multi-tuple, where represents the predicted computing power resource demand, represents the inherent computing power resources of the edge computing server itself, represents the number of resources required for actual on-site transactions. bid′ n represents the unit price bid by the resource demander for the purchased resources. ω n is the distance parameter, representing the data transmission cost per unit distance. represents the default rate of this ES in past historical transactions. Let represent the set of resource providers. Each is composed of a five-tuple where SID m represents the fixed number of each ES. represents the current role. When the ES with the number SID m is a resource provider, SIDm is a multi-tuple, where represents the predicted computing power resource supply of itself, represents its own inherent resources, represents the number of resources required to cover users during actual transactions. Since the resource types are different, typical resource combinations include CPU, GPU, and RAM. For the auction of specific resources, it is more or less the same. For the convenience of explanation, GPU is taken as an example for illustration. ask m represents the asking unit price for its own resources. represents the default rate of this ES in past historical transactions. Among them, b n represents an individual resource demander, and s m represents an individual resource provider.

[0038] Specifically, the asking price matrix can be determined in the following way:

[0039] The ES that becomes the resource provider will provide its own SID to the platform m , the amount of computing power resources that can be provided and the unit price asking price ask m , to generate a resource quantity and asking price matrix A:

[0040]

[0041] At the same time, the resource demander provides its own bid n and the distance parameter ω n , and the platform stores the map of the entire trading environment and the distance information between edge servers. Assuming the channel quality is the same, it is only related to the transmission distance and the hardware conditions of the ES itself (represented by a positive correlation function).

[0042] bid n,m = bid′ n - ω n dis n,m

[0043] In the formula, bid n,m represents the bid that the resource demander n can give to the resource provider m after removing the transmission cost, bid′ n represents the bid unit price of the resource demander n, ω n represents the distance parameter (the transmission cost per unit distance and per unit data when the resource demander n uploads data), dis n,m represents the distance between the resource demander n and the resource provider m.

[0044] It should be noted that the price that the resource provider can finally obtain is the bid of the resource demander minus the distance cost.

[0045] dis n,m = Dis(SID m , BID n )

[0046] In the formula, Dis(SID m , BID n ) is the distance between the edge computing server with the fixed number SID m and the edge computing server with the fixed number BID n .

[0047] Generate a bid matrix based on the original bid of the resource demander:

[0048]

[0049] After adding the distance weight, the resource bid matrix of each resource demander for different resource providers is as follows:

[0050]

[0051]

[0052] In the formula, B n represents the bid matrix of resource demander n for all resource providers after removing the transmission cost, and B represents the bid matrix that all resource demanders can give to all resource providers.

[0053] Step S204: Generate a first transaction contract based on the resource quantity, asking price matrix, and bid matrix. The transaction contract is used to represent the scheduling rule for the edge computing resources to be scheduled from the resource provider to the resource demander. The first transaction contract includes: the quantity of resources to be traded, the unit price that the resource demander should pay, and the unit price that the resource provider should receive;

[0054] Step S206: Receive the default data of the resource demander and the resource provider, and generate a second transaction contract based on the default data. The second transaction contract is obtained by modifying the first transaction contract based on the default data. The default data is determined according to the difference between the contract content that the resource demander and the resource provider can actually execute and the content of the first transaction contract;

[0055] Step S208: Execute the second transaction contract. After the second transaction contract is executed, send the remaining resource sharing platform to the sharing platform, and the sharing platform is used for secondary allocation of the remaining resources.

[0056] Through the above steps S202 to S208, by respectively receiving the information of the resource demand side and the resource supply side, generating the resource quantity and asking price matrix of the edge computing resources according to the information of the resource supply side, and generating the bidding matrix according to the information of the resource demand side, wherein the information of the resource demand side includes: the bid of the resource demand side and the distance parameter, and the information of the resource supply side at least includes the computing resource quantity that the resource supply side can provide and the asking price of the resource supply side, and the distance parameter is determined according to the transmission distance between the resource demand side and the resource supply side; generating a first transaction contract according to the resource quantity, the asking price matrix and the bidding matrix, wherein the transaction contract is used to represent the scheduling rule for the edge computing resources to be scheduled by the resource supply side to the resource demand side, and the first transaction contract includes: the resource quantity to be traded, the unit price that the resource demand side should pay, and the unit price that the resource supply side should receive; receiving the default data of the resource demand side and the resource supply side, and generating a second transaction contract according to the default data, wherein the second transaction contract is obtained by modifying the first transaction contract based on the default data, and the default data is determined according to the difference between the contract content that the resource demand side and the resource supply side can actually execute and the content of the first transaction contract; executing the second transaction contract, and after the execution of the second transaction contract is completed, sending the remaining resource sharing platform to the sharing platform, and the sharing platform is used for the secondary allocation of the remaining resources, so as to achieve the purpose that the edge computing server formulates the first transaction contract in advance according to its own resource demand status, and then performs resource scheduling according to the second transaction contract reflecting its actual situation before the formal scheduling, thereby realizing the technical effect of pre-auction matching and shortening the resource scheduling delay, and further solving the technical problem of long resource scheduling delay in the related technology due to the need to perform auction matching first. The following is a detailed description.

[0057] Figure 3 Shows a specific application scenario of the present application, such as Figure 3 As shown, the resource scheduling method provided by the present application is applied to resource scheduling among multiple edge computing servers.

[0058] Figure 4 Shows another resource scheduling method, such as Figure 4 As shown, the asking price and the bidding price are matched according to different identities, and a contract is generated according to the matching result. During on-site scheduling, it is adjusted according to the resource quantity provided by the actual demand, and finally the scheduling is completed.

[0059] In some embodiments of the present application, the specific steps for obtaining the first transaction contract according to the resource quantity, asking price matrix, and bidding matrix are as follows: Traverse the list of resource demanders of the target resource provider, and obtain the highest bid of the resource demander from the list of resource demanders; obtain the asking price of the resource provider of the target resource provider from the resource quantity and asking price matrix of the target resource provider; compare the asking price of the resource provider of the target resource provider with the highest bid of the resource demander. When the comparison result indicates that the highest bid of the resource demander is not less than the asking price of the resource provider of the target resource provider, and the resource quantity that the target resource provider can provide and the resource quantity required by the resource demander corresponding to the highest bid of the resource demander are both non-zero, determine that the target resource provider matches the resource demander corresponding to the highest bid of the resource demander; when the target resource provider matches the resource demander corresponding to the highest bid of the resource demander, determine to generate the first transaction contract between the target resource provider and the resource demander corresponding to the highest bid of the resource demander.

[0060] It should be noted that the platform sorts the asking prices and bids of resource providers and resource demanders and then matches them. Moreover, the two parties do not match one-to-one. A resource demander can trade with multiple resource providers, and a resource provider can also trade with multiple resource demanders. Finally, a matching matrix is output.

[0061] The specific matching process is as follows: Arrange the resource providers in descending order of asking price. For each resource provider m (from 1 to |S|, that is, the total number of resource providers), taking the target resource provider as an example, find the highest bid that can be given to the target resource provider in the bidding matrix of resource demanders, and compare the asking price of the resource provider of the target resource provider with the highest bid of the resource demander. When the comparison result indicates that the highest bid of the resource demander is not less than the asking price of the resource provider of the target resource provider, and the resource quantity that the target resource provider can provide and the resource quantity required by the resource demander corresponding to the highest bid of the resource demander are both non-zero, determine to generate the first transaction contract between the target resource provider and the resource demander corresponding to the highest bid of the resource demander.

[0062] The matching method for each resource demander n (from 1 to |B|, that is, the total number of resource demanders) is similar to that of resource providers and will not be elaborated here.

[0063] In some embodiments of the present application, after determining the matching of both parties, it is determined that the target resource provider and the resource demander corresponding to the highest bid of the highest resource demander sign the first transaction contract. The specific steps are as follows: The resource demander corresponding to the highest bid of the highest resource demander is determined as the target resource demander, and the smaller resource quantity is selected from the resource quantity that the target resource provider can provide and the resource quantity required by the target resource demander to be determined as the transaction quantity in the first transaction contract; The unit price that the target resource demander should pay in the first transaction contract is determined according to the bid of the resource demander; The difference between the unit price that the target resource demander should pay and the distance cost is used to determine the unit price that the target resource provider should receive in the first transaction contract, and the distance cost is determined according to the distance parameter; The first transaction contract is generated based on the transaction quantity, the unit price that the target resource provider should receive, the unit price that the target resource demander should pay, the penalty that the resource demander needs to pay for breach of contract, and the penalty that the resource provider needs to pay for breach of contract.

[0064] The first transaction contract can be expressed by the following formula:

[0065]

[0066] Wherein,

[0067]

[0068] SID m ,BID n respectively represent the fixed numbers of the resource provider and the resource demander, represents the resource quantity of normal transactions in the first transaction contract, represents the unit prices that both parties should pay and receive in the pre-signed contract, respectively represent the penalties that the resource demander / resource provider needs to pay to the other party in case of breach of contract, trans n,m represents the distance cost, trans n,m =ω n dis n,m .

[0069] The constraint conditions of the transaction contract are as follows: The total transaction volume of each resource provider cannot exceed its supply volume, and the total transaction volume of each resource demander cannot exceed its demand volume; The transaction volume is non-negative; The quantity of breach of contract is less than the original transaction volume.

[0070] In some embodiments of the present application, the second transaction contract may be determined in the following manner: receiving the default data of the resource demander and the resource provider, and generating a second transaction contract based on the default data: receiving default data, where the default data includes: resource demander default data and resource provider default data. The resource demander default data is used to represent the difference between the actual amount of resources required by the resource demander and the transaction amount in the first transaction contract. The resource provider default data is used to represent the difference between the actual amount of resources that the resource provider can provide and the transaction amount in the first transaction contract. Wherein, when the amount of resources corresponding to the default data is greater than a preset threshold, the first transaction contract is regenerated; determining the fines that the resource demander needs to pay to the platform and the resource provider and the fines that the resource provider needs to pay to the platform and the resource demander based on the default data; determining the actual transaction amount according to the default data; obtaining the unit price that the resource demander should pay in the second transaction contract; determining the second transaction contract according to the actual transaction amount, the fines that the resource demander needs to pay to the platform and the resource provider, the fines that the resource provider needs to pay to the platform and the resource demander, the unit price that the target resource provider should receive, and the unit price that the resource demander should pay.

[0071] Specifically, before determining the second transaction contract, the resource demander and the resource provider respectively submit their default decisions to the platform according to their actual needs, where the resource demander default data is BQ.

[0072]

[0073] In the formula, represents the amount of resources for which the resource demander needs to default.

[0074] When the resource demander cannot execute the purchased resource quantity as agreed in the first transaction contract, as shown in the following formula:

[0075]

[0076] In the formula, represents the inherent amount of resources of the resource demander, represents the actual amount of resources required.

[0077] At this time,

[0078] And

[0079] Similarly, the resource provider's default data SQ is as shown in the following formula:

[0080]

[0081] In the formula, represents the number of computing power resources that the resource demander s m needs to default on.

[0082] When

[0083]

[0084] the remaining resources of the resource provider are not enough to provide for itself and cannot provide computing power resources to all its resource demanders as agreed, where represents the inherent computing power resource quantity of the resource provider itself, represents the resource quantity required in actual transactions. At this time,

[0085]

[0086] and

[0087]

[0088] both parties need to pay fines for their default behaviors at this time.

[0089] The second transaction contract can be determined by the following formula:

[0090]

[0091] In the formula, represents the computing power resources actually traded by both parties on-site, respectively represent the unit price that the resource provider will receive and the unit price that the resource demander will pay, and are paid according to payment. respectively represent the fines charged by the platform to the resource demander and the fines that need to be paid to the resource demander, then respectively represent the fines charged by the platform to the resource provider and the fines that need to be paid to the resource provider.

[0092] In some embodiments of the present application, the method for determining the unit price to be paid by the target resource demander in the first transaction contract according to the bid of the resource demander is as follows: determining the average value of the bid of the resource demander and the asking price of the resource provider of the target resource provider as the futures trading price; and determining the sum of the futures trading price and the distance cost as the unit price to be paid by the target resource demander.

[0093] In addition, the method for determining the unit price to be paid by the resource demander in the second transaction contract is as follows: Obtain the unit prices to be paid by all resource demanders of the target resource provider; determine the unit price to be paid by the resource demander in the second transaction contract based on the unit prices to be paid by all resource demanders.

[0094] Specifically, the method for determining the unit price to be paid by the target resource demander in the first transaction contract is as follows:

[0095] In the first transaction contract, the unit price of the resources of resource demander n that resource provider m can receive from the platform in the first-round pricing:

[0096]

[0097] In the formula, ask′ n,m represents the cost of the resource provider (the minimum asking price of the resource provider), and bid′ n,m represents the revenue of the resource demander (the maximum bid price of the resource demander).

[0098] In the first transaction contract, the price that resource demander n needs to pay to resource provider m in the first-round pricing is:

[0099]

[0100] Then determine the final unit price of the resource provider: For each resource provider m, traverse all resource demanders again and select the maximum value among the unit prices paid by all resource demanders to resource provider m

[0101] Determine the final unit price of the resource demander: Similarly, for each resource demander n, traverse all resource providers S again and select the maximum value among the unit prices asked by all resource providers from resource demander n

[0102] As Figure 5 shown, in the case where both the resource demander and the resource provider are in default, match and offset the number of resources in default of both the resource demander and the resource provider in descending order of distance from the cost; after matching, in the case where the resource demander is still in default, determine the fines that the resource demander needs to pay to the platform and the resource provider based on the remaining default data of the resource demander and the default probability of the resource demander; after matching, in the case where the resource provider is still in default, determine the fines that the resource provider needs to pay to the platform and the resource demander based on the remaining default data of the resource provider and the default probability of the resource provider.

[0103] In addition, when the default situations of both parties reach a certain threshold, as shown in the following formula:

[0104]

[0105] When the time comes, the platform updates the contract.

[0106] In the formula, represents the quantity of resources for which the resource provider m chooses to default during the on-site transaction phase, represents the quantity of resources for which the resource demander n chooses to default during the on-site transaction phase, and ξ represents a preset threshold.

[0107] Specifically, first, the defaults that exist in both are matched according to the transmission cost from high to low. After the first-round matching is selected, the resource demanders that still need to default make default choices. In this case, all the defaults of its corresponding resource providers have been offset, and the fine that the resource demander needs to pay is the final default quantity this time. Defaults are selected according to the transmission cost from high to low, and the default quantity is recorded.

[0108] After the execution of the second transaction contract, when the remaining resources are put into the sharing platform, it includes: receiving identity conversion information, which is determined by the resource demander and the resource provider according to their respective remaining resources and is used to convert the identities of the resource demander and the resource provider; after the identity conversion is completed, the resource demander with the highest bid is selected from multiple resource demanders to conduct transactions with the resource provider.

[0109] Specifically, when it means that the inherent resources of this resource demander are sufficient to provide its own resource requirements. At this time, during the determination stage, all the resources purchased by this resource demander default and it has remaining resources itself, that is, Therefore, after is executed, this ES can re-invest its idle resources in the market to reduce fine losses or increase revenues.

[0110] When it means that the inherent resources of this resource provider are insufficient to provide its own resource requirements. At this time, during the determination stage, all the resources sold by this resource provider default and it still needs more resources to support the original task requirements. Therefore, after is executed, this ES can re-submit its resource requirements.

[0111] Figure 6 is an edge computing power resource scheduling device according to an embodiment of the present application. This device includes:

[0112] A receiving module 70, configured to receive information of a resource requester and information of a resource provider respectively, generate a resource quantity and a asking price matrix of edge computing power resources according to the information of the resource provider, and generate a bidding matrix according to the information of the resource requester, where the information of the resource requester includes: a resource requester's bid and a distance parameter, and the information of the resource provider at least includes the computing power resource quantity that the resource provider can provide and the resource provider's asking price, and the distance parameter is determined according to the transmission distance between the resource requester and the resource provider;

[0113] A first generating module 72, configured to generate a first transaction contract according to the resource quantity, the asking price matrix and the bidding matrix, where the transaction contract is used to represent a scheduling rule for the edge computing power resources to be scheduled from the resource provider to the resource requester, and the first transaction contract includes: the resource quantity to be traded, the unit price that the resource requester should pay, and the unit price that the resource provider should receive;

[0114] A second generating module 74, configured to receive default data of the resource requester and the resource provider, and generate a second transaction contract according to the default data, where the second transaction contract is obtained by modifying the first transaction contract based on the default data, and the default data is determined according to the difference between the contract content that the resource requester and the resource provider can actually execute and the content of the first transaction contract;

[0115] An execution module 76, configured to execute the second transaction contract, and after the execution of the second transaction contract is completed, send the remaining resource sharing platform to the sharing platform, and the sharing platform is used for secondary allocation of the remaining resources.

[0116] Through the above-mentioned edge computing power resource scheduling device, by separately receiving the information of the resource demand side and the resource supply side, generating a resource quantity and an asking price matrix of the edge computing power resources according to the information of the resource supply side, and generating a bidding matrix according to the information of the resource demand side, wherein the information of the resource demand side includes: the bid of the resource demand side and a distance parameter, and the information of the resource supply side at least includes the computing power resource quantity that the resource supply side can provide and the asking price of the resource supply side, and the distance parameter is determined according to the transmission distance between the resource demand side and the resource supply side; generating a first transaction contract according to the resource quantity, the asking price matrix and the bidding matrix, wherein the transaction contract is used to represent the scheduling rule for the edge computing power resources to be scheduled by the resource supply side to the resource demand side, and the first transaction contract includes: the resource quantity to be traded, the unit price that the resource demand side should pay, and the unit price that the resource supply side should receive; receiving the default data of the resource demand side and the resource supply side, and generating a second transaction contract according to the default data, wherein the second transaction contract is obtained by modifying the first transaction contract based on the default data, and the default data is determined according to the difference between the contract content that the resource demand side and the resource supply side can actually execute and the content of the first transaction contract; executing the second transaction contract, and after the execution of the second transaction contract is completed, sending the remaining resource sharing platform to the sharing platform, and the sharing platform is used for the secondary allocation of the remaining resources, so as to achieve the purpose that the edge computing server formulates the first transaction contract in advance according to its own resource demand status, and then performs resource scheduling according to the second transaction contract reflecting its actual situation before the formal scheduling, thus realizing the technical effect of pre-auction matching and then shortening the resource scheduling delay, and further solving the technical problem that the resource scheduling delay is relatively long in the related technology due to the need to perform auction matching first.

[0117] The first generation module 72 includes: a matching sub-module, configured to obtain a first transaction contract according to the resource quantity, asking price matrix and bidding matrix, including: traversing the resource demander list of the target resource provider, and obtaining the highest resource demander bid from the resource demander list; obtaining the resource provider asking price of the target resource provider from the resource quantity and asking price matrix of the target resource provider; comparing the resource provider bid of the target resource provider with the highest resource demander bid, and when the comparison result indicates that the highest resource demander bid is not less than the resource provider bid of the target resource provider, and the resource quantity that the target resource provider can provide and the resource quantity required by the resource demander corresponding to the highest resource demander bid are both non-zero, determining that the target resource provider matches the resource demander corresponding to the highest resource demander bid; when the target resource provider matches the resource demander corresponding to the highest resource demander bid, determining to generate the first transaction contract between the target resource provider and the resource demander corresponding to the highest resource demander bid.

[0118] The matching sub-module includes: a generating unit, configured to determine that the target resource provider and the resource demander corresponding to the highest resource demander bid sign the first transaction contract, including: determining the resource demander corresponding to the highest resource demander bid as the target resource demander, and selecting the smaller resource quantity from the resource quantity that the target resource provider can provide and the resource quantity required by the target resource demander as the transaction quantity in the first transaction contract; determining the unit price that the target resource demander in the first transaction contract should pay according to the resource demander bid; determining the unit price that the target resource provider in the first transaction contract should receive by taking the difference between the unit price that the target resource demander should pay and the distance cost, where the distance cost is determined according to the distance parameter; generating the first transaction contract based on the transaction quantity, the unit price that the target resource provider should receive, the unit price that the target resource demander should pay, the penalty that the resource demander needs to pay for breach of contract, and the penalty that the resource provider needs to pay for breach of contract.

[0119] The second generation module 74 includes: a generation sub-module, configured to receive the default data of the resource demander and the resource provider, and generate a second transaction contract according to the default data, including: receiving default data, where the default data includes: resource demander default data and resource provider default data, the resource demander default data is used to represent the difference between the actual amount of resources required by the resource demander and the transaction amount in the first transaction contract, and the resource provider default data is used to represent the difference between the actual amount of resources that the resource provider can provide and the transaction amount in the first transaction contract. Wherein, when the amount of resources corresponding to the default data is greater than a preset threshold, the first transaction contract is regenerated; determining the fines that the resource demander needs to pay to the platform and the resource provider and the fines that the resource provider needs to pay to the platform and the resource demander based on the default data; determining the actual transaction amount according to the default data; obtaining the unit price that the resource demander in the second transaction contract should pay; determining the second transaction contract according to the actual transaction amount, the fines that the resource demander needs to pay to the platform and the resource provider, the fines that the resource provider needs to pay to the platform and the resource demander, the unit price that the target resource provider should receive, and the unit price that the resource demander should pay.

[0120] The generation unit includes: a pricing sub-unit, configured to determine the unit price that the target resource demander in the first transaction contract should pay according to the bid of the resource demander, including: determining the average value of the bid of the resource demander and the asking price of the resource provider of the target resource provider as the futures trading price; determining the sum of the futures trading price and the distance cost as the unit price that the target resource demander should pay.

[0121] The generation sub-module includes: a pricing unit and a default unit. The pricing unit is configured to obtain the unit price that the resource demander in the second transaction contract should pay, including: obtaining the unit prices that all resource demanders of the target resource provider should pay; determining the unit price that the resource demander in the second transaction contract should pay according to the unit prices that all resource demanders should pay.

[0122] Default unit, which is used to match and offset the quantity of resources defaulted by both the resource demander and the resource provider in descending order of distance cost when both the resource demander and the resource provider default; after matching, when the resource demander still defaults, determine the fines that the resource demander needs to pay to the platform and the resource provider according to the remaining default data of the resource demander and the default probability of the resource demander; after matching, when the resource provider still defaults, determine the fines that the resource provider needs to pay to the platform and the resource demander according to the remaining default data of the resource provider and the default probability of the resource provider.

[0123] The execution module 76 includes: a conversion sub-module, which is used to, after the execution of the second transaction contract is completed, put the remaining resources into the sharing platform and then receive identity conversion information, where the identity conversion information is determined by the resource demander and the resource provider according to their respective remaining resources and is used to convert the identities of the resource demander and the resource provider; after the identity conversion is completed, select the resource demander with the highest bid from multiple resource demanders to conduct transactions with the resource provider.

[0124] It should be noted that Figure 6 The edge computing power resource scheduling device shown is used to execute Figure 2 The edge computing power resource scheduling method shown, so the relevant explanations in the above edge computing power resource scheduling method also apply to this edge computing power resource scheduling device and will not be elaborated here.

[0125] The embodiment of the present application also provides a computer device, including: a memory and a processor, where the memory is used to store program instructions; the processor is connected to the memory and is used to execute the above edge computing power resource scheduling method.

[0126] The embodiment of the present application also provides a non-volatile storage medium, which includes a stored computer program, where the device where the non-volatile storage medium is located executes the above edge computing power resource scheduling method by running the computer program.

[0127] The embodiment of the present application also provides a computer program product, including computer instructions, where when the computer instructions are executed by a processor, the steps of the edge computing power resource scheduling method in the present application are implemented.

[0128] The serial numbers of the above embodiments of the present application are only for description and do not represent the advantages or disadvantages of the embodiments.

[0129] In the above embodiments of the present application, the descriptions of each embodiment have their own emphases. For parts not detailed in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0130] In several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are merely illustrative. For example, the division of units can be a logical function division. In actual implementation, there can be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed couplings or direct couplings or communication connections to each other can be through some interfaces. The indirect couplings or communication connections of units or modules can be in electrical or other forms.

[0131] The units described as separate components may or may not be physically separated. The components displayed as units may or may not be physical units, that is, they can be located in one place or distributed to multiple units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0132] In addition, in each embodiment of this application, each functional unit can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

[0133] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to enable a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods in each embodiment of this application. The aforementioned storage medium includes: USB flash drives, read-only memories (ROMs), random access memories (RAMs), mobile hard disks, magnetic disks, or optical discs and other various media that can store program codes.

[0134] The above is only the preferred embodiment of this application. It should be noted that for those of ordinary skill in the art, without departing from the principle of this application, several improvements and refinements can still be made, and these improvements and refinements should also be regarded as the protection scope of this application.

Claims

1. A method for scheduling edge computing power resources, characterized in that, Including: Receiving the information of the resource demander and the resource provider respectively, generating the resource quantity and asking price matrix of the edge computing power resources according to the information of the resource provider, and generating the bidding matrix according to the information of the resource demander, wherein the information of the resource demander includes: the bid of the resource demander and the distance parameter, and the information of the resource provider includes at least the computing power resource quantity that the resource provider can provide and the asking price of the resource provider, and the distance parameter is determined according to the transmission distance between the resource demander and the resource provider; Generating a first transaction contract according to the resource quantity, asking price matrix and the bidding matrix, wherein the transaction contract is used to represent the scheduling rule for the edge computing power resources to be scheduled by the resource provider to the resource demander, and the first transaction contract includes: the resource quantity to be traded, the unit price that the resource demander should pay, and the unit price that the resource provider should receive; Receiving the default data of the resource demander and the resource provider, and generating a second transaction contract according to the default data, wherein the second transaction contract is obtained by modifying the first transaction contract based on the default data, and the default data is determined according to the difference between the contract content actually executable by the resource demander and the resource provider and the content of the first transaction contract; Executing the second transaction contract, and after the execution of the second transaction contract is completed, sending the remaining resource sharing platform to the sharing platform, and the sharing platform is used for the secondary allocation of the remaining resources.

2. The method according to claim 1, characterized in that, Matching to obtain the first transaction contract according to the resource quantity, asking price matrix and the bidding matrix, including: Traversing the resource demander list of the target resource provider, and obtaining the highest bid of the resource demander from the resource demander list; Obtaining the asking price of the resource provider of the target resource provider from the resource quantity and asking price matrix of the target resource provider; Comparing the asking price of the resource provider of the target resource provider with the highest bid of the resource demander, and when the comparison result indicates that the highest bid of the resource demander is not less than the asking price of the resource provider of the target resource provider, and both the resource quantity that the target resource provider can provide and the resource quantity required by the resource demander corresponding to the highest bid of the resource demander are not zero, determining that the target resource provider matches the resource demander corresponding to the highest bid of the resource demander; When the target resource provider matches the resource demander corresponding to the highest bid of the resource demander, determining to generate the first transaction contract between the target resource provider and the resource demander corresponding to the highest bid of the resource demander.

3. The method according to claim 2, wherein Determining that the target resource provider and the resource demander corresponding to the highest bid of the resource demander sign the first transaction contract, including: ​ Determine the unit price to be paid by the target resource demander in the first transaction contract according to the bid of the resource demander; Determine the unit price to be received by the target resource provider in the first transaction contract as the difference between the unit price to be paid by the target resource demander and the distance cost, where the distance cost is determined according to the distance parameter; Generate the first transaction contract based on the transaction quantity, the unit price to be received by the target resource provider, the unit price to be paid by the target resource demander, the penalty to be paid in case of default by the resource demander, and the penalty to be paid in case of default by the resource provider.

4. The method according to claim 2, wherein Receive the default data of the resource demander and the resource provider, and generate a second transaction contract according to the default data, including: Receive default data, where the default data includes: resource demander default data and resource provider default data. The resource demander default data is used to represent the difference between the actual quantity of resources required by the resource demander and the transaction quantity in the first transaction contract, and the resource provider default data is used to represent the difference between the actual quantity of resources that the resource provider can provide and the transaction quantity in the first transaction contract. Wherein, in the case that the quantity of resources corresponding to the default data is greater than a preset threshold, regenerate the first transaction contract; Determine the penalty that the resource demander needs to pay to the platform and the resource provider and the penalty that the resource provider needs to pay to the platform and the resource demander based on the default data; Determine the actual transaction quantity according to the default data; Obtain the unit price to be paid by the resource demander in the second transaction contract; Determine the second transaction contract according to the actual transaction quantity, the penalty that the resource demander needs to pay to the platform and the resource provider, the penalty that the resource provider needs to pay to the platform and the resource demander, the unit price to be received by the target resource provider, and the unit price to be paid by the resource demander.

5. The method according to claim 3, characterized in that Determine the unit price to be paid by the target resource demander in the first transaction contract according to the bid of the resource demander, including: Determine the futures trading price as the average of the bid of the resource demander and the asking price of the resource provider of the target resource provider; Determine the unit price to be paid by the target resource demander as the sum of the futures trading price and the distance cost.

6. The method according to claim 4, characterized in that, Obtain the unit price to be paid by the resource demander in the second transaction contract, including: Obtain the unit prices to be paid by all resource demanders of the target resource provider; Determine the unit price to be paid by the resource demander in the second transaction contract according to the unit prices to be paid by all resource demanders.

7. The method according to claim 4, wherein The method further includes: In the case that both the resource demander and the resource provider default, match and offset the quantity of resources for which both the resource demander and the resource provider default in descending order of distance cost; After matching, in the case that the resource demander still defaults, determine the penalty that the resource demander needs to pay to the platform and the resource provider according to the remaining default data of the resource demander and the default probability of the resource demander; In the case that the resource provider still defaults after matching, determine the fines that the resource provider needs to pay to the platform and the resource demander according to the remaining default data of the resource provider and the default probability of the resource provider.

8. The method according to claim 1, wherein After the execution of the second transaction contract and after the remaining resources are invested in the sharing platform, the method further includes: Receiving identity conversion information, which is determined by the resource demander and the resource provider according to their remaining resources and is used to convert the identities of the resource demander and the resource provider; After the identity conversion is completed, select the resource demander with the highest bid from multiple resource demanders to conduct a transaction with the resource provider.

9. An edge computing power resource scheduling device, characterized in that, Includes: A receiving module, configured to receive resource demander information and resource provider information respectively, generate a resource quantity and asking price matrix of edge computing power resources according to the resource provider information, and generate a bid matrix according to the resource demander information, where the resource demander information includes: the bid of the resource demander and a distance parameter, and the resource provider information at least includes the computing power resource quantity that the resource provider can provide and the asking price of the resource provider, and the distance parameter is determined according to the transmission distance between the resource demander and the resource provider; A first generation module, configured to generate a first transaction contract according to the resource quantity, the asking price matrix, and the bid matrix, where the transaction contract is used to represent the scheduling rule for the edge computing power resources to be scheduled by the resource provider to the resource demander, and the first transaction contract includes: the resource quantity to be traded, the unit price that the resource demander should pay, and the unit price that the resource provider should receive; A second generation module, configured to receive the default data of the resource demander and the resource provider, and generate a second transaction contract according to the default data, where the second transaction contract is obtained by modifying the first transaction contract based on the default data, and the default data is determined according to the difference between the contract content that the resource demander and the resource provider can actually execute and the content of the first transaction contract; An execution module, configured to execute the second transaction contract, and after the execution of the second transaction contract is completed, send the remaining resources to the sharing platform, and the sharing platform is used for secondary allocation of the remaining resources.

10. A computer program product, comprising computer instructions, characterized in that, When the computer instructions are executed by a processor, the edge computing power resource scheduling method according to any one of claims 1-8 is implemented.

Images