Virtual machine task scheduling method and device, equipment and storage medium

Abstract

The embodiment of the invention discloses a virtual machine task scheduling method and device, equipment and a storage medium, and belongs to the technical field of computers, and the method comprises the steps that under the condition that a target virtual machine task is obtained, target task information is determined, the target task information comprises an information value corresponding to each target queue in a target link, and the information value indicates a corresponding target position; the target link is a sequential scheduling link, and the virtual machine tasks in each queue in the target link are scheduled by the scheduling nodes corresponding to the queues according to a queuing sequence; and under the condition of performing target virtual machine task scheduling along the target link, when the target virtual machine task is scheduled to the scheduling node corresponding to any target queue, performing corresponding scheduling on the target virtual machine task based on the target position indicated by the corresponding information value. According to the embodiment of the invention, the queuing time can be remarkably shortened, and priority scheduling and flexible scheduling according to the condition of the target virtual machine task are realized, so that the scheduling flexibility is improved, and the scheduling failure rate is reduced.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of computers, and in particular to a virtual machine task scheduling method and device, equipment and a storage medium. BACKGROUND

[0002] Related technologies can deploy multiple virtual machines in a cloud environment and support a user to issue a virtual machine task to any virtual machine, so as to achieve the purpose of providing corresponding services for the user by executing the virtual machine task based on the virtual machine. In the virtual machine task scheduling scheme of related technologies in the cloud environment, the virtual machine task needs to be queued multiple times before it can be finally executed from generation to execution. Such virtual machine task scheduling schemes all have a forward scheduling link, which will lead to low virtual machine task scheduling efficiency, inflexible calling process and even high scheduling failure rate. SUMMARY

[0003] Embodiments of the present application provide a virtual machine task scheduling method, device, equipment and storage medium, which can implement a flexible virtual machine task scheduling method based on the forward scheduling link framework without substantially modifying the link framework of the forward scheduling link, comprehensively improve the virtual machine task scheduling efficiency and flexibility, and reduce the scheduling failure rate.

[0004] According to an aspect of an embodiment of the present application, a virtual machine task scheduling method is provided, which comprises:

[0005] In the case of obtaining a target virtual machine task, target task information is determined, the target task information comprising information values corresponding to each target queue in a target link, the information values indicating corresponding target positions, the target link being a forward scheduling link, and the virtual machine tasks in each queue in the target link being scheduled and processed by the scheduling nodes corresponding to the queues in the order of queuing;

[0006] In the case of scheduling the target virtual machine task along the target link, when the target virtual machine task is scheduled to any scheduling node corresponding to the target queue, the target virtual machine task is scheduled according to the target position indicated by the corresponding information value.

[0007] According to an aspect of an embodiment of the present application, a virtual machine task scheduling device is provided, which comprises:

[0008] The virtual machine task acquisition module is configured to, in a case where a target virtual machine task is acquired, determine target task information, the target task information including information values corresponding to each target queue in a target link, the information values indicating corresponding target positions, the target link being a forward scheduling link, and virtual machine tasks in each queue in the target link being scheduled and processed by a scheduling node corresponding to the queue in a queuing order;

[0009] The virtual machine task scheduling module is configured to, in a case where target virtual machine tasks are scheduled along the target link, when the target virtual machine tasks are scheduled to any scheduling node corresponding to the target queue, schedule the target virtual machine tasks according to the target positions indicated by the corresponding information values.

[0010] According to an aspect of an embodiment of the present application, a computer device is provided, the computer device including a processor and a memory, the memory storing at least one instruction, at least one program, a code set or an instruction set, the at least one instruction, the at least one program, the code set or the instruction set being loaded and executed by the processor to implement the virtual machine task scheduling method.

[0011] According to an aspect of an embodiment of the present application, a computer readable storage medium is provided, the storage medium storing at least one instruction, at least one program, a code set or an instruction set, the at least one instruction, the at least one program, the code set or the instruction set being loaded and executed by a processor to implement the virtual machine task scheduling method.

[0012] According to an aspect of an embodiment of the present application, a computer program product is provided, the computer program product including computer instructions stored in a computer readable storage medium. A processor of a computer device reads the computer instructions from the computer readable storage medium, and the processor executes the computer instructions, so that the computer device performs to implement the virtual machine task scheduling method.

[0013] The technical scheme provided by the embodiment of the present application can bring the following beneficial effects:

[0014] The virtual machine task scheduling method provided in the embodiments of the present application does not need to change the forward scheduling link required by the virtual machine task scheduling, and can implement high flexibility of the virtual machine task scheduling under the framework of the forward scheduling link. Specifically, a target position corresponding to a target queue related to the target virtual machine task in the forward scheduling link can be determined, when the target virtual machine task is transferred along the forward scheduling link to a scheduling node corresponding to the target queue, the target virtual machine task does not need to be inserted into the tail of the target queue to wait for queuing and scheduling as in the related art, but can be inserted into the target position based on the target position of the target queue determined in advance to realize queuing, and even can be directly prioritized to be scheduled by jumping the target queue. That is, in the virtual machine task scheduling method provided in the embodiments of the present application, the target virtual machine task does not need to normally queue and wait for scheduling in each queue of the forward scheduling link, but can queue and even jump in the related target queue according to the situation of the target virtual machine task, so that the scheduling node corresponding to the target queue still schedules the virtual machine task according to the queuing order, but the queuing time is significantly shortened due to the queuing and even jumping.

[0015] Therefore, although the target virtual machine task still needs to undergo multiple queuing from generation to final execution under the forward scheduling link, the queuing time can be significantly shortened when the target virtual machine task is transferred to the target queue, the target virtual machine task can be queued and even jumped, so that the priority scheduling and flexible scheduling according to the situation of the target virtual machine task are realized, and the scheduling flexibility is improved and the scheduling failure rate is reduced. BRIEF DESCRIPTION OF DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0017] Figure 1 is a virtual machine task scheduling process diagram under the forward scheduling link in the related art provided by an embodiment of the present application;

[0018] Figure 2 is a schematic diagram of an application running environment provided by an embodiment of the present application;

[0019] Figure 3 is a flowchart of a virtual machine task scheduling method provided by an embodiment of the present application;

[0020] Figure 4 is a schematic diagram of a target task information determination method provided by an embodiment of the present application;

[0021] Figure 5This is a schematic diagram of a virtual machine task scheduling system provided in one embodiment of this application;

[0022] Figure 6 This is a schematic diagram illustrating the execution process of a target task information determination method provided in one embodiment of this application;

[0023] Figure 7 This is a schematic diagram of an intelligent scheduling method provided in one embodiment of this application;

[0024] Figure 8 This is a schematic diagram of an intelligent scheduling process provided in one embodiment of this application;

[0025] Figure 9 This is a block diagram of a virtual machine task scheduling device provided in one embodiment of this application;

[0026] Figure 10 This is a structural block diagram of a computer device provided in one embodiment of this application. Detailed Implementation

[0027] Before introducing the method embodiments provided in this application, a brief introduction will be given to the relevant terms or nouns that may be involved in the method embodiments of this application, so as to facilitate the understanding of those skilled in the art.

[0028] Cloud technology refers to a hosting technology that unifies hardware, software, and network resources within a wide area network (WAN) or local area network (LAN) to achieve data computation, storage, processing, and sharing. Cloud technology is a collective term for network technology, information technology, integration technology, management platform technology, and application technology applied based on the cloud computing business model. It can form resource pools, be used on demand, and is flexible and convenient. Cloud computing technology will become a crucial support. Backend services of technical network systems require substantial computing and storage resources, such as video websites, image websites, and many portal websites. With the rapid development and application of the internet industry, every item may have its own identification mark in the future, requiring transmission to backend systems for logical processing. Data at different levels will be processed separately, and various industry data will require robust system support, which can only be achieved through cloud computing.

[0029] Before describing the specific embodiments of this application, the relevant technical background related to the embodiments of this application will be introduced to facilitate understanding by those skilled in the art.

[0030] Related technologies can build cloud environments based on cloud technology, deploy multiple virtual machines (VMs) within these environments, and support users in publishing VM tasks to any VM, thereby providing corresponding services to users by executing VM tasks on VMs. However, in VM task scheduling schemes within cloud environments, VM tasks need to be queued multiple times from generation before they can be finally executed. These schemes all have a sequential scheduling chain, which leads to low scheduling efficiency, inflexible scheduling processes, and even a high scheduling failure rate.

[0031] Please refer to Figure 1 This diagram illustrates the virtual machine task scheduling process under a sequential scheduling link in related technologies. The target user account can be any computer associated with any user. The target user account can publish a target virtual machine task to any virtual machine. This target virtual machine task is first assigned to a first scheduling node in the cloud environment. This first scheduling node includes a first pusher and a first executor. The first scheduling node is used to sort and schedule the virtual machine tasks published by each user account received in the cloud environment. The first scheduling node corresponds to a first task queue. The first pusher inserts the target virtual machine task at the tail of the first task queue, which records the sorting results of the virtual machine tasks published by each user account in the cloud environment. The first executor of the first scheduling node is responsible for extracting virtual machine tasks from the head of the first task queue for execution. The first pusher and the first executor respectively perform the initial production and consumption of virtual machine tasks, and have a logical correspondence.

[0032] Taking task-3 as the target virtual machine task as an example, after task-1 and task-2 are processed by the first scheduling node, the first executor extracts task-3 for execution. Specifically, the first executor sends task-3 to the second scheduling node corresponding to the host machine where its virtual machine resides.

[0033] The second scheduling node is used to sort and schedule virtual machine tasks that need to be executed by virtual machines in its corresponding host machine. This second scheduling node includes a second pusher and a second executor, and corresponds to a second task queue. The second pusher inserts the target virtual machine task into the tail of the second task queue, which records the sorting results of virtual machine tasks to be executed by virtual machines in its corresponding host machine. The second executor is responsible for retrieving virtual machine tasks from the head of the second task queue for execution.

[0034] The second executor can only extract task-3 after all virtual machine tasks preceding task-3 in the second task queue have been extracted. Specifically, the second executor sends each extracted virtual machine task to the third pusher of the third scheduling node. The third scheduling node corresponds to the third task queue. This third pusher is used to lock each virtual machine task and then sequentially place it into its corresponding third task queue. The third executor of the third scheduling node executes each virtual machine task in the third task queue in order to complete the corresponding virtual machine task. Only after all virtual machine tasks preceding task-3 in the third task queue have been executed can task-3 be actually executed.

[0035] Obviously, Figure 1 The virtual machine task scheduling process in the illustrated related technology is a sequential scheduling process, and the resulting chain is a chronological scheduling chain. The target virtual machine task needs to enter the first task queue, the second task queue, and the third task queue in sequence before it can be finally executed. Each time it enters a task queue, it needs to queue up, so it needs to go through three queuing processes before it can be finally executed. Multiple queuing processes lead to low virtual machine task scheduling efficiency, inflexible scheduling process, and may even cause the virtual machine task itself or other virtual machine tasks to fail to schedule.

[0036] For example, in a cloud environment, if a virtual machine crashes, a user can issue a virtual machine restart task to restart the virtual machine. This virtual machine restart task also needs to go through three queues before it can be executed by the corresponding virtual machine. However, since the virtual machine is already in a crashed state, other virtual machine tasks that need to be processed by the virtual machine before the virtual machine restart task cannot be executed and can only wait until the timeout. However, this will cause these virtual machine tasks to fail to be scheduled, and will also cause users to wait too long, affecting task execution efficiency and user experience.

[0037] In summary, under the sequential scheduling framework example in related technologies, the virtual machine task scheduling method, which requires a virtual machine task to go through three queuing processes from its generation, leads to low virtual machine task scheduling efficiency, inflexible scheduling process, and even a high scheduling failure rate. To address these technical problems, this application provides a virtual machine task scheduling method that... Figure 1 The virtual machine task scheduling method shown is optimized. For example, without changing the sequential scheduling chain, the flexibility of each queuing can be improved without changing the scheduling framework of virtual machine tasks that need to be queued three times. This comprehensively improves the scheduling efficiency of virtual machine tasks, enhances the flexibility of the scheduling process, and significantly reduces the scheduling failure rate.

[0038] This application proposes a virtual machine task scheduling method that does not require altering the sequential scheduling chain required for virtual machine task scheduling, enabling highly flexible virtual machine task scheduling within the framework of the sequential scheduling chain. Specifically, the target position of the target virtual machine task corresponding to the relevant target queue in the sequential scheduling chain can be determined. When the target virtual machine task is transferred along the sequential scheduling chain to the scheduling node corresponding to the target queue, it does not need to be inserted at the tail of the target queue and wait for queuing, as in related technologies. Instead, based on the pre-determined target position corresponding to the target queue, the target virtual machine task can be inserted into the target position to achieve queue jumping, or even skip the target queue and be scheduled first, thus achieving queue skipping. In other words, in the virtual machine task scheduling method proposed in this application, the target virtual machine task does not need to wait in line for scheduling in each queue of the sequential scheduling chain. Instead, it can jump in or even skip queues in the relevant target queues according to its own situation. Therefore, even if the scheduling node corresponding to the target queue still schedules virtual machine tasks according to the queuing order, the queuing time is significantly shortened due to queue jumping or skipping.

[0039] Therefore, although the target virtual machine task may still need to go through multiple queuing processes from generation to final execution under the sequential scheduling link, it can jump the queue or even skip the queue when it is transferred to the target queue. Thus, the queuing time can be significantly shortened, and priority scheduling and flexible scheduling based on the target virtual machine task itself can be achieved, thereby improving scheduling flexibility and reducing scheduling failure rate.

[0040] To make the objectives, technical solutions, and advantages of this application clearer, the embodiments of this application will be described in further detail below with reference to the accompanying drawings. It should be noted that all data used in the embodiments of this application has been fully authorized by the relevant parties before use.

[0041] Please refer to Figure 2 This diagram illustrates an application runtime environment provided in one embodiment of this application. The application runtime environment may include: terminal 10 and server 20.

[0042] Terminal 10 includes, but is not limited to, electronic devices such as mobile phones, computers, smart voice interaction devices, smart home appliances, in-vehicle terminals, game consoles, e-book readers, multimedia playback devices, and wearable devices. Application clients can be installed on terminal 10.

[0043] In this embodiment, the application described above can be any application capable of providing or relying on virtual machine task scheduling. Typically, the application is a media application. Of course, other types of applications besides media applications can also provide or rely on virtual machine task scheduling. For example, news applications, social applications, interactive entertainment applications, browser applications, shopping applications, content sharing applications, virtual reality (VR) applications, augmented reality (AR) applications, etc., are not limited in this embodiment. Optionally, a client of the above-mentioned application runs on terminal 10.

[0044] Server 20 provides background services to clients of applications in terminal 10. For example, server 20 can be a background server for the aforementioned applications. Server 20 can be a standalone physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms. Optionally, server 20 can simultaneously provide background services to applications in multiple terminals 10.

[0045] Optionally, terminal 10 and server 20 can communicate with each other via network 30. Terminal 10 and server 20 can be directly or indirectly connected via wired or wireless communication, which is not limited herein.

[0046] Please refer to Figure 3 The diagram illustrates a flowchart of a virtual machine task scheduling method according to an embodiment of this application. This method can be applied to computer devices, which refer to electronic devices with data computing and processing capabilities. For example, the executing entity for each step can be... Figure 2 The relevant devices in the application's runtime environment, such as server 20, are shown. This method may include the following steps:

[0047] Step S301. If the target virtual machine task is obtained, determine the target task information. The target task information includes the information value corresponding to each target queue in the target link. The information value indicates the corresponding target position. The target link is a sequential scheduling link. The virtual machine tasks in each queue in the target link are scheduled and processed by the scheduling node corresponding to the queue in the queuing order.

[0048] In this application's embodiments, the target virtual machine task can be any task that can be executed by any virtual machine. Taking a cloud environment as an example, multiple host machines can be deployed in a cloud environment, and each host machine can run at least one virtual machine. Users can publish target virtual machine tasks that can be executed by any virtual machine by interacting with the cloud environment. This application's embodiments do not limit the specific task details of the target virtual machine task; for example, it can be a virtual machine startup task, a virtual machine shutdown task, a virtual machine restart task, or any computing task executed by the virtual machine.

[0049] The virtual machine task scheduling method in this embodiment still operates on a sequential scheduling link, i.e., the target link. Each virtual machine task received in the cloud environment needs to flow along the sequential scheduling link until it is finally executed by the virtual machine to which the task points. The target link can include N queues, where N is a positive integer. Without skipping queues, each virtual machine task needs to go through N queues before it is finally executed by the virtual machine corresponding to that task. Please refer to... Figure 1 The corresponding sequential scheduling link can be used as an example of a target link, which includes 3 queues.

[0050] This application's embodiments differ from related technologies in that several target queues can be determined in each queue of the target link. A target queue can be understood as a queue that allows intelligent scheduling of target virtual machine tasks. Intelligent scheduling allows determining the information value corresponding to the target queue, which indicates the target location. When a target virtual machine task is transferred to the scheduling node corresponding to the target queue, the target virtual machine is scheduled based on that target location. For example, depending on the specific circumstances of the target location, the target virtual machine task is allowed to queue normally, jump the queue, or even skip the queue.

[0051] In one implementation, when the information value is a first preset value, the indicated target location does not belong to the corresponding target queue; when the information value is a second preset value, the indicated target location belongs to the corresponding location under normal queuing conditions; when the information value is neither the first preset value nor the second preset value, the information value is the position number of the target location in the corresponding target queue.

[0052] This application does not limit the first and second preset values ​​in its embodiments. These values ​​can be set according to actual conditions and do not constitute an obstacle to implementation. For example, the first preset value can be "-1" and the second preset value can be "0". Furthermore, the specific data structure of the target task information is not limited. For example, the target task information has a list structure, which records each target queue and its corresponding information value. Please refer to Table 1, which shows a schematic table of target task information.

[0053] Table 1

[0054]

[0055]

[0056] A queue identifier of "1" indicates that the first queue in the target link is the target queue, which is the standard practice. Figure 1 For example, the target queue is the first task queue. The information value "-1" does not correspond to a position in the first task queue. Therefore, it means that when the target virtual machine task is transferred to the first scheduling node corresponding to the first task queue, it does not need to queue in the first task queue and can skip the queue.

[0057] The queue identifier "2" indicates that the second queue in the target link is the target queue, which is the same as the previous one. Figure 1 For example, the target queue is the second task queue. The information value "2" is neither the first preset value nor the second preset value. It represents the sequence number corresponding to the target position. That is to say, when the target virtual machine task is transferred to the second scheduling node corresponding to the second task queue, it is inserted into the second position of the second task queue. In other words, the target virtual machine task has been queued and inserted into the target position indicated by the information value.

[0058] The queue identifier "3" indicates that the third queue in the target link is the target queue, which is the same as the previous method. Figure 1 For example, the target queue is the third task queue. The information value "0" indicates the corresponding position under normal queuing conditions. Therefore, it means that when the target virtual machine task is transferred to the third scheduling node corresponding to the third task queue, it can queue normally.

[0059] Step S302. When scheduling target virtual machine tasks along the target link, when the target virtual machine task is scheduled to any of the scheduling nodes corresponding to the target queue, the target virtual machine task is scheduled accordingly based on the target location indicated by the corresponding information value.

[0060] Similar to related technologies, embodiments of this application schedule the target virtual machine task along the target link, so as to Figure 1 For example, the target virtual machine task is sequentially routed along the forward scheduling path. The difference lies in that, when it is routed to a specific scheduling node, if that node corresponds to a target queue, the target virtual machine task can be intelligently scheduled based on the target position indicated by the information value corresponding to that target queue. Specifically, it can queue normally, jump the queue, or even skip the queue. Obviously, jumping the queue and skipping the queue can allow the target virtual machine task to be routed to the next scheduling node more quickly. (Continuing...) Figure 1 For example, the scheduling method used in the embodiments of this application is in Figure 1Although the sequential scheduling link framework still requires passing through three scheduling nodes and queuing three times before final processing without skipping queues, each queue can be skipped according to the actual situation, thus enabling the target virtual machine task to be scheduled and executed faster.

[0061] This application proposes a virtual machine task scheduling method that does not require altering the sequential scheduling chain required for virtual machine task scheduling, enabling highly flexible virtual machine task scheduling within the framework of the sequential scheduling chain. Specifically, the target position of the target virtual machine task corresponding to the relevant target queue in the sequential scheduling chain can be determined. When the target virtual machine task is transferred along the sequential scheduling chain to the scheduling node corresponding to the target queue, it does not need to be inserted at the tail of the target queue and wait for queuing, as in related technologies. Instead, based on the pre-determined target position corresponding to the target queue, the target virtual machine task can be inserted into the target position to achieve queue jumping, or even skip the target queue and be scheduled first, thus achieving queue skipping. In other words, in the virtual machine task scheduling method proposed in this application, the target virtual machine task does not need to wait in line for scheduling in each queue of the sequential scheduling chain. Instead, it can jump in or even skip queues in the relevant target queues according to its own situation. Therefore, even if the scheduling node corresponding to the target queue still schedules virtual machine tasks according to the queuing order, the queuing time is significantly shortened due to queue jumping or skipping.

[0062] Therefore, although the target virtual machine task may still need to go through multiple queuing processes from generation to final execution under the sequential scheduling link, it can jump the queue or even skip the queue when it is transferred to the target queue. Thus, the queuing time can be significantly shortened, and priority scheduling and flexible scheduling based on the target virtual machine task itself can be achieved, thereby improving scheduling flexibility and reducing scheduling failure rate.

[0063] This application does not limit the specific method for determining the target task information; for example, it can be set by the user or automatically generated. Please refer to... Figure 4 The diagram illustrates a method for determining target task information according to an embodiment of this application. The determination of target task information includes:

[0064] Step S401. Among the queues of the target link, determine the target queues that will participate in priority task scheduling.

[0065] This application does not limit the method of determining the target queue; several queues can be selected as target queues according to the actual situation. Priority task scheduling can be understood as an implementation of the aforementioned intelligent scheduling, that is, generating target task information based on the priority of the target virtual machine task, thereby realizing intelligent scheduling based on the target task information.

[0066] Step S402. Obtain priority configuration information, which indicates the correspondence between tasks and priorities; determine the target priority of the target virtual machine task based on the target virtual machine task and the priority configuration information.

[0067] Priority configuration information can be dynamically adjusted according to user needs. It records the correspondence between tasks and priorities. For example, virtual machine restart tasks have high priority, virtual machine hibernation tasks have low priority, and the number of priority levels and which virtual machine tasks each level corresponds to can be dynamically configured according to user needs. Then, by combining the specific task corresponding to the target virtual machine task with the priority configuration information, the target priority can be obtained. For example, if the target virtual machine task is a virtual machine restart task, then it has high priority.

[0068] Step S403. Determine the target task information based on the target priority and the target queue.

[0069] This application does not limit the specific method for determining the target task information based on the target priority and the target queue, and does not constitute an obstacle to implementation. It can be configured according to actual conditions; if the target priority is high, the target virtual machine task is allowed to jump the queue or even skip queues when it arrives at the scheduling node corresponding to the target queue. This application determines the target priority of the target virtual machine task based on priority configuration information, and then automatically obtains the target task information according to the target priority, thereby automatically implementing queue jumping or skipping according to priority, achieving the technical objective of flexibly and automatically achieving efficient scheduling of virtual machine tasks according to the user's dynamic needs.

[0070] In one embodiment, the virtual machine task scheduling system of this application includes each queue and a corresponding scheduling node. The target queue is also a queue in the virtual machine task scheduling system, and naturally each target queue has its corresponding scheduling node. Figure 1 For example, the virtual machine task scheduling system in this application embodiment can... Figure 1 Based on this, it can also include a first scheduling node, a second scheduling node, and a third scheduling node, corresponding to a first task queue, a second task queue, and a third task queue.

[0071] Unlike Figure 1 The difference lies in the fact that embodiments of this application also include related components for implementing intelligent scheduling. Please refer to... Figure 5 This diagram illustrates a virtual machine task scheduling system according to an embodiment of this application. The virtual machine task scheduling system can... Figure 1 Based on this, the virtual machine task scheduling method of the present application embodiment is obtained.

[0072] The virtual machine task scheduling system in this embodiment further includes a priority controller and an adjuster plugin corresponding to each of the aforementioned target queues. The priority controller is used to determine the corresponding target queue based on the adjuster plugin with which it communicates, and to obtain the aforementioned priority configuration information and determine the aforementioned target priority. Specifically, the queue configured with the adjuster plugin is the target queue. Figure 1 The virtual machine task scheduling system shown is a related technology. Figure 5 The virtual machine task scheduling system shown in this embodiment of the application, after receiving a target virtual machine task published by a user, transfers the target virtual machine task to the priority controller, which is located before each scheduling node. The target task information is determined through the interaction between the priority controller and each adjuster plugin; that is, the target task information can be generated in the priority controller.

[0073] Please refer to Figure 6 This illustration shows a schematic diagram of the execution process of the target task information determination method according to an embodiment of this application. The determination of the target task information based on the target priority and the target queue includes: the priority controller transmitting the target priority to each of the adjuster plug-ins; each adjuster plug-in determining a corresponding information value based on the target priority and existing virtual machine tasks in the corresponding target queue; reporting the information value to the priority controller; and the priority controller determining the target task information based on the information values ​​reported by each adjuster plug-in. Of course, the method by which each adjuster plug-in determines the corresponding information value based on the target priority and existing virtual machine tasks in the corresponding target queue is not limited in this embodiment and does not constitute an obstacle to implementation. For example, if the target priority is higher than the priority of all existing virtual machine tasks in the target queue, the information value can be set to "-1"; if the target priority is lower than the priority of all existing virtual machine tasks in the target queue, the information value can be set to "0"; or, based on the relationship between the target virtual machine task and existing virtual machine tasks in the target queue, a sequence number corresponding to the target position can be set to obtain the information value.

[0074] Specifically, the priority controller can read the user-preconfigured priority information. This step can be performed by the Master priority manager in the priority controller. Based on the target virtual machine task and the priority configuration information, the target priority of the target virtual machine task is determined. This target priority is then transmitted to the adjuster plugins corresponding to each target queue. Taking a virtual machine task scheduling system with three target queues as an example, each target queue can be configured with a corresponding adjuster plugin, thereby obtaining... Figure 6The system has three adjuster plugins, each reporting information values ​​to enable the priority controller to obtain target task information. This target task information includes information values ​​corresponding to three target queues, which can be... Figure 5 or Figure 1 The system consists of a first task queue, a second task queue, and a third task queue. This target task information can be transmitted along the target virtual machine task within the target link.

[0075] Clearly, the virtual machine task scheduling system in this embodiment is an extensible architecture. Specifically, an adjuster plugin can be configured for any queue. The adjuster plugin is an extensible plugin; if intelligent scheduling is required for a queue, the corresponding adjuster plugin needs to be configured, and a communication connection between the adjuster plugin and the priority controller needs to be established. Figure 1 and Figure 5 It can be seen that the addition of the adjuster plugin does not intrude on the original virtual machine task scheduling system, and the addition and deletion of the adjuster plugin can be flexibly configured according to the actual situation, realizing plug-and-play and deletion-and-stop functionality.

[0076] In this embodiment, each of the target queues includes a scheduler and an executor as its corresponding scheduling node. The executor processes virtual machine tasks according to the queuing order of the virtual machine tasks in the corresponding target queue. If it is not a target queue, intelligent scheduling is not required; the original scheduling node corresponding to the queue can be used instead. Figure 1 Like the scheduling nodes in [the context of the system], it includes pushers and executors. (Comparison) Figure 1 and Figure 5 It can be seen that the scheduling node corresponding to the target queue is... Figure 1 The scheduling nodes in this architecture differ from those in the original architecture, including the scheduler. The scheduler can replace the pusher at the corresponding position in the original architecture. The executor of the scheduling node corresponding to the target queue is... Figure 1 The executors of the scheduling nodes are the same, so we will not elaborate further. The scheduler of the scheduling node corresponding to the target queue is used to schedule the aforementioned target virtual machine tasks based on the target location indicated by the corresponding information value. For details, please refer to [link to relevant documentation]. Figure 7 The diagram illustrates an intelligent scheduling method according to an embodiment of this application. The method involves scheduling the target virtual machine task based on the target location indicated by the corresponding information value, including:

[0077] In step S701, if the target location indicates the location in the corresponding target queue, the scheduler inserts the target virtual machine task into the target location.

[0078] If the target location indicated by the information value corresponds to a position under normal queuing conditions, or if a sequence number corresponding to the target location is given, then the target location is determined to indicate a position in the corresponding target queue. Otherwise, the target location does not indicate a position in the corresponding target queue.

[0079] In step S702, if the target location does not indicate a position in the corresponding target queue, the scheduler skips the target queue and directly transmits the target virtual machine task to the executor.

[0080] Please refer to Figure 8 The diagram illustrates the intelligent scheduling process of an embodiment of this application. Figure 6 and Figure 8 All belong to Figure 5 The diagram illustrates the detailed execution process. When a target virtual machine task flows to a scheduling node corresponding to a target queue, the scheduler of that node extracts the corresponding information value from the target task information. Taking the second row of the target task information in Table 1 as an example, if the information value is "-1", the target queue is skipped directly, and the target virtual machine task is transmitted to the corresponding executor. Therefore, the target virtual machine task task-3 does not exist in the first task queue. Taking the third row of the target task information in Table 1 as an example, if the information value is "2", the target virtual machine task is directly inserted into the second position of the target queue, after task-1. After retrieving task-1, the executor can process the target virtual machine task.

[0081] contrast Figure 5 and Figure 1 It can be seen that the virtual machine task scheduling system in this application embodiment can... Figure 1 Based on the previous version, it only requires adding a priority controller and a scheduler at the scheduling node corresponding to the target queue, and configuring the scheduler plugin corresponding to the target queue as a plugin. The modification to the overall virtual machine task scheduling system is very small, and flexible virtual machine task scheduling can be achieved with low intrusion. Figure 5The virtual machine task scheduling system shown above includes a first scheduling node, multiple host machines, a second scheduling node corresponding to each host machine, and a third scheduling node corresponding to each second scheduling node. The first scheduling node is used to sequentially send each virtual machine task in the corresponding first task queue to the second scheduling node corresponding to the host machine where the virtual machine corresponding to the virtual machine task resides. The second scheduling node is used to sequentially send the virtual machines in the corresponding second task queue to the corresponding third scheduling node. The third scheduling node is used to sequentially lock and execute each virtual machine in the corresponding third task queue. Scheduling the target virtual machine task along the target link includes: sequentially passing the target virtual machine task through the first scheduling node, the second scheduling node, and the third scheduling node to complete execution. Therefore, Figure 5 The target link of the scheduled target virtual machine task and Figure 1 The attribute scheduling link framework is the same. Any one of the above-mentioned first task queue, second task queue, and third task queue can be the target queue, or all of them can be target queues. That is, the above-mentioned first task queue, second task queue, and third task queue can choose to participate in or not participate in intelligent scheduling.

[0082] contrast Figure 5 and Figure 1 As can be seen, the virtual machine task scheduling system proposed in this application still uses a sequential scheduling link. The framework of the target link remains unchanged compared to the sequential scheduling link framework of related technologies. Therefore, the virtual machine task scheduling method executed based on this virtual machine task scheduling system in this application is still suitable for cloud computing environments. The difference lies in that this application embodiment can achieve intelligent scheduling at the scheduling node corresponding to the target queue. Intelligent scheduling allows target virtual machine tasks to jump the queue or even skip queues to reduce queuing time and achieve flexible scheduling.

[0083] To achieve intelligent scheduling, this application embodiment adds a priority controller and sets up an adjuster plugin for the target queues participating in intelligent scheduling, and sets up a scheduler for the scheduling nodes corresponding to the target queues participating in intelligent scheduling. The addition of the priority controller and scheduler is low-intrusive, and the addition of the adjuster plugin is non-intrusive and scalable. Therefore, this application embodiment achieves intelligent scheduling of the scheduling node corresponding to any target queue without significantly modifying the sequential scheduling link architecture of related technologies. Moreover, the intelligent scheduling fully considers the priority of the target virtual machine task and the priority configuration information dynamically set by the user, achieving the technical purpose of supporting flexible user configuration and automatic scheduling. It has broad application prospects, meets the diverse needs of users, and makes tasks run more efficiently.

[0084] The following are embodiments of the apparatus of this application, which can be used to execute embodiments of the method of this application. For details not disclosed in the apparatus embodiments of this application, please refer to the embodiments of the method of this application.

[0085] Please refer to Figure 9 This diagram illustrates a block diagram of a virtual machine task scheduling apparatus according to an embodiment of this application. The apparatus has the function of implementing the above-described virtual machine task scheduling method; this function can be implemented in hardware or by hardware executing corresponding software. The apparatus can be a computer device or can be installed within a computer device. The apparatus may include:

[0086] The virtual machine task acquisition module 901 is used to determine the target task information when the target virtual machine task is acquired. The target task information includes the information value corresponding to each target queue in the target link. The information value indicates the corresponding target position. The target link is a sequential scheduling link. The virtual machine tasks in each queue in the target link are scheduled and processed by the scheduling node corresponding to the queue in the queuing order.

[0087] The virtual machine task scheduling module 902 is used to schedule the target virtual machine task according to the target location indicated by the corresponding information value when the target virtual machine task is scheduled to any scheduling node corresponding to the target queue, in the case of target virtual machine task scheduling along the target link.

[0088] In one exemplary implementation, when the above information value is a first preset value, the indicated target location does not belong to the location in the corresponding target queue;

[0089] When the above information value is the second preset value, the indicated target location is the location corresponding to the normal queuing situation;

[0090] If the above information value is neither the first preset value nor the second preset value, the above information value is the position number of the above target location in the corresponding target queue.

[0091] In one exemplary implementation, determining the target task information includes:

[0092] Among the queues mentioned above in the target links, determine the target queues that will participate in priority task scheduling;

[0093] Obtain priority configuration information, which indicates the correspondence between tasks and priorities;

[0094] Based on the target virtual machine task and the priority configuration information, determine the target priority of the target virtual machine task.

[0095] Based on the aforementioned target priorities and target queues, the aforementioned target task information is determined.

[0096] In one exemplary embodiment, the above-described apparatus is applied to a virtual machine task scheduling system. The virtual machine task scheduling system includes each target queue and a corresponding scheduling node. Each scheduling node corresponding to a target queue includes a scheduler and an executor. The executor is used to process virtual machine tasks according to the queuing order of virtual machine tasks in the corresponding target queue. The corresponding scheduling of the target virtual machine tasks based on the target position indicated by the corresponding information value includes:

[0097] When the target location indicates the position in the corresponding target queue, the scheduler inserts the target virtual machine task into the target location.

[0098] If the target location does not indicate a corresponding position in the target queue, the scheduler skips the target queue and directly transmits the target virtual machine task to the executor.

[0099] 5. The method according to claim 4, wherein the virtual machine task scheduling system includes a priority controller and an adjuster plugin corresponding to each of the target queues; the priority controller is used to determine the corresponding target queue based on the adjuster plugin with which it communicates, and to obtain the priority configuration information and determine the target priority.

[0100] In one exemplary implementation, determining the target task information based on the target priority and the target queue includes:

[0101] The aforementioned priority controller transmits the aforementioned target priority to each of the aforementioned adjuster plug-ins;

[0102] Each of the aforementioned adjuster plugins determines the corresponding information value based on the aforementioned target priority and the existing virtual machine tasks in the corresponding target queue; and reports the aforementioned information value to the aforementioned priority controller;

[0103] The priority controller determines the target task information based on the information values ​​reported by each of the aforementioned adjuster plug-ins.

[0104] In one exemplary embodiment, the virtual machine task scheduling system includes a first scheduling node, multiple host machines, a second scheduling node corresponding to each host machine, and a third scheduling node corresponding to each second scheduling node.

[0105] The first scheduling node is used to send each virtual machine task in the corresponding first task queue to the second scheduling node corresponding to the host machine where the virtual machine corresponding to the virtual machine task is located.

[0106] The aforementioned second scheduling node is used to sequentially send the virtual machines in the corresponding second task queue to the corresponding third scheduling node;

[0107] The aforementioned third scheduling node is used to lock and execute each virtual machine in the corresponding third task queue in sequence;

[0108] The above-mentioned scheduling of the target virtual machine task along the target link includes: passing the target virtual machine task sequentially through the first scheduling node, the second scheduling node, and the third scheduling node to complete the execution.

[0109] In one exemplary embodiment, any one of the first task queue, the second task queue, and the third task queue is the target queue.

[0110] It should be noted that the apparatus provided in the above embodiments is only illustrated by the division of the above functional modules when implementing its functions. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above. In addition, the apparatus and method embodiments provided in the above embodiments belong to the same concept, and the specific implementation process can be found in the method embodiments, which will not be repeated here.

[0111] Please refer to Figure 10 This document illustrates a structural block diagram of a computer device provided in one embodiment of this application, used to execute the aforementioned virtual machine task scheduling method. The computer device may be a server. Specifically:

[0112] Computer device 1000 includes a central processing unit (CPU) 1001, a system memory 1004 including random access memory (RAM) 1002 and read-only memory (ROM) 1003, and a system bus 1005 connecting the system memory 1004 and the CPU 1001. Computer device 1000 also includes a basic input / output system (I / O system) 1006 to facilitate information transfer between various devices within the computer, and a mass storage device 1007 for storing the operating system 1013, application programs 1014, and other program modules 1015.

[0113] The basic input / output system 1006 includes a display 1008 for displaying information and an input device 1009 for user input, such as a mouse or keyboard. Both the display 1008 and the input device 1009 are connected to the central processing unit 1001 via an input / output controller 1010 connected to the system bus 1005. The basic input / output system 1006 may also include the input / output controller 1010 for receiving and processing input from multiple other devices such as a keyboard, mouse, or electronic stylus. Similarly, the input / output controller 1010 also provides output to a display screen, printer, or other types of output devices.

[0114] Mass storage device 1007 is connected to central processing unit 1001 via a mass storage controller (not shown) connected to system bus 1005. Mass storage device 1007 and its associated computer-readable media provide non-volatile storage for computer device 1000. That is, mass storage device 1007 may include computer-readable media (not shown) such as hard disk or CD-ROM (Compact Disc Read-Only Memory) drive.

[0115] Without loss of generality, computer-readable media can include computer storage media and communication media. Computer storage media includes volatile and non-volatile, removable and non-removable media implemented using any method or technology for storing information such as computer-readable instructions, data structures, program modules, or other data. Computer storage media include RAM, ROM, EPROM (Erasable Programmable Read-Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), flash memory or other solid-state storage technologies, CD-ROM, DVD (Digital Video Disc) or other optical storage, magnetic tape cassettes, magnetic tape, disk storage, or other magnetic storage devices. Of course, those skilled in the art will recognize that computer storage media are not limited to the above-mentioned types. The system memory 1004 and mass storage device 1007 described above can be collectively referred to as memory.

[0116] According to various embodiments of this application, the computer device 1000 can also be connected to a remote computer on a network, such as the Internet. That is, the computer device 1000 can be connected to the network 1012 via the network interface unit 1011 connected to the system bus 1005, or the network interface unit 1011 can be used to connect to other types of networks or remote computer systems (not shown).

[0117] The aforementioned memory also includes a computer program stored in the memory and configured to be executed by one or more processors to implement the aforementioned virtual machine task scheduling method.

[0118] In an exemplary embodiment, a computer-readable storage medium is also provided, wherein at least one instruction, at least one program, code set, or instruction set is stored therein, wherein the at least one instruction, at least one program, code set, or instruction set is executed by a processor to implement the virtual machine task scheduling method.

[0119] Specifically, the virtual machine task scheduling method includes:

[0120] Once the target virtual machine task is obtained, the target task information is determined. The target task information includes the information value corresponding to each target queue in the target link. The information value indicates the corresponding target position. The target link is a sequential scheduling link. The virtual machine tasks in each queue in the target link are scheduled and processed by the scheduling node corresponding to the queue in the queuing order.

[0121] When scheduling target virtual machine tasks along the aforementioned target link, when a target virtual machine task is scheduled to any of the aforementioned target queues corresponding to a scheduling node, the target virtual machine task is scheduled accordingly based on the target location indicated by the corresponding information value.

[0122] In one exemplary implementation, when the above information value is a first preset value, the indicated target location does not belong to the location in the corresponding target queue;

[0123] When the above information value is the second preset value, the indicated target location is the location corresponding to the normal queuing situation;

[0124] If the above information value is neither the first preset value nor the second preset value, the above information value is the position number of the above target location in the corresponding target queue.

[0125] In one exemplary implementation, determining the target task information includes:

[0126] Among the queues mentioned above in the target links, determine the target queues that will participate in priority task scheduling;

[0127] Obtain priority configuration information, which indicates the correspondence between tasks and priorities;

[0128] Based on the target virtual machine task and the priority configuration information, determine the target priority of the target virtual machine task.

[0129] Based on the aforementioned target priorities and target queues, the aforementioned target task information is determined.

[0130] In an exemplary embodiment, the above method is applied to a virtual machine task scheduling system, which includes each target queue and a corresponding scheduling node. Each scheduling node corresponding to a target queue includes a scheduler and an executor. The executor processes virtual machine tasks according to the queuing order of virtual machine tasks in the corresponding target queue. The corresponding scheduling of the target virtual machine tasks based on the target position indicated by the corresponding information value includes:

[0131] When the target location indicates the position in the corresponding target queue, the scheduler inserts the target virtual machine task into the target location.

[0132] If the target location does not indicate a corresponding position in the target queue, the scheduler skips the target queue and directly transmits the target virtual machine task to the executor.

[0133] In one exemplary embodiment, the virtual machine task scheduling system includes a priority controller and an adjuster plugin corresponding to each of the target queues; the priority controller is used to determine the corresponding target queue based on the adjuster plugin with which it communicates, and to obtain the priority configuration information and determine the target priority.

[0134] In one exemplary implementation, determining the target task information based on the target priority and the target queue includes:

[0135] The aforementioned priority controller transmits the aforementioned target priority to each of the aforementioned adjuster plug-ins;

[0136] Each of the aforementioned adjuster plugins determines the corresponding information value based on the aforementioned target priority and the existing virtual machine tasks in the corresponding target queue; and reports the aforementioned information value to the aforementioned priority controller;

[0137] The priority controller determines the target task information based on the information values ​​reported by each of the aforementioned adjuster plug-ins.

[0138] In one exemplary embodiment, the virtual machine task scheduling system includes a first scheduling node, multiple host machines, a second scheduling node corresponding to each host machine, and a third scheduling node corresponding to each second scheduling node.

[0139] The first scheduling node is used to send each virtual machine task in the corresponding first task queue to the second scheduling node corresponding to the host machine where the virtual machine corresponding to the virtual machine task is located.

[0140] The aforementioned second scheduling node is used to sequentially send the virtual machines in the corresponding second task queue to the corresponding third scheduling node;

[0141] The aforementioned third scheduling node is used to lock and execute each virtual machine in the corresponding third task queue in sequence;

[0142] The above-mentioned scheduling of the target virtual machine task along the target link includes: passing the target virtual machine task sequentially through the first scheduling node, the second scheduling node, and the third scheduling node to complete the execution.

[0143] In one exemplary embodiment, any one of the first task queue, the second task queue, and the third task queue is the target queue.

[0144] Optionally, the computer-readable storage medium may include: ROM (Read-Only Memory), RAM (Random Access Memory), SSD (Solid State Drive), or optical disc, etc. The random access memory may include ReRAM (Resistant Random Access Memory) and DRAM (Dynamic Random Access Memory).

[0145] In an exemplary embodiment, a computer program product or computer program is also provided, which includes computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the virtual machine task scheduling method or recommended method described above.

[0146] It should be understood that "multiple" as used herein refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. Furthermore, the step numbers described herein are merely illustrative of one possible execution order. In some other embodiments, the steps may not be executed in numerical order, such as two steps with different numbers being executed simultaneously, or two steps with different numbers being executed in the reverse order of the illustration. This application does not limit this.

[0147] In addition, in the specific embodiments of this application, data such as user information are involved. When the above embodiments of this application are applied to specific products or technologies, user permission or consent is required, and the collection, use and processing of related data must comply with the relevant laws, regulations and standards of the relevant countries and regions.

[0148] The above are merely exemplary embodiments of this application and are not intended to limit this application. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application shall be included within the protection scope of this application.

Claims

1. A virtual machine task scheduling method, characterized in that, The method includes: Upon obtaining the target virtual machine task, the target task information is determined. The target task information includes the information value corresponding to each target queue in the target link. The information value indicates the corresponding target position. The target link is a sequential scheduling link, and the virtual machine tasks in each queue in the target link are scheduled and processed by the scheduling node corresponding to the queue in queuing order. When scheduling a target virtual machine task along the target link, when the target virtual machine task is scheduled to any scheduling node corresponding to the target queue, the target virtual machine task is scheduled accordingly based on the target location indicated by the corresponding information value.

2. The method according to claim 1, characterized in that, If the information value is a first preset value, the indicated target location does not belong to the corresponding target queue. When the information value is the second preset value, the indicated target location belongs to the location corresponding to the normal queuing situation; If the information value is neither the first preset value nor the second preset value, the information value is the position number of the target location in the corresponding target queue.

3. The method according to claim 1 or 2, characterized in that, The information used to determine the target task includes: Among the queues of the target link, the target queues participating in priority task scheduling are determined; Obtain priority configuration information, which indicates the correspondence between tasks and priorities; Based on the target virtual machine task and the priority configuration information, determine the target priority of the target virtual machine task; The target task information is determined based on the target priority and the target queue.

4. The method according to claim 3, characterized in that, The method is applied to a virtual machine task scheduling system, which includes each target queue and a corresponding scheduling node. Each scheduling node corresponding to a target queue includes a scheduler and an executor. The executor processes virtual machine tasks according to the queuing order of virtual machine tasks in the corresponding target queue. The step of scheduling the target virtual machine tasks based on the target position indicated by the corresponding information value includes: When the target location indicates the position in the corresponding target queue, the scheduler inserts the target virtual machine task into the target location; If the target location does not indicate a corresponding position in the target queue, the scheduler skips the target queue and directly transmits the target virtual machine task to the executor.

5. The method according to claim 4, characterized in that, The virtual machine task scheduling system includes a priority controller and an adjuster plugin corresponding to each target queue; the priority controller is used to determine the corresponding target queue based on the adjuster plugin with which it communicates, and to obtain the priority configuration information and determine the target priority.

6. The method according to claim 5, characterized in that, The step of determining the target task information based on the target priority and the target queue includes: The priority controller transmits the target priority to each of the adjuster plug-ins; Each of the aforementioned adjuster plugins determines a corresponding information value based on the target priority and the existing virtual machine tasks in the corresponding target queue; and reports the information value to the priority controller; The priority controller determines the target task information based on the information values ​​reported by each of the adjuster plug-ins.

7. The method according to claim 5, characterized in that, The virtual machine task scheduling system includes a first scheduling node, multiple host machines, a second scheduling node corresponding to each host machine, and a third scheduling node corresponding to each second scheduling node. The first scheduling node is used to send each virtual machine task in the corresponding first task queue to the second scheduling node corresponding to the host machine where the virtual machine corresponding to the virtual machine task is located; The second scheduling node is used to send the virtual machines in the corresponding second task queue to the corresponding third scheduling node in sequence; The third scheduling node is used to lock and execute each virtual machine in the corresponding third task queue in sequence. The step of scheduling the target virtual machine task along the target link includes: sequentially passing the target virtual machine task through the first scheduling node, the second scheduling node, and the third scheduling node to complete the execution.

8. The method according to claim 7, characterized in that, The first task queue, the second task queue, and the third task queue are all the target queues.

9. A virtual machine task scheduling device, characterized in that, The device includes: The virtual machine task acquisition module is used to determine the target task information when a target virtual machine task is acquired. The target task information includes the information value corresponding to each target queue in the target link. The information value indicates the corresponding target position. The target link is a sequential scheduling link. The virtual machine tasks in each queue in the target link are scheduled and processed by the scheduling node corresponding to the queue in the queuing order. The virtual machine task scheduling module is used to schedule the target virtual machine task according to the target location indicated by the corresponding information value when the target virtual machine task is scheduled to any scheduling node corresponding to the target queue, in the case of target virtual machine task scheduling along the target link.

10. A computer device, characterized in that, The computer device includes a processor and a memory, wherein the memory stores at least one instruction, at least one program, a code set, or an instruction set, and the at least one instruction, the at least one program, the code set, or the instruction set is loaded and executed by the processor to implement the virtual machine task scheduling method as described in any one of claims 1 to 8.

11. A computer-readable storage medium, characterized in that, The storage medium stores at least one instruction, at least one program, code set, or instruction set, wherein the at least one instruction, the at least one program, the code set, or the instruction set is loaded and executed by a processor to implement the virtual machine task scheduling method as described in any one of claims 1 to 8.

12. A computer program product, characterized in that, The computer program product includes computer instructions, the processor of the computer device reads the computer instructions, and the processor of the computer device executes the computer instructions to implement the virtual machine task scheduling method as described in any one of claims 1 to 8.

Images