CN105389212A - Job assigning method and apparatus - Google Patents
Job assigning method and apparatus Download PDFInfo
- Publication number
- CN105389212A CN105389212A CN201510694921.7A CN201510694921A CN105389212A CN 105389212 A CN105389212 A CN 105389212A CN 201510694921 A CN201510694921 A CN 201510694921A CN 105389212 A CN105389212 A CN 105389212A
- Authority
- CN
- China
- Prior art keywords
- allocated
- feature vector
- operation set
- value
- 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.)
- Granted
Links
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
Abstract
The present invention discloses a job assigning method and apparatus. The method comprises the following steps: determining the number of job sets according to the number of available computing nodes; according to a job feature vector corresponding to each to-be-assigned job, selecting a seed job from all the to-be-assigned jobs, and initializing each job set to make each job set comprise only one seed job; according to a set feature vector corresponding to each job set and job feature vectors corresponding to other to-be-assigned jobs other than the seed job, classifying the other to-be-assigned jobs into a corresponding job set; and separately assigning jobs in each job set to corresponding available computing nodes. According to the method and apparatus, types of hardware resources required by different jobs on the same computing node can be maximally discriminated, so as to reasonably assigning different types of jobs to different computing nodes, so that different jobs use different types of hardware resources on the same node respectively, thereby using the resources efficiently.
Description
Technical field
The present invention relates to field of computer technology, be specifically related to a kind of activity allocation method and device.
Background technology
Along with the proposition of " internet+" strategy, and internet is dominated the epoch and is dominated epoch to industry internet to consume internet and progressively shift, and increasing computing service will to move in large-scale data in the heart.But, different computing services (operation) is different to the demand of hardware resource, its priority is also different, if reasonable distribution cannot be carried out to operation, operation intensive competition same type hardware resource can be caused, the continuous service of key business cannot be ensured, the hardware resource of computing node also can be made to can not get efficiency utilization.
Summary of the invention
The invention provides a kind of activity allocation method and device, cannot the defect of efficiency utilization hardware resource to solve existing activity allocation method.
The invention provides a kind of activity allocation method, comprise the following steps:
According to the quantity of available computing node, determine the quantity of operation set; The operational feature vector corresponding according to each operation to be allocated, from all operations to be allocated, select kind of a subjob, the quantity of described operation set is identical with the quantity of described available computing node, and the quantity of described kind of subjob is identical with the quantity of described operation set;
Each operation set is initialized as respectively and only comprises a kind subjob, and different work set comprises different kind subjobs;
Other operations to be allocated described are included in the operation set of correspondence by the set feature vector corresponding according to each operation set, and the operational feature vector that other operations to be allocated outside described kind of subjob are corresponding;
Operation in each operation set is distributed to respectively corresponding available computing node, and the available computing node that different operation set is corresponding different.
Alternatively, the operational feature vector corresponding according to each operation to be allocated, before selecting kind of subjob, also comprises from all operations to be allocated:
Respectively corresponding operational feature vector is built to each operation to be allocated.
Alternatively, described operational feature vector comprises cpu demand value, memory requirements value, disk read-write frequency needs value, network bandwidth resources requirements, and precedence information;
The described operational feature vector respectively each operation to be allocated being built to correspondence, is specially:
According to the history data of each operation to be allocated, quantize the cpu demand value of each operation to be allocated, memory requirements 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, memory requirements value, disk read-write frequency needs value and network bandwidth resources requirements, and the precedence information of each operation to be allocated, build the operational feature vector that each operation to be allocated is corresponding.
Alternatively, other operations to be allocated described are included in the operation set of correspondence, are specially by the set feature vector corresponding according to each operation set, and the operational feature vector that other operations to be allocated outside described kind of subjob are corresponding:
S1, one is selected not to be included into operation to be allocated in operation set as current work;
S2, calculate each operation set respectively the set feature vector operational feature vector corresponding with described current work between distance, the operation set cooperation selecting the distance maximum with numerical value corresponding is goal set, described current work is included in described goal set, upgrade the set feature vector of described goal set, judge whether to exist the operation to be allocated of not being included in operation set, if so, then step S1 is returned; Otherwise, determine described operation to be allocated to be included in operation set.
Alternatively, the distance between the vectorial operational feature vector corresponding with described current work of set feature of each operation set described, is specially:
The business of the Euler's distance between the operational feature vector that each operation set proper vector described is corresponding with described current work and the operation quantity in this operation set.
Present invention also offers a kind of operation distributor, comprising:
Select module, for the quantity according to available computing node, determine the quantity of operation set; The operational feature vector corresponding according to each operation to be allocated, from all operations to be allocated, select kind of a subjob, the quantity of described operation set is identical with the quantity of described available computing node, and the quantity of described kind of subjob is identical with the quantity of described operation set;
Initialization module, only comprise a kind subjob, and different work set comprises different kind subjobs for each operation set being initialized as respectively;
Classifying module, for the set feature vector corresponding according to each operation set, and the operational feature vector that other operations to be allocated outside described kind of subjob are corresponding, other operations to be allocated described are included in the operation set of correspondence;
Distribution module, for the operation in each operation set being distributed to respectively corresponding available computing node, and the available computing node that different operation set is corresponding different.
Alternatively, described device, also comprises:
Build module, for building corresponding operational feature vector to each operation to be allocated respectively.
Alternatively, described operational feature vector comprises cpu demand value, memory requirements value, disk read-write frequency needs value, network bandwidth resources requirements, and precedence information;
Described structure module, specifically for the history data according to each operation to be allocated, quantize the cpu demand value of each operation to be allocated, memory requirements 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, memory requirements value, disk read-write frequency needs value and network bandwidth resources requirements, and the precedence information of each operation to be allocated, build the operational feature vector that each operation to be allocated is corresponding.
Alternatively, described classifying module, specifically for performing following operation:
S1, one is selected not to be included into operation to be allocated in operation set as current work;
S2, calculate each operation set respectively the set feature vector operational feature vector corresponding with described current work between distance, the operation set cooperation selecting the distance maximum with numerical value corresponding is goal set, described current work is included in described goal set, upgrade the set feature vector of described goal set, judge whether to exist the operation to be allocated of not being included in operation set, if so, then step S1 is returned; Otherwise, determine described operation to be allocated to be included in operation set.
Alternatively, the distance between the vectorial operational feature vector corresponding with described current work of set feature of each operation set described, is specially:
The business of the Euler's distance between the operational feature vector that each operation set proper vector described is corresponding with described current work and the operation quantity in this operation set.
The present invention is according to the distance between the vectorial operational feature vector corresponding with operation to be allocated of the set feature of each operation set, distribute operation, the demand type of the different work on the same computing node of difference to hardware resource can be maximized, thus by dissimilar operation reasonable distribution to different computing nodes, different work is made to utilize hardware resource dissimilar on same node respectively, thus reach the efficiency utilization of resource, avoid operation intensive competition same type hardware resource.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of a kind of activity allocation method in the embodiment of the present invention;
Fig. 2 is the structural drawing of a kind of operation distributor in the embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
It should be noted that, if do not conflicted, each feature in the embodiment of the present invention and embodiment can be combined with each other, all within protection scope of the present invention.In addition, although show logical order in flow charts, in some cases, can be different from the step shown or described by order execution herein.
Embodiments provide a kind of activity allocation method, as shown in Figure 1, comprise the following steps:
Step 101, builds corresponding operational feature vector to each operation to be allocated respectively.
Wherein, operational feature vector comprises cpu demand value, memory requirements value, disk read-write frequency needs value, network bandwidth resources requirements, and precedence information; Correspondingly, can according to the history data of each operation to be allocated, quantize the cpu demand value of each operation to be allocated, memory requirements 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, memory requirements value, disk read-write frequency needs value and network bandwidth resources requirements, and the precedence information of each operation to be allocated, build the operational feature vector that each operation to be allocated is corresponding.
Such as, operation T
tat the operational feature vector of correspondence be:
T
t＝[f
t,1,f
t,2,f
t,3,f
t,4,f
t,5]
Wherein, f
t, 1to f
t, 5be respectively operation T
tcpu demand value, memory requirements value, disk read-write frequency needs value and network bandwidth resources requirements.
Step 102, according to the quantity of available computing node, determines the quantity of operation set; The operational feature vector corresponding according to each operation to be allocated, selects kind of a subjob from all operations to be allocated.
Wherein, the quantity of operation set is identical with the quantity of available computing node, and the quantity of planting subjob is identical with the quantity of operation set.
In the present embodiment, kind of a subjob can be determined according to given standard, such as, using operation the highest for cpu demand amount as kind of a subjob.
Step 103, each operation set is initialized as respectively and only comprises a kind subjob, and different work set comprises different kind subjobs.
Such as, the quantity of operation set is 3, selects operation 2, and operation set 1 as kind of a subjob, and is initialized as and only comprises operation 2 by operation 4 and operation 7, operation set 2 is initialized as and only comprises operation 4, operation set 3 be initialized as and only comprise operation 7.
Step 104, the set feature vector corresponding according to each operation set, and plant operational feature vector corresponding to other operations to be allocated outside subjob, other operations to be allocated are included in the operation set of correspondence.
Particularly, following operation can be performed:
S1, one is selected not to be included into operation to be allocated in operation set as current work;
S2, calculate each operation set respectively the set feature vector operational feature vector corresponding with current work between distance, the operation set cooperation selecting the distance maximum with numerical value corresponding is goal set, current work is included in goal set, upgrade the set feature vector of goal set, judge whether to exist the operation to be allocated of not being included in operation set, if so, then step S1 is returned; Otherwise, determine described operation to be allocated to be included in operation set.
Wherein, distance between the set feature vector operational feature vector corresponding with current work of each operation set, is specially: the business of the Euler's distance between the operational feature vector that each operation set proper vector described is corresponding with described current work and the operation quantity in this operation set.
In the present embodiment, operation set G
kcomprise an operation, that is:
G
k＝{T
1,T
2,…,T
n}
G
kcorresponding set feature vector is:
G
kcorresponding set feature vector and current work T
tdistance between corresponding operational feature vector is:
d
t,k＝Euler(T
t,G
k)/num(G
k)
Step 105, distributes to corresponding available computing node respectively by the operation in each operation set, and the available computing node that different operation set is corresponding different.
The embodiment of the present invention is according to the distance between the vectorial operational feature vector corresponding with operation to be allocated of the set feature of each operation set, distribute operation, the demand type of the different work on the same computing node of difference to hardware resource can be maximized, thus by dissimilar operation reasonable distribution to different computing nodes, different work is made to utilize hardware resource dissimilar on same node respectively, thus reach the efficiency utilization of resource, avoid operation intensive competition same type hardware resource; In addition, the operation of different high priorities is assigned on different computing node, can avoids by high priority operation layout on same computing node, thus ensure the normal operation of key business.
Based on above-mentioned activity allocation method, the embodiment of the present invention additionally provides a kind of operation distributor, as shown in Figure 2, comprising:
Select module 210, for the quantity according to available computing node, determine the quantity of operation set; The operational feature vector corresponding according to each operation to be allocated, from all operations to be allocated, select kind of a subjob, the quantity of described operation set is identical with the quantity of described available computing node, and the quantity of described kind of subjob is identical with the quantity of described operation set;
Initialization module 220, only comprise a kind subjob, and different work set comprises different kind subjobs for each operation set being initialized as respectively;
Classifying module 230, for the set feature vector corresponding according to each operation set, and the operational feature vector that other operations to be allocated outside described kind of subjob are corresponding, other operations to be allocated described are included in the operation set of correspondence;
Particularly, above-mentioned classifying module 230, specifically for performing following operation:
S1, one is selected not to be included into operation to be allocated in operation set as current work;
S2, calculate each operation set respectively the set feature vector operational feature vector corresponding with described current work between distance, the operation set cooperation selecting the distance maximum with numerical value corresponding is goal set, described current work is included in described goal set, upgrade the set feature vector of described goal set, judge whether to exist the operation to be allocated of not being included in operation set, if so, then step S1 is returned; Otherwise, determine described operation to be allocated to be included in operation set.
Wherein, distance between the set feature vector operational feature vector corresponding with described current work of each operation set, is specially: the business of the Euler's distance between the operational feature vector that each operation set proper vector is corresponding with described current work and the operation quantity in this operation set.
Distribution module 240, for the operation in each operation set being distributed to respectively corresponding available computing node, and the available computing node that different operation set is corresponding different.
Further, said apparatus, also comprises:
Build module 250, for building corresponding operational feature vector to each operation to be allocated respectively.
Wherein, operational feature vector comprises cpu demand value, memory requirements value, disk read-write frequency needs value, network bandwidth resources requirements, and precedence information;
Correspondingly, above-mentioned structure module 250, specifically for the history data according to each operation to be allocated, quantize the cpu demand value of each operation to be allocated, memory requirements 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, memory requirements value, disk read-write frequency needs value and network bandwidth resources requirements, and the precedence information of each operation to be allocated, build the operational feature vector that each operation to be allocated is corresponding.
The embodiment of the present invention is according to the distance between the vectorial operational feature vector corresponding with operation to be allocated of the set feature of each operation set, distribute operation, the demand type of the different work on the same computing node of difference to hardware resource can be maximized, thus by dissimilar operation reasonable distribution to different computing nodes, different work is made to utilize hardware resource dissimilar on same node respectively, thus reach the efficiency utilization of resource, avoid operation intensive competition same type hardware resource; In addition, the operation of different high priorities is assigned on different computing node, can avoids by high priority operation layout on same computing node, thus ensure the normal operation of key business.
In conjunction with the software module that the step in the method that embodiment disclosed herein describes can directly use hardware, processor to perform, or the combination of the two is implemented.Software module can be placed in the storage medium of other form any known in random access memory (RAM), internal memory, ROM (read-only memory) (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technical field.
The above; be only the specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, is anyly familiar with those skilled in the art in the technical scope that the present invention discloses; change can be expected easily or replace, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should described be as the criterion with the protection domain of claim.
Claims (10)
1. an activity allocation method, is characterized in that, comprises the following steps:
According to the quantity of available computing node, determine the quantity of operation set; The operational feature vector corresponding according to each operation to be allocated, from all operations to be allocated, select kind of a subjob, the quantity of described operation set is identical with the quantity of described available computing node, and the quantity of described kind of subjob is identical with the quantity of described operation set;
Each operation set is initialized as respectively and only comprises a kind subjob, and different work set comprises different kind subjobs;
Other operations to be allocated described are included in the operation set of correspondence by the set feature vector corresponding according to each operation set, and the operational feature vector that other operations to be allocated outside described kind of subjob are corresponding;
Operation in each operation set is distributed to respectively corresponding available computing node, and the available computing node that different operation set is corresponding different.
2. the method for claim 1, is characterized in that, the operational feature vector corresponding according to each operation to be allocated, before selecting kind of subjob, also comprises from all operations to be allocated:
Respectively corresponding operational feature vector is built to each operation to be allocated.
3. method as claimed in claim 2, it is characterized in that, described operational feature vector comprises cpu demand value, memory requirements value, disk read-write frequency needs value, network bandwidth resources requirements, and precedence information;
The described operational feature vector respectively each operation to be allocated being built to correspondence, is specially:
According to the history data of each operation to be allocated, quantize the cpu demand value of each operation to be allocated, memory requirements 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, memory requirements value, disk read-write frequency needs value and network bandwidth resources requirements, and the precedence information of each operation to be allocated, build the operational feature vector that each operation to be allocated is corresponding.
4. the method for claim 1, it is characterized in that, the set feature vector corresponding according to each operation set, and the operational feature vector that other operations to be allocated outside described kind of subjob are corresponding, other operations to be allocated described are included in the operation set of correspondence, are specially:
S1, one is selected not to be included into operation to be allocated in operation set as current work;
S2, calculate each operation set respectively the set feature vector operational feature vector corresponding with described current work between distance, the operation set cooperation selecting the distance maximum with numerical value corresponding is goal set, described current work is included in described goal set, upgrade the set feature vector of described goal set, judge whether to exist the operation to be allocated of not being included in operation set, if so, then step S1 is returned; Otherwise, determine described operation to be allocated to be included in operation set.
5. method as claimed in claim 4, is characterized in that, the distance between the vectorial operational feature vector corresponding with described current work of set feature of each operation set described, is specially:
The business of the Euler's distance between the operational feature vector that each operation set proper vector described is corresponding with described current work and the operation quantity in this operation set.
6. an operation distributor, is characterized in that, comprising:
Select module, for the quantity according to available computing node, determine the quantity of operation set; The operational feature vector corresponding according to each operation to be allocated, from all operations to be allocated, select kind of a subjob, the quantity of described operation set is identical with the quantity of described available computing node, and the quantity of described kind of subjob is identical with the quantity of described operation set;
Initialization module, only comprise a kind subjob, and different work set comprises different kind subjobs for each operation set being initialized as respectively;
Classifying module, for the set feature vector corresponding according to each operation set, and the operational feature vector that other operations to be allocated outside described kind of subjob are corresponding, other operations to be allocated described are included in the operation set of correspondence;
Distribution module, for the operation in each operation set being distributed to respectively corresponding available computing node, and the available computing node that different operation set is corresponding different.
7. device as claimed in claim 6, is characterized in that, also comprise:
Build module, for building corresponding operational feature vector to each operation to be allocated respectively.
8. device as claimed in claim 7, it is characterized in that, described operational feature vector comprises cpu demand value, memory requirements value, disk read-write frequency needs value, network bandwidth resources requirements, and precedence information;
Described structure module, specifically for the history data according to each operation to be allocated, quantize the cpu demand value of each operation to be allocated, memory requirements 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, memory requirements value, disk read-write frequency needs value and network bandwidth resources requirements, and the precedence information of each operation to be allocated, build the operational feature vector that each operation to be allocated is corresponding.
9. device as claimed in claim 6, is characterized in that,
Described classifying module, specifically for performing following operation:
S1, one is selected not to be included into operation to be allocated in operation set as current work;
S2, calculate each operation set respectively the set feature vector operational feature vector corresponding with described current work between distance, the operation set cooperation selecting the distance maximum with numerical value corresponding is goal set, described current work is included in described goal set, upgrade the set feature vector of described goal set, judge whether to exist the operation to be allocated of not being included in operation set, if so, then step S1 is returned; Otherwise, determine described operation to be allocated to be included in operation set.
10. method as claimed in claim 9, is characterized in that, the distance between the vectorial operational feature vector corresponding with described current work of set feature of each operation set described, is specially:
The business of the Euler's distance between the operational feature vector that each operation set proper vector described is corresponding with described current work and the operation quantity in this 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 true CN105389212A (en) | 2016-03-09 |
| CN105389212B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108062254A (en) * | 2017-12-12 | 2018-05-22 | 腾讯科技（深圳）有限公司 | Job processing method, device, storage medium and equipment |
| CN108845886A (en) * | 2018-07-27 | 2018-11-20 | 中南大学 | 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 |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008022594A1 (en) * | 2006-08-18 | 2008-02-28 | Huawei Technologies Co., Ltd. | A method and apparatus of allocating bandwidth resource |
| CN101447939A (en) * | 2008-12-16 | 2009-06-03 | 中国移动通信集团北京有限公司 | Functional distribution method and load balancer |
| CN102075425A (en) * | 2008-12-16 | 2011-05-25 | 中国移动通信集团北京有限公司 | Business allocation method and load balancer |
| CN102929720A (en) * | 2012-09-24 | 2013-02-13 | 曙光信息产业(北京)有限公司 | Energy-saving 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 |
| CN104391749A (en) * | 2014-11-26 | 2015-03-04 | 北京奇艺世纪科技有限公司 | Resource allocation method and device |
-
2015
- 2015-10-21 CN CN201510694921.7A patent/CN105389212B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008022594A1 (en) * | 2006-08-18 | 2008-02-28 | Huawei Technologies Co., Ltd. | A method and apparatus of allocating bandwidth resource |
| CN101447939A (en) * | 2008-12-16 | 2009-06-03 | 中国移动通信集团北京有限公司 | Functional distribution method and load balancer |
| CN102075425A (en) * | 2008-12-16 | 2011-05-25 | 中国移动通信集团北京有限公司 | Business allocation method and load balancer |
| CN102929720A (en) * | 2012-09-24 | 2013-02-13 | 曙光信息产业(北京)有限公司 | Energy-saving 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 |
| CN104391749A (en) * | 2014-11-26 | 2015-03-04 | 北京奇艺世纪科技有限公司 | Resource allocation method and device |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108062254A (en) * | 2017-12-12 | 2018-05-22 | 腾讯科技（深圳）有限公司 | Job processing method, device, storage medium and equipment |
| CN108845886A (en) * | 2018-07-27 | 2018-11-20 | 中南大学 | Cloud computing energy consumption optimization method and system based on phase space |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105389212B (en) | 2019-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11700300B2 (en) | Cluster resource management in distributed computing systems | |
| US9785472B2 (en) | Computing cluster performance simulation using a genetic algorithm solution | |
| CN102082692A (en) | Method and equipment for migrating virtual machines based on network data flow direction, and cluster system | |
| US20030093527A1 (en) | Method and system for exploiting service level objectives to enable resource sharing in a communication network having a plurality of application environments | |
| CN103853618B (en) | Resource allocation method with minimized cloud system cost based on expiration date drive | |
| US20180018197A1 (en) | Virtual Machine Resource Allocation Method and Apparatus | |
| US20140359126A1 (en) | Workload partitioning among heterogeneous processing nodes | |
| CN105975340A (en) | Deployment algorithm of application distribution of virtual machine | |
| JP5305664B2 (en) | Method, program and apparatus for trading resources between partitions of a data processing system | |
| CN104468803A (en) | Virtual data center resource mapping method and equipment | |
| CN104243405A (en) | Request processing method, device and system | |
| CN105373432B (en) | A kind of cloud computing resource scheduling method based on virtual resource status predication | |
| CN103548324B (en) | Virtual machine distribution method and virtual machine distributor | |
| CN103810047A (en) | Dynamically improving memory affinity of logical partitions | |
| CN103781081A (en) | Opportunity sharing-based wireless virtual resource allocation method | |
| CN105389212A (en) | Job assigning method and apparatus | |
| CN114880130A (en) | Method, system, device and storage medium for breaking memory limitation in parallel training | |
| CN109726008A (en) | Resource allocation methods and equipment | |
| CN113946431B (en) | Resource scheduling method, system, medium and computing device | |
| CN106155822A (en) | A kind of disposal ability appraisal procedure and device | |
| CN114237894A (en) | Container scheduling method, device, equipment and readable storage medium | |
| CN111506400A (en) | Computing resource allocation system, method, device and computer equipment | |
| CN116109102A (en) | Resource allocation method and system based on genetic algorithm | |
| CN110347502A (en) | Load equilibration scheduling method, device and the electronic equipment of cloud host server | |
| CN113347046B (en) | Network access method and device |
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 |