CN116755832A - Virtual machine starting set scheduling design method - Google Patents
Virtual machine starting set scheduling design method Download PDFInfo
- Publication number
- CN116755832A CN116755832A CN202310561866.9A CN202310561866A CN116755832A CN 116755832 A CN116755832 A CN 116755832A CN 202310561866 A CN202310561866 A CN 202310561866A CN 116755832 A CN116755832 A CN 116755832A
- Authority
- CN
- China
- Prior art keywords
- virtual machine
- starting
- scheduling
- flow
- resources
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000013461 design Methods 0.000 title claims abstract description 19
- 230000005012 migration Effects 0.000 claims abstract description 33
- 238000013508 migration Methods 0.000 claims abstract description 33
- 238000002360 preparation method Methods 0.000 claims abstract description 10
- 230000008569 process Effects 0.000 claims description 10
- 230000002159 abnormal effect Effects 0.000 claims description 4
- 230000005856 abnormality Effects 0.000 claims description 4
- 238000004590 computer program Methods 0.000 claims description 3
- 238000005304 joining Methods 0.000 claims description 3
- 230000004044 response Effects 0.000 claims description 3
- 238000003860 storage Methods 0.000 claims description 2
- 238000004140 cleaning Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5022—Mechanisms to release resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5077—Logical partitioning of resources; Management or configuration of virtualized resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/45562—Creating, deleting, cloning virtual machine instances
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/4557—Distribution of virtual machine instances; Migration and load balancing
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Stored Programmes (AREA)
Abstract
The application provides a virtual machine starting set scheduling design method, which comprises the following steps: creating a virtual machine by utilizing a virtual machine creation flow; adding a starting set flow by using a virtual machine to finish a resource preparation starting flow; scheduling resources required by the preparation migration of the target host by utilizing the migration flow of the virtual machine, and starting the migration flow; and scheduling resources required by the target host to be rebuilt by using the virtual machine rebuilding flow, and starting the rebuilding flow. The scheme ensures that after the virtual machines are added into the starting set, the virtual machines are forced to be non-affinitive, and concurrent operation is supported; ensuring that the virtual machines which are added into the starting set are still forced to be non-affinitive with other virtual machines when the virtual machines are migrated, expanded and rebuilt, and are on different hosts; optimizing virtual machine scheduling logic, integrating starting set scheduling and host resource scheduling into one scheduling interface, and simplifying scheduling logic arranged in each flow; and the accuracy of the starting set resources and the host resources of the computing service is improved through resource preemption and resource cleaning.
Description
Technical Field
The application belongs to the field of cloud computing, and particularly relates to a virtual machine starting set scheduling design method.
Background
The virtual machine firstly performs resource scheduling before creation, and performs resource preemption after determining the host computer to which the virtual machine belongs, wherein the preemption resources comprise cpu, memory and local disk capacity.
The boot set is a set of virtual machines for controlling affinity between virtual machines, and currently only a boot set of a forced non-affinity type is supported, and virtual machines in the same boot set must be distributed on different hosts. When the virtual machines are created, a starting set can be designated, and then the hosts where all the virtual machines under the starting set are located are added into a dispatching blacklist by dispatching, so that the non-affinity among the virtual machines is ensured.
After the virtual machine is created, the virtual machine can also be independently operated to be added into a certain starting set, and if the virtual machine on the same host exists under the starting set, the migration operation is triggered, and a new host is rescheduled. However, if multiple virtual machines on a host join the same boot set concurrently, successful joining of the boot set may occur without triggering virtual machine migration. By analysis, the traditional virtual machine joining start set and resource scheduling are separated, and concurrency risks exist, so that the start set and the resource scheduling need to be fused.
If the virtual machine is added with the starting set, the starting set is also considered when the virtual machine performs operations such as migration and reconstruction, and a scheduling interface with stronger functions is provided by using the starting set for scheduling, so that various scenes can be perfectly compatible, and meanwhile, the flow design of the virtual machine can be simplified. When the scheduling is completed, the scheduling service performs a series of operations according to the scheduled host, and if an abnormality occurs, the resources to be pre-occupied by the scheduling are released.
Disclosure of Invention
In view of the above, the present application is directed to a virtual machine boot set scheduling design method, which at least solves at least one problem in the background art.
In order to achieve the above purpose, the technical scheme of the application is realized as follows:
a virtual machine startup set scheduling design method comprises the following steps:
creating a virtual machine by utilizing a virtual machine creation flow;
adding a starting set flow by using a virtual machine to finish a resource preparation starting flow;
scheduling resources required by the preparation migration of the target host by utilizing the migration flow of the virtual machine, and starting the migration flow;
and scheduling resources required by the target host to be rebuilt by using the virtual machine rebuilding flow, and starting the rebuilding flow.
Further, in the virtual machine creation process, the method specifically includes:
a1, analyzing a virtual machine to create a delivery bill;
a2, if the delivery list in the step A1 contains a starting set, calling a starting set scheduling interface, and if the starting set does not exist, calling a common host resource scheduling interface;
a3, obtaining a target host, preparing a series of resources, and storing parameters required by starting set scheduling resource release in a thread cache;
a4, if abnormality occurs in the process of preparing the resources, the prepared parameters are taken out from the thread cache, and the starting set scheduling release interface is called to release the occupied resources;
a5, preparing resources, namely preparing a release pre-occupied resource, and starting a virtual machine creation flow;
a6, if the created flow is abnormal and cannot be repaired, after the rollback operation is executed, calling a startup set scheduling release interface according to the released pre-occupied resources stored in the database before after the rollback operation is completed, and releasing the pre-occupied startup set resources and host resources;
and A7, if the flow is successfully executed, completing virtual machine creation.
Further, the virtual machine joins the startup set flow, specifically including:
b1, analyzing a delivery list of a starting set;
b2, calling a computing service starting set scheduling interface to preempt starting set resources;
b3, according to the response result of the starting set scheduling interface, preparing resource parameters required by migration if migration is required, and preparing resources added into the starting set if migration is not required;
and B4, completing resource preparation and starting a flow.
Further, the virtual machine migration process specifically includes:
c1, analyzing a migration delivery form;
c2, inquiring details of the virtual machine, and checking whether the virtual machine is added with a starting set;
c3, if the virtual machine is added with the starting set, calling a starting set scheduling interface, and if the virtual machine is not provided with the starting set, calling a common host resource scheduling interface;
and C4, dispatching out the target host, preparing resources required by migration, and starting a migration flow.
Further, the virtual machine rebuilding process specifically includes:
d1, analyzing and reconstructing a delivery list;
d2, inquiring details of the virtual machine, and checking whether the virtual machine is added with a starting set;
d3, if the virtual machine is added with the starting set, calling a starting set scheduling interface, and if the virtual machine is not provided with the starting set, calling a common host resource scheduling interface;
and D4, dispatching out the target host, preparing resources required by reconstruction, and starting a reconstruction flow.
Further, the scheme discloses electronic equipment, which comprises a processor and a memory, wherein the memory is in communication connection with the processor and is used for storing executable instructions of the processor, and the processor is used for executing a virtual machine starting set scheduling design method.
Further, the present solution discloses a server, including at least one processor, and a memory communicatively connected to the processor, where the memory stores instructions executable by the at least one processor, and the instructions are executed by the processor, so that the at least one processor performs a virtual machine boot set scheduling design method.
Further, the present solution discloses a computer readable storage medium storing a computer program, which when executed by a processor, implements a virtual machine startup set scheduling design method.
Compared with the prior art, the virtual machine starting set scheduling design method has the following beneficial effects:
the virtual machine starting set scheduling design method ensures that virtual machines are forced to be non-affinitive after being added into a starting set, and supports concurrent operation; ensuring that the virtual machines which are added into the starting set are still forced to be non-affinitive with other virtual machines when the virtual machines are migrated, expanded and rebuilt, and are on different hosts; optimizing virtual machine scheduling logic, integrating starting set scheduling and host resource scheduling into one scheduling interface, and simplifying scheduling logic arranged in each flow; and the accuracy of the starting set resources and the host resources of the computing service is improved through resource preemption and resource cleaning.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the application. In the drawings:
FIG. 1 is a schematic diagram of a startup set scheduling logic according to an embodiment of the present application;
fig. 2 is a schematic diagram of a startup set scheduling exception handling logic according to an embodiment of the present application.
Detailed Description
It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be combined with each other.
The application will be described in detail below with reference to the drawings in connection with embodiments.
Virtual machine creation flow:
1. the resolution virtual machine creates a delivery sheet.
2. If the delivery sheet contains a startup set, a startup set scheduling interface is invoked. If there is no boot set, the common host resource scheduling interface is invoked.
3. A target host is obtained and a series of resources are prepared. And the parameters required by the starting set to schedule the resource release are stored in the thread cache.
4. If the process of preparing the resources is abnormal, the prepared parameters are taken out from the thread cache, the starting set scheduling release interface is called, and the occupied resources are released.
5. The resource preparation is completed, a piece of release pre-occupied resource is prepared, and the virtual machine creation flow is started.
6. If the creation flow is abnormal and cannot be repaired, after the rollback operation is executed, the startup set scheduling release interface is called according to the released pre-occupied resources stored in the database before after the rollback operation is completed, and the pre-occupied startup set resources and host resources are released.
7. If the flow is successfully executed, the virtual machine creation is completed.
The virtual machine joins the startup set flow:
1. and analyzing the start set delivery list.
2. And calling a computing service startup set scheduling interface to preempt startup set resources.
3. And according to the response result of the startup set scheduling interface, preparing the resource parameters required by migration if migration is required, and preparing the resources added into the startup set if migration is not required.
4. And (5) completing resource preparation and starting a flow.
Virtual machine migration flow:
1. and analyzing the migration delivery form.
2. And inquiring details of the virtual machine, and checking whether the virtual machine is added into the starting set.
3. And if the virtual machine joins the startup set, calling a startup set scheduling interface. If there is no boot set, the common host resource scheduling interface is invoked.
4. And dispatching out the target host, preparing resources required by migration, and starting a migration flow.
Virtual machine rebuilding flow:
1. and analyzing and reconstructing the delivery form.
2. And inquiring details of the virtual machine, and checking whether the virtual machine is added into the starting set.
3. And if the virtual machine joins the startup set, calling a startup set scheduling interface. If there is no boot set, the common host resource scheduling interface is invoked.
4. And dispatching out the target host, preparing the resources required by reconstruction, and starting a reconstruction flow.
In the specific implementation process, the steps are as follows:
1 start set scheduling
1.1, locking a starting set;
1.2, inquiring all virtual machines and hosts where the virtual machines are located under the starting;
1.3 judging whether the host id of the newly added virtual machine exists;
1.4 if the host id already exists, triggering scheduling, setting all hosts under a startup set as a scheduling blacklist, scheduling a new host, and then camping on a startup set record, wherein the startup set record mainly comprises a virtual machine id, a startup set id and a host id;
1.5 if the host id does not exist, the scheduling is not triggered, and a start set record is directly preempted;
1.6, returning a starting set preemption result, wherein the starting set preemption result mainly comprises whether the virtual machine needs to be migrated or not and the detail information of the target host;
1.7, starting set unlocking;
and 1.8, performing corresponding processing according to the scheduling result.
2 start set scheduling resource release
2.1 after startup set scheduling, one startup set of data will be preempted, and if a new host needs to be scheduled, host resources will also be preempted. If the scheduling is successful and an abnormality occurs when other logic is processed, a starting set release interface is required to be adjusted to release the pre-occupied starting set and host resources;
2.2 orchestration 2.0 supporting flow rollback, if a rollback operation is performed, the computed boot set schedule release interface also needs to be tuned after rollback is completed to release the preempted boot set and host resources.
Those of ordinary skill in the art will appreciate that the elements and method steps of each example described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the elements and steps of each example have been described generally in terms of functionality in the foregoing description to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
In the several embodiments provided in the present application, it should be understood that the disclosed methods and systems may be implemented in other ways. For example, the above-described division of units is merely a logical function division, and there may be another division manner when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted or not performed. The units may or may not be physically separate, and components shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment of the present application.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the application, and are intended to be included within the scope of the appended claims and description.
The foregoing description of the preferred embodiments of the application is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the application.
Claims (8)
1. The virtual machine starting set scheduling design method is characterized by comprising the following steps of:
creating a virtual machine by utilizing a virtual machine creation flow;
adding a starting set flow by using a virtual machine to finish a resource preparation starting flow;
scheduling resources required by the preparation migration of the target host by utilizing the migration flow of the virtual machine, and starting the migration flow;
and scheduling resources required by the target host to be rebuilt by using the virtual machine rebuilding flow, and starting the rebuilding flow.
2. The method for designing the virtual machine startup set schedule according to claim 1, wherein in the virtual machine creation process, the method specifically comprises:
a1, analyzing a virtual machine to create a delivery bill;
a2, if the delivery list in the step A1 contains a starting set, calling a starting set scheduling interface, and if the starting set does not exist, calling a common host resource scheduling interface;
a3, obtaining a target host, preparing a series of resources, and storing parameters required by starting set scheduling resource release in a thread cache;
a4, if abnormality occurs in the process of preparing the resources, the prepared parameters are taken out from the thread cache, and the starting set scheduling release interface is called to release the occupied resources;
a5, preparing resources, namely preparing a release pre-occupied resource, and starting a virtual machine creation flow;
a6, if the created flow is abnormal and cannot be repaired, after the rollback operation is executed, calling a startup set scheduling release interface according to the released pre-occupied resources stored in the database before after the rollback operation is completed, and releasing the pre-occupied startup set resources and host resources;
and A7, if the flow is successfully executed, completing virtual machine creation.
3. The virtual machine boot set scheduling design method according to claim 2, wherein: the virtual machine joining in the starting set flow specifically comprises:
b1, analyzing a delivery list of a starting set;
b2, calling a computing service starting set scheduling interface to preempt starting set resources;
b3, according to the response result of the starting set scheduling interface, preparing resource parameters required by migration if migration is required, and preparing resources added into the starting set if migration is not required;
and B4, completing resource preparation and starting a flow.
4. The virtual machine boot set scheduling design method of claim 3, wherein: the virtual machine migration process specifically comprises the following steps:
c1, analyzing a migration delivery form;
c2, inquiring details of the virtual machine, and checking whether the virtual machine is added with a starting set;
c3, if the virtual machine is added with the starting set, calling a starting set scheduling interface, and if the virtual machine is not provided with the starting set, calling a common host resource scheduling interface;
and C4, dispatching out the target host, preparing resources required by migration, and starting a migration flow.
5. The virtual machine boot set scheduling design method of claim 3, wherein: the virtual machine rebuilding process specifically comprises the following steps:
d1, analyzing and reconstructing a delivery list;
d2, inquiring details of the virtual machine, and checking whether the virtual machine is added with a starting set;
d3, if the virtual machine is added with the starting set, calling a starting set scheduling interface, and if the virtual machine is not provided with the starting set, calling a common host resource scheduling interface;
and D4, dispatching out the target host, preparing resources required by reconstruction, and starting a reconstruction flow.
6. An electronic device comprising a processor and a memory communicatively coupled to the processor for storing processor-executable instructions, characterized in that: the processor is configured to execute a virtual machine boot set scheduling design method as set forth in any one of claims 1-5.
7. A server, characterized by: comprising at least one processor and a memory communicatively coupled to the processor, the memory storing instructions executable by the at least one processor to cause the at least one processor to perform a virtual machine boot set scheduling method as claimed in any one of claims 1-5.
8. A computer-readable storage medium storing a computer program, characterized in that: the computer program, when executed by a processor, implements a virtual machine boot set scheduling design method as claimed in any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310561866.9A CN116755832A (en) | 2023-05-18 | 2023-05-18 | Virtual machine starting set scheduling design method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310561866.9A CN116755832A (en) | 2023-05-18 | 2023-05-18 | Virtual machine starting set scheduling design method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116755832A true CN116755832A (en) | 2023-09-15 |
Family
ID=87950454
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310561866.9A Pending CN116755832A (en) | 2023-05-18 | 2023-05-18 | Virtual machine starting set scheduling design method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116755832A (en) |
-
2023
- 2023-05-18 CN CN202310561866.9A patent/CN116755832A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11960915B2 (en) | Method and apparatus for creating virtual machine based on parameter information of a virtual network interface card | |
| US8230264B2 (en) | System evaluation apparatus | |
| EP2600246B1 (en) | Batch processing of business objects | |
| US10050900B2 (en) | Methods and systems for allocating and provisioning computing resources | |
| US20170322826A1 (en) | Setting support program, setting support method, and setting support device | |
| CN107203560B (en) | Database, multi-database operation transaction consistency ensuring method and system | |
| CN111897558A (en) | Kubernets upgrading method and device for container cluster management system | |
| CN107612950B (en) | Method, device and system for providing service and electronic equipment | |
| US20110185360A1 (en) | Multiprocessing transaction recovery manager | |
| CN113157411B (en) | Celery-based reliable configurable task system and device | |
| CN111400011A (en) | Real-time task scheduling method, system, equipment and readable storage medium | |
| WO2009089746A1 (en) | Method, device and system for realizing task in cluster environment | |
| CN105653356A (en) | Method and device for processing multi-server concurrent operation | |
| CN112925614A (en) | Distributed transaction processing method, device, medium and equipment | |
| CN111258726A (en) | Task scheduling method and device | |
| CN109508223A (en) | A kind of virtual machine batch creation method, system and equipment | |
| CN112559525B (en) | Data checking system, method, device and server | |
| CN116755832A (en) | Virtual machine starting set scheduling design method | |
| CN111143041A (en) | Data consistency method, distributed coordinator and central coordinator | |
| CN114443295B (en) | Heterogeneous cloud resource management scheduling method, device and system | |
| CN115934272A (en) | Online batch task processing method and device | |
| GB2335516A (en) | Failure recovery in distributed transaction avoids heuristic damage | |
| US20120185839A1 (en) | Program execution method, computer system, and program execution control program | |
| CN117389713B (en) | Storage system application service data migration method, device, equipment and medium | |
| CN112003744B (en) | Backup recovery method and system for cloud platform service cluster |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |