CN111221644A - Resource scheduling method, device and equipment - Google Patents
Resource scheduling method, device and equipment Download PDFInfo
- Publication number
- CN111221644A CN111221644A CN201811427658.5A CN201811427658A CN111221644A CN 111221644 A CN111221644 A CN 111221644A CN 201811427658 A CN201811427658 A CN 201811427658A CN 111221644 A CN111221644 A CN 111221644A
- Authority
- CN
- China
- Prior art keywords
- resource
- scheduling
- tag
- group
- label
- 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.)
- Granted
Links
Images
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/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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application discloses a resource scheduling method, which comprises the following steps: obtaining scheduling requirement information; comparing a scheduling label group contained in the scheduling requirement information with a resource label group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label; and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information. By adopting the method, the problem that the scheduling labels need to be merged and enumerated more complexly in the prior art is solved.
Description
Technical Field
The present application relates to the field of computing resource allocation, and in particular, to a resource scheduling method. The invention also relates to a resource scheduling device, electronic equipment and storage equipment.
Background
In a cloud storage system, machines covering different BUs (application Unit) are required, and different applications have different application scheduling requirements in a machine room due to availability, cost, network placement, power consumption and the like. For example, the machine deploying the application a has a high requirement on availability, so that a plurality of sub-clusters can be split, and it is ensured that when a problem occurs in a single sub-cluster, the global service quality is not greatly affected. And B application relates to non-core application, only one cluster is deployed for cost, and even the cluster resources of A application are borrowed.
In the above background, a cluster has different scheduling labels in different scenarios, for example, in the requirements of an application a, it is required that the scheduling labels of two dimensions are both matched to allocate resources, and when the same resource meets the requirements of an application B, it is only necessary to consider the scheduling label of one dimension. There may be multiple values on the same scheduling tag, while another scheduling tag may exist or may not exist. Most scheduling systems perform scheduling based on a one-dimensional scheduling label, and find out fully-matched resources to meet the requirements according to each scheduling label in application scheduling requirements.
In the scheduling label processing method in the prior art, each resource has a resource label group, the resource label group includes at least one scheduling label, each scheduling label has a name and a value, the names of the scheduling labels cannot be the same, and one or more values in the same scheduling label can be provided. Corresponding to the above scenario, if the scheme is to be used for implementation, in a scenario where the second scheduling tag does not exist, all values need to be enumerated and filled; if duplicate values occur between scheduling labels of different dimensions, they must be manually combined to ensure that the duplicate values do not interfere with each other. If more complex scenes appear subsequently, more complex merging and enumeration of the scheduling tags are required, and the maintenance workload is greatly increased.
Disclosure of Invention
The application provides a resource scheduling method, which aims to solve the problem that the scheduling label needs to be merged and enumerated more complexly in the prior art.
The application provides a resource scheduling method, which comprises the following steps:
obtaining scheduling requirement information;
comparing a scheduling label group contained in the scheduling requirement information with a resource label group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
Optionally, the using the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information includes:
and taking the resource corresponding to the resource tag group with the maximum weight matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
Optionally, before the step of comparing the scheduling tag group included in the scheduling requirement information with the resource tag group corresponding to the resource, the method further includes:
sequencing the resource tag groups according to the weight of the resource tag groups to obtain the sequenced resource tag groups;
and generating a resource tag group list according to the sorted resource tag groups.
Optionally, the sorting the resource tag groups according to the weights of the resource tag groups to obtain the sorted resource tag groups includes: if the resource tag groups correspond to the same weight, randomly arranging the sequence among the resource tag groups.
Optionally, the comparing the scheduling tag group included in the scheduling requirement information with the resource tag group corresponding to the resource includes:
and comparing the scheduling label group contained in the scheduling requirement information with the resource label group in the resource label group list in sequence.
Optionally, the taking the resource corresponding to the resource tag group with the largest weight matched with the requirement tag as the scheduling resource according with the scheduling requirement information includes:
sequencing all successfully matched resource tag groups according to the weight;
and taking the resource corresponding to the resource label group with the maximum weight as the scheduling resource of the scheduling requirement.
Optionally, the weight of the resource tag group is set according to the number of the scheduling tag groups corresponding to the resource.
Optionally, the resource tag group matched with the scheduling tag group is a resource tag group including all scheduling tags of the scheduling tag group and corresponding tag values.
Optionally, the resource is a switch cluster.
The present application further provides a resource scheduling apparatus, including:
a scheduling requirement information obtaining unit for obtaining scheduling requirement information;
the tag group comparison unit is used for comparing the scheduling tag group contained in the scheduling requirement information with the resource tag group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and the scheduling resource determining unit is used for taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
The present application further provides an electronic device, comprising:
a processor; and
a memory for storing a program of a resource scheduling method, the apparatus performing the following steps after being powered on and running the program of the resource scheduling method by the processor:
obtaining scheduling requirement information;
comparing a scheduling label group contained in the scheduling requirement information with a resource label group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
The present application also provides a storage device that,
a program storing a resource scheduling method, the program being executed by a processor to perform the steps of:
obtaining scheduling requirement information;
comparing a scheduling label group contained in the scheduling requirement information with a resource label group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
Compared with the prior art, the method has the following advantages:
the application provides a resource scheduling method, a resource scheduling device, electronic equipment and storage equipment, wherein at least one resource corresponds to a plurality of resource tag groups, and a scheduling tag group contained in scheduling demand information is compared with a resource tag group corresponding to the resource; and the resource corresponding to the resource tag group matched with the scheduling tag group is used as the scheduling resource according with the scheduling requirement information, so that more complicated combination and enumeration of the scheduling tags are avoided.
Drawings
Fig. 1 is a flowchart of a resource scheduling method according to a first embodiment of the present application.
Fig. 2 is a scene diagram of a resource scheduling method according to a first embodiment of the present application.
Fig. 3 is a schematic diagram of a resource scheduling apparatus according to a second embodiment of the present application.
Fig. 4 is a schematic diagram of an electronic device according to a third embodiment of the present application.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein, but rather construed as limited to the embodiments set forth herein.
Before describing the embodiments, some terms of art to which this application relates will be described.
Scheduling label (label): one way to describe abstracted resources, for example, the disk preference is a scheduling tag, and the value may be capacity first or performance first.
Scheduling requirements: a set of constraint requirements set forth when applying for a resource.
A first embodiment of the present application provides a resource scheduling method, which is described in detail below with reference to fig. 1 and fig. 2.
As shown in fig. 1, in step S101, scheduling requirement information is obtained.
The scheduling requirement information may refer to application scheduling requirement information.
The scheduling requirement information comprises: scheduling label, for example, scheduling label of application scheduling requirement.
As shown in fig. 1, in step S102, a scheduling tag group included in the scheduling requirement information is compared with a resource tag group corresponding to a resource; at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag.
The scheduling requirement information includes a scheduling tag group including at least one scheduling tag, for example, the application scheduling requirement 3 in fig. 2 includes 3 scheduling tags, which are a scheduling tag a, a scheduling tag B, and a scheduling tag C.
The resource refers to a resource that can be scheduled by a scheduling system, and specifically may refer to a cloud computing resource, i.e., a sub-cluster.
At least one resource in all the resources which can be scheduled by the scheduling system corresponds to a plurality of resource tag groups, and one resource tag group comprises one or more scheduling tags.
As shown in fig. 2, the scheduling system includes two resources, resource 1 and resource 2, where resource 1 is provided with 3 resource tag groups, which are resource tag group 1, resource tag group 2, and resource tag group 3, and resource tag group 1 includes 2 scheduling tags: scheduling label A and scheduling label B, wherein the value of the scheduling label A is 1, and the value of the scheduling label B is 1, 2 and 3; resource tag group 2 contains three scheduling tags: resource tag group 2 contains three scheduling tags: the scheduling label A, the scheduling label B and the scheduling label C are adopted, wherein the value of the scheduling label A is 2, the value of the scheduling label B is 4, and the value of the scheduling label C is 5; the resource tag group 3 contains a scheduling tag a with a value of 3; the resource 2 is provided with a resource tag group 4, and the resource tag group 4 comprises three scheduling tags: scheduling label A, scheduling label B and scheduling label C, wherein the value of scheduling label A is 1, the value of scheduling label B is 1 and the value of scheduling label C is 3.
As can be seen from the figure, one resource is provided with one or more resource tag groups, fig. 3 is only a simple schematic diagram, and in the specific implementation, the number of resource tag groups that can be set on one resource is not specifically limited, and may be set as needed, for example, 100 resource tag groups may be set for a certain resource. Because more resource label groups are arranged on the resources, the scheduling label groups of different application requirements can be matched with the appropriate resource label groups, and more complex combination and enumeration of the scheduling labels are avoided.
In specific implementation, each resource tag group may be stored as a table, and the storage is performed in a Key-Value form. For example, resource tag group 2 in FIG. 3 may be stored in the following table:
| scheduling tag name | Value of |
| Scheduling tag A | 2 |
| Scheduling tag B | 4 |
| Scheduling tag C | 5 |
The comparing of the scheduling tag group included in the scheduling requirement information with the resource tag group corresponding to the resource means that the value of each scheduling tag in the scheduling tag group included in the scheduling requirement information is compared with the value of each scheduling tag in the resource tag group corresponding to the resource. It may be determined whether the scheduling tag group and the resource tag group match based on the result of the comparison.
In order to make the application scheduling requirement obtain the optimal resource to serve it, a corresponding weight may be set for each resource tag group.
In the implementation, it is not specifically defined which resource tag group is set with a large weight, and the resource tag group can be set by a developer at will. The weights of the resource tag groups may be set according to the number of the scheduling tag groups corresponding to the resource, for example, if the number of the scheduling tag groups corresponding to the resource a is 5 and the number of the scheduling tag groups corresponding to the resource B is 1, the weights of the scheduling tag groups corresponding to the resource a may be set smaller and the weights of the scheduling tag groups corresponding to the resource B may be set larger; the weight of the resource tag group may also be set according to the number of the scheduling tags corresponding to the resource tag group, for example, if the number of the scheduling tags corresponding to the resource tag group a is 3 and the number of the scheduling tags corresponding to the resource tag group B is 1, the weight of the resource tag group a may be set smaller and the weight of the resource tag group B may be set larger.
As shown in fig. 1, in step S103, the resource corresponding to the resource tag group matching the scheduling tag group is used as the scheduling resource meeting the scheduling requirement information.
The resource tag group matched with the scheduling tag group may be a resource tag group including all scheduling tags of the scheduling tag group and corresponding tag values, for example, as shown in fig. 2, the scheduling tag group of the application scheduling requirement 4 includes three scheduling tags: scheduling label A, scheduling label B, scheduling label C, scheduling label A's value is 1, scheduling label B's value is 1, scheduling label C's value is 3, resource label group 4 contains three scheduling labels: the scheduling method comprises the following steps of scheduling a label A, a scheduling label B and a scheduling label C, wherein the value of the scheduling label A is 1, the value of the scheduling label B is 1, the value of the scheduling label C is 3, a resource label group 4 comprises all scheduling labels of a scheduling label group of an application scheduling requirement 4, the corresponding label values are the same, the resource label group 4 is a resource label group matched with the scheduling label group of the application scheduling requirement 4, and a resource 2 corresponding to the resource label group 4 is used as a scheduling resource meeting the application scheduling requirement 4; if there is no resource tag group including all scheduling tags of the scheduling tag group and corresponding tag values, the resource tag group including part of the scheduling tags of the scheduling tag group and corresponding tag values may also be used as a resource tag group matching the scheduling tag group, for example, as shown in fig. 2, the scheduling tag group applying scheduling requirement 2 includes three scheduling tags: the scheduling method comprises the steps of scheduling a tags A, scheduling B and scheduling C, wherein the value of the scheduling tag A is 3, the value of the scheduling tag B is 2, the value of the scheduling tag C is 1, a resource tag group 3 comprises one scheduling tag A, the value of the scheduling tag A is 2, the resource tag group 3 comprises part of scheduling tags of a scheduling tag group applying the scheduling requirement 2, and the scheduling system does not have a resource tag group completely matched with the scheduling tag group applying the scheduling requirement 2, so that the resource tag group 3 can be used as the resource tag group matched with the scheduling tag group applying the scheduling requirement 2, and the resource 1 corresponding to the resource tag group 3 is used as scheduling resources meeting the application scheduling requirement 2.
Taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information, wherein the resource comprises the following steps:
and taking the resource corresponding to the resource tag group with the maximum weight matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
Before the step of comparing the scheduling tag group included in the scheduling requirement information with the resource tag group corresponding to the resource, the method further includes:
sequencing the resource tag groups according to the weight of the resource tag groups to obtain the sequenced resource tag groups;
and generating a resource tag group list according to the sorted resource tag groups.
The comparing the scheduling tag group contained in the scheduling requirement information with the resource tag group corresponding to the resource includes:
and comparing the scheduling label group contained in the scheduling requirement information with the resource label group in the resource label group list in sequence.
The resource tag groups are firstly sequenced according to the weight of the resource tag groups to generate a sequenced resource tag group list, and then the scheduling tag groups contained in the scheduling requirement information are sequentially compared with the resource tag groups in the resource tag group list, so that the matching efficiency of the scheduling tag groups contained in the scheduling requirement information and the resource tag groups can be improved. As long as the resource tag group matched with the scheduling tag group is found, the resource corresponding to the resource tag group can be used as the scheduling resource meeting the scheduling requirement information, and the resource tag group with lower weight does not need to be continuously matched.
When the resource tag groups are sorted according to the weights of the resource tag groups, if there is a case where a plurality of resource tag groups correspond to the same weight, the resource tag groups may be randomly arranged in order to obtain the sorted resource tag groups. For example, if there are 10 resource tag groups with the same weight, the order among the 10 resource tag groups may be randomly arranged.
The above-mentioned mode (the first mode) is to sort the resource tag groups according to the weights of the resource tag groups, and then compare the scheduling tag groups included in the scheduling requirement information with the resource tag groups in the resource tag group list in sequence, so long as the matched resource tag groups are found, the corresponding resources can be directly used as the scheduling resources meeting the scheduling requirement information; another mode (a second mode) is to match the scheduling tag group included in the scheduling requirement information with the resource tag group to obtain all resource tag groups successfully matched with the scheduling tag group, sort all the successfully matched resource tag groups according to the weight, and use the resource corresponding to the resource tag group with the highest weight as the scheduling resource of the scheduling requirement.
The step of using the resource corresponding to the resource tag group with the maximum weight matched with the requirement tag as the scheduling resource meeting the scheduling requirement information includes:
sequencing all successfully matched resource tag groups according to the weight;
and taking the resource corresponding to the resource tag group with the maximum weight as the scheduling resource of the scheduling requirement information.
For example, as shown in fig. 2, if step S102 is performed, all resource tag groups successfully matched with the scheduling tag group (including three scheduling tags: scheduling tag a, scheduling tag B, and scheduling tag C, where the value of scheduling tag a is 1, the value of scheduling tag B is 1, and the value of scheduling tag C is 3) of the application scheduling requirement 4 are obtained as resource tag group 1 and resource tag group 4, since the resource 2 in which the resource tag group 4 is located has only one resource tag group, the resource 1 in which the resource tag group 1 is located has 3 resource tag groups, the weight of the resource tag group 4 is greater than that of the resource tag group 1, all the successfully matched resource tag groups are sorted according to the weights, and the resource 2 corresponding to the resource tag group 4 with the largest weight is used as the scheduling resource of the application scheduling requirement 4.
It should be noted that, because the first method firstly sorts the resource tag groups according to the weights and then compares the resource tag groups, the weight of the resource tag group which is successfully matched with the scheduling tag group is the largest, and as long as the resource tag group which is successfully matched with the scheduling tag group is found, the corresponding resource can be used as the scheduling resource for applying the scheduling requirement; the second method needs to compare the scheduling tag group with all resource tag groups, then sort all successfully matched resource tag groups according to the weights, and use the resource corresponding to the resource tag group with the largest weight as the scheduling resource of the application scheduling requirement.
By setting a plurality of resource tag groups on a resource, the first embodiment of the present application solves the problem that the scheduling tags of the resource tag groups need to be enumerated and merged in the prior art.
Corresponding to the resource scheduling method provided in the first embodiment of the present application, a second embodiment of the present application also provides a resource scheduling apparatus.
As shown in fig. 3, the resource scheduling apparatus includes:
a scheduling requirement information obtaining unit 301, configured to obtain scheduling requirement information;
a tag group comparing unit 302, configured to compare a scheduling tag group included in the scheduling requirement information with a resource tag group corresponding to a resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
a scheduling resource determining unit 303, configured to use a resource corresponding to the resource tag group matched with the scheduling tag group as a scheduling resource meeting the scheduling requirement information.
Optionally, the scheduling resource determining unit is specifically configured to:
and taking the resource corresponding to the resource tag group with the maximum weight matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
Optionally, the apparatus further comprises: a resource tag group list generation unit that generates a resource tag group list,
the resource tag group comparison unit is used for comparing the resource tag groups with the resource tag groups in the resource tag group list, and comparing the resource tag groups with the resource tag groups;
and generating a resource tag group list according to the sorted resource tag groups.
Optionally, the sorting the resource tag groups according to the weights of the resource tag groups to obtain the sorted resource tag groups includes: if the resource tag groups correspond to the same weight, randomly arranging the sequence among the resource tag groups.
Optionally, the tag group comparing unit is specifically configured to:
and comparing the scheduling label group contained in the scheduling requirement information with the resource label group in the resource label group list in sequence.
Optionally, the taking the resource corresponding to the resource tag group with the largest weight matched with the requirement tag as the scheduling resource according with the scheduling requirement information includes:
sequencing all successfully matched resource tag groups according to the weight;
and taking the resource corresponding to the resource label group with the maximum weight as the scheduling resource of the scheduling requirement.
Optionally, the apparatus further includes a resource tag group weight setting unit, configured to set a weight of the resource tag group according to the number of scheduling tag groups corresponding to the resource.
Optionally, the resource tag group matched with the scheduling tag group is a resource tag group including all scheduling tags of the scheduling tag group and corresponding tag values.
Optionally, the resource is a switch cluster.
It should be noted that, for the detailed description of the resource scheduling apparatus provided in the second embodiment of the present application, reference may be made to the related description of the first embodiment of the present application, and details are not repeated here.
Corresponding to the resource scheduling method provided in the first embodiment of the present application, a third embodiment of the present application also provides an electronic device.
As shown in fig. 4, the electronic apparatus includes:
a processor 401; and
a memory 402 for storing a program of a resource scheduling method, the apparatus performing the following steps after being powered on and running the program of the resource scheduling method by the processor:
obtaining scheduling requirement information;
comparing a scheduling label group contained in the scheduling requirement information with a resource label group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
Optionally, the using the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information includes:
and taking the resource corresponding to the resource tag group with the maximum weight matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
Optionally, before the step of comparing the scheduling tag group included in the scheduling requirement information with the resource tag group corresponding to the resource, the method further includes:
sequencing the resource tag groups according to the weight of the resource tag groups to obtain the sequenced resource tag groups;
and generating a resource tag group list according to the sorted resource tag groups.
Optionally, the sorting the resource tag groups according to the weights of the resource tag groups to obtain the sorted resource tag groups includes: if the resource tag groups correspond to the same weight, randomly arranging the sequence among the resource tag groups.
Optionally, the comparing the scheduling tag group included in the scheduling requirement information with the resource tag group corresponding to the resource includes:
and comparing the scheduling label group contained in the scheduling requirement information with the resource label group in the resource label group list in sequence.
Optionally, the taking the resource corresponding to the resource tag group with the largest weight matched with the requirement tag as the scheduling resource according with the scheduling requirement information includes:
sequencing all successfully matched resource tag groups according to the weight;
and taking the resource corresponding to the resource label group with the maximum weight as the scheduling resource of the scheduling requirement.
Optionally, the weight of the resource tag group is set according to the number of the scheduling tag groups corresponding to the resource.
Optionally, the resource tag group matched with the scheduling tag group is a resource tag group including all scheduling tags of the scheduling tag group and corresponding tag values.
Optionally, the resource is a switch cluster.
It should be noted that, for the detailed description of the electronic device provided in the third embodiment of the present application, reference may be made to the related description of the first embodiment of the present application, and details are not repeated here.
Corresponding to the resource scheduling method provided in the first embodiment of the present application, a fourth embodiment of the present application further provides a storage device, in which a program of the resource scheduling method is stored, and the program is executed by a processor to perform the following steps:
obtaining scheduling requirement information;
comparing a scheduling label group contained in the scheduling requirement information with a resource label group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
It should be noted that, for the detailed description of the storage device provided in the fourth embodiment of the present application, reference may be made to the related description of the first embodiment of the present application, and details are not described here again.
Although the present invention has been described with reference to the preferred embodiments, it should be understood that the scope of the present invention is not limited to the embodiments described above, and that various changes and modifications may be made by one skilled in the art without departing from the spirit and scope of the present invention.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include non-transitory computer readable media (transient media), such as modulated data signals and carrier waves.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
Claims (12)
1. A method for scheduling resources, comprising:
obtaining scheduling requirement information;
comparing a scheduling label group contained in the scheduling requirement information with a resource label group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
2. The method according to claim 1, wherein the using the resource corresponding to the resource tag group matching the scheduling tag group as the scheduling resource meeting the scheduling requirement information comprises:
and taking the resource corresponding to the resource tag group with the maximum weight matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
3. The method according to claim 2, wherein before the step of comparing the scheduling label group included in the scheduling requirement information with the resource label group corresponding to the resource, the method further comprises:
sequencing the resource tag groups according to the weight of the resource tag groups to obtain the sequenced resource tag groups;
and generating a resource tag group list according to the sorted resource tag groups.
4. The method of claim 3, wherein the sorting the resource tag groups according to the weights of the resource tag groups to obtain sorted resource tag groups comprises: if the resource tag groups correspond to the same weight, randomly arranging the sequence among the resource tag groups.
5. The method according to claim 4, wherein comparing the scheduling tag group included in the scheduling requirement information with the resource tag group corresponding to the resource comprises:
and comparing the scheduling label group contained in the scheduling requirement information with the resource label group in the resource label group list in sequence.
6. The method according to claim 2, wherein the using the resource corresponding to the resource tag group with the highest weight matched with the requirement tag as the scheduling resource meeting the scheduling requirement information comprises:
sequencing all successfully matched resource tag groups according to the weight;
and taking the resource corresponding to the resource label group with the maximum weight as the scheduling resource of the scheduling requirement.
7. The method of claim 2, wherein the weight of the resource tag group is set according to the number of scheduling tag groups corresponding to the resource.
8. The method of claim 1, wherein the set of resource tags matching the set of scheduling tags is a set of resource tags that includes all scheduling tags of the set of scheduling tags and corresponding tag values.
9. The method of claim 1, wherein the resource is a switch cluster.
10. A resource scheduling apparatus, comprising:
a scheduling requirement information obtaining unit for obtaining scheduling requirement information;
the tag group comparison unit is used for comparing the scheduling tag group contained in the scheduling requirement information with the resource tag group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and the scheduling resource determining unit is used for taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
11. An electronic device, comprising:
a processor; and
a memory for storing a program of a resource scheduling method, the apparatus performing the following steps after being powered on and running the program of the resource scheduling method by the processor:
obtaining scheduling requirement information;
comparing a scheduling label group contained in the scheduling requirement information with a resource label group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
12. A storage device, characterized in that,
a program storing a resource scheduling method, the program being executed by a processor to perform the steps of:
obtaining scheduling requirement information;
comparing a scheduling label group contained in the scheduling requirement information with a resource label group corresponding to the resource; at least one resource corresponds to a plurality of resource label groups, and one resource label group comprises at least one scheduling label;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource meeting the scheduling requirement information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811427658.5A CN111221644B (en) | 2018-11-27 | 2018-11-27 | Resource scheduling method, device and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811427658.5A CN111221644B (en) | 2018-11-27 | 2018-11-27 | Resource scheduling method, device and equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111221644A true CN111221644A (en) | 2020-06-02 |
| CN111221644B CN111221644B (en) | 2023-06-13 |
Family
ID=70827072
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811427658.5A Active CN111221644B (en) | 2018-11-27 | 2018-11-27 | Resource scheduling method, device and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111221644B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113961321A (en) * | 2021-10-09 | 2022-01-21 | 国云科技股份有限公司 | Cross-cloud-platform resource scheduling method and device, terminal equipment and storage medium |
| WO2022252510A1 (en) * | 2021-06-04 | 2022-12-08 | 深圳前海微众银行股份有限公司 | Resource management method, apparatus and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102262653A (en) * | 2011-06-09 | 2011-11-30 | 华中科技大学 | Label recommendation method and system based on user motivation orientation |
| US20130212576A1 (en) * | 2012-02-09 | 2013-08-15 | Citrix Systems, Inc | Tagging Physical Resources in a Cloud Computing Environment |
| CN106126347A (en) * | 2016-08-17 | 2016-11-16 | 浪潮电子信息产业股份有限公司 | Method for effectively realizing host cluster resource scheduling under cloud platform |
| CN107133096A (en) * | 2017-04-13 | 2017-09-05 | 新华三技术有限公司 | A kind of resource allocation methods and device |
| CN107783734A (en) * | 2017-11-17 | 2018-03-09 | 北京联想超融合科技有限公司 | A kind of resource allocation methods, device and terminal based on super fusion storage system |
-
2018
- 2018-11-27 CN CN201811427658.5A patent/CN111221644B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102262653A (en) * | 2011-06-09 | 2011-11-30 | 华中科技大学 | Label recommendation method and system based on user motivation orientation |
| US20130212576A1 (en) * | 2012-02-09 | 2013-08-15 | Citrix Systems, Inc | Tagging Physical Resources in a Cloud Computing Environment |
| US20150220357A1 (en) * | 2012-02-09 | 2015-08-06 | Citrix Systems, Inc. | Tagging Physical Resources In A Cloud Computing Environment |
| CN106126347A (en) * | 2016-08-17 | 2016-11-16 | 浪潮电子信息产业股份有限公司 | Method for effectively realizing host cluster resource scheduling under cloud platform |
| CN107133096A (en) * | 2017-04-13 | 2017-09-05 | 新华三技术有限公司 | A kind of resource allocation methods and device |
| CN107783734A (en) * | 2017-11-17 | 2018-03-09 | 北京联想超融合科技有限公司 | A kind of resource allocation methods, device and terminal based on super fusion storage system |
Non-Patent Citations (3)
| Title |
|---|
| HYUN JUNG LEE等: "Construction of Tag-Based Dynamic Data Catalog (TaDDCat) Using Ontology" * |
| 唐瑞: "基于Kubernetes的容器云平台资源调度策略研究" * |
| 夏秀峰;张姝;李晓明;: "一种个性化标签云中的标签排序算法" * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022252510A1 (en) * | 2021-06-04 | 2022-12-08 | 深圳前海微众银行股份有限公司 | Resource management method, apparatus and device |
| CN113961321A (en) * | 2021-10-09 | 2022-01-21 | 国云科技股份有限公司 | Cross-cloud-platform resource scheduling method and device, terminal equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111221644B (en) | 2023-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102198680B1 (en) | Efficient data caching management in scalable multi-stage data processing systems | |
| CN109684065B (en) | Resource scheduling method, device and system | |
| US8595732B2 (en) | Reducing the response time of flexible highly data parallel task by assigning task sets using dynamic combined longest processing time scheme | |
| Anjos et al. | MRA++: Scheduling and data placement on MapReduce for heterogeneous environments | |
| CN108279974B (en) | Cloud resource allocation method and device | |
| US8843632B2 (en) | Allocation of resources between web services in a composite service | |
| US20180248934A1 (en) | Method and System for a Scheduled Map Executor | |
| CN107506145B (en) | Physical storage scheduling method and cloud host creation method | |
| CN112148468A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN111143331A (en) | Data migration method and device and computer storage medium | |
| CN111221644B (en) | Resource scheduling method, device and equipment | |
| CN110716813A (en) | Data stream processing method and device, readable storage medium and processor | |
| Dai et al. | Research and implementation of big data preprocessing system based on Hadoop | |
| CN109788013B (en) | Method, device and equipment for distributing operation resources in distributed system | |
| US11250001B2 (en) | Accurate partition sizing for memory efficient reduction operations | |
| CN112988383A (en) | Resource allocation method, device, equipment and storage medium | |
| US20150149498A1 (en) | Method and System for Performing an Operation Using Map Reduce | |
| CN117033170A (en) | Test task allocation method, device, equipment, storage medium and program product | |
| CN112148461A (en) | Application scheduling method and device | |
| CN116594734A (en) | Container migration method and device, storage medium and electronic equipment | |
| CN111984510B (en) | Performance test method and device for dispatching system | |
| CN113986846A (en) | Data processing method, system, device and storage medium | |
| CN108664323B (en) | Data transmission method and device based on multiple processors | |
| CN108134810B (en) | Method and system for determining resource scheduling component | |
| CN115858134B (en) | Method and device for controlling multitasking resources of solid state disk |
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 |