CN105389212B - A kind of activity allocation method and device - Google Patents
A kind of activity allocation method and device Download PDFInfo
- Publication number
- CN105389212B CN105389212B CN201510694921.7A CN201510694921A CN105389212B CN 105389212 B CN105389212 B CN 105389212B CN 201510694921 A CN201510694921 A CN 201510694921A CN 105389212 B CN105389212 B CN 105389212B
- Authority
- CN
- China
- Prior art keywords
- allocated
- feature vector
- operation set
- subjob
- operational feature
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 17
- 238000011156 evaluation Methods 0.000 description 2
- 230000007547 defect Effects 0.000 description 1
- 238000013139 quantization Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5044—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering hardware capabilities
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/503—Resource availability
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of activity allocation method and devices, method includes the following steps: determining the quantity of operation set according to the quantity that can use calculate node；According to the corresponding operational feature vector of each operation to be allocated, each operation set is initialized as only comprising a kind of subjob by a selection kind subjob from all operations to be allocated respectively；The corresponding operational feature vector of other operations to be allocated according to the corresponding set feature vector of each operation set, and except kind subjob, other operations to be allocated are included into corresponding operation set；Operation in each operation set is respectively allocated to corresponding available calculate node.The present invention can maximize demand type of the different work to hardware resource in the same calculate node of difference, thus by different types of operation reasonable distribution to different calculate nodes, different work is set to be utilized respectively different types of hardware resource on same node, to reach the efficient utilization of resource.
Description
Technical field
The present invention relates to field of computer technology, and in particular to a kind of activity allocation method and device.
Background technique
As the proposition and internet of " internet+" strategy dominate the epoch to industry internet to consume internet
The leading epoch gradually shift, and more and more calculating business will move in large-scale data center.But different calculating
Demand of the business (operation) to hardware resource is different, and priority is also different, if reasonable distribution can not be carried out to operation,
It will lead to operation and intensively compete same type hardware resource, not can guarantee the continuous service of key business, can also to calculate and save
The hardware resource of point cannot be utilized efficiently.
Summary of the invention
The present invention provides a kind of activity allocation method and devices, can not be efficiently sharp to solve existing activity allocation method
With the defect of hardware resource.
The present invention provides a kind of activity allocation methods, comprising the following steps:
According to the quantity that can use calculate node, the quantity of operation set is determined；According to the corresponding work of each operation to be allocated
Industry feature vector, the selection kind subjob from all operations to be allocated, the quantity of the operation set and the calculating section
The quantity of point is identical, and the quantity of described kind of subjob is identical as the quantity of the operation set；
Each operation set is initialized as respectively only comprising a kind of subjob, and different work set includes different
Kind subjob；
According to other works to be allocated except the corresponding set feature vector of each operation set and described kind of subjob
Other described operations to be allocated are included into corresponding operation set by the corresponding operational feature vector of industry；
Operation in each operation set is respectively allocated to corresponding available calculate node, and different operation set pair
Answer different available calculate nodes.
Optionally, it according to the corresponding operational feature vector of each operation to be allocated, is selected from all operations to be allocated kind
Before subjob, further includes:
Corresponding operational feature vector is constructed to each operation to be allocated respectively.
Optionally, the operational feature vector includes cpu demand value, memory requirement value, disk read-write frequency needs value, net
Network bandwidth resources requirements and precedence information；
It is described that corresponding operational feature vector is constructed to each operation to be allocated respectively, specifically:
According to the history data of each operation to be allocated, quantify the cpu demand value of each operation to be allocated, memory needs
Evaluation, disk read-write frequency needs value and network bandwidth resources requirements, and according to the cpu demand value of each operation to be allocated,
Memory requirement value, disk read-write frequency needs value and network bandwidth resources requirements and the priority of each operation to be allocated
Information constructs the corresponding operational feature vector of each operation to be allocated.
Optionally, according to other except the corresponding set feature vector of each operation set and described kind of subjob
The corresponding operational feature vector of operation to be allocated, other described operations to be allocated is included into corresponding operation set, specifically
Are as follows:
S1, select the operation to be allocated not being included into operation set as current work；
S2, the set feature vector for calculating separately each operation set operational feature vector corresponding with the current work
The distance between, it selects maximum apart from corresponding operation set cooperation to be target collection, the current work is included into described
In target collection, update the set feature vector of the target collection, judge whether there is be not included into operation set to
Operation is distributed, if it is, return step S1；Otherwise, it determines the operation to be allocated is included into operation set.
Optionally, the set feature vector operational feature vector corresponding with the current work of each operation set
The distance between, specifically:
Euler between each operation set feature vector operational feature vector corresponding with the current work away from
From the quotient with the operation quantity in the operation set.
The present invention also provides a kind of operation distributors, comprising:
Selecting module, for determining the quantity of operation set according to the quantity that can use calculate node；According to each to be allocated
The corresponding operational feature vector of operation, selection kind subjob, the quantity of the operation set and institute from all operations to be allocated
The quantity for stating available calculate node is identical, and the quantity of described kind of subjob is identical as the quantity of the operation set；
Initialization module, for each operation set to be initialized as respectively only comprising a kind of subjob, and difference is made
Industry set includes different kind subjob；
Classifying module, except according to the corresponding set feature vector of each operation set and described kind of subjob
The corresponding operational feature vector of other operations to be allocated, corresponding operation set is included into other described operations to be allocated
In；
Distribution module, for the operation in each operation set to be respectively allocated to corresponding available calculate node, and not
Same operation set corresponds to different available calculate nodes.
Optionally, the device, further includes:
Module is constructed, for constructing corresponding operational feature vector to each operation to be allocated respectively.
Optionally, the operational feature vector includes cpu demand value, memory requirement value, disk read-write frequency needs value, net
Network bandwidth resources requirements and precedence information；
The building module quantifies each to be allocated specifically for the history data according to each operation to be allocated
Cpu demand value, memory requirement value, disk read-write frequency needs value and the network bandwidth resources requirements of operation, and according to each
Cpu demand value, memory requirement value, disk read-write frequency needs value and the network bandwidth resources requirements of operation to be allocated, and
The precedence information of each operation to be allocated constructs the corresponding operational feature vector of each operation to be allocated.
Optionally, the classifying module is specifically used for executing following operation:
S1, select the operation to be allocated not being included into operation set as current work；
S2, the set feature vector for calculating separately each operation set operational feature vector corresponding with the current work
The distance between, it selects maximum apart from corresponding operation set cooperation to be target collection, the current work is included into described
In target collection, update the set feature vector of the target collection, judge whether there is be not included into operation set to
Operation is distributed, if it is, return step S1；Otherwise, it determines the operation to be allocated is included into operation set.
Optionally, the set feature vector operational feature vector corresponding with the current work of each operation set
The distance between, specifically:
Euler between each operation set feature vector operational feature vector corresponding with the current work away from
From the quotient with the operation quantity in the operation set.
The present invention according to the set feature vector operational feature vector corresponding with operation to be allocated of each operation set it
Between distance, distribute operation, demand type of the different work in the same calculate node of difference to hardware resource can be maximized,
To make different work be utilized respectively on same node different for different types of operation reasonable distribution to different calculate nodes
The hardware resource of type avoids operation from intensively competing same type hardware resource to reach the efficient utilization of resource.
Detailed description of the invention
Fig. 1 is the flow chart of one of embodiment of the present invention activity allocation method；
Fig. 2 is the structure chart of one of embodiment of the present invention operation distributor.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
It should be noted that each feature in the embodiment of the present invention and embodiment can be tied mutually if do not conflicted
It closes, it is within the scope of the present invention.In addition, though logical order is shown in flow charts, but in certain situations
Under, it can be with the steps shown or described are performed in an order that is different from the one herein.
The embodiment of the invention provides a kind of activity allocation methods, as shown in Figure 1, comprising the following steps:
Step 101, corresponding operational feature vector is constructed to each operation to be allocated respectively.
Wherein, operational feature vector includes cpu demand value, memory requirement value, disk read-write frequency needs value, network bandwidth
Resource requirement value and precedence information；Correspondingly, can be quantified each according to the history data of each operation to be allocated
Cpu demand value, memory requirement value, disk read-write frequency needs value and the network bandwidth resources requirements of a operation to be allocated, and
According to the cpu demand value of each operation to be allocated, memory requirement value, disk read-write frequency needs value and network bandwidth resources demand
Value and the precedence information of each operation to be allocated construct the corresponding operational feature vector of each operation to be allocated.
For example, operation TtIn corresponding operational feature vector are as follows:
Tt=[ft,1,ft,2,ft,3,ft,4,ft,5]
Wherein, ft,1To ft,5Respectively operation TtCpu demand value, memory requirement value, disk read-write frequency needs value and
Network bandwidth resources requirements and precedence information.
Step 102, according to the quantity that can use calculate node, the quantity of operation set is determined；According to each operation to be allocated
Corresponding operational feature vector, the selection kind subjob from all operations to be allocated.
Wherein, the quantity of operation set is identical as the quantity of available calculate node, plants the quantity and operation set of subjob
Quantity it is identical.
In the present embodiment, kind of subjob can be determined according to given standard, for example, the highest operation of cpu demand amount is made
For kind of a subjob.
Step 103, each operation set is initialized as only respectively comprising a kind of subjob, and different work set packet
Containing different kind subjobs.
For example, the quantity of operation set is 3, operation 2 is selected, operation 4 and operation 7 are as kind of a subjob, and by operation set
1 is closed to be initialized as being initialized as only being initialized as only wrapping by operation set 3 comprising operation 4 by operation set 2 only comprising operation 2
Containing operation 7.
Step 104, other according to the corresponding set feature vector of each operation set, and except kind subjob wait for point
With the corresponding operational feature vector of operation, other operations to be allocated are included into corresponding operation set.
Specifically, following operation can be executed:
S1, select the operation to be allocated not being included into operation set as current work；
Between S2, the set feature vector for calculating separately each operation set operational feature vector corresponding with current work
Distance, select maximum apart from corresponding operation set cooperation to be target collection, current work is included into target collection, more
The set feature vector of fresh target set judges whether there is the operation to be allocated not being included into operation set, if it is,
Return step S1；Otherwise, it determines the operation to be allocated is included into operation set.
Wherein, between the set feature vector of each operation set operational feature vector corresponding with current work away from
From, specifically: the Euler between each operation set feature vector operational feature vector corresponding with the current work
The quotient of distance and the operation quantity in the operation set.
In the present embodiment, operation set GkInclude n operation, it may be assumed that
Gk={ T1,T2,…,Tn}
GkCorresponding set feature vector are as follows:
GkCorresponding set feature vector and current work TtThe distance between corresponding operational feature vector are as follows:
dt,k=Euler (Tt,Gk)/num(Gk)
Step 105, the operation in each operation set is respectively allocated to corresponding available calculate node, and different works
Industry set corresponds to different available calculate nodes.
The embodiment of the present invention is according to the set feature vector operational feature corresponding with operation to be allocated of each operation set
The distance between vector distributes operation, can maximize the different work in the same calculate node of difference to the need of hardware resource
Type is sought, to make different work be utilized respectively same section different types of operation reasonable distribution to different calculate nodes
Different types of hardware resource on point avoids operation from intensively competing same type hardware money to reach the efficient utilization of resource
Source；In addition, the operation of different high priorities is assigned in different calculate nodes, it can be avoided and be laid out high priority operation
In same calculate node, to guarantee the normal operation of key business.
Based on above-mentioned activity allocation method, the embodiment of the invention also provides a kind of operation distributors, as shown in Fig. 2,
Include:
Selecting module 210, for determining the quantity of operation set according to the quantity that can use calculate node；According to it is each to
Distribute operation corresponding operational feature vector, selection kind subjob, the quantity of the operation set from all operations to be allocated
Identical as the quantity with calculate node, the quantity of described kind of subjob is identical as the quantity of the operation set；
Initialization module 220, for each operation set to be initialized as only including a kind of subjob respectively, and it is different
Operation set includes different kind subjob；
Classifying module 230, for according to the corresponding set feature vector of each operation set and described kind of subjob it
Other described operations to be allocated are included into corresponding operation set by the corresponding operational feature vector of outer other operations to be allocated
In；
Specifically, above-mentioned classifying module 230 is specifically used for executing following operation:
S1, select the operation to be allocated not being included into operation set as current work；
S2, the set feature vector for calculating separately each operation set operational feature vector corresponding with the current work
The distance between, it selects maximum apart from corresponding operation set cooperation to be target collection, the current work is included into described
In target collection, update the set feature vector of the target collection, judge whether there is be not included into operation set to
Operation is distributed, if it is, return step S1；Otherwise, it determines the operation to be allocated is included into operation set.
Wherein, between the set feature vector of each operation set operational feature vector corresponding with the current work
Distance, specifically: Euler between each operation set feature vector operational feature vector corresponding with the current work away from
From the quotient with the operation quantity in the operation set.
Distribution module 240, for the operation in each operation set to be respectively allocated to corresponding available calculate node, and
Different operation set corresponds to different available calculate nodes.
Further, above-mentioned apparatus, further includes:
Module 250 is constructed, for constructing corresponding operational feature vector to each operation to be allocated respectively.
Wherein, operational feature vector includes cpu demand value, memory requirement value, disk read-write frequency needs value, network bandwidth
Resource requirement value and precedence information；
Correspondingly, above-mentioned building module 250, specifically for the history data according to each operation to be allocated, quantization
Cpu demand value, memory requirement value, disk read-write frequency needs value and the network bandwidth resources requirements of each operation to be allocated,
And according to the cpu demand value of each operation to be allocated, memory requirement value, disk read-write frequency needs value and network bandwidth resources need
Evaluation and the precedence information of each operation to be allocated construct the corresponding operational feature vector of each operation to be allocated.
The embodiment of the present invention is according to the set feature vector operational feature corresponding with operation to be allocated of each operation set
The distance between vector distributes operation, can maximize the different work in the same calculate node of difference to the need of hardware resource
Type is sought, to make different work be utilized respectively same section different types of operation reasonable distribution to different calculate nodes
Different types of hardware resource on point avoids operation from intensively competing same type hardware money to reach the efficient utilization of resource
Source；In addition, the operation of different high priorities is assigned in different calculate nodes, it can be avoided and be laid out high priority operation
In same calculate node, to guarantee the normal operation of key business.
Step in method described in conjunction with the examples disclosed in this document can directly use hardware, processor to execute
The combination of software module or the two is implemented.Software module can be placed in random access memory (RAM), memory, read-only memory
(ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technical field
In any other form of storage medium well known to interior.
The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any
Those familiar with the art in the technical scope disclosed by the present invention, can easily think of the change or the replacement, and should all contain
Lid is within protection scope of the present invention.Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (8)
1. a kind of activity allocation method, which comprises the following steps:
According to the quantity that can use calculate node, the quantity of operation set is determined；It is special according to the corresponding operation of each operation to be allocated
Vector is levied, selection kind of a subjob from all operations to be allocated, the quantity of the operation set and described with calculate node
Quantity is identical, and the quantity of described kind of subjob is identical as the quantity of the operation set；
Each operation set is initialized as respectively only comprising a kind of subjob, and different work set includes different seed
Operation；
According to other operations pair to be allocated except the corresponding set feature vector of each operation set and described kind of subjob
Other described operations to be allocated are included into corresponding operation set by the operational feature vector answered；
Operation in each operation set is respectively allocated to corresponding available calculate node, and different operation set is corresponding not
Same available calculate node,
Wherein operation set GkCorresponding set feature vector are as follows:
Wherein
Operation set GkInclude n operation, it may be assumed that Gk={ T1, T2..., Tn, operation TtCorresponding operational feature vector are as follows:
Tt=[fT, 1, fT, 2, fT, 3, fT, 4, fT, 5],
Wherein, fT, 1To fT, 5Respectively operation TtCpu demand value, memory requirement value, disk read-write frequency needs value, Netowrk tape
Wide resource requirement value and precedence information,
Wherein according to other works to be allocated except the corresponding set feature vector of each operation set and described kind of subjob
Other described operations to be allocated are included into corresponding operation set by the corresponding operational feature vector of industry, specifically:
S1, select the operation to be allocated not being included into operation set as current work；
Between S2, the set feature vector for calculating separately each operation set operational feature vector corresponding with the current work
Distance, select maximum apart from corresponding operation set cooperation to be target collection, the current work be included into the target
In set, update the set feature vector of the target collection, judge whether there is be not included into it is to be allocated in operation set
Operation, if it is, return step S1；Otherwise, it determines the operation to be allocated is included into operation set.
2. the method as described in claim 1, which is characterized in that according to the corresponding operational feature vector of each operation to be allocated,
Before selection kind subjob in all operations to be allocated, further includes:
Corresponding operational feature vector is constructed to each operation to be allocated respectively.
3. method according to claim 2, which is characterized in that
It is described that corresponding operational feature vector is constructed to each operation to be allocated respectively, specifically:
According to the history data of each operation to be allocated, quantify cpu demand value, the memory requirements of each operation to be allocated
Value, disk read-write frequency needs value and network bandwidth resources requirements, and according to the cpu demand value of each operation to be allocated, interior
Deposit the priority letter of requirements, disk read-write frequency needs value and network bandwidth resources requirements and each operation to be allocated
Breath constructs the corresponding operational feature vector of each operation to be allocated.
4. the method as described in claim 1, which is characterized in that the set feature vector of each operation set is worked as with described
The distance between corresponding operational feature vector of preceding operation, specifically:
Euler's distance between each operation set feature vector operational feature vector corresponding with the current work with
The quotient of operation quantity in the operation set.
5. a kind of operation distributor characterized by comprising
Selecting module, for determining the quantity of operation set according to the quantity that can use calculate node；According to each operation to be allocated
Corresponding operational feature vector, selection kind of a subjob from all operations to be allocated, the quantity of the operation set and it is described can
Identical with the quantity of calculate node, the quantity of described kind of subjob is identical as the quantity of the operation set；
Initialization module, for each operation set to be initialized as only respectively comprising a kind of subjob, and different work collection
Closing includes different kind subjobs；
Classifying module, for according to its except the corresponding set feature vector of each operation set and described kind of subjob
The corresponding operational feature vector of his operation to be allocated, other described operations to be allocated are included into corresponding operation set；
Distribution module, for the operation in each operation set to be respectively allocated to corresponding available calculate node, and it is different
Operation set corresponds to different available calculate nodes,
Wherein operation set GkCorresponding set feature vector are as follows:
Wherein
Operation set GkInclude n operation, it may be assumed that Gk={ T1, T2..., Tn, operation TtCorresponding operational feature vector are as follows:
Tt=[fT, 1, fT, 2, fT, 3, fT, 4, fT, 5],
Wherein, fT, 1To fT, 5Respectively operation TtCpu demand value, memory requirement value, disk read-write frequency needs value, Netowrk tape
Wide resource requirement value and precedence information,
The wherein classifying module is specifically used for executing following operation:
S1, select the operation to be allocated not being included into operation set as current work；
Between S2, the set feature vector for calculating separately each operation set operational feature vector corresponding with the current work
Distance, select maximum apart from corresponding operation set cooperation to be target collection, the current work be included into the target
In set, update the set feature vector of the target collection, judge whether there is be not included into it is to be allocated in operation set
Operation, if it is, return step S1；Otherwise, it determines the operation to be allocated is included into operation set.
6. device as claimed in claim 5, which is characterized in that further include:
Module is constructed, for constructing corresponding operational feature vector to each operation to be allocated respectively.
7. device as claimed in claim 6, which is characterized in that
The building module quantifies each operation to be allocated specifically for the history data according to each operation to be allocated
Cpu demand value, memory requirement value, disk read-write frequency needs value and network bandwidth resources requirements, and according to it is each to point
Cpu demand value, memory requirement value, disk read-write frequency needs value and network bandwidth resources requirements with operation and each
The precedence information of operation to be allocated constructs the corresponding operational feature vector of each operation to be allocated.
8. device as claimed in claim 5, which is characterized in that the set feature vector of each operation set is worked as with described
The distance between corresponding operational feature vector of preceding operation, specifically:
Euler's distance between each operation set feature vector operational feature vector corresponding with the current work with
The quotient of operation quantity in the operation set.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510694921.7A CN105389212B (en) | 2015-10-21 | 2015-10-21 | A kind of activity allocation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510694921.7A CN105389212B (en) | 2015-10-21 | 2015-10-21 | A kind of activity allocation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105389212A CN105389212A (en) | 2016-03-09 |
| CN105389212B true CN105389212B (en) | 2019-05-24 |
Family
ID=55421519
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510694921.7A Active CN105389212B (en) | 2015-10-21 | 2015-10-21 | A kind of activity allocation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105389212B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108062254B (en) * | 2017-12-12 | 2022-11-18 | 腾讯科技（深圳）有限公司 | Job processing method, device, storage medium and equipment |
| CN108845886B (en) * | 2018-07-27 | 2022-03-08 | 中南大学 | Cloud computing energy consumption optimization method and system based on phase space |
| CN110633135A (en) * | 2019-08-15 | 2019-12-31 | 中国平安财产保险股份有限公司 | Asynchronous task allocation method and device, computer equipment and storage medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100455131C (en) * | 2006-08-18 | 2009-01-21 | 华为技术有限公司 | Band-width resource distribution |
| CN102075425B (en) * | 2008-12-16 | 2012-10-03 | 中国移动通信集团北京有限公司 | Business allocation method and load balancer |
| CN101447939B (en) * | 2008-12-16 | 2011-09-28 | 中国移动通信集团北京有限公司 | Functional distribution method and load balancer |
| CN102929720B (en) * | 2012-09-24 | 2017-06-23 | 曙光信息产业(北京)有限公司 | A kind of energy-conservation job scheduling system |
| WO2014133512A1 (en) * | 2013-02-28 | 2014-09-04 | Hewlett-Packard Development Company, L.P. | Providing code change job sets of different sizes to validators |
| CN104391749B (en) * | 2014-11-26 | 2020-06-05 | 北京奇艺世纪科技有限公司 | Resource allocation method and device |
-
2015
- 2015-10-21 CN CN201510694921.7A patent/CN105389212B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN105389212A (en) | 2016-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109218355B (en) | Load balancing engine, client, distributed computing system and load balancing method | |
| CN105637925B (en) | Dynamic frequency and power resource allocation with refinement tactical management | |
| WO2018176385A1 (en) | System and method for network slicing for service-oriented networks | |
| CN108776612A (en) | A kind of cloud computing method for allocating tasks, device, equipment and storage medium | |
| US20170329643A1 (en) | Distributed node intra-group task scheduling method and system | |
| CN110463140A (en) | The network Service Level Agreement of computer data center | |
| CN105893138A (en) | Resource management method and device based on quota | |
| CN104243405A (en) | Request processing method, device and system | |
| Mashayekhy et al. | A coalitional game-based mechanism for forming cloud federations | |
| Santos et al. | Zeus: A resource allocation algorithm for the cloud of sensors | |
| CN105389212B (en) | A kind of activity allocation method and device | |
| CN110826915B (en) | Resource scheduling method, device and computer readable storage medium | |
| CN103781081A (en) | Opportunity sharing-based wireless virtual resource allocation method | |
| CN109976901A (en) | A kind of resource regulating method, device, server and readable storage medium storing program for executing | |
| CN115421930B (en) | Task processing method, system, device, equipment and computer readable storage medium | |
| CN108055701A (en) | A kind of resource regulating method and base station | |
| CN106453143A (en) | Bandwidth setting method, device and system | |
| CN111328146B (en) | Service scheduling method for optimizing transmission rate weight based on genetic algorithm | |
| KR102039650B1 (en) | Method and apparatus for allocating frequency resource in cognitive radio ad hoc network | |
| CN106506229B (en) | A kind of SBS cloud application adaptive resource optimizes and revises system and method | |
| CN113543160B (en) | 5G slice resource allocation method, device, computing equipment and computer storage medium | |
| Devagnanam et al. | Design and development of exponential lion algorithm for optimal allocation of cluster resources in cloud | |
| CN109062683A (en) | The method, apparatus and computer readable storage medium of host resource distribution | |
| CN116302569A (en) | Resource partition intelligent scheduling method based on user request information | |
| Cheng et al. | An approximate bandwidth allocation algorithm for tradeoff between fairness and throughput in WSN |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |