Factory resource arrangement method and apparatus, and computer device
By adopting a dynamic computing resource allocation method in the factory, and utilizing a bidding mechanism and legality verification, the problem of low efficiency in computing resource allocation in large factories has been solved, achieving efficient utilization of computing resources and rapid response to emergencies.
Patent Information
- Application Number
- PCT/CN2023/096904
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-29
- Publication Date
- 2024-12-05
AI Technical Summary
In large factories, the allocation of computing resources is cost-inefficient and difficult to schedule manually, especially when batteries, locations, and workloads vary, making it difficult to utilize computing resources efficiently.
A dynamic computing resource allocation method is adopted, which allocates computing resources through a bidding mechanism, including non-urgent event types and emergency event types. The legality of resource requests and computing resources is verified, and resource allocation is determined based on the lowest bid, thereby optimizing resource utilization.
It improves the utilization rate of computing resources, reduces costs, enables flexible sharing and efficient scheduling of computing resources, and adapts to rapid response to sudden emergencies.
Smart Images

Figure CN2023096904_05122024_PF_FP_ABST
Abstract
Description
Factory resource arrangement method, device, and computer equipment Technical Field
[0001] The present application relates to the industrial field, and in particular, to a method, apparatus, computer equipment, and storage medium for arranging factory resources. Background Art
[0002] With the advancement of artificial intelligence and computing devices, more and more applications are being deployed in smart factories. However, dedicated computing devices for each application can go unused and lack cost-efficiency optimization. Furthermore, when factory sites are large and tasks are complex and constantly changing, it is difficult to manually plan the mobile computing devices to complete their tasks. Furthermore, mobile computing devices vary in terms of battery life, location, and workload, making scheduling even more difficult. Therefore, how to allocate computing resources to support factory tasks and applications has become a pressing issue.
[0003] Summary of the Invention
[0004] This summary is provided to introduce some selected concepts in a simplified form, which will be further described in the detailed description below. This summary is not intended to identify any key features or essential features of the claimed subject matter, nor is it intended to be used to help determine the scope of the claimed subject matter.
[0005] Based on this, a method for arranging factory resources includes: receiving a resource request, wherein the resource request includes an event type; the event type includes a non-emergency event type; allocating dynamic computing resources according to the event type; wherein, for non-emergency event types, the dynamic computing resources are determined according to a bidding mechanism.
[0006] Through the above method, computing resources can be dynamically allocated to improve device resource utilization, and computing devices can be shared by different tasks or applications at different times.
[0007] Furthermore, the legitimacy of the resource request is verified; and the legitimacy of the dynamic computing resources is verified.
[0008] Through the above methods, data security can be guaranteed, and the computing power of dynamic computing resources can be made transparent, which provides a basis for the overall planning of the factory. In addition, the tasks that arise in the factory can also be supported by computing resources in an anticipatory manner.
[0009] Furthermore, the allocating dynamic computing resources according to the event type includes: determining the dynamic computing resources according to the lowest bid in the bidding mechanism.
[0010] Through the above method, from the perspective of factory control, the corresponding computing resources can be obtained with the lowest overhead or cost. When the computing resources are not in use, the corresponding resources can be released to be used as computing resources for other tasks, thereby maximizing resource utilization efficiency.
[0011] Furthermore, the event type includes an emergency event type; and further includes: allocating the dynamic computing resources according to the minimum response time of the dynamic computing resources, location distance, computing power, and battery life.
[0012] Through the above method, it can also be guaranteed that emergency events or special events are supported by corresponding computing resources and tasks are quickly resolved.
[0013] In addition, the present application provides a method for dynamically providing computing resources, including: obtaining a resource request; providing a bid price based on the resource request; and providing dynamic computing resources if the bid price is received.
[0014] In addition, a factory resource arrangement device includes: a request receiving module for receiving resource requests; wherein the resource requests include event types; the event types include non-emergency event types; a resource allocation module for allocating dynamic computing resources according to the event types; wherein, for non-emergency event types, the dynamic computing resources are determined according to a bidding mechanism.
[0015] In addition, the present application also provides a device for providing dynamic computing resources, including: an acquisition module for obtaining resource requests; a bidding module for providing a bidding price based on the resource request; and an execution module for providing dynamic computing resources if the bidding price is received.
[0016] The present application also provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, and wherein the processor implements the above method when executing the computer program.
[0017] The present application also provides a computer-readable storage medium having a computer program stored thereon, and the computer program implements the above method when executed by a processor.
[0018] The present application also provides a computer program product, which is tangibly stored on a computer-readable medium and includes computer-executable instructions. When the computer-executable instructions are executed, the computer-executable instructions cause at least one processor to perform the method described above. BRIEF DESCRIPTION OF THE DRAWINGS
[0019] Implementations of the present disclosure are illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate the same or similar parts.
[0020] FIG1 is an effect diagram of a factory system according to an embodiment of the present application.
[0021] FIG2 is a schematic diagram of a process of a method for arranging factory resources according to an embodiment of the present application.
[0022] FIG3 is a schematic diagram of a device for arranging factory resources according to an embodiment of the present application.
[0023] FIG4 is a schematic diagram of a device for providing computing resources according to an embodiment of the present application.
[0024] FIG5 is a schematic diagram of a factory resource system according to an embodiment of the present application.
[0025] FIG6 is a schematic diagram of a computer device of a factory resource system according to an embodiment of the present application.
[0026] The reference numerals are as follows: 100: System 101-103: Modules S201-S203 Step 300: Apparatus 301: Module 302: Module 303: Module 304: Module 400: Apparatus 401: Module 402: Module 403: Module 500: System 600: Computer device 602: Processor 604: Memory DETAILED DESCRIPTION
[0027] In the following description, for the purpose of explanation, a large number of specific details are set forth. However, it is understood that the present invention can be implemented without these specific details. In other examples, well-known circuits, structures, and technologies are not shown in detail so as not to affect the understanding of the description.
[0028] References throughout this specification to "an implementation," "an implementation," "an exemplary implementation," "some implementations," "various implementations," etc., indicate that the implementations of the invention being described may include particular features, structures, or characteristics. However, it does not imply that every implementation must include those particular features, structures, or characteristics. Furthermore, some implementations may have some, all, or none of the features described for other implementations.
[0029] In the following description, the terms "coupled" and "connected" and their derivatives may be used. It should be understood that these terms are not intended as synonyms for each other. Rather, in certain implementations, "connected" is used to indicate that two or more components are in direct physical or electrical contact with each other, while "coupled" is used to indicate that two or more components cooperate or interact with each other, but they may or may not be in direct physical or electrical contact. Figure 1 is a flow chart of a method for generating a component according to one embodiment of the present application.
[0030] It should be understood that although the steps in the flowcharts in the accompanying drawings are shown in sequence as indicated by the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the figures may include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times. The order of execution of these steps or stages is not necessarily sequential, but can be executed in turn or alternately with other steps or at least a portion of steps or stages in other steps.
[0031] The problem to be solved and the application scenario to be addressed by this application can be illustrated as follows, using a factory as an example: Within this factory, there are routine tasks such as inventory checks, motor maintenance checks, and environmental inspections; in addition, there are one-time tasks such as updating AI models on the production line; and finally, there are emergency tasks such as fire detection. All sensors and actuators involved in these tasks can be referred to as requesters, requesting computing services or issuing tasks that require responders to provide computing support, such as 103 in Figure 1. If dedicated computing devices were required for all of these tasks, the cost and maintenance would be very high. In this case, mobile devices with computing capabilities, or responders, can provide a flexible and reliable way to provide services for different applications, such as specific computing services. Furthermore, by adopting device-to-device and ultra-wideband models, these dynamic computing-supported services can have additional features, such as ultra-low latency and localized location positioning.
[0032] FIG1 exemplarily shows a scenario of several mobile computing devices running in a factory. All mobile computing devices 103 are managed by a controller 102 stationed in the IT data center infrastructure of the factory 100. The overall factory 100 can be described as three parts, including sensors 101, the controller 102, and the mobile computing devices 103. The controller 102 can execute the factory resource scheduling method described below, and the mobile computing devices 103 can provide dynamic computing capabilities. The sensor 101 in the figure can be called a requester. The requester includes an event type in the resource request it proposes. The event type includes a non-emergency event type and an emergency event type. In this application, a bidding dynamic computing resource scheduling method is adopted for resource requests of non-emergency event types.
[0033] Therefore, the present application provides a method for arranging factory resources, including:
[0034] S201: Receive a resource request, wherein the resource request includes an event type; the event type includes a non-emergency event type.
[0035] In a factory, there are routine tasks such as inventory checks, motor maintenance checks, and environmental inspections. There are also one-off tasks such as updating AI models on a production line. The sensors and actuators for these non-urgent tasks are also called requesters. These requesters request computing services or make resource requests.
[0036] Resource requests include the event type. There are two types of events: urgent events that require immediate processing, and non-urgent events that do not. Therefore, for resource requests for non-urgent events, dynamic computing resource support can be employed. This means that computing resources are occupied and used only when the non-urgent event is being processed. After processing is complete, or when the processing is no longer needed, the computing resources can be released.
[0037] Furthermore, the resource request also includes the task location, the deadline for completing the task, the expected reward, and the estimated workload of the computing resources. The resource request information can subsequently provide a basis and reference for bids by responders or dynamic computing resources.
[0038] S202: Allocate dynamic computing resources according to the event type; for non-emergency event types, determine the dynamic computing resources according to a bidding mechanism.
[0039] When supporting or arranging non-emergency events, a bidding process can be employed. For example, for published resource requests or tasks, entities with dynamic computing resources, or so-called responders, can bid publicly. The responder or entity with the lowest bid will receive the task and, in turn, receive a reward from the factory or the equipment implementing the above-described method. From a factory control perspective, this allows for the acquisition of corresponding computing resources with minimal overhead or expense. When computing resources are not in use, they can be freed up to support other tasks, thereby maximizing computing resource utilization efficiency. The reward can include virtual currency or credits, which can be allocated to different departments based on factory policies. After the corresponding sensor or actuator in the department requests computing resources, the corresponding virtual currency or credits are fed back to the dynamic computing resources.
[0040] Furthermore, the legitimacy of the resource request is verified; and the legitimacy of the dynamic computing resources is verified.
[0041] For example, when a requester 101 posts a task, the corresponding control device, or the execution device 102 in the aforementioned method, will verify the legitimacy of the task. Only legitimate and qualified requesters can post the task, or the posted task itself must have a certain degree of legitimacy. Because requesters are sensors or actuators on different devices, the sensors or actuators themselves represent certain characteristics of the tasks typically posted by the device. For example, some requesters frequently post non-emergency tasks, while others frequently post emergency tasks. This differentiation between these different requesters facilitates effective task management and avoids accidental or erroneous task postings. Furthermore, responders, or the carriers of dynamic computing resources 103, must also undergo legitimacy verification and bid reasonably based on their capabilities and the number of tasks currently undertaken. They must not conceal or exaggerate their computing capabilities in order to obtain higher returns. In some embodiments, the maximum computing capacity of responders or carriers of dynamic computing resources has been filed or registered. In some embodiments, the requester must verify the responder's certificate before using the responder's resources, thereby ensuring the responder's legitimacy and ensuring that the responder has the corresponding computing resources to complete the calculation of the corresponding task.
[0042] Computing resources can include powerful central processing units (CPUs), graphics processing units (GPUs), random access memory (RAM), device-to-device (D2D) and ultra-wideband (UWB) capabilities. These capabilities support computation, completing data and image processing and analysis tasks, and providing feedback to the requester.
[0043] Furthermore, the dynamic computing resources are determined based on the lowest bid in the bidding mechanism.
[0044] In some embodiments, it is usually the responder with the lowest bid price who gets the opportunity to handle the corresponding task. However, if there are multiple responders with the same bid, the responders will further reduce their respective bid prices by a certain preset amount until one respondent has the lowest price and gets the task. When other responders see that their bid price for the current task is already lower than the bid price for another task, they can give up the bidding process for the current task. Or to put it another way, when the bid price is lower than the responder's target expectation or its own cost budget, the responder can give up the bid for the task, otherwise it will reduce its own bid by a certain preset amount as described above and compete with other responders. In some embodiments, the bid price is related to the cost consumed by the responder or the carrier of the dynamic computing resources, for example, electricity, chips, location distance, communication signals, data transmission and other computing resources occupied by the tasks that have been undertaken are related to the bid price. In some embodiments, the location distance may refer to the location where the task needs to be performed. In some embodiments, the factory area is relatively open, and the corresponding equipment of the dynamic computing resources may be distributed in different locations. It takes a certain amount of time and cost to reach the execution location of the task. Therefore, the location distance between the corresponding equipment of the dynamic computing resources and the task execution location is also a factor that needs to be considered.
[0045] Furthermore, the event type includes an emergency event type; and further includes: allocating the dynamic computing resources according to the minimum response time, location, computing power, and battery life of the dynamic computing resources.
[0046] In some embodiments, for emergency event types, such as some of the one-time tasks or fire tasks mentioned above, these events need to be handled in a timely manner, so computing resources need to be supported in a short period of time. Therefore, at this time, the execution equipment or device of the above method directly allocates and configures the corresponding computing resources based on factors such as the minimum response time, location distance, computing power, and battery status of all dynamic computing resources, and no longer adopts a bidding method.
[0047] In some embodiments, the device or apparatus executing the above-described method may be referred to as controller 102. Controller 102 contains multiple components. The first component is the task board, where task administrators or requesters can post their currently required computing tasks, or resource requests. Task information may include task type, precise location within the factory, deadline for task completion, a reference maximum reward, the requester's identity, and any relevant precautions. Responders can, based on this task information and their own assessments, bid for the task. In some embodiments, depending on factory policy, the reward or bid price may be virtual currency or other credit points. The task's workload can be assessed through test runs on the responder's same or similar hardware. When a non-urgent task is posted on the task board, it is open for bidding. The responder requiring the lowest reward will receive the task. The controller then shares connection information with the requester and responder.
[0048] In some embodiments, the responder may provide the location of the responder's computing resources, the deadline for completing the responder's task, the responder's expected reward, and the responder's expected workload. In some embodiments, a task may be handled by multiple responders, and the multiple responders may complete their respective parts of the task in a distributed manner and feedback their respective computational results to the requester, so that the requester can combine the results of multiple responders to obtain the final result.
[0049] In some embodiments, in order to avoid unauthorized use of resources, the controller 102 also includes a second component and a third component. The second component and the third component are the requester board and the responder board, respectively. The controller only registers qualified and approved devices to the corresponding board according to their corresponding requester or responder roles. When the requester publishes a task, the controller will check the legitimacy of the requester and the task. At the same time, the requester must verify the responder's certificate before using the responder's computing resources. On the other hand, the responder needs to accurately assess the accurate computing resource support it can provide for a certain task. In some embodiments, the responder's maximum computing capacity is also recorded in the responder board or the controller.
[0050] Furthermore, the present application provides a method for dynamically providing computing resources, comprising: obtaining a resource request; providing a bid price based on the resource request; and providing dynamic computing resources if the bid price is received.
[0051] The resource request, or resource acquisition, involves the dynamic computing resource receiving the corresponding resource request information from the controller. This resource request information includes some basic information required to complete the corresponding task. The dynamic computing resource then provides its bid price based on the resource request information and its own circumstances. If the bid price is accepted, the corresponding dynamic computing resources are provided to execute and complete the corresponding task.
[0052] In some embodiments, the workflow of a mobile computing device, or responder, can include the following three phases: a scheduling phase, a bidding phase, and an execution phase. The first phase is the scheduling phase. In this phase, responders use a task board to select tasks to bid on. This phase can be described as a multi-choice knapsack problem. The goal is to maximize rewards and returns while maintaining constraints such as battery life and deadlines. Many established algorithms exist to solve this multi-choice knapsack problem, such as the branch-and-bound algorithm. The bidding phase then begins after a responder has selected multiple tasks. Starting with the highest reward or price-performance ratio, the responder bids for tasks. If it encounters other responders with the same bid, it reduces its bid by a predefined amount and continues bidding until it becomes the winner. It may also abandon its bid for the current task if its bid is lower than the bid for another task or for other cost reasons. The final phase is the execution phase. Once one or more tasks are won, the execution phase begins. In some embodiments, mobile computing devices complete their tasks one by one, starting with the task with the closest deadline.
[0053] Furthermore, in this application, a new computing resource management system is proposed to solve the problem of computing resource allocation. In this system, a mobile computing device is assumed. This device can be based on an automated guided vehicle (AGV) and equipped with a large battery, a powerful central processing unit (CPU), a graphics processing unit (GPU), a random access memory (RAM), device to device (D2D) and ultra-wide band (UWB) capabilities. The computing power of these devices can be shared and arranged by different applications to improve resource utilization and reduce maintenance workload. For situations where ultra-short delay is required, a device-to-device mode can be adopted to handle the corresponding tasks. For spontaneous computing resource requests, UWB can provide the precise location of the requester and responder to achieve optimal scheduling.
[0054] Furthermore, in the present disclosure, the proposed resource management system can:
[0055] 1. Improve device resource utilization. Computing devices can be shared by different applications at different times. As a result, the device's resource utility increases.
[0056] 2. Reduced construction and maintenance costs. Since the number of computing devices is smaller, the cost of building and maintaining the infrastructure will be lower. Furthermore, there is no need for human involvement in the detailed planning phase.
[0057] 3. Flexible expansion: Mobile computing devices utilize wireless networks and do not require the installation of additional infrastructure.
[0058] 4. Applicable to sudden and emergency situations. The system takes into account spontaneous requests for computing resources. The entire scheduling algorithm can be designed to respond to these requests in a timely manner.
[0059] In the present disclosure, the mobile computing device providing computing resources can take several instructions. By inspecting network packets, we can find that the method of this application has been implemented. The design architecture of the entire system can also provide clues to detect the invention disclosure.
[0060] Figure 3 provides a device 300 for scheduling factory resources. Device 300 includes a request receiving module 301 for receiving a resource request, wherein the resource request includes an event type, and the event type includes a non-emergency event type. A resource allocation module 302 is configured to allocate dynamic computing resources based on the event type. For non-emergency event types, the dynamic computing resources are determined based on a bidding mechanism. Device 300 is the same device or apparatus as 102 in Figure 1 and performs the same operations or methods.
[0061] Furthermore, the apparatus further includes a verification module 303 for verifying the legitimacy of the resource request; and for verifying the legitimacy of the dynamic computing resource.
[0062] Furthermore, the resource allocation module 302 is configured to determine the dynamic computing resources according to the lowest bid in the bidding mechanism.
[0063] Furthermore, the event type includes an emergency event type; further comprising: an emergency event allocation module 204, for allocating dynamic computing resources based on the minimum response time, location distance, computing power, and battery life of the dynamic computing resources. As shown in FIG4 , the present application also provides a device 400 for providing dynamic computing resources, comprising: an acquisition module 401, for obtaining a resource request; a bidding module 402, for providing a bid price based on the resource request; and an execution module 403, for providing dynamic computing resources if the bid price is received. The providing device 400 is the same device or apparatus as 103 in FIG1 , and performs the same operation or method.
[0064] As shown in FIG5 , the present application further provides a factory resource system 500 , comprising the above-mentioned arrangement device 300 and the above-mentioned providing device 400 .
[0065] It should be noted that the device may include more or fewer modules to implement the described functions. For example, at least one module in Figures 3 and 4 may be further divided into a plurality of different sub-modules, each sub-module being configured to perform at least a portion of the operations described herein in conjunction with the corresponding module. In addition, in some examples, the device 300 may further include additional modules for performing other operations already described in the specification. Furthermore, those skilled in the art will appreciate that the exemplary devices 300 and 400 may be implemented using software, hardware, firmware, or any combination thereof.
[0066] Figure 6 provides a computer device. According to one embodiment, the computer device 600 may include a processor 602, which executes a computer program stored in a memory 604. When the computer program is executed by the processor, the above method is implemented.
[0067] Those skilled in the art will understand that the structure shown in Figure 3 is merely a block diagram of a portion of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.
[0068] Those skilled in the art will appreciate that all or part of the processes in the methods for implementing the above-mentioned embodiments can be accomplished by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include processes for the implementation of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the various embodiments provided in this application may include at least one of non-volatile and volatile memory. Non-volatile memory may include read-only memory (ROM), magnetic tape, floppy disk, flash memory or optical memory, etc. Volatile memory may include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).
[0069] The present application also provides a computer-readable storage medium having a computer program stored thereon, which implements the above steps when the computer program is executed by a processor.
[0070] The present application also provides a computer program product, which is tangibly stored on a computer-readable medium and includes computer-executable instructions. When the computer-executable instructions are executed, the computer-executable instructions cause at least one processor to perform the above method.
[0071] Furthermore, the computer program can be stored and run in the cloud to perform the method. Furthermore, the components of the program can be deployed on multiple devices and the cloud. For example, the corresponding steps can be deployed and run on a local or local computer, or run on different cloud devices, transmitting signals through a communication connection, or can also be deployed and run on a local or local computer. This application does not limit the described methods or methods, and the corresponding technologies can be flexibly deployed and deployed to fully utilize equipment and technologies such as the cloud, big data, and supercomputing capabilities to execute and complete the method.
[0072] Some implementations of the present disclosure may include articles of manufacture. Articles of manufacture may include storage media for storing logic. Examples of storage media may include one or more types of computer-readable storage media capable of storing electronic data, including volatile or non-volatile memory, removable or non-removable memory, erasable or non-erasable memory, writable or rewritable memory, and the like. Examples of logic may include various software units, such as software components, programs, applications, computer programs, application programs, system programs, machine programs, operating system software, middleware, firmware, software modules, routines, subroutines, functions, methods, processes, software interfaces, application program interfaces (APIs), instruction sets, computing codes, computer codes, code segments, computer code segments, words, values, symbols, or any combination thereof. In some implementations, for example, articles of manufacture may store executable computer program instructions that, when executed by a processor, cause the processor to perform the methods and / or operations described herein. Executable computer program instructions may include any suitable type of code, such as source code, compiled code, interpreted code, executable code, static code, dynamic code, and the like. Executable computer program instructions can be implemented according to a predefined computer language, method or syntax for commanding a computer to perform a specific function. The instructions can be implemented using any appropriate high-level, low-level, object-oriented, visual, compiled and / or interpreted programming language.
[0073] What has been described above includes examples of the disclosed architecture. It is, of course, not possible to describe every conceivable combination of components and / or methodologies, but those skilled in the art will appreciate that many other combinations and permutations are possible. Therefore, the novel architecture is intended to embrace all such alternatives, modifications, and variations that fall within the spirit and scope of the appended claims.
Claims
1. A method for arranging factory resources, include: receiving a resource request, wherein the resource request includes an event type; the event type includes a non-emergency event type; Dynamic computing resources are allocated according to the event type; wherein, for non-emergency event types, the dynamic computing resources are determined according to a bidding mechanism.
2. The method according to claim 1, in, Verifying the legitimacy of the resource request; Verify the legitimacy of the dynamic computing resource.
3. The method according to claim 1, in, Allocating dynamic computing resources according to the event type includes: The dynamic computing resource is determined according to the lowest bid in the bidding mechanism.
4. The method according to claim 1, in, The event type includes an emergency event type; and further includes: The dynamic computing resources are allocated according to their minimum response time, distance location, computing power, and battery life.
5. A method for dynamically providing computing resources, include: Get resource request; Providing bid prices in response to resource requests; If the bid price is received, dynamic computing resources are provided.
6. A factory resource arrangement device (300), include: A request receiving module (301) is used to receive a resource request; wherein the resource request includes an event type; the event type includes a non-emergency event type; The resource allocation module (302) is used to allocate dynamic computing resources according to the event type; wherein, for non-emergency event types, the dynamic computing resources are determined according to a bidding mechanism.
7. The device (300) according to claim 6, in, include: A verification module (303), used to verify the legitimacy of the resource request; And used to verify the legitimacy of the dynamic computing resources.
8. The device (300) according to claim 6, in, The resource allocation module (302) is used to determine the dynamic computing resources according to the lowest bid in the bidding mechanism.
9. The device (300) according to claim 6, in, The event type includes an emergency event type; and further includes: The emergency event allocation module (204) is used to allocate the dynamic computing resources according to the minimum response time, location distance, computing capacity and battery life of the dynamic computing resources.
10. A device (400) for providing dynamic computing resources, include: The acquisition module (401) is used to obtain a resource request; A bidding module (402), configured to provide a bidding price according to a resource request; The execution module (403) is used to provide dynamic computing resources if the bid price is received.
11. A computer device comprising a memory and a processor, wherein the memory stores a computer program. in, When the processor executes the computer program, the steps of the method according to any one of claims 1 to 5 are implemented.
12. A computer-readable storage medium having a computer program stored thereon, in, When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 5 are implemented.
13. A computer program product tangibly stored on a computer readable medium and comprising computer executable instructions which, when executed, cause at least one processor to perform the method according to any one of claims 1 to 5.
14. A factory resource system (500), comprising the scheduling device (300) according to claims 6-9 and the providing device (400) according to claim 10.
Citation Information
Patent Citations
A method for long-term allocation of computing resources based on mobile device cloud
CN109040206A
Resource scheduling method and device
CN109426550A
Mobile edge network resource allocation method based on online combined auction
CN110996396A
Demand response marketization resource allocation method and device for electric power spot market
CN112712440A
Computing resource configuration method and device for cloud on enterprise
CN114860430A
