CN111221644B - Resource scheduling method, device and equipment - Google Patents

Resource scheduling method, device and equipment Download PDF

Info

Publication number
CN111221644B
CN111221644B CN201811427658.5A CN201811427658A CN111221644B CN 111221644 B CN111221644 B CN 111221644B CN 201811427658 A CN201811427658 A CN 201811427658A CN 111221644 B CN111221644 B CN 111221644B
Authority
CN
China
Prior art keywords
scheduling
resource
tag
group
tag group
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
Application number
CN201811427658.5A
Other languages
Chinese (zh)
Other versions
CN111221644A (en
Inventor
杨天洋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Priority to CN201811427658.5A priority Critical patent/CN111221644B/en
Publication of CN111221644A publication Critical patent/CN111221644A/en
Application granted granted Critical
Publication of CN111221644B publication Critical patent/CN111221644B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements 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/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

The application discloses a resource scheduling method, which comprises the following steps: obtaining scheduling requirement information; comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag; and taking the resources corresponding to the resource tag group matched with the scheduling tag group as scheduling resources conforming to the scheduling demand information. By adopting the method, the problem that more complex combination and enumeration of the scheduling tags are required in the prior art is solved.

Description

Resource scheduling method, device and equipment
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 the cloud storage system, machines covering different BU (Business 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 for deploying the application a has high availability requirement, so that a plurality of sub-clusters can be split, and the global service quality is not greatly influenced when a single sub-cluster has a problem. While the B application involves being a non-core application, only one cluster is deployed for cost reasons, even to borrow cluster resources of the a application.
Under the above background, a cluster has different scheduling labels under different scenes, for example, in the requirement of an application a, the scheduling labels of two dimensions are required to be matched to allocate resources, and when the same resources face the requirement of an application B, only one of the scheduling labels of one dimension needs to be considered. At this time, there may be multiple values on the same scheduling tag, and another scheduling tag may or may not be present. Most scheduling systems are scheduled based on one dimension of scheduling label, and full matching resources are found out to meet according to each scheduling label in application scheduling requirements.
In the scheduling tag processing method in the prior art, each resource is provided with a resource tag group, the resource tag group comprises at least one scheduling tag, each scheduling tag has a name and a value, the names of the scheduling tags cannot be the same, and one or more scheduling tag inner values can be provided. If the scheme is to be used for realizing the corresponding scene, all values need to be enumerated and filled in the scene where the second scheduling label does not exist; if duplicate values occur between scheduling tags of different dimensions, then manual combining is necessary to ensure that the duplicate values do not interfere with each other. If more complex scenarios follow, more complex merging and enumeration of the scheduling tags is required, and maintenance effort is greatly increased.
Disclosure of Invention
The application provides a resource scheduling method to solve the problem that more complex merging and enumeration of scheduling labels are needed in the prior art.
The application provides a resource scheduling method, which comprises the following steps:
obtaining scheduling requirement information;
comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
and taking the resources corresponding to the resource tag group matched with the scheduling tag group as scheduling resources conforming to the scheduling demand information.
Optionally, the taking 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 largest weight matched with the scheduling tag group as the scheduling resource conforming to the scheduling demand 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:
sorting the resource tag groups according to the weights of the resource tag groups to obtain sorted resource tag groups;
and generating a resource tag group list according to the ordered resource tag groups.
Optionally, the sorting the resource tag groups according to weights of the resource tag groups to obtain sorted resource tag groups includes: and if the plurality of resource tag groups correspond to the same weight, randomly arranging the sequence among the plurality of 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 tag groups contained in the scheduling demand information with the resource tag groups in the resource tag group list sequentially.
Optionally, the taking the resource corresponding to the resource tag group with the largest 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 weights;
and taking the resource corresponding to the resource tag group with the largest 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 containing all scheduling tags of the scheduling tag group and corresponding tag values.
Optionally, the resource is a switch cluster.
The application also provides a resource scheduling device, which comprises:
the scheduling demand information obtaining unit is used for obtaining scheduling demand information;
the label group comparison unit is used for comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
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 conforming to the scheduling requirement information.
The application also provides an electronic device comprising:
a processor; and
and the memory is used for storing a program of the resource scheduling method, and after the equipment is powered on and runs the program of the resource scheduling method through the processor, the following steps are executed:
obtaining scheduling requirement information;
comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
and taking the resources corresponding to the resource tag group matched with the scheduling tag group as scheduling resources conforming to the scheduling demand information.
The present application also provides a memory 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 the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
and taking the resources corresponding to the resource tag group matched with the scheduling tag group as scheduling resources conforming to the scheduling demand information.
Compared with the prior art, the application has the following advantages:
the application provides a resource scheduling method, a device, electronic equipment and storage equipment, wherein at least one resource corresponds to a plurality of resource tag groups, and scheduling tag groups contained in scheduling demand information are compared with the resource tag groups corresponding to the resources; and taking the resources corresponding to the resource tag group matched with the scheduling tag group as the scheduling resources conforming to the scheduling requirement information, thereby avoiding more complex merging and enumeration of the scheduling tags.
Drawings
Fig. 1 is a flowchart of a resource scheduling method according to a first embodiment of the present application.
Fig. 2 is a scenario 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. The present invention may be embodied in many other forms than those herein described, and those skilled in the art will readily appreciate that the present invention may be similarly embodied without departing from the spirit or essential characteristics thereof, and therefore the present invention is not limited to the specific embodiments disclosed below.
Before describing the embodiments, some terms of art to which the present application relates will be described.
Scheduling label (label): one way to describe resources after abstraction, for example, disk preference is a scheduling tag, and the value may be capacity priority or performance priority.
Scheduling requirements: a set of constraint requirements set forth when applying for resources.
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 includes: scheduling label and the like, for example, scheduling label and the like to which scheduling needs are applied.
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; wherein 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 respectively a scheduling tag a, a scheduling tag B, and a scheduling tag C.
The resource refers to a resource which can be scheduled by a scheduling system, and particularly may refer to a cloud computing resource, namely a sub-cluster.
At least one of all the resources that the scheduling system can schedule corresponds to a plurality of resource tag groups, and one resource tag group contains 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, namely resource tag group 1, resource tag group 2 and resource tag group 3, and resource tag group 1 includes 2 scheduling tags: a scheduling label A and a 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: scheduling label A, scheduling label B and scheduling label C, wherein the value of scheduling label A is 2, the value of scheduling label B is 4 and the value of scheduling label C is 5; the resource tag group 3 comprises a scheduling tag A with a value of 3; the resource 2 is provided with a resource tag group 4, the resource tag group 4 comprising three scheduling tags: scheduling label a, scheduling label B, scheduling label C, scheduling label a having a value of 1, scheduling label B having a value of 1, and scheduling label C having a value of 3.
As can be seen from the figure, one or more resource tag groups are disposed on one resource, and fig. 3 is only a simple schematic diagram, and in implementation, the number of resource tag groups that can be disposed on one resource is not particularly limited, and may be set according to needs, for example, 100 resource tag groups may be disposed on a certain resource. As more resource tag groups are arranged on the resources, the scheduling tag groups with different application requirements can be matched with the proper resource tag groups, and more complicated combination and enumeration of the scheduling tags are avoided.
In specific implementation, each resource tag group can be stored as a table, and the table is stored 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 label A 2
Scheduling label B 4
Scheduling label C 5
And comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource, namely respectively comparing the value of each scheduling label in the scheduling label group contained in the scheduling demand information with the value of each scheduling label of the resource label group corresponding to the resource. It may be determined whether the scheduling tag set matches the resource tag set based on the result of the comparison.
In order to enable the application scheduling requirements to obtain the optimal resources to serve, a corresponding weight may be set for each resource tag group.
In the specific implementation, the weight of which resource tag group is set is not specifically defined, and may be set at will by a developer. The weight of the resource tag group 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 weight of the scheduling tag group corresponding to the resource a may be set to be smaller and the weight of the scheduling tag group corresponding to the resource B may be set to be larger; the weight of the resource tag group may also be set according to the number of scheduling tags corresponding to the resource tag group, for example, if the number of scheduling tags corresponding to the resource tag group a is 3 and the number of 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, a resource corresponding to the resource tag group matched with the scheduling tag group is used as a scheduling resource conforming to 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 to which the scheduling requirement 4 is applied includes 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, the value of scheduling label C is 3, and the resource label group 4 comprises three scheduling labels: the method comprises the steps of scheduling a, scheduling B and scheduling C, wherein the value of the scheduling a is 1, the value of the scheduling B is 1, the value of the scheduling C is 3, the resource tag group 4 comprises all scheduling tags of the scheduling tag group of the application scheduling requirement 4, the corresponding tag values are the same, the resource tag group 4 is a resource tag group matched with the scheduling tag group of the application scheduling requirement 4, and the resource 2 corresponding to the resource tag group 4 is used as scheduling resource meeting the application scheduling requirement 4; if there is no resource tag group containing all the scheduling tags and the corresponding tag values of the scheduling tag group, the resource tag group containing part of the scheduling tags and the corresponding tag values of the scheduling tag group may also be used as a resource tag group matched with the scheduling tag group, for example, as shown in fig. 2, the scheduling tag group applying the scheduling requirement 2 contains three scheduling tags: the resource tag group 3 can be used as a resource tag group matched with the scheduling tag group of the application scheduling requirement 2, and the resource 1 corresponding to the resource tag group 3 can be used as a scheduling resource meeting the application scheduling requirement 2 because the scheduling tag group which is completely matched with the scheduling tag group of the application scheduling requirement 2 does not exist in the scheduling system.
Taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource conforming to the scheduling requirement information, comprising the following steps:
and taking the resource corresponding to the resource tag group with the largest weight matched with the scheduling tag group as the scheduling resource conforming to the scheduling demand information.
Before the step of comparing the scheduling tag group contained in the scheduling requirement information with the resource tag group corresponding to the resource, the method further comprises the following steps:
sorting the resource tag groups according to the weights of the resource tag groups to obtain sorted resource tag groups;
and generating a resource tag group list according to the ordered resource tag groups.
The comparing the scheduling tag group contained in the scheduling requirement information with the resource tag group corresponding to the resource comprises the following steps:
and comparing the scheduling tag groups contained in the scheduling demand information with the resource tag groups in the resource tag group list sequentially.
The resource tag groups are firstly ordered according to the weight of the resource tag groups, an ordered resource tag group list is generated, then the scheduling tag groups contained in the scheduling demand information are sequentially compared with the resource tag groups in the resource tag group list, and the matching efficiency of the scheduling tag groups contained in the scheduling demand information and the resource tag groups can be improved. And 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 conforming to the scheduling requirement information, and the resource tag group with lower matching weight does not need to be continuously matched.
When the resource tag groups are ranked according to the weights of the resource tag groups, if there are cases where the plurality of resource tag groups correspond to the same weights, the order among the plurality of resource tag groups may be randomly arranged, and the ranked resource tag groups may be obtained. For example, if there are 10 resource tag groups with the same weight, the order among the 10 resource tag groups may be arranged randomly.
The method (first method) comprises the steps of firstly sequencing the resource tag groups according to the weights of the resource tag groups, and then sequentially comparing the scheduling tag groups contained in the scheduling demand information with the resource tag groups in a resource tag group list, wherein the corresponding resources can be directly used as scheduling resources meeting the scheduling demand information as long as the matched resource tag groups are found; in another mode (a second mode), the scheduling tag groups contained in the scheduling requirement information are matched with the resource tag groups to obtain all the resource tag groups successfully matched with the scheduling tag groups, then all the successfully matched resource tag groups are ordered according to weights, and the resource corresponding to the resource tag group with the largest weight is used as the scheduling resource of the scheduling requirement.
The step of using the resource corresponding to the resource tag group with the largest weight matched with the demand tag as the scheduling resource conforming to the scheduling demand information comprises the following steps:
sequencing all successfully matched resource tag groups according to weights;
and taking the resource corresponding to the resource tag group with the largest weight as the scheduling resource of the scheduling demand information.
For example, as shown in fig. 2, if the step S102 is performed, all the 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, and since resource 2 where resource tag group 4 is located is only one resource tag group, resource 1 where resource tag group 1 is located has 3 resource tag groups, the weight of resource tag group 4 is greater than that of resource tag group 1, all the successfully matched resource tag groups are ranked according to the weight, and resource 2 corresponding to 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 mode firstly sorts the resource tag groups according to the weights, and then compares the resource tag groups, the weight of the resource tag group successfully matched with the scheduling tag group is the largest, and the resource corresponding to the resource tag group can be used as the scheduling resource for applying the scheduling requirement as long as the resource tag group successfully matched with the scheduling tag group is found out; the second mode needs to compare the scheduling tag group with all the resource tag groups, then ranks all the successfully matched resource tag groups according to the weights, and uses the resource corresponding to the resource tag group with the largest weight as the scheduling resource for applying the scheduling requirement.
Thus, a detailed description is provided for a resource scheduling method provided in the first embodiment of the present application, where the first embodiment of the present application solves the problem that in the prior art, scheduling tags of a resource tag group need to be enumerated and combined by setting a plurality of resource tag groups on a resource.
Corresponding to the resource scheduling method provided in the first embodiment of the present application, the second embodiment of the present application further provides a resource scheduling device.
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 the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
and 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 that meets 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 largest weight matched with the scheduling tag group as the scheduling resource conforming to the scheduling demand information.
Optionally, the apparatus further includes: a resource tag group list generating unit,
before the label group comparison unit works, the resource label groups are ordered according to the weights of the resource label groups, so that the ordered resource label groups are obtained;
and generating a resource tag group list according to the ordered resource tag groups.
Optionally, the sorting the resource tag groups according to weights of the resource tag groups to obtain sorted resource tag groups includes: and if the plurality of resource tag groups correspond to the same weight, randomly arranging the sequence among the plurality of resource tag groups.
Optionally, the tag group comparing unit is specifically configured to:
and comparing the scheduling tag groups contained in the scheduling demand information with the resource tag groups in the resource tag group list sequentially.
Optionally, the taking the resource corresponding to the resource tag group with the largest 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 weights;
and taking the resource corresponding to the resource tag group with the largest weight as the scheduling resource of the scheduling requirement.
Optionally, the device 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 containing 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 device 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, which is not repeated here.
Corresponding to the resource scheduling method provided in the first embodiment of the present application, the third embodiment of the present application further provides an electronic device.
As shown in fig. 4, the electronic device includes:
a processor 401; and
a memory 402, configured to store a program of a resource scheduling method, and after the device is powered on and the program of the resource scheduling method is executed by the processor, perform the following steps:
obtaining scheduling requirement information;
comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
and taking the resources corresponding to the resource tag group matched with the scheduling tag group as scheduling resources conforming to the scheduling demand information.
Optionally, the taking 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 largest weight matched with the scheduling tag group as the scheduling resource conforming to the scheduling demand 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:
sorting the resource tag groups according to the weights of the resource tag groups to obtain sorted resource tag groups;
and generating a resource tag group list according to the ordered resource tag groups.
Optionally, the sorting the resource tag groups according to weights of the resource tag groups to obtain sorted resource tag groups includes: and if the plurality of resource tag groups correspond to the same weight, randomly arranging the sequence among the plurality of 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 tag groups contained in the scheduling demand information with the resource tag groups in the resource tag group list sequentially.
Optionally, the taking the resource corresponding to the resource tag group with the largest 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 weights;
and taking the resource corresponding to the resource tag group with the largest 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 containing 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, which is not repeated here.
Corresponding to the resource scheduling method provided in the first embodiment of the present application, the fourth embodiment of the present application further provides a storage device, where a program of the resource scheduling method is stored, and the program is executed by a processor, and performs the following steps:
obtaining scheduling requirement information;
comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
and taking the resources corresponding to the resource tag group matched with the scheduling tag group as scheduling resources conforming to the scheduling demand 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, which is not repeated here.
While the preferred embodiment has been described, it is not intended to limit the invention thereto, and any person skilled in the art may make variations and modifications without departing from the spirit and scope of the invention, so that the scope of the invention shall be defined by the claims of the present application.
In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
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 storage media for a computer 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, which can be used to store information that can be accessed by a computing device. Computer readable media, as defined herein, does not include non-transitory computer readable media (transmission media), such as modulated data signals and carrier waves.
It will be appreciated by those skilled in the art that 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 (10)

1. A method for scheduling resources, comprising:
obtaining scheduling requirement information;
comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource conforming to the scheduling demand information, wherein the resource tag group matched with the scheduling tag group is a resource tag group containing all scheduling tags and corresponding tag values of the scheduling tag group, or the resource tag group matched with the scheduling tag group is a resource tag group containing part of the scheduling tags and corresponding tag values of the scheduling tag group, or the resource tag group matched with the scheduling tag group is a resource tag group with the largest weight matched with the scheduling tag group.
2. The method of claim 1, further comprising, prior to the step of comparing the set of scheduling tags contained in the scheduling requirement information with the set of resource tags corresponding to the resource:
sorting the resource tag groups according to the weights of the resource tag groups to obtain sorted resource tag groups;
and generating a resource tag group list according to the ordered resource tag groups.
3. The method of claim 2, wherein the sorting the resource tag groups according to the weights of the resource tag groups to obtain sorted resource tag groups comprises: and if the plurality of resource tag groups correspond to the same weight, randomly arranging the sequence among the plurality of resource tag groups.
4. The method of claim 3, wherein comparing the scheduling tag set included in the scheduling requirement information with the resource tag set corresponding to the resource comprises:
and comparing the scheduling tag groups contained in the scheduling demand information with the resource tag groups in the resource tag group list sequentially.
5. The method according to claim 1, wherein taking the resource corresponding to the resource tag group with the largest weight matched with the demand tag as the scheduling resource conforming to the scheduling demand information comprises:
sequencing all successfully matched resource tag groups according to weights;
and taking the resource corresponding to the resource tag group with the largest weight as the scheduling resource of the scheduling requirement.
6. The method of claim 1, wherein the weights of the resource tag groups are set according to the number of scheduling tag groups to which the resource corresponds.
7. The method of claim 1, wherein the resource is a cluster of switches.
8. A resource scheduling apparatus, comprising:
the scheduling demand information obtaining unit is used for obtaining scheduling demand information;
the label group comparison unit is used for comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
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 conforming to the scheduling requirement information, wherein the resource tag group matched with the scheduling tag group is a resource tag group containing all scheduling tags and corresponding tag values of the scheduling tag group, or the resource tag group matched with the scheduling tag group is a resource tag group containing part of the scheduling tags and corresponding tag values of the scheduling tag group, or the resource tag group matched with the scheduling tag group is a resource tag group with the largest weight matched with the scheduling tag group.
9. An electronic device, comprising:
a processor; and
and the memory is used for storing a program of the resource scheduling method, and after the equipment is powered on and runs the program of the resource scheduling method through the processor, the following steps are executed:
obtaining scheduling requirement information;
comparing the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource conforming to the scheduling demand information, wherein the resource tag group matched with the scheduling tag group is a resource tag group containing all scheduling tags and corresponding tag values of the scheduling tag group, or the resource tag group matched with the scheduling tag group is a resource tag group containing part of the scheduling tags and corresponding tag values of the scheduling tag group, or the resource tag group matched with the scheduling tag group is a resource tag group with the largest weight matched with the scheduling tag group.
10. A memory 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 the scheduling label group contained in the scheduling demand information with the resource label group corresponding to the resource; wherein at least one resource corresponds to a plurality of resource tag groups, and one resource tag group comprises at least one scheduling tag;
and taking the resource corresponding to the resource tag group matched with the scheduling tag group as the scheduling resource conforming to the scheduling demand information, wherein the resource tag group matched with the scheduling tag group is a resource tag group containing all scheduling tags and corresponding tag values of the scheduling tag group, or the resource tag group matched with the scheduling tag group is a resource tag group containing part of the scheduling tags and corresponding tag values of the scheduling tag group, or the resource tag group matched with the scheduling tag group is a resource tag group with the largest weight matched with the scheduling tag group.
CN201811427658.5A 2018-11-27 2018-11-27 Resource scheduling method, device and equipment Active CN111221644B (en)

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 CN111221644A (en) 2020-06-02
CN111221644B true 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)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113360284A (en) * 2021-06-04 2021-09-07 深圳前海微众银行股份有限公司 Resource management method, device and equipment

Citations (4)

* Cited by examiner, † Cited by third party
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
CN106126347A (en) * 2016-08-17 2016-11-16 浪潮电子信息产业股份有限公司 A kind of method effectively realizing mainframe cluster scheduling of resource 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

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9038083B2 (en) * 2012-02-09 2015-05-19 Citrix Systems, Inc. Virtual machine provisioning based on tagged physical resources in a cloud computing environment

Patent Citations (4)

* Cited by examiner, † Cited by third party
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
CN106126347A (en) * 2016-08-17 2016-11-16 浪潮电子信息产业股份有限公司 A kind of method effectively realizing mainframe cluster scheduling of resource 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)

* Cited by examiner, † Cited by third party
Title
Hyun Jung Lee等.Construction of Tag-Based Dynamic Data Catalog (TaDDCat) Using Ontology.2012 15th International Conference on Network-Based Information Systems.2012,全文. *
唐瑞.基于Kubernetes的容器云平台资源调度策略研究.中国优秀硕士学位论文全文数据库 信息科技辑.2018,(第02期),全文. *
夏秀峰 ; 张姝 ; 李晓明 ; .一种个性化标签云中的标签排序算法.沈阳航空航天大学学报.2011,第28卷(第01期),全文. *

Also Published As

Publication number Publication date
CN111221644A (en) 2020-06-02

Similar Documents

Publication Publication Date Title
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
CN106293893B (en) Job scheduling method and device and distributed system
US20200218579A1 (en) Selecting a cloud service provider
CN103649910A (en) Virtual machine placement
US20120089734A1 (en) Allocation of resources between web services in a composite service
CN112905342B (en) Resource scheduling method, device, equipment and computer readable storage medium
CN110782122B (en) Data processing method and device and electronic equipment
CN112463375A (en) Data processing method and device
CN109739627B (en) Task scheduling method, electronic device and medium
CN114818446B (en) Power service decomposition method and system facing 5G cloud edge terminal cooperation
CN112148468A (en) Resource scheduling method and device, electronic equipment and storage medium
CN110716813A (en) Data stream processing method and device, readable storage medium and processor
CN104410666A (en) Method and system for implementing heterogeneous storage resource management under cloud computing
CN105630601A (en) Resource allocation method and system based on real-time computing
CN111221644B (en) Resource scheduling method, device and equipment
US20130212584A1 (en) Method for distributed caching and scheduling for shared nothing computer frameworks
US11250001B2 (en) Accurate partition sizing for memory efficient reduction operations
US10901972B2 (en) Table partition configuration method, apparatus and system for database system
CN116594734A (en) Container migration method and device, storage medium and electronic equipment
US20230015635A1 (en) Operating cloud-managed remote edge sites at reduced disk capacity
Quinten et al. Using feature modelling and automations to select among cloud solutions
US8918555B1 (en) Adaptive and prioritized replication scheduling in storage clusters
CN112148461A (en) Application scheduling method and device
CN109947613A (en) File read test method and apparatus

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