CN102426542A - Resource management system for data center and operation calling method - Google Patents
Resource management system for data center and operation calling method Download PDFInfo
- Publication number
- CN102426542A CN102426542A CN2011103354697A CN201110335469A CN102426542A CN 102426542 A CN102426542 A CN 102426542A CN 2011103354697 A CN2011103354697 A CN 2011103354697A CN 201110335469 A CN201110335469 A CN 201110335469A CN 102426542 A CN102426542 A CN 102426542A
- Authority
- CN
- China
- Prior art keywords
- group
- resource
- data center
- scheduling
- priority
- 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
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a resource management for a data center and an operation calling method applied to the system. The system comprises a plurality of physical nodes and a data center resource manager, which are arranged in the data center, wherein the data center resource manager is used for managing and distributing resources on the physical nodes by units of groups, and operation of each group can operate on any physical node meeting operation operating requirements in the data center; when load is high, the plurality of groups can proportionally share resources in the data center; when load is low, the groups with operation to be operated can proportionally apply for idle resources according to resource quota so as to send operation as much as possible; therefore, the resource utilization rate of the data center is improved. In addition, the quick capacity expansion and dynamic shrinkage of resources of multiple groups can be realized through modifying the resource quota and operation scheduling strategies of the groups; therefore, diversity and time for handling emergency, which are required by application operation scheduling, can be realized.
Description
Technical field
The invention belongs to the computer systems technology field, relate in particular to the method that improves data center's resource sharing efficient.
Background technology
Data center (DataCenter) typically refers to the place that focuses on, stores, transmits, exchanges, manages of the information that in a physical space, realizes, is made up of one or more group of planes that is positioned at same machine room.A group of planes is to couple together the computer system that constitutes by numerous servers or workstation (workstation) through express network, and the server or the workstation that constitute a group of planes are called as node.
In recent years; The internet, applications development rapidly; It is many to demonstrate application type; The big characteristics such as (any active ues amount, visit capacity and business datum amounts) of application scale makes the data center's scale that supports internet, applications sharply enlarge, and extends to several ten thousand or even hundreds of thousands platform scale by hundreds of platform, several thousand.And,, brought very big difficulty for data center's cluster operation scheduling owing to the diversity of application load characteristic, the diversity and the node resource dynamic in use of data center's node resource.How reasonably (for example: internet, applications), sharing group of planes resource efficiently, improve data center's resource utilization, is the key issue of data center's resource management in schedule job.
General data center's resource management system is shown in accompanying drawing 1; Adopting the method for resource partitioning is a plurality of independent partitions (a plurality of independently little group of planes) with data center's resource division; Characteristic according to application and resource; For each subregion (group of planes) is provided with different job scheduling strategies, under certain rule, the part resource can be leased in different by stages.This method is simple, easy to be realized, but exists group of planes quantity many, small scale, and operation can not be striden the phenomenon of the effective shared resource of subregion, causes resource fragmentation; In addition, the resource share method of leasing formula lacks dirigibility and instantaneity, causes operation dilatation and capacity reducing fast, can not adapt to the current internet demands of applications well, causes resource utilization low, and application cost is higher.
Summary of the invention
Therefore, the objective of the invention is to overcome the defective of above-mentioned prior art, a kind of data center's dispatching method of taking into account fair and capacity is provided.
The objective of the invention is to realize through following technical scheme:
On the one hand; The invention provides a kind of data center resource management system; Said system comprises a plurality of physical nodes and the data center resource manager that is positioned at data center; Said data center resource manager is that unit manages and distributes the resource on the physical node with the group, the resource on a plurality of physical nodes at one or more groups of shared data centers, and each group has resource quota and job scheduling algorithm separately; The resource quota of said each group is organized operable minimum resource usage quantity for this, and the operation of each group can run on any in the data center and satisfy on the physical node that job run requires.
In the said system; Data center resource manager can come group is managed with the configuration file mode; In said configuration file, for the attribute of each configuration set comprises: title, resource quota, the resource quantity seizing scheduling strategy, priority, used to user, job scheduling strategy, the operation of this group submit job of having the right.
In the said system, data center resource manager can be through revising the attribute that configuration file is set up group, deletion group or changed each group.
In the said system, user or use can be to a plurality of group submit jobs that the submit job authority is arranged wherein, but same operation can and can only be submitted to a group.
In the said system, wherein data center resource manager also is used to carry out job scheduling.
On the other hand, the invention provides a kind of job scheduling method that is used for said system, said method comprises:
Step 2, selection will be participated in the group of job scheduling;
In the said method, said step 1 can be calculated the priority of each group according to following formula:
The lowest common multiple of the resource quota of the priority of a group=all groups/this group has been used resource quantity.
In the said method, before said step 2, also comprise the step that a plurality of groups are sorted according to priority from high to low.
In the said method, said step 2 selects to participate in the group of job scheduling according to following priority:
(1) select priority the highest and the group of waiting for operation arranged;
(2) select all groups higher to wait for that number of jobs is 0, and this group is that the group of waiting for operation is arranged than this group priority;
(3) select front priority high, participated in job scheduling but unsuccessful group, and this group has used resource less than the high group of the priority of its resource quota.
In the said method, step 3) comprises
Step 31 is carried out job scheduling according to selected group job scheduling strategy;
Step 32 is if the job scheduling success then goes to step 1; If job scheduling is unsuccessful, judges whether to carry out operation and seize scheduling;
Step 33 is carried out operation to selected group and is seized scheduling;
Step 34 is dispatched successfully if operation is seized, and then sleeps a period of time, goes to step 1;
Otherwise, judge whether selected group be the minimum group of priority, if; Then sleep a period of time, go to step 1, otherwise select next group; And whether judge its quantity of having used resource less than its resource quota, if less than, then go to step 31; Otherwise sleep a period of time, go to step 1.
In the said method, step 32 can adopt following step to judge whether to carry out operation and seize scheduling:
When a group use resource less than the value of " its resource quota * first threshold " the time, need seize scheduling;
When a group use resource greater than the value of " resource quota * second threshold value " the time, it can be seized scheduling;
Wherein the span of first threshold be (0,1], the span of second threshold value be [1, natural number).
In the said method, first threshold can be that 0.9, the second threshold value can be 1.1.
Compared with prior art, the invention has the advantages that:
Be that unit manages with Resources allocation and carries out job scheduling with the group, the operation of each group can run on any one of data center to be satisfied on the node that job run required, had enough idling-resources, does not therefore have the phenomenon of division of resources and resource fragmentation.When load is high; A plurality of groups according to the resource quota resource at shared data center pro rata, when load is low, has the group of waiting for operation to apply for idling-resource pro rata by the resource quota; Issue operation as much as possible, thereby improve data center's resource utilization.And can realize the quick dilatation and dynamically contraction of a plurality of groups resource through the resource quota and the job scheduling strategy of modification group, satisfy the diversity and the demand of reply burst time of application job dispatching requirement.
Description of drawings
Followingly the embodiment of the invention is described further with reference to accompanying drawing, wherein:
Fig. 1 is the structural representation of existing data center resource management system;
Fig. 2 is the structural representation according to data center's resource management system of the embodiment of the invention;
Fig. 3 is the process flow diagram according to data center's job scheduling method of the embodiment of the invention.
Embodiment
In order to make the object of the invention, technical scheme and advantage are clearer, pass through specific embodiment to further explain of the present invention below in conjunction with accompanying drawing.Should be appreciated that specific embodiment described herein only in order to explanation the present invention, and be not used in qualification the present invention.
Shown in Figure 2 is the configuration diagram of data center's resource management system according to an embodiment of the invention.This system comprises a plurality of physical nodes and the data center resource manager that is positioned at data center.Wherein, data center resource manager is that unit distributes and manages the resource on a plurality of physical nodes and carry out job scheduling with group (Group).All resources at a plurality of groups of shared data centers.Can and select the job scheduling strategy for the certain resource quota of each set of dispense (Resource Quota).User or use can be to a plurality of group submit jobs that the submit job authority is arranged, but same operation can and can only be submitted to a group.A group can be represented user's group or application, and for example using can be like the IM instant messaging, happy farm, QQ recreation, the Internet service of Online Video etc.
Different with the subregion in the existing data center resource management system, the resource quota of distributing to a group is a logical concept, and expression guarantees to satisfy its operable minimum resources quantity, does not comprise the node listing that is exclusively used in this group.The operation of each group can run on any one of data center to be satisfied on the node that job run required, had enough idling-resources, does not therefore have the phenomenon of division of resources and resource fragmentation.And the subregion in the existing system is a physical concept, and subregion has the node of some separately usually, and is separate between the subregion.
Wherein, data center's resource division commonly used mainly comprises following several kinds of forms: (1) physical machine; (2) virtual machine for each virtual machine distribution calculation resource, mainly contains CPU, internal memory, disk and network; (3) groove (Slot) is divided into a plurality of grooves according to the CPU number of node; (4) Linux container (Container).The present invention can support multiple group of planes resource division mode, and just the resource of any type of data center can be managed and distributes according to method provided by the invention.
The job scheduling method that will introduce by hereinafter when group of planes load is high, is shared group of planes resource according to the resource quota for a plurality of groups liberally, satisfies the minimum resources demand of each group; When group of planes load is low, there is the group of waiting for operation to apply for group of planes idling-resource pro rata by the resource quota, issue operation as much as possible, thereby improve group of planes resource utilization, realize the scalable management of group of planes resource.
Data center resource manager can realize configuration and the management organized through the mode of configuration file (for example its can called after Group.conf).According to this configuration file, data center resource manager reads and configuration informations such as scheduling strategy and rights management are seized in resource quota, job scheduling strategy, the operation of each group of initialization.Through revising configuration file, can dynamically organize a plurality of groups, reach the dirigibility of data center's resource management.Also can organize for each increases various attributes and authority, for example is the suitable job scheduling strategy of each group selection, realizes the variation of data center's resource management, satisfies the diversity of internet, applications job scheduling demand.
In one embodiment, the Group.conf file layout for example is: the configuration to each group comprises following key word (key word and content can be isolated with colon):
Name: the name of group; It can be by the character string of capitalization (A-Z), lowercase (a-z), numeral (0-9) and underscore (_) formation; But its maximum length is no more than constant MAXGROUPNAMELEN (maximum zone name length), and the name of any two groups can not be identical.
ResourceQuota: the resource quota of this group, promptly should group minimum resources usage quantity.It must be the natural number greater than 0, and its span is (0, available resources quantity).
Users: have the right to the user profile of this group submit job formal description as follows:
" username|username " wherein: " | " expression " perhaps ".
SchedPolicy: the job scheduling strategy of this group.Can string representation, case-insensitive mainly contains: FIFO, Priority, Capacity, job scheduling strategies such as BackFill.
PreemptiveSchedPolicy: this group seize the job scheduling strategy.Can string representation, case-insensitive mainly contains: lower priority job is preferential, the running job priority scheduling is seized the job scheduling strategy recently.
Priority: the priority of this group.(the priority computing method of the group of the discussion that can vide infra)
UsedResource: this group all running job take the summation of resource quantity.
For the quantity Calculation mode of using resource, at present general has two kinds: (1) is directly calculated according to the number of CPU and is used resource quantity.(2) keystone resources computing method for example suppose that a station server has 4 CPU, 16G internal memory.The resource requirement of operation is 2CPU, the 4G internal memory.It has taken the CPU of whole service 1/2,1/4 internal memory, and the CPU maximum by occupation proportion calculates shared resource use amount, i.e. 1/2 station server;
Should point out that the present invention supports multiple resource computing method, the quantity of using resource that obtains a group that requires in the present invention, as for its concrete computing method, the user can select according to demand voluntarily.In addition, preceding text are relevant with the resource computing method about the setting of resource quota, if adopt the method for CPU number, its quota is as long as specify minimum spendable CPU number just passable; If adopt the keystone resources computing method, its resource quota need be specified CPU, internal memory, disk and the network bandwidth.
During system start-up, read the initial value that dispatching algorithm etc. is seized in resource quota, job scheduling algorithm and operation that configuration file obtains Group, but its value can on-the-fly modify when moving in system, for example can on-the-fly modify through API.During each job scheduling, calculate the priority of this group, and, select different job scheduling algorithms according to the dispatching algorithm configuration of this group according to the new resource quota value of group.Each Group can select suitable job scheduling strategy and operation to seize scheduling strategy according to the application load characteristic, satisfies the diversity of internet, applications job scheduling demand.
Fig. 3 shows the process flow diagram of data center's job scheduling method according to an embodiment of the invention.This method has adopted the job scheduling method of two-stage.First order job scheduling according to the priority of each group with used resource situation, selects to participate in the group of job scheduling, guarantees that a plurality of groups are shared group of planes resource pro rata according to the resource quota; Second level job scheduling according to selected group configuration, is selected the job scheduling algorithm, dispatches the wait operation of this group.Mainly may further comprise the steps: step 1, at first calculate the priority of each group and ordering from high to low according to priority; Step 2, the group of job scheduling is participated in selection; Step 3 according to selected group configuration, is carried out job scheduling.In addition, if the present load of a group of planes is high, resource is nervous, then utilizes operation to seize scheduling and realizes a plurality of groups according to the shared pro rata group of planes resource of resource quota.
In one embodiment, the priority of each group can by the resource quota of this group and it all running job take total resources and calculate, numerical value is big more, priority is low more, concrete computing method are following:
(1) the resource quota of a group is set;
(2) calculate the lowest common multiple that all organize the resource quotas;
That (3) calculates this group uses resource quantity;
(4) lowest common multiple of the resource quota of these group priority=all groups/this group has been used resource quantity; When this group had used resource to be 0, its priority was fixed as 0.
In above-mentioned group priority algorithm, through asking lowest common multiple, the number of resources of using divided by this group again can guarantee the shared cluster resource of a plurality of group by resource quota equitable proportion.For instance, two group A and B are arranged, the resource quota of group A is 2, and the resource quota of group B is 3; Move identical operation, the resource hypothesis that each operation consumes is 1, so when A running job number be 1, B running job number is 1 o'clock; The priority ratio A of B is high, comes the front during job scheduling, but as B when the running job number has been 2; Its priority value is 4, and the A priority value is 3, and A comes the front.Again for example, the resource quota of A and B all is 1, and A moves an operation, and B does not have running job, and during job scheduling, the priority ratio A of B is high, and when the B running job was two, the priority ratio B of A was high.
It is thus clear that above-mentioned priority computational algorithm about group by the ratio numerical value of using resource and its resource quota, sorts when sharing group of planes resource for a plurality of groups from low to high, has guaranteed to come the right that preferentially obtains job scheduling of front.The one-stop operation scheduling flow; Can select the high group of priority to carry out job scheduling; If the success of its job scheduling, then this job scheduling finishes, and carries out job scheduling next time; If it does not wait for operation or its back group use the resource quota of resource less than it, then can then dispatch the next operation of organizing.
In addition,, can according to priority sort from high to low, with the selection step of convenient back in order to improve the efficient of algorithm.
In one embodiment, can select to carry out the group of job scheduling according to following priority: (1) selects priority the highest and the group of waiting for operation arranged; (2) be chosen in all high groups of this group front priority and wait for that number of jobs is 0, and this group is that the group of waiting for operation is arranged; (3) select the high group of front priority, participated in job scheduling, but job scheduling is unsuccessful, wait for that just operation does not have coupling to go up suitable computational resource, and this group has been used the resource quota of resource less than it.Group in addition can not obtain the chance of job scheduling.
In one embodiment, can adopt job scheduling and operation to seize the mode that combines of scheduling and accomplish scheduling operation.Carrying out operation, to seize the purpose of scheduling be to guarantee that a plurality of groups are shared cluster resources liberally, prevents that the group from when a group of planes is idle, issuing a lot of operations, and all be long operation.The machine group busy hour, other group can be seized the operation that this group is seized in scheduling through operation, so that the operation of self is issued.
Should point out that the one-stop operation scheduling flow is only dispatched an operation of a group.Can find out that from preceding text the one-stop operation scheduling flow is divided into two steps, the one, selection will be carried out the group of job scheduling, and the 2nd, carry out job scheduling according to the group of selecting, but the job scheduling of this group is once only dispatched an operation.After the job scheduling success, the job scheduling flow process is accomplished, and can get into next job scheduling flow process, can recomputate the priority of each group, and these groups are resequenced.
More specifically, as shown in Figure 3, this method may further comprise the steps:
A) put sign IsSched and equal False;
Wherein, the effect of this sign is to judge whether the job scheduling flow process has selected a group to carry out job scheduling.Usually, can there be three kinds of situation in the possibility of selecting a group to carry out job scheduling: the highest group of priority is selected in (1), and this group has the wait operation, carries out job scheduling, and operation is resource matched, operation issues successfully, and then this job scheduling flow process finishes; (2) preferentially select the high group of priority to carry out job scheduling, but find that these groups do not wait for operation, then then dispatching priority is low, but the group of waiting for operation is arranged, and at this moment the IsSched value is false, because the group of front is not carried out job scheduling; (3) group that front priority is high has the wait operation, and job scheduling is unsuccessful, and then this time, IsSched value was true, and the job scheduling flow process can then be dispatched the group of back, still can add a condition, this group use the resource quota of resource less than it.The purpose of doing like this is: (a) guarantee the fairness between a plurality of groups the job scheduling, preferentially obtained the right of job scheduling with the little group of resource/this ratio of resource quota; (b) guarantee the least resource quota of each group.In other words, even if the group job of front scheduling is unsuccessful, come the group of back, what need only it uses the resource quota of resource less than it, its job scheduling of still having an opportunity to obtain.So not only can satisfy the least resource quota of each group, and when group of planes idling-resource, each is organized according to resource quota ratio, shares liberally.Promptly in the machine group busy hour, share group of planes resource according to resource quota equitable proportion for a plurality of groups; When a group of planes is not busy, the group of waiting for that operation need issue is arranged, according to resource quota ratio, the fair idling-resource of sharing.
B) calculate the priority of each group;
C) according to priority sort from high to low for group;
D) select the highest group of priority;
E) do you judge that selecteed group has the wait operation? No, then jump to step 1);
F) put sign IsSched and equal True;
G) according to the suitable job scheduling algorithm of selected group selection of configuration, carry out job scheduling; Introduce as preceding text, job scheduling algorithm's initial value is provided with in configuration file, but also can dynamically select.
H) do you judge selected group whether success of job scheduling? Success then jumps to step a);
I) do you judge that selected group of needs operation seize scheduling? Do not need, then jump to step 1);
Can be through two threshold values be set, A and B judge whether a group need carry out operation and seize scheduling and whether can be seized scheduling; Wherein the span of A be (0,1], for example can be 0.9; The span of B is [1; Natural number), can be 1.1 for example, the purpose that two threshold value A and b are set is to produce shake for fear of seizing scheduling.When a group use resource less than the value of " its resource quota * A " the time, need seize scheduling.When a group use resource greater than the value of " resource quota * B " the time, can be seized scheduling.The value of A and B can be configured according to demand.Group is seized in scheduling back a period of time (for example 20 seconds) and is not participated in job scheduling, that is to say that the job scheduling flow process can skip this group, and the direct group of scheduling back can prevent that like this job scheduling generation from shaking.And when a group by a period of time after seizing, for example one minute, if it use the resource quota of resource quantity greater than it, still do not participate in job scheduling.
J) scheduling is seized in the operation of carrying out this group;
K) do you judge whether successfully the Group operation seizes scheduling? Success then jumps to step o);
L) do you judge that this group is last group? Be then to jump to step o);
M) select next group;
N) judge selecteed group equal True with resource quantity less than its resource quota or IsSched? For very, then jump to step e);
O) sleep a period of time, go to step a);
Can find out that from above-mentioned steps the preferential group of selecting has the operation of wait and the highest group of priority, moreover be to select to have to wait for operation and participated in job scheduling with resource less than the group of its resource quota.System can also set a default set (Default Group), the resource quota of this group less (1%-5% that is about group of planes total resources).When group of planes load was high, because the resource quota of default set is few, priority was low, and its resource quota that is easy to surpass it with resource quantity, can not get scheduling and execution so the major part of default set is waited for operation; When group of planes load was low, default set can be applied for group of planes idling-resource pro rata by the resource quota, dispatches and carry out its wait operation, and its suitable user submits the operation that priority is low, do not have the deadline qualification to.
In addition, if a job scheduling success of selected group shows that then a group of planes has idling-resource, load is not high, gets into new job scheduling flow process immediately, can dispatch a large amount of little operations effectively; Otherwise, scheduling flow sleep a period of time, avoid repeating invalid job scheduling.
And the system manager can seize in operation under the help of scheduling through the resource quota of more reorganizing, and realizes the quick dilatation and dynamically contraction of a plurality of groups resource.
The application and the effect thereof of the system and method for explaining in the above-described embodiments by way of example below to be provided.For example; Because popularizing of smart mobile phone, increasing people take bus or subway in, login mobile phone application (news; Music; Books etc.) pastime riding time, make the peak period of mobile phone application concentrate on point seven thirty to nine of morning, five thirty thirty to seven of evening these two intervals.When people opened computer and start working, pc clients such as portal website, E-mail address, happy farm and web game were used the peak period that has welcome them.Leisure was used and was got into peak period, like online game, Online Video etc. to ten one points at 8 o'clock in evening.So can the resource quota that be applied in different time be set according to the difference of using peak period, such as the regulation mobile phone application in the morning the resource quota of seven thirty to nine be 20; Be 10 At All Other Times; The be on duty resource quota of period of news website is 50, and other period is 20, and the resource quota of online game is 50 the time in the evening; Be 20 At All Other Times; Seize under the assistance of dispatching and using services such as disposing automatically in operation, the use resource of each application realizes the quick dilatation of resource of each group and dynamically contraction along with the time variation is different and different.This is owing to the resource quota of passing through dynamically to change by the period each group, and each group priority can change, and can seize the resource of other group on one's own initiative and perhaps seized by other group.
Though the present invention is described through preferred embodiment, yet the present invention is not limited to described embodiment here, also comprises various changes and the variation done without departing from the present invention.
Claims (12)
1. data center's resource management system; Said system comprises a plurality of physical nodes and the data center resource manager that is positioned at data center; Said data center resource manager is that unit manages and distributes the resource on the physical node with the group; Resource on a plurality of physical nodes at one or more groups of shared data centers; Each group has resource quota and job scheduling algorithm separately, and the resource quota of said each group is organized operable minimum resource usage quantity for this, and the operation of each group can run on any in the data center and satisfy on the physical node that job run requires.
2. system according to claim 1; Wherein, Data center resource manager comes group is managed with the configuration file mode; In said configuration file, for the attribute of each configuration set comprises: title, resource quota, the resource quantity seizing scheduling strategy, priority, used to user, job scheduling strategy, the operation of this group submit job of having the right.
3. system according to claim 2, wherein, data center resource manager is through revising the attribute that configuration file is set up group, deletion group or changed each group.
4. system according to claim 2, user or use can be to a plurality of group submit jobs that the submit job authority is arranged wherein, but same operation can and can only be submitted to a group.
5. system according to claim 1, wherein data center resource manager also is used to carry out job scheduling.
6. job scheduling method that is used for like the described system of above-mentioned arbitrary claim, said method comprises:
Step 1 is calculated the priority of each group;
Step 2, selection will be participated in the group of job scheduling;
Step 3 is carried out job scheduling to selected group.
7. method according to claim 6, wherein, said step 1 is calculated the priority of each group with following formula:
The lowest common multiple of the resource quota of the priority of a group=all groups/this group has been used resource quantity.
8. method according to claim 6 wherein, also comprised the step that a plurality of groups are sorted according to priority from high to low before said step 2.
9. method according to claim 6, wherein, said step 2 selects to participate in the group of job scheduling according to following priority:
(1) select priority the highest and the group of waiting for operation arranged;
(2) select all groups higher to wait for that number of jobs is 0, and this group is that the group of waiting for operation is arranged than this group priority;
(3) select front priority high, participated in job scheduling but unsuccessful group, and this group has used resource less than the high group of the priority of its resource quota.
10. method according to claim 6, wherein, said step 3) comprises
Step 31 is carried out job scheduling according to selected group job scheduling strategy;
Step 32 is if the job scheduling success then goes to step 1; If job scheduling is unsuccessful, judges whether to carry out operation and seize scheduling;
Step 33 is carried out operation to selected group and is seized scheduling;
Step 34 is dispatched successfully if operation is seized, and then sleeps a period of time, goes to step 1;
Otherwise, judge whether selected group be the minimum group of priority, if; Then sleep a period of time, go to step 1, otherwise select next group; And whether judge its quantity of having used resource less than its resource quota, if less than, then go to step 31; Otherwise sleep a period of time, go to step 1.
11. method according to claim 10, wherein, the step below step 32 adopts judges whether to carry out operation and seizes scheduling:
When a group use resource less than the value of " its resource quota * first threshold " the time, need seize scheduling;
When a group use resource greater than the value of " resource quota * second threshold value " the time, it can be seized scheduling;
Wherein the span of first threshold be (0,1], the span of second threshold value be [1, natural number).
12. method according to claim 11, wherein first threshold is that 0.9, the second threshold value is 1.1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110335469 CN102426542B (en) | 2011-10-28 | 2011-10-28 | Resource management system for data center and operation calling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110335469 CN102426542B (en) | 2011-10-28 | 2011-10-28 | Resource management system for data center and operation calling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102426542A true CN102426542A (en) | 2012-04-25 |
| CN102426542B CN102426542B (en) | 2013-06-12 |
Family
ID=45960530
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110335469 Active CN102426542B (en) | 2011-10-28 | 2011-10-28 | Resource management system for data center and operation calling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102426542B (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102722413A (en) * | 2012-05-16 | 2012-10-10 | 上海兆民云计算科技有限公司 | Distributed resource scheduling method for desktop cloud cluster |
| CN102945185A (en) * | 2012-10-24 | 2013-02-27 | 深信服网络科技（深圳）有限公司 | Task scheduling method and device |
| CN103279390A (en) * | 2012-08-21 | 2013-09-04 | 中国科学院信息工程研究所 | Parallel processing system for small operation optimizing |
| CN103336714A (en) * | 2013-06-20 | 2013-10-02 | 北京奇虎科技有限公司 | Operation scheduling method and device |
| CN103491024A (en) * | 2013-09-27 | 2014-01-01 | 中国科学院信息工程研究所 | Job scheduling method and device for streaming data |
| CN103841126A (en) * | 2012-11-20 | 2014-06-04 | ***通信集团辽宁有限公司 | Shared resource deployment method and device |
| CN103945004A (en) * | 2014-05-06 | 2014-07-23 | 中国联合网络通信集团有限公司 | Dispatching method and system for data between data centers |
| CN104750558A (en) * | 2013-12-31 | 2015-07-01 | 伊姆西公司 | Resource allocation management method and device of hierarchical quota system |
| CN105320565A (en) * | 2014-07-31 | 2016-02-10 | 中国石油化工股份有限公司 | Computer resource scheduling method for various application software |
| CN106170769A (en) * | 2014-12-11 | 2016-11-30 | 华为技术有限公司 | Determine the method for resources of virtual machine, device and program product |
| CN107688492A (en) * | 2016-08-05 | 2018-02-13 | 阿里巴巴集团控股有限公司 | Control method, device and the cluster resource management system of resource |
| CN109086142A (en) * | 2018-09-25 | 2018-12-25 | 郑州云海信息技术有限公司 | A kind of resource regulating method and device based on Openlava |
| CN109992373A (en) * | 2017-12-29 | 2019-07-09 | 华为技术有限公司 | Resource regulating method, approaches to IM and device and task deployment system |
| CN110198356A (en) * | 2019-06-10 | 2019-09-03 | 莫毓昌 | A kind of user's request scheduling mechanism based on mixed cloud |
| CN110515737A (en) * | 2019-09-02 | 2019-11-29 | 北京明略软件***有限公司 | Data management task operation method and device |
| CN110915099A (en) * | 2017-08-09 | 2020-03-24 | 环球互连及数据中心公司 | Rack level power control |
| CN114500405A (en) * | 2021-12-27 | 2022-05-13 | 天翼云科技有限公司 | Resource allocation and acquisition method and device for multi-type service application |
| WO2024119536A1 (en) * | 2022-12-08 | 2024-06-13 | 中国科学院声学研究所 | Icn-network-based data center distributed resource scheduling method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1517872A (en) * | 2003-01-16 | 2004-08-04 | 国际商业机器公司 | Method and device for dynamic allocation of computer resource |
| CN101326489A (en) * | 2005-12-12 | 2008-12-17 | 微软公司 | OS mini-boot for running multiple environments |
-
2011
- 2011-10-28 CN CN 201110335469 patent/CN102426542B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1517872A (en) * | 2003-01-16 | 2004-08-04 | 国际商业机器公司 | Method and device for dynamic allocation of computer resource |
| CN101326489A (en) * | 2005-12-12 | 2008-12-17 | 微软公司 | OS mini-boot for running multiple environments |
Non-Patent Citations (1)
| Title |
|---|
| 汤小春，刘健: "《基于元区间的云计算基础设施服务的资源分配额研究》", 《计算机工程与应用》 * |
Cited By (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102722413B (en) * | 2012-05-16 | 2017-12-29 | 上海兆民云计算科技有限公司 | The distributed resource scheduling method that a kind of desktop cloud cluster uses |
| CN102722413A (en) * | 2012-05-16 | 2012-10-10 | 上海兆民云计算科技有限公司 | Distributed resource scheduling method for desktop cloud cluster |
| CN103279390A (en) * | 2012-08-21 | 2013-09-04 | 中国科学院信息工程研究所 | Parallel processing system for small operation optimizing |
| CN103279390B (en) * | 2012-08-21 | 2016-09-28 | 中国科学院信息工程研究所 | A kind of parallel processing system (PPS) towards little optimization of job |
| CN102945185B (en) * | 2012-10-24 | 2015-04-22 | 深信服网络科技（深圳）有限公司 | Task scheduling method and device |
| CN102945185A (en) * | 2012-10-24 | 2013-02-27 | 深信服网络科技（深圳）有限公司 | Task scheduling method and device |
| CN103841126B (en) * | 2012-11-20 | 2017-11-21 | ***通信集团辽宁有限公司 | The concocting method and device of a kind of shared resource |
| CN103841126A (en) * | 2012-11-20 | 2014-06-04 | ***通信集团辽宁有限公司 | Shared resource deployment method and device |
| CN103336714A (en) * | 2013-06-20 | 2013-10-02 | 北京奇虎科技有限公司 | Operation scheduling method and device |
| CN103491024B (en) * | 2013-09-27 | 2017-01-11 | 中国科学院信息工程研究所 | Job scheduling method and device for streaming data |
| CN103491024A (en) * | 2013-09-27 | 2014-01-01 | 中国科学院信息工程研究所 | Job scheduling method and device for streaming data |
| CN104750558B (en) * | 2013-12-31 | 2018-07-03 | 伊姆西公司 | The method and apparatus that resource allocation is managed in quota system is layered |
| CN104750558A (en) * | 2013-12-31 | 2015-07-01 | 伊姆西公司 | Resource allocation management method and device of hierarchical quota system |
| CN103945004B (en) * | 2014-05-06 | 2017-05-31 | 中国联合网络通信集团有限公司 | Data dispatching method and system between a kind of data center |
| CN103945004A (en) * | 2014-05-06 | 2014-07-23 | 中国联合网络通信集团有限公司 | Dispatching method and system for data between data centers |
| CN105320565A (en) * | 2014-07-31 | 2016-02-10 | 中国石油化工股份有限公司 | Computer resource scheduling method for various application software |
| CN105320565B (en) * | 2014-07-31 | 2018-11-20 | 中国石油化工股份有限公司 | A kind of computer scheduling of resource method for a variety of application software |
| CN106170769B (en) * | 2014-12-11 | 2020-01-21 | 华为技术有限公司 | Method, device and program product for determining virtual machine resources |
| CN106170769A (en) * | 2014-12-11 | 2016-11-30 | 华为技术有限公司 | Determine the method for resources of virtual machine, device and program product |
| CN107688492A (en) * | 2016-08-05 | 2018-02-13 | 阿里巴巴集团控股有限公司 | Control method, device and the cluster resource management system of resource |
| CN107688492B (en) * | 2016-08-05 | 2021-11-09 | 阿里巴巴集团控股有限公司 | Resource control method and device and cluster resource management system |
| CN110915099A (en) * | 2017-08-09 | 2020-03-24 | 环球互连及数据中心公司 | Rack level power control |
| CN109992373A (en) * | 2017-12-29 | 2019-07-09 | 华为技术有限公司 | Resource regulating method, approaches to IM and device and task deployment system |
| CN109992373B (en) * | 2017-12-29 | 2021-04-09 | 华为技术有限公司 | Resource scheduling method, information management method and device and task deployment system |
| CN109086142A (en) * | 2018-09-25 | 2018-12-25 | 郑州云海信息技术有限公司 | A kind of resource regulating method and device based on Openlava |
| CN109086142B (en) * | 2018-09-25 | 2022-03-25 | 郑州云海信息技术有限公司 | Resource scheduling method and device based on Openlava |
| CN110198356A (en) * | 2019-06-10 | 2019-09-03 | 莫毓昌 | A kind of user's request scheduling mechanism based on mixed cloud |
| CN110515737A (en) * | 2019-09-02 | 2019-11-29 | 北京明略软件***有限公司 | Data management task operation method and device |
| CN114500405A (en) * | 2021-12-27 | 2022-05-13 | 天翼云科技有限公司 | Resource allocation and acquisition method and device for multi-type service application |
| WO2024119536A1 (en) * | 2022-12-08 | 2024-06-13 | 中国科学院声学研究所 | Icn-network-based data center distributed resource scheduling method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102426542B (en) | 2013-06-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102426542B (en) | Resource management system for data center and operation calling method | |
| CN104092767B (en) | A kind of publish/subscribe system and its method of work for increasing message queue model | |
| CN111290854B (en) | Task management method, device, system, computer storage medium and electronic equipment | |
| US10003500B2 (en) | Systems and methods for resource sharing between two resource allocation systems | |
| US20100223618A1 (en) | Scheduling jobs in a cluster | |
| US8843929B1 (en) | Scheduling in computer clusters | |
| CN101146127B (en) | A client buffer update method and device in distributed system | |
| CN102307133A (en) | Virtual machine scheduling method for public cloud platform | |
| CN103516585A (en) | Method and system for distributing messages according to priorities | |
| KR20120017411A (en) | Priority-based management of system load level | |
| CN103927225A (en) | Multi-core framework Internet information processing and optimizing method | |
| CN102981973B (en) | Perform the method for request within the storage system | |
| JP2005234637A (en) | Method and device for managing computer resource and processing program | |
| US9817698B2 (en) | Scheduling execution requests to allow partial results | |
| Tao et al. | Job scheduling optimization for multi-user MapReduce clusters | |
| CN113419846A (en) | Resource allocation method and device, electronic equipment and computer readable storage medium | |
| Shi et al. | Multijob associated task scheduling for cloud computing based on task duplication and insertion | |
| WO2022062981A1 (en) | Resource scheduling method and system, electronic device, and computer-readable storage medium | |
| CN112764909B (en) | Sharing method and system based on cloud architecture workstation | |
| CN107454137B (en) | Method, device and equipment for on-line business on-demand service | |
| CN103051511B (en) | A kind of processing method of message data and device | |
| CN114489978A (en) | Resource scheduling method, device, equipment and storage medium | |
| CN117056064A (en) | Resource allocation method, device, server, storage medium and program product | |
| CN102929605A (en) | Cloud-computing-based open interface of data mining system | |
| CN112291320A (en) | Distributed two-layer scheduling method and system for quantum computer cluster |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |