CN115309592B - Resource scheduling method and device, computer equipment and storage medium - Google Patents
Resource scheduling method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN115309592B CN115309592B CN202211065521.6A CN202211065521A CN115309592B CN 115309592 B CN115309592 B CN 115309592B CN 202211065521 A CN202211065521 A CN 202211065521A CN 115309592 B CN115309592 B CN 115309592B
- Authority
- CN
- China
- Prior art keywords
- queue
- machine room
- target
- job
- physical cluster
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/16—Error detection or correction of the data by redundancy in hardware
- G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
- G06F11/202—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where processing functionality is redundant
- G06F11/2023—Failover techniques
- G06F11/203—Failover techniques using migration
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Quality & Reliability (AREA)
- Telephonic Communication Services (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The disclosure provides a resource scheduling method, a device, a computer device and a storage medium, wherein the method comprises the following steps: receiving a job request; responding to the job request, and distributing a first logic machine room queue for the target job by utilizing a hierarchical relationship among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model based on the job type of the target job; responding to the abnormality of at least one cluster queue associated under the first logic machine room queue, and determining a second logic machine room queue under the queue naming space queue based on the job type of the target job; and executing the target job by using the computing resources in the associated physical cluster queue under the second logic machine room queue. The embodiment of the disclosure realizes that the target operation is automatically migrated from the first logic machine room queue with the abnormality to the second logic machine room queue with the abnormality in the range of the queue naming space queue, so that the target operation has the capacity of automatic disaster recovery across machine rooms.
Description
Technical Field
The disclosure relates to the technical field of computers, and in particular relates to a resource scheduling method, a resource scheduling device, computer equipment and a storage medium.
Background
With the development of internet technology, more and more fields begin to use big data for calculation and analysis, and decision support is provided for data operation and the like.
In the big data computing scene, certain computing tasks with larger data volume need to be allocated with computing queues with abundant resources to meet the computing demands. In practice, network abnormality, equipment abnormality and other conditions often occur, and abnormal calculation queues cannot be used, so that calculation tasks are easy to be unable to be normally performed.
Disclosure of Invention
The embodiment of the disclosure at least provides a resource scheduling method, a resource scheduling device, computer equipment and a storage medium.
In a first aspect, an embodiment of the present disclosure provides a resource scheduling method, including:
receiving a job request, wherein the job request is used for requesting execution of a target job;
Responding to the job request, and distributing a corresponding first logic machine room queue for the target job by utilizing a hierarchical relationship among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model based on the job type of the target job; wherein, each queue naming space queue is associated with a plurality of logic machine room queues, and each logic machine room queue is associated with at least one physical cluster queue;
responding to the abnormality of at least one physical cluster queue associated under the first logic machine room queue, and determining a second logic machine room queue for executing the target job under the queue namespace queue based on the job type of the target job;
And executing the target job by using the computing resources in the associated physical cluster queue under the second logic machine room queue.
In an alternative embodiment, after receiving the job request, the method further comprises:
Creating a first physical cluster queue under the first logical machine room queue in response to the physical cluster queue with target computing resources being unassociated under the first logical machine room queue; the target computing resource is used for executing the target job;
Establishing an association relationship between the first physical cluster queue and a second physical cluster queue with the target computing resource; the second physical cluster queue is a physical cluster queue in other logic machine room queues;
And scheduling the target computing resource of the second physical cluster queue to execute the target job based on the association relation in the first physical cluster queue.
In an alternative embodiment, the executing the target job by using the computing resources in the associated physical cluster queue under the second logical machine room queue includes:
Determining a fourth physical cluster queue based on the number of computing resources respectively corresponding to each physical cluster queue associated under the second logical machine room queue in response to the number of computing resources corresponding to a third physical cluster queue associated under the second logical machine room queue currently executing the target job being smaller than the number of computing resources required by the target job;
executing the target job using the computing resources in the fourth physical cluster queue; or merging the fourth physical cluster queue with the third physical cluster queue to obtain a fifth physical cluster queue, and executing the target job by using the computing resources in the fifth physical cluster queue.
In an optional implementation manner, the allocating, based on the job type of the target job, a corresponding first logical machine room queue for the target job by using a hierarchical relationship among a queue namespace queue, a logical machine room queue, and a physical cluster queue in a three-layer virtual queue model includes:
Based on the job type of the target job, distributing candidate logic machine room queues with computing resources and computing resource configuration information corresponding to each candidate logic machine room queue respectively for the target job by utilizing a hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model;
And screening a first logic machine room queue of which the computing resource configuration information meets preset conditions from the candidate logic machine room queues based on the computing resource configuration information corresponding to the candidate logic machine room queues.
In an alternative embodiment, the job request includes an amount of computing resources required to execute the target job;
The allocating a candidate logic machine room queue with computing resources for the target job includes:
allocating a queue namespace queue for executing the target job matching the number of computing resources for the target job based on the number of computing resources;
And selecting a candidate logic machine room queue with the computing resource for executing the target job from the queue namespace queues based on the job type of the target job.
In an optional implementation manner, the allocating, based on the job type of the target job, a corresponding first logical machine room queue for the target job by using a hierarchical relationship among a queue namespace queue, a logical machine room queue, and a physical cluster queue in a three-layer virtual queue model includes:
Based on the job type of the target job, distributing candidate logic machine room queues with computing resources for executing the target job and the number of associated physical cluster queues under each candidate logic machine room queue for the target job by utilizing a hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model;
And determining the candidate logical machine room queues, the number of which meets the set threshold, of the associated physical cluster queues as first logical machine room queues for executing the target job.
In an optional implementation manner, the job request includes identification information of a user;
The allocating a corresponding first logical machine room queue for the target job by using a hierarchical relationship among a queue naming space queue, a logical machine room queue and a physical cluster queue in a three-layer virtual queue model based on the job type of the target job comprises:
verifying the user authority of the user based on the identity information of the user;
And responding to the user permission verification of the user, and distributing a corresponding first logic machine room queue for the target job by utilizing the hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model based on the job type of the target job.
In an optional implementation manner, after the response to the occurrence of the abnormality of at least one cluster queue associated under the first logical room queue, the method further includes:
receiving a job scheduling request; the job scheduling request comprises queue identification information to be scheduled;
determining a target queue for executing the target job based on the queue identification information;
And executing the target job by utilizing the computing resources corresponding to the target queue based on the computing resources configured in the target queue.
In an alternative embodiment, the determining, based on the queue identification information, a target queue for executing the target job includes:
Determining a target queue namespace queue corresponding to the queue namespace queue identification information if the queue identification information includes queue namespace queue identification information; determining any physical cluster queue in any logic machine room queue associated under the target queue namespace queue as a target queue for executing the target job;
Under the condition that the queue identification information comprises queue name space queue identification information and logic machine room queue identification information, determining a target logic machine room queue corresponding to the logic machine room queue identification information under a target queue name space queue corresponding to the queue name space queue identification information; determining a target physical cluster queue in the target logical machine room queue as a target queue for executing the target job; the target physical cluster queue is a physical cluster queue with user permission;
Under the condition that the queue identification information comprises queue naming space queue identification information, logic machine room queue identification information and physical cluster queue identification information, determining a target physical cluster queue corresponding to the physical cluster queue identification information under a target queue naming space queue corresponding to the queue naming space queue identification information and under a target logic machine room queue corresponding to the logic machine room queue identification information in the target queue naming space queue; the target physical cluster queue is determined as a target queue for executing the target job.
In a second aspect, an embodiment of the present disclosure further provides a resource scheduling apparatus, including:
the first receiving module is used for receiving a job request, wherein the job request is used for requesting to execute a target job;
The allocation module is used for responding to the job request, and allocating a corresponding first logic machine room queue for the target job by utilizing the hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in the three-layer virtual queue model based on the job type of the target job; wherein, each queue naming space queue is associated with a plurality of logic machine room queues, and each logic machine room queue is associated with at least one physical cluster queue;
the first determining module is used for determining a second logic machine room queue for executing the target job under the queue naming space queue based on the job type of the target job in response to the abnormality of at least one physical cluster queue associated under the first logic machine room queue;
and the first execution module is used for executing the target job by utilizing the computing resources in the associated physical cluster queue under the second logic machine room queue.
In a third aspect, embodiments of the present disclosure further provide a computer device, comprising: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory in communication via the bus when the computer device is running, the machine-readable instructions when executed by the processor performing the steps of the first aspect, or any of the possible implementations of the first aspect.
In a fourth aspect, the presently disclosed embodiments also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the first aspect, or any of the possible implementations of the first aspect.
According to the resource scheduling method provided by the embodiment of the disclosure, three-dimensional virtual queues, namely, a queue namespace queue, a logic machine room queue and a physical cluster queue are used, and under the condition that at least one physical cluster queue under a first logic machine room queue which is currently executing target jobs is abnormal, a second logic machine room queue for executing the target jobs can be automatically determined, so that the target jobs can be automatically migrated from the first logic machine room queue with the abnormality to a normal second logic machine room queue within the scope of the queue namespace queue, and the capacity of automatic disaster recovery across machine rooms is achieved; and the target job can use the computing resources in each virtual machine room queue within the range of the queue namespace queue, so that the resource utilization rate is improved compared with the scheme that the target job can only use the computing resources in the appointed computing queue.
The foregoing objects, features and advantages of the disclosure will be more readily apparent from the following detailed description of the preferred embodiments taken in conjunction with the accompanying drawings.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings required for the embodiments are briefly described below, which are incorporated in and constitute a part of the specification, these drawings showing embodiments consistent with the present disclosure and together with the description serve to illustrate the technical solutions of the present disclosure. It is to be understood that the following drawings illustrate only certain embodiments of the present disclosure and are therefore not to be considered limiting of its scope, for the person of ordinary skill in the art may admit to other equally relevant drawings without inventive effort.
FIG. 1 illustrates a flow chart of a method for scheduling resources provided by an embodiment of the present disclosure;
FIG. 2 illustrates a hierarchical schematic of a three-tier virtual queue model provided by embodiments of the present disclosure;
FIG. 3 illustrates a user rights hierarchy diagram corresponding to a three-tier virtual queue model provided by an embodiment of the present disclosure;
FIG. 4 illustrates a hierarchical schematic of another three-tier virtual queue model provided by embodiments of the present disclosure;
FIG. 5 shows a flow chart of a resource scheduling apparatus provided by an embodiment of the present disclosure;
fig. 6 shows a schematic diagram of a computer device provided by an embodiment of the present disclosure.
Detailed Description
For the purposes of making the objects, technical solutions and advantages of the embodiments of the present disclosure more apparent, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is apparent that the described embodiments are only some embodiments of the present disclosure, but not all embodiments. The components of the embodiments of the present disclosure, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present disclosure provided in the accompanying drawings is not intended to limit the scope of the disclosure, as claimed, but is merely representative of selected embodiments of the disclosure. All other embodiments, which can be made by those skilled in the art based on the embodiments of this disclosure without making any inventive effort, are intended to be within the scope of this disclosure.
In big data scenarios, computing tasks are typically scheduled to a designated computing cluster, or in the computing cluster where computing resources are most abundant. When network abnormality, equipment abnormality and the like occur, an abnormal computing queue cannot be used, and a user is required to manually schedule a computing task into a normal computing cluster. In the above way, automatic disaster recovery across machine rooms cannot be realized, and computing service is seriously affected.
Based on the above, the present disclosure provides a resource scheduling method, which uses three-dimensional virtual queues, namely, a queue namespace queue, a logic machine room queue and a physical cluster queue, and can automatically determine a second logic machine room queue for executing a target job under the condition that at least one physical cluster queue under a first logic machine room queue currently executing the target job is abnormal, so that the target job can be automatically migrated from the first logic machine room queue with the abnormality to the second logic machine room queue with the normal condition within the scope of the queue namespace queue, and the capability of automatic disaster recovery across machine rooms is provided; and the target job can use the computing resources in each virtual machine room queue within the range of the queue namespace queue, so that the resource utilization rate is improved compared with the scheme that the target job can only use the computing resources in the appointed computing queue.
The shortcomings of the above solutions, as well as the solutions proposed, are the results of the inventors after practice and careful study, and, therefore, the discovery process of the above problems and the solutions to the above problems set forth hereinafter by the present disclosure should be all contributions of the inventors to the present disclosure during the course of the present disclosure.
It should be noted that: like reference numerals and letters denote like items in the following figures, and thus once an item is defined in one figure, no further definition or explanation thereof is necessary in the following figures.
For the sake of understanding the present embodiment, first, a detailed description will be given of a resource scheduling method disclosed in an embodiment of the present disclosure, where an execution body of the resource scheduling method provided in the embodiment of the present disclosure is generally a computer device with a certain computing capability.
The resource scheduling method provided by the embodiment of the disclosure is mainly applicable to big data scenes, such as machine learning, data statistical analysis and the like.
Referring to fig. 1, a flowchart of a resource scheduling method according to an embodiment of the present disclosure is shown, where the method includes S101 to S104, where:
s101: a job request is received, the job request for requesting execution of a target job.
In the disclosed embodiments, the received job request may be a request submitted by a user for execution of a target job. The target job included in the job request may include at least one. The plurality of target jobs included in the job request may be a plurality of target jobs of a certain user; multiple target jobs for multiple users are also possible, for example, multiple target jobs for each member of a team of multiple members.
S102: responding to the job request, and distributing a corresponding first logic machine room queue for the target job by utilizing a hierarchical relationship among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model based on the job type of the target job; each queue naming space queue is associated with a plurality of logic machine room queues, and at least one physical cluster queue is associated under each logic machine room queue.
In an embodiment of the present disclosure, a computing resource for executing a job may be set as a three-tier virtual queue model that includes three-tier virtual queues, which may include a queue namespace queue, a logical machine room queue, and a physical cluster queue. In the hierarchical structure diagram of a three-layer virtual queue model shown in fig. 2, the upper layer virtual queue and the lower layer virtual queue have a relationship between inclusion and inclusion, specifically, a plurality of logical machine room queues (or called data centers DATACENTER) may be corresponding to a queue namespace queue (or called Region virtual queue), and at least one physical Cluster queue (or called Cluster) may be corresponding to each logical machine room queue. That is, each queue namespace queue may be a set of multiple logical machine room queues, each logical machine room queue may be a set of at least one physical cluster queue. Each layer of virtual queues may be provided with corresponding queue identification information, such as queue names. For example, the queue namespace queue identification information corresponding to the queue namespace queue may be represented by queue_namespace; the logic machine room queue identification information corresponding to the logic machine room queue can be represented by data_ ceneter; the cluster queue identification information corresponding to the physical cluster queue may be represented by a queue_name. The queue name space queue identification information can be a set unique identification to distinguish different area virtual queues.
In implementations, each logical machine room queue may have computing resources, storage resources, job data, etc. configured therein for executing the job. Wherein the computing resources may include, for example, a central processing unit (Central Processing Unit, CPU) or the like; the storage resources may include, for example, memory (Memory). Job data may refer to data on which a target job is executed.
The queue naming space queue can manage a plurality of logic machine room queues through corresponding cross machine room routes, for example, the cross machine room routes can transfer the jobs in the logic machine room queue 1 under the same queue naming space queue to the logic machine room queue 2; the job data stored in the logical room queue 2 may also be read to execute the job or the like in the logical room queue 1.
Different target jobs may correspond to different job types, under which the job data required for executing the target job may be different.
The logic machine room queue can determine the correlation between the job type of the target job and the job data stored in the logic machine room queue through the configured machine room route, namely, different logic machine room queues can process the target jobs with different job types.
The physical cluster queues can adjust the number of computing resources and/or storage resources among the physical cluster queues in the same logical machine room queue through configured cluster routing, and the like.
In order to ensure that the target job can be smoothly executed in the case of abnormality of the logic machine room queues, job data required for the same target job may be stored in a plurality of logic machine room queues. In one embodiment, in the process of determining the first logical machine room queue for executing the target job, according to the job type of the target job, a candidate logical machine room queue with computing resources and computing resource configuration information corresponding to each candidate logical machine room queue may be allocated to the target job by using a hierarchical relationship among the queue namespace queue, the logical machine room queue, and the physical cluster queue in the three-layer virtual queue model.
Here, according to the job type of the target job, the storage path corresponding to the action data required by the target job is analyzed at the calculation engine layer, and then an application program interface (Application Programming Interface, API) provided by the storage system is called to obtain the distribution condition of the job data. According to the distribution condition of the job data and the hierarchical relation of the virtual queues in the three-layer virtual queue model, candidate logic machine room queues configured with computing resources for executing the target job and computing resource configuration information corresponding to each candidate logic machine room queue can be determined. The computing resource configuration information here may include information of the size, the number of configurations, and the like of job data.
Based on the computing resource configuration information corresponding to the candidate logic machine room queue, a first logic machine room queue with computing resource configuration information meeting preset conditions can be screened from the candidate logic machine room queue.
Here, the preset condition may refer to the number of configurations of job data being greater than or equal to a set threshold. In a specific implementation, candidate logic machine room queues with the configuration number of the job data being greater than or equal to the set threshold value may be screened as the first logic machine room queue.
To ensure utilization of computing resources, in one embodiment, the job request may include an amount of computing resources required to execute the target job. The number of computing resources herein may include the number of computing resources and/or storage resources. In allocating a queue namespace queue for executing the target job for the target job, the queue namespace queue for executing the target job that matches the number of computing resources may be allocated for the target job based on the number of computing resources.
In a specific implementation, a user may apply for queue namespace queue identification information to a resource management platform, which may allocate a queue namespace queue corresponding to the number of computing resources required for the target job for the user. The queue namespace queue assigned for a user may execute respective target jobs submitted by the user. That is, individual target jobs submitted by a user may share all of the computing resources in the queue namespace queue.
After determining the queue namespace queue for executing the target job, a candidate logical machine room queue having computing resources for executing the target job may be selected from the queue namespace queues based on the job type of the target job.
In a specific implementation, the more the number of physical cluster queues set in the logical machine room queues, the more the number of computing resources in the logical machine room queues, the faster the target job is executed, so in one embodiment, the number of candidate logical machine room queues having computing resources for executing the target job and physical cluster queues set under each candidate logical machine room queue may be allocated for the target job based on the job type of the target job using a hierarchical relationship among the three queue namespaces, the logical machine room queues, and the physical cluster queues in the three-layer virtual queue model. And then determining the candidate logical machine room queues, the number of which meets the set threshold, of the associated physical cluster queues as the first logical machine room queue for executing the target job.
Here, the determined candidate logical machine room queue may include a logical machine room queue configured with job data for executing the target job. And then selecting the candidate logic machine room queues with the number which meets the set threshold value as the first logic machine room queue according to the number of the associated physical cluster queues under each candidate logic machine room queue.
As previously described, the target job may include a plurality of target jobs for a plurality of users. In a user authority level diagram corresponding to a three-layer virtual queue model as shown in fig. 3, the authority of using the virtual queue owned by different users may be different. In order to manage the authority of each user, a corresponding Resource Record (RR) may be set for each queue namespace queue, where the authority of the user, virtual queue attribute information (e.g., virtual queue identification information) and the like of each logical machine room queue under the queue namespace queue are described in the Resource Record. Each queue namespace queue, the logical machine room queues under the queue namespace queue, and the physical cluster queues under each logical machine room queue may be constructed in the form of a tree queue structure. Each parent node may possess all of the rights of the child nodes and be able to use all of the computing resources of the child nodes.
In one embodiment, the job request may include identification information of the user. In the process of distributing the corresponding first logic machine room queue for the target job, the user authority of the user can be verified based on the identity information of the user. And responding to the user authority verification of the user, and distributing a first logic machine room queue matched with the user authority for the target job by utilizing the hierarchical relationship among the queue naming space queue, the logic machine room queue and the physical cluster queue in the three-layer virtual queue model based on the job type of the target job and the user authority.
For the user with the passing user authority, the corresponding target job can be executed by using the first logic machine room queue matched with the user authority. For example, if the user authority is the authority of the logic machine room queue, the user may use the computing resources corresponding to each physical cluster queue in the first logic machine room queue. For example, if the user authority is the authority of the physical cluster queue, the user may use the computing resource corresponding to the target physical cluster queue in the first logical machine room queue.
S103: and responding to the abnormality of at least one physical cluster queue associated under the first logic machine room queue, and determining a second logic machine room queue for executing the target job under the queue namespace queue based on the job type of the target job.
Here, an exception occurs in at least one physical cluster queue under the first logical machine room queue, including but not limited to a network exception, a hardware failure, etc. In the case where the number of physical cluster queues in the first logical machine room queue that are abnormal is less than the total number of physical cluster queues in the first logical machine room queue, in one embodiment, the target job in the physical cluster queue in the first logical machine room queue that is abnormal may be migrated to other physical cluster queues in the first logical machine room queue that are not abnormal. For example, as shown in fig. 4, when an abnormality occurs in the physical cluster queue a in the logical room queue, the target job in the physical cluster queue a may be migrated to the physical cluster queue B in the logical room queue. That is, at least one physical cluster queue under the first logical machine room queue is abnormal, and the determined second logical machine room queue may be the same logical machine room queue as the first logical machine room queue based on the job type of the target job. In one embodiment, the target job in the physical cluster queue with the exception in the first logical machine room queue may be migrated to another second logical machine room queue without the exception. The second logical room queue may be a different logical room queue than the first logical room queue.
Under the condition that the number of the abnormal physical cluster queues in the first logic machine room queue is the total number of the physical cluster queues in the first logic machine room queue, the target operation in the abnormal physical cluster queues in the first logic machine room queue can be migrated to other second logic machine room queues without abnormality. The second logical room queue may be a different logical room queue than the first logical room queue.
S104: and executing the target job by using the computing resources in the associated physical cluster queue under the second logic machine room queue.
In the embodiment of the disclosure, in a process of executing the target job in the second logical machine room queue, an imbalance of computing resources in the virtual queue may occur, and in one implementation manner, the fourth physical cluster queue is determined based on the number of computing resources respectively corresponding to each physical cluster queue in the second logical machine room queue in response to the number of computing resources corresponding to the third physical cluster queue in the second logical machine room queue in which the target job is currently executed being smaller than the number of computing resources required by the target job.
Here, in the case where the number of computing resources corresponding to the third physical cluster queue under the second logical machine room queue currently executing the target job is smaller than the number of computing resources required for the target job, the third physical cluster queue may not be able to execute the target job in time. In this case, the fourth physical cluster queue with the number of computing resources meeting the preset condition may be determined according to the number of computing resources corresponding to each physical cluster queue under the second logical machine room queue. The preset condition herein may refer to the number of computing resources being greater than or equal to a set threshold. The target job is then executed using the computing resources in the fourth physical cluster queue.
Or combining the fourth physical cluster queue with the third physical cluster queue to obtain a fifth physical cluster queue. The number of computing resources of the fourth physical cluster queue and the number of computing resources of the third physical cluster queue are mainly combined, and the number of computing resources of the fifth physical cluster queue may be the sum of the number of computing resources of the fourth physical cluster queue and the number of computing resources of the third physical cluster queue. And executing the target job by using the computing resource quantity of the fifth physical cluster queue.
By the embodiment, the computing resources among the physical cluster queues can be balanced, so that the computing resources of the physical cluster queues can be fully utilized, and resource fragmentation is prevented.
In an embodiment of the disclosure, there may be a case where a physical cluster queue with target computing resources is not configured under the determined first logical machine room queue, in order to reduce cross machine room communication, in one implementation, after receiving a job request, in response to the determining that a physical cluster queue with target computing resources is not associated under the first logical machine room queue for executing the target job under the queue namespace queue, the first physical cluster queue is created under the first logical machine room queue.
Here, the target computing resource may be used to execute the target job. The first physical cluster queue created is also a physical cluster queue of unassociated target computing resources, which may refer to job data in particular. To reduce cross-machine room communication, an association between a first physical cluster queue and a second physical cluster queue having target computing resources may be established. The second physical cluster queue is a physical cluster queue in other logical machine room queues. By establishing an association between the first physical cluster queue and a second physical cluster queue having target computing resources, the first physical cluster queue may schedule the target computing resources of the second physical cluster queue based on the association, and then execute the target job using the target computing resources of the second physical cluster queue.
In the implementation process, the second logical machine room queue for executing the target job under the queue namespace queue can be automatically determined based on the job type of the target job by responding to the abnormality of at least one physical cluster queue under the first logical machine room queue, so that the dispatching efficiency of the cross machine room is improved.
In the embodiment of the disclosure, after the first logical room queue is abnormal, a job scheduling request may be received in addition to automatically determining the second logical room queue for executing the target job. The job scheduling request may include queue identification information to be scheduled. The queue identification information to be scheduled may be user-specified queue identification information.
Based on the queue identification information, a target queue for executing the target job may be determined. Then, based on the computing resources configured in the target queue, the target job is executed using the computing resources corresponding to the target queue.
Here, as described above, each layer of virtual queues may be provided with corresponding queue identification information. The queue namespace queue identification information may be uniquely determined queue identification information. Logical room queue identification information and physical cluster queue identification information may support wildcard "×".
In the case where the queue identification information includes queue namespace queue identification information, a target queue namespace queue corresponding to the queue namespace queue identification information may be determined. And determining any physical cluster queue in any logic machine room queue under the target queue namespace queue as a target queue for executing the target job.
For example, the queue namespace queue identification information is ns1, any physical cluster queue in any logical machine room queue under the condition that the target queue namespace queue corresponding to the queue namespace queue identification information is 'ns 1' can be determined as the target queue for executing the target job.
Under the condition that the queue identification information comprises queue name space queue identification information and logic machine room queue identification information, determining a target logic machine room queue corresponding to the logic machine room queue identification information under a target queue name space queue corresponding to the queue name space queue identification information; determining a target physical cluster queue in a target logic machine room queue as a target queue for executing target jobs; the target physical cluster queue is a physical cluster queue with user rights.
For example, the queue namespace queue identification information is ns1.Dc1. It may be determined that the target physical cluster queue in the logical machine room queue dc1 with the target queue namespace queue corresponding to the queue namespace queue identification information being "ns1" is the target queue for executing the target job.
Under the condition that the queue identification information comprises queue naming space queue identification information, logic machine room queue identification information and physical cluster queue identification information, determining a target physical cluster queue corresponding to cluster queue identification information under a target queue naming space queue corresponding to the queue naming space queue identification information and under a target logic machine room queue corresponding to the logic machine room queue identification information in the target queue naming space queue; the target physical cluster queue is determined as a target queue for executing the target job.
For example, the queue namespace queue identification information is ns1.Dc1.Queue a, and it may be determined that the target physical cluster queue with physical cluster queue queueA is a target queue for executing the target job in the logical machine room queue dc1 with the target queue namespace queue corresponding to the queue namespace queue identification information being "ns 1".
It will be appreciated by those skilled in the art that in the above-described method of the specific embodiments, the written order of steps is not meant to imply a strict order of execution but rather should be construed according to the function and possibly inherent logic of the steps.
Based on the same inventive concept, the embodiments of the present disclosure further provide a job execution device corresponding to the resource scheduling method, and since the principle of solving the problem by the device in the embodiments of the present disclosure is similar to that of the resource scheduling method in the embodiments of the present disclosure, the implementation of the device may refer to the implementation of the method, and the repetition is omitted.
Referring to fig. 5, an architecture diagram of a job execution apparatus according to an embodiment of the disclosure is shown, where the apparatus includes:
A first receiving module 501 configured to receive a job request, where the job request is used to request execution of a target job;
The allocation module 502 is configured to allocate, in response to the job request, a corresponding first logical machine room queue for the target job by using a hierarchical relationship among a queue namespace queue, a logical machine room queue, and a physical cluster queue in a three-layer virtual queue model based on a job type of the target job; wherein, each queue naming space queue is associated with a plurality of logic machine room queues, and each logic machine room queue is associated with at least one physical cluster queue;
A first determining module 503, configured to determine, in response to occurrence of an abnormality in at least one of the physical cluster queues associated under the first logical machine room queue, a second logical machine room queue under the queue namespace queue for executing the target job based on a job type of the target job;
And the first execution module 504 is configured to execute the target job by using computing resources in an associated physical cluster queue under the second logical machine room queue.
In an alternative embodiment, after receiving the job request, the apparatus further comprises:
The creating module is used for responding to the physical cluster queue with the target computing resource which is not associated under the first logic machine room queue, and creating a first physical cluster queue under the first logic machine room queue; the target computing resource is used for executing the target job;
The establishing module is used for establishing an association relation between the first physical cluster queue and a second physical cluster queue with the target computing resource; the second physical cluster queue is a physical cluster queue in other logic machine room queues;
And the scheduling module is used for scheduling the target computing resource of the second physical cluster queue to execute the target job on the basis of the association relation in the first physical cluster queue.
In an alternative embodiment, the first execution module 504 is specifically configured to:
Determining a fourth physical cluster queue based on the number of computing resources respectively corresponding to each physical cluster queue associated under the second logical machine room queue in response to the number of computing resources corresponding to a third physical cluster queue associated under the second logical machine room queue currently executing the target job being smaller than the number of computing resources required by the target job;
executing the target job using the computing resources in the fourth physical cluster queue; or merging the fourth physical cluster queue with the third physical cluster queue to obtain a fifth physical cluster queue, and executing the target job by using the computing resources in the fifth physical cluster queue.
In an alternative embodiment, the allocation module 502 is specifically configured to:
Based on the job type of the target job, distributing candidate logic machine room queues with computing resources and computing resource configuration information corresponding to each candidate logic machine room queue respectively for the target job by utilizing a hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model;
And screening a first logic machine room queue of which the computing resource configuration information meets preset conditions from the candidate logic machine room queues based on the computing resource configuration information corresponding to the candidate logic machine room queues.
In an alternative embodiment, the job request includes an amount of computing resources required to execute the target job;
the allocation module 502 is specifically configured to:
allocating a queue namespace queue for executing the target job matching the number of computing resources for the target job based on the number of computing resources;
And selecting a candidate logic machine room queue with the computing resource for executing the target job from the queue namespace queues based on the job type of the target job.
In an alternative embodiment, the allocation module 502 is specifically configured to:
Based on the job type of the target job, distributing candidate logic machine room queues with computing resources for executing the target job and the number of associated physical cluster queues under each candidate logic machine room queue for the target job by utilizing a hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model;
And determining the candidate logical machine room queues, the number of which meets the set threshold, of the associated physical cluster queues as first logical machine room queues for executing the target job.
In an optional implementation manner, the job request includes identification information of a user;
the allocation module 502 is specifically configured to:
verifying the user authority of the user based on the identity information of the user;
And responding to the user permission verification of the user, and distributing a corresponding first logic machine room queue for the target job by utilizing the hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model based on the job type of the target job.
In an alternative embodiment, after the response to the occurrence of an abnormality in at least one of the cluster queues associated under the first logical room queue, the apparatus further includes:
The second receiving module is used for receiving the job scheduling request; the job scheduling request comprises queue identification information to be scheduled;
a second determining module configured to determine a target queue for executing the target job based on the queue identification information;
And the second execution module is used for executing the target job by utilizing the computing resources corresponding to the target queue based on the computing resources configured in the target queue.
In an alternative embodiment, the second determining module is specifically configured to:
Determining a target queue namespace queue corresponding to the queue namespace queue identification information if the queue identification information includes queue namespace queue identification information; determining any physical cluster queue in any logic machine room queue associated under the target queue namespace queue as a target queue for executing the target job;
Under the condition that the queue identification information comprises queue name space queue identification information and logic machine room queue identification information, determining a target logic machine room queue corresponding to the logic machine room queue identification information under a target queue name space queue corresponding to the queue name space queue identification information; determining a target physical cluster queue in the target logical machine room queue as a target queue for executing the target job; the target physical cluster queue is a physical cluster queue with user permission;
Under the condition that the queue identification information comprises queue naming space queue identification information, logic machine room queue identification information and physical cluster queue identification information, determining a target physical cluster queue corresponding to the physical cluster queue identification information under a target queue naming space queue corresponding to the queue naming space queue identification information and under a target logic machine room queue corresponding to the logic machine room queue identification information in the target queue naming space queue; the target physical cluster queue is determined as a target queue for executing the target job.
The process flow of each module in the apparatus and the interaction flow between the modules may be described with reference to the related descriptions in the above method embodiments, which are not described in detail herein.
Based on the same technical concept, the embodiment of the disclosure also provides computer equipment. Referring to fig. 6, a schematic diagram of a computer device 600 according to an embodiment of the disclosure includes a processor 601, a memory 602, and a bus 603. The memory 602 is used for storing execution instructions, including a memory 6021 and an external memory 6022; the memory 6021 is also referred to as an internal memory, and is used for temporarily storing operation data in the processor 601 and data exchanged with the external memory 6022 such as a hard disk, the processor 601 exchanges data with the external memory 6022 through the memory 6021, and when the computer device 600 operates, the processor 601 and the memory 602 communicate through the bus 603, so that the processor 601 executes the following instructions:
receiving a job request, wherein the job request is used for requesting execution of a target job;
Responding to the job request, and distributing a corresponding first logic machine room queue for the target job by utilizing a hierarchical relationship among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model based on the job type of the target job; wherein, each queue naming space queue is associated with a plurality of logic machine room queues, and each logic machine room queue is associated with at least one physical cluster queue;
responding to the abnormality of at least one physical cluster queue associated under the first logic machine room queue, and determining a second logic machine room queue for executing the target job under the queue namespace queue based on the job type of the target job;
And executing the target job by using the computing resources in the associated physical cluster queue under the second logic machine room queue.
The disclosed embodiments also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the resource scheduling method described in the method embodiments above. Wherein the storage medium may be a volatile or nonvolatile computer readable storage medium.
The embodiments of the present disclosure further provide a computer program product, where the computer program product carries program code, where instructions included in the program code may be used to perform steps of a resource scheduling method described in the foregoing method embodiments, and specifically reference may be made to the foregoing method embodiments, which are not described herein.
Wherein the above-mentioned computer program product may be realized in particular by means of hardware, software or a combination thereof. In an alternative embodiment, the computer program product is embodied as a computer storage medium, and in another alternative embodiment, the computer program product is embodied as a software product, such as a software development kit (Software Development Kit, SDK), or the like.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described system and apparatus may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again. In the several embodiments provided in the present disclosure, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present disclosure may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer readable storage medium executable by a processor. Based on such understanding, the technical solution of the present disclosure may be embodied in essence or a part contributing to the prior art or a part of the technical solution, or in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present disclosure. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Finally, it should be noted that: the foregoing examples are merely specific embodiments of the present disclosure, and are not intended to limit the scope of the disclosure, but the present disclosure is not limited thereto, and those skilled in the art will appreciate that while the foregoing examples are described in detail, it is not limited to the disclosure: any person skilled in the art, within the technical scope of the disclosure of the present disclosure, may modify or easily conceive changes to the technical solutions described in the foregoing embodiments, or make equivalent substitutions for some of the technical features thereof; such modifications, changes or substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the disclosure, and are intended to be included within the scope of the present disclosure. Therefore, the protection scope of the present disclosure shall be subject to the protection scope of the claims.
Claims (12)
1. A method for scheduling resources, comprising:
Setting a computing resource for executing a job into a three-layer virtual queue model comprising three layers of virtual queues, wherein the three layers of virtual queues comprise queue naming space queues, logic machine room queues and physical cluster queues, each queue naming space queue is associated with a plurality of logic machine room queues, and at least one physical cluster queue is associated under each logic machine room queue;
receiving a job request, wherein the job request is used for requesting execution of a target job;
Responding to the job request, and distributing a corresponding first logic machine room queue for the target job by utilizing a hierarchical relation among the three layers of virtual queues in the three layers of virtual queue model based on the job type of the target job;
responding to the abnormality of at least one physical cluster queue associated under the first logic machine room queue, and determining a second logic machine room queue for executing the target job under the queue namespace queue based on the job type of the target job;
And executing the target job by using the computing resources in the associated physical cluster queue under the second logic machine room queue.
2. The method of claim 1, wherein after receiving the job request, the method further comprises:
Creating a first physical cluster queue under the first logical machine room queue in response to the physical cluster queue with target computing resources being unassociated under the first logical machine room queue; the target computing resource is used for executing the target job;
Establishing an association relationship between the first physical cluster queue and a second physical cluster queue with the target computing resource; the second physical cluster queue is a physical cluster queue in other logic machine room queues;
And scheduling the target computing resource of the second physical cluster queue to execute the target job based on the association relation in the first physical cluster queue.
3. The method of claim 1, wherein executing the target job using computing resources in an associated physical cluster queue under the second logical machine room queue comprises:
Determining a fourth physical cluster queue based on the number of computing resources respectively corresponding to each physical cluster queue associated under the second logical machine room queue in response to the number of computing resources corresponding to a third physical cluster queue associated under the second logical machine room queue currently executing the target job being smaller than the number of computing resources required by the target job;
executing the target job using the computing resources in the fourth physical cluster queue; or merging the fourth physical cluster queue with the third physical cluster queue to obtain a fifth physical cluster queue, and executing the target job by using the computing resources in the fifth physical cluster queue.
4. The method of claim 1, wherein the allocating a corresponding first logical machine room queue for the target job based on the job type of the target job using a hierarchical relationship between a queue namespace queue, a logical machine room queue, and a physical cluster queue in a three-layer virtual queue model comprises:
Based on the job type of the target job, distributing candidate logic machine room queues with computing resources and computing resource configuration information corresponding to each candidate logic machine room queue respectively for the target job by utilizing a hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model;
And screening a first logic machine room queue of which the computing resource configuration information meets preset conditions from the candidate logic machine room queues based on the computing resource configuration information corresponding to the candidate logic machine room queues.
5. The method of claim 4, wherein the job request includes an amount of computing resources required to execute the target job;
The allocating a candidate logic machine room queue with computing resources for the target job includes:
allocating a queue namespace queue for executing the target job matching the number of computing resources for the target job based on the number of computing resources;
And selecting a candidate logic machine room queue with the computing resource for executing the target job from the queue namespace queues based on the job type of the target job.
6. The method of claim 1, wherein the allocating a corresponding first logical machine room queue for the target job based on the job type of the target job using a hierarchical relationship between a queue namespace queue, a logical machine room queue, and a physical cluster queue in a three-layer virtual queue model comprises:
Based on the job type of the target job, distributing candidate logic machine room queues with computing resources for executing the target job and the number of associated physical cluster queues under each candidate logic machine room queue for the target job by utilizing a hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model;
And determining the candidate logical machine room queues, the number of which meets the set threshold, of the associated physical cluster queues as first logical machine room queues for executing the target job.
7. The method according to claim 1, wherein the job request includes identification information of a user;
The allocating a corresponding first logical machine room queue for the target job by using a hierarchical relationship among a queue naming space queue, a logical machine room queue and a physical cluster queue in a three-layer virtual queue model based on the job type of the target job comprises:
verifying the user authority of the user based on the identity information of the user;
And responding to the user permission verification of the user, and distributing a corresponding first logic machine room queue for the target job by utilizing the hierarchical relation among a queue naming space queue, a logic machine room queue and a physical cluster queue in a three-layer virtual queue model based on the job type of the target job.
8. The method of claim 1, wherein the method further comprises, after the response to the occurrence of the anomaly in the at least one cluster queue associated under the first logical machine room queue:
receiving a job scheduling request; the job scheduling request comprises queue identification information to be scheduled;
determining a target queue for executing the target job based on the queue identification information;
And executing the target job by utilizing the computing resources corresponding to the target queue based on the computing resources configured in the target queue.
9. The method of claim 8, wherein the determining a target queue for executing the target job based on the queue identification information comprises:
Determining a target queue namespace queue corresponding to the queue namespace queue identification information if the queue identification information includes queue namespace queue identification information; determining any physical cluster queue in any logic machine room queue associated under the target queue namespace queue as a target queue for executing the target job;
Under the condition that the queue identification information comprises queue name space queue identification information and logic machine room queue identification information, determining a target logic machine room queue corresponding to the logic machine room queue identification information under a target queue name space queue corresponding to the queue name space queue identification information; determining a target physical cluster queue in the target logical machine room queue as a target queue for executing the target job; the target physical cluster queue is a physical cluster queue with user permission;
Under the condition that the queue identification information comprises queue naming space queue identification information, logic machine room queue identification information and physical cluster queue identification information, determining a target physical cluster queue corresponding to the physical cluster queue identification information under a target queue naming space queue corresponding to the queue naming space queue identification information and under a target logic machine room queue corresponding to the logic machine room queue identification information in the target queue naming space queue; the target physical cluster queue is determined as a target queue for executing the target job.
10. A resource scheduling apparatus, comprising:
The model setting module is configured to set a computing resource for executing a job as a three-layer virtual queue model comprising three layers of virtual queues, wherein the three layers of virtual queues comprise queue naming space queues, logic machine room queues and physical cluster queues, each queue naming space queue is associated with a plurality of logic machine room queues, and at least one physical cluster queue is associated under each logic machine room queue;
the first receiving module is used for receiving a job request, wherein the job request is used for requesting to execute a target job;
The allocation module is used for responding to the job request, allocating a corresponding first logic machine room queue for the target job by utilizing the hierarchical relation among the three layers of virtual queues in the three layers of virtual queue model based on the job type of the target job;
the first determining module is used for determining a second logic machine room queue for executing the target job under the queue naming space queue based on the job type of the target job in response to the abnormality of at least one physical cluster queue associated under the first logic machine room queue;
and the first execution module is used for executing the target job by utilizing the computing resources in the associated physical cluster queue under the second logic machine room queue.
11. A computer device, comprising: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory in communication via the bus when the computer device is running, the machine-readable instructions when executed by the processor performing the steps of the resource scheduling method of any one of claims 1 to 9.
12. A computer readable storage medium, characterized in that the computer readable storage medium has stored thereon a computer program which, when executed by a processor, performs the steps of the resource scheduling method according to any of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211065521.6A CN115309592B (en) | 2022-09-01 | 2022-09-01 | Resource scheduling method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211065521.6A CN115309592B (en) | 2022-09-01 | 2022-09-01 | Resource scheduling method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115309592A CN115309592A (en) | 2022-11-08 |
| CN115309592B true CN115309592B (en) | 2024-09-17 |
Family
ID=83864719
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211065521.6A Active CN115309592B (en) | 2022-09-01 | 2022-09-01 | Resource scheduling method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115309592B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115934299B (en) * | 2023-02-22 | 2023-05-23 | 智者四海（北京）技术有限公司 | YARN operation migration system and method |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111130835A (en) * | 2018-11-01 | 2020-05-08 | 中国移动通信集团河北有限公司 | Data center dual-active system, switching method, device, equipment and medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7814050B2 (en) * | 2002-10-22 | 2010-10-12 | Brocade Communications Systems, Inc. | Disaster recovery |
| CN112291082B (en) * | 2020-09-30 | 2023-08-29 | 北京大米科技有限公司 | Computer room disaster recovery processing method, terminal and storage medium |
| CN113760446B (en) * | 2021-01-22 | 2025-09-12 | 北京沃东天骏信息技术有限公司 | Resource scheduling method, device, equipment and medium |
| CN113806066A (en) * | 2021-04-06 | 2021-12-17 | 京东科技控股股份有限公司 | Big data resource scheduling method, system and storage medium |
| CN114637473A (en) * | 2022-03-31 | 2022-06-17 | 苏州浪潮智能科技有限公司 | Method and apparatus for allocating virtual resources, electronic device and storage medium |
-
2022
- 2022-09-01 CN CN202211065521.6A patent/CN115309592B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111130835A (en) * | 2018-11-01 | 2020-05-08 | 中国移动通信集团河北有限公司 | Data center dual-active system, switching method, device, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115309592A (en) | 2022-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11409556B2 (en) | Custom placement policies for virtual machines | |
| Yao et al. | Fog resource provisioning in reliability-aware IoT networks | |
| US8424059B2 (en) | Calculating multi-tenancy resource requirements and automated tenant dynamic placement in a multi-tenant shared environment | |
| CN104854563B (en) | What resource used automatically analyzes | |
| US8117611B2 (en) | Method, system, and program product for deploying a platform dependent application in a grid environment | |
| US10996994B2 (en) | Task queuing and dispatching mechanisms in a computational device | |
| US20150263983A1 (en) | System and Method for Allocating Resources and Managing a Cloud Based Computer System | |
| CN113806066A (en) | Big data resource scheduling method, system and storage medium | |
| US10649811B2 (en) | Sunder management for a cluster of disperse nodes | |
| US11175948B2 (en) | Grouping of tasks for distribution among processing entities | |
| US9507676B2 (en) | Cluster creation and management for workload recovery | |
| US10616134B1 (en) | Prioritizing resource hosts for resource placement | |
| EP2569709A2 (en) | A decision support system for moving computing workloads to public clouds | |
| CN104424013A (en) | Method and device for deploying virtual machine in computing environment | |
| US10733025B2 (en) | Balancing categorized task queues in a plurality of processing entities of a computational device | |
| EP3442201B1 (en) | Cloud platform construction method and cloud platform | |
| US12013974B2 (en) | Provisioning a computing subsystem with disaggregated computing hardware resources selected in compliance with a physical location requirement of a workload | |
| CN112379971A (en) | Application container management method, device and equipment | |
| US11561824B2 (en) | Embedded persistent queue | |
| Ungureanu et al. | Kubernetes cluster optimization using hybrid shared-state scheduling framework | |
| US20190004844A1 (en) | Cloud platform construction method and cloud platform | |
| CN115309592B (en) | Resource scheduling method and device, computer equipment and storage medium | |
| CN118051341A (en) | Computing power resource scheduling method, computing power resource scheduling device, terminal equipment and storage medium | |
| CN106533961A (en) | Flow control method and device | |
| JP2014063449A (en) | Resource management system, resource management method and resource management program |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |