CN107368367A - Processing method, device and the electronic equipment of resource allocation - Google Patents
Processing method, device and the electronic equipment of resource allocation Download PDFInfo
- Publication number
- CN107368367A CN107368367A CN201710366928.5A CN201710366928A CN107368367A CN 107368367 A CN107368367 A CN 107368367A CN 201710366928 A CN201710366928 A CN 201710366928A CN 107368367 A CN107368367 A CN 107368367A
- Authority
- CN
- China
- Prior art keywords
- resource
- space
- job task
- task
- fixed
- 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
-
- 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/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
-
- 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/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/4557—Distribution of virtual machine instances; Migration and load balancing
Abstract
The embodiment of the present application discloses a kind of processing method of resource allocation, device and electronic equipment.Methods described includes：When receiving job task, fixed resource space of the least unit sequestered resources to division is distributed from the flexible resource space of division；Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into the flexible resource space.It using each embodiment of the application, can both ensure that least resource can use, the resource utilization and overall system performance of maximum resource availability, effectively lifting virtualization unit can be obtained in resource space idle again.
Description
Technical field
The application belongs to microcomputer data processing field, more particularly to a kind of processing method of resource allocation, device
And electronic equipment.
Background technology
With the continuous improvement of unit performance, unit is virtualized into as a trend.Described unit virtualizes
Refer to the virtual more virtual machines of host, the calculating of virtual machine, storage, network all in this host, be it is a kind of very
Flexible virtualization mode, it does not make any change to original hardware environment.And unit virtualization at present is one very big
Problem is how effectively to carry out resource isolation so that mutual unaware between different tasks.
Traditional resource isolation mode, often it is divided into more parts using resource, each task has a foot in the dish resource.But
It is to distribute its part resource because each task can only use, this scheme easily causes in the case where load is not high
The wasting of resources.For example, if an existing CPU (Central Processing Unit, central processing unit) resource, is passed
It is averaged during the resource isolation processing of system and is divided into 4 parts, each task at most takes portion.When so single task is run at most
25% CPU can be taken, now 75% CPU is in idle condition, it is clear that use more cpu resources than the single task
(such as 30% or 50%) is low to handle the single task efficiency.This simple division of resources scheme greatly limit host
The utilization rate of overall resource.At present in the industry also have another processing mode, i.e., in order to improve resource utilization, do not do resource every
From making task resource vie each other.But the competition between multiple different tasks can be so caused again so that the blocking rate of task is anxious
Play rise.
Therefore, the profit of resource is effectively lifted in the case of resource isolation how is more reasonably realized in unit virtualization
With rate, there is no good solution also in currently available technology.
The content of the invention
The application purpose is to provide a kind of processing method of resource allocation, device and electronic equipment, can both ensured most
Small resource can use, and can obtain maximum resource availability in resource space idle again, and the resource for improving virtualization unit uses effect
Rate and overall system performance.
What processing method, device and the electronic equipment for a kind of resource allocation that the application provides were realized in：
A kind of processing method of resource allocation, methods described include：
When receiving job task, least unit sequestered resources consolidating to division is distributed from the flexible resource space of division
Determine resource space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into institute
State flexible resource space.
A kind of processing unit of resource allocation, described device include：
Resource division module, during for receiving job task, least unit is distributed from the flexible resource space of division
Fixed resource space of the sequestered resources to division；
Resource distribution module, appoint for distributing least unit sequestered resources from the fixed resource space to the operation
Business is exclusive to be used；
Resource reclaim module, at the end of the job task, the fixed resource of the job task will to be distributed to
The resource in space returns to the flexible resource space.
A kind of processing unit of resource allocation, including processor and the storage for storing processor-executable instruction
Device, realized described in the computing device during instruction：
When receiving job task, least unit sequestered resources consolidating to division is distributed from the flexible resource space of division
Determine resource space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into institute
State flexible resource space.
A kind of computer-readable recording medium, is stored thereon with computer instruction, and the instruction is realized following when being performed
Step：
When receiving job task, least unit sequestered resources consolidating to division is distributed from the flexible resource space of division
Determine resource space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into institute
State flexible resource space.
A kind of electronic equipment, including processor and the memory for storing processor-executable instruction, the processing
Device is realized when performing the instruction：
When receiving job task, least unit sequestered resources consolidating to division is distributed from the flexible resource space of division
Determine resource space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into institute
State flexible resource space.
Processing method, device and the electronic equipment for a kind of resource allocation that the application provides, host resource divide into
Fixed resource space and flexible resource space.Fixed resource space is distributed according to need to task resource and used as exclusive resource, and
The withdrawal after having used.And the resource in flexible resource space can then be competed by task and used, it can both ensure that least resource could
, again can be in idle (other of resource with (i.e. task is perfected monopoly in some limit, and other tasks are uncompetitive)
Business does not use) when obtain maximum resource availability.In the embodiment that the application provides, due in fixed resource space
Resource monopolized for task, so even if the full up situation of task, each task also all without competing, realize resource every
From.And task do not have it is full up in the case of have flexible resource space can with free competition, give full play to resource using effect
Rate, greatly improve the resource utilization and systematic function of virtualization unit.
Brief description of the drawings
, below will be to embodiment or existing in order to illustrate more clearly of the embodiment of the present application or technical scheme of the prior art
There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments described in application, for those of ordinary skill in the art, do not paying the premise of creative labor
Under, other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is a kind of schematic flow sheet of the processing method embodiment of herein described resource allocation；
Fig. 2 is the schematic diagram of initial resource Type division in herein described method one embodiment；
Fig. 3 is a schematic diagram according to task quantity automatic resource Type division in herein described method；
Fig. 4 is the processing distance schematic diagram of a job task thread resources application in herein described method；
Fig. 5 is that a task terminates the schematic diagram that rear resource type is repartitioned in the application；
Fig. 6 is a kind of modular structure schematic diagram of the processing unit embodiment for resource allocation that the application provides；
Fig. 7 is the modular structure schematic diagram of the processing unit embodiment for another resource allocation that the application provides；
Fig. 8 is the modular structure schematic diagram of the processing unit embodiment for another resource allocation that the application provides；
Fig. 9 is the modular structure schematic diagram of the processing unit embodiment for another resource allocation that the application provides.
Figure 10 is the structural representation for a kind of electronic equipment that the application provides.
Embodiment
In order that those skilled in the art more fully understand the technical scheme in the application, it is real below in conjunction with the application
The accompanying drawing in example is applied, the technical scheme in the embodiment of the present application is clearly and completely described, it is clear that described implementation
Example only some embodiments of the present application, rather than whole embodiments.It is common based on the embodiment in the application, this area
The every other embodiment that technical staff is obtained under the premise of creative work is not made, it should all belong to the application protection
Scope.
Fig. 1 is a kind of schematic flow sheet of the processing method embodiment of herein described resource allocation.Although the application carries
Supply such as following embodiments or method operating procedure shown in the drawings or apparatus structure, but based on conventional or without creative
Operating procedure less after more or part merges or modular unit can be included in methods described or device by working.Patrolling
Collect in the step of necessary causality is not present in property or structure, the execution sequence of these steps or the modular structure of device are unlimited
In the embodiment of the present application or execution sequence shown in the drawings or modular structure.Described method or modular structure in practice
When device, server or end product are applied, it can be carried out according to embodiment or method shown in the drawings or modular structure suitable
Sequence, which performs either parallel perform, (such as the environment of parallel processor or multiple threads, even includes distributed treatment, service
The implementation environment of device cluster).
Resource divide into fixed resource space and flexible resource space by the embodiment that the application provides, and fixed resource is empty
Between distribution according to need (have during new task just distribute) resource and reclaimed, the use of flexible resource competition for space.Described here presses
It need to distribute and refer to just divide exclusive resource to fixed resource space after job task is submitted and received in task, terminate in task
After reclaim, repartition flexible resource space carry out free competition use.For clarity, the line virtualized below with unit
Journey resource allocation process is that implement scene illustrates to this programme.The application embodiment goes for institute in background technology
The implement scene for the unit virtualization stated, realize resource isolation, classifying rationally, improve resource utilization etc., but art technology
Personnel are also applied to the implementation of other resource allocations it is understood that the resource allocation thought that basic application provides
In scene, including but not limited to machine resources (hardware resource), memory source, bandwidth resources, ideal money resource etc..
A kind of specific embodiment is as shown in figure 1, a kind of one kind of the processing method for resource allocation that the application provides is real
Apply in example, methods described can include：
S1：When receiving job task, least unit sequestered resources are distributed from the flexible resource space of division to division
Fixed resource space.
In the implement scene of the present embodiment, the thread resources of host can be divided into fixed resource space and spirit in advance
Resource space living.When initial, the method for salary distribution in fixed resource space and flexible resource space can be configured according to the design needs,
Such as initial fixed resource space could be arranged to the 20% of host thread resources total amount, and flexible resource space is total resources
80%.It is of course also possible to use other methods of salary distribution, such as when fixed resource space is total resources 20%, flexible resource is empty
Between be the 70% of total resources, remaining 10% can be as reserved or other purposes.The another kind of herein described method is real
Apply in example, in order to further improve the service efficiency of resource, give full play to host performance, can be consolidated using following manner
Determine the division in resource space and initial resource space：
S101：The fixed resource space and flexible resource space are configured to, and the initial resource in fixed resource space is
0th, the initial resource in flexible resource space is available total resources.
Such as the existing thread pool of the host, wherein there is 500 available threads.Thread is that program performs stream
Minimum unit, an entity in process, is the base unit independently dispatched and assigned by system.Usual thread, which is gathered around, seldom to be transported
Essential resource is outer in row oneself does not possess system resource, can be used as a kind of resource by task.In thread pool
Thread wish to carry out resource isolation and used to 100 tasks.So, can be by line in the starting stage of resource allocation
Cheng Ziyuan is divided into：It is 0 thread when fixed resource space is initial, is 500 threads when flexible resource space is initial.Such as Fig. 2 institutes
Show, Fig. 2 is the schematic diagram of initial resource Type division in herein described method one embodiment.In the present embodiment, it is described
The resource of fixed resource space distribution is monopolized as job task to be used, and the resource in the flexible resource space is appointed as operation
Business competition uses.
When receiving a new job task, automatically marked off from flexible resource space a least unit every
Fixed resource space is given from resource.In fixed resource space, described least unit sequestered resources generally include multiple resources,
Such as multiple threads, and described least unit sequestered resources can be marked as distributing to some work in fixed resource space
The resource collection of industry task, when job task does not discharge resource, be not applied to use in least unit sequestered resources its
He can not be used resource by other job task applications.For a specific example, if the least unit isolation money set
Source is 5 threads, and finally 4 threads are used only in job task taskA, then distributes to taskA in fixed resource space
5 thread resources in idle 1 thread resources be still retained in fixed resource space, and during taskA is survived
Also it is only capable of applying using by taskA.
In the application, described least unit sequestered resources can use various ways determine, as operating personnel according to should
Set with the quantity of the job task handled in scene, degree of priority, task resource service condition, or even operating personnel's experience etc.
Least unit sequestered resources.In a kind of embodiment that the application provides, the least unit sequestered resources are included using following
In any one mode determine：
Determined according to available total resources and expected maximum task data amount；
Determined according to the expection that single job task is maximum using resource；
The individual task fixed space distribution resource of self-defined setting.
Such as acquiescence be divided into fixed space resource it is anticipated that maximum number of tasks determine application scenarios in, if
500 thread resources wish can giving 100 tasks while use with resource isolation, then can determine in application scenarios
Least unit sequestered resources are 500/100=5 thread, minimum equivalent to each task to ensure have 5 threads available i.e. reachable
To the requirement of resource isolation.It is, of course, also possible to according to the larger task dispatching of the configuration of system, the configuration of resource, resources requirement
Factor determines the least unit sequestered resources.90% or so task can ensure normally to hold using 5 threads as expected
OK, then least unit sequestered resources could be arranged to 5 threads, or for Conservative estimation, it can also be provided that 6 lines
Journey.
In the present embodiment, when often receiving a new job task, you can automatically drawn from flexible resource space
Separate a least unit sequestered resources and give fixed resource space.As shown in figure 3, Fig. 3 is a root in herein described method
According to the schematic diagram of task quantity automatic resource Type division, fixed resource space is initially 0, and flexible resource space is initially 500,
Then：
After task taskA is submitted, fixed resource space is changed into 5, and flexible resource space is kept to 495；
After task taskB is submitted, fixed resource space is changed into 10, and flexible resource space is kept to 490；
……
By that analogy.
S2：Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use.
The present embodiment can automatically adjust fixed resource space and flexible resource space according to the job task of reception.Have
During new job task, a newest unit sequestered resources are distributed from fixed resource space to be made to the job task is exclusive
With.During the resource bid of job task, if take available resources from fixed resource space, it is only capable of from distributing to job task
Fixation the set of least unit sequestered resources in obtain.A specific resource bid process example is as shown in figure 4, Fig. 4 is
The processing distance schematic diagram of a job task thread resources application in herein described method.
In another implement scene, if the inadequate job task of least unit sequestered resources of fixed resource space distribution makes
With, then can continue in flexible resource space it is extra needed for resource competition.If flexible resource space application less than,
Then current work task temporary block.Therefore, in another embodiment of methods described, if the job task received is asked
Resource be more than the least unit sequestered resources, then from the fixed resource space distribute least unit sequestered resources to institute
Job task is stated to monopolize after use, in addition to：
S20：Competition application requested resource subtracts the least unit sequestered resources from the flexible resource space
Resource afterwards.
In such as implement scene of above-mentioned 500 threads, it is 5 that job task taskB is distributed in fixed resource space
The exclusive thread resources used, now fixed resource space is 10, and flexible resource space is 495.But actual job task taskB
7 thread resources are needed, taskB applies for 7 thread resources.The resource asked according to taskB, 5 from fixed resource space
After thread distributes to taskB, other two thread resources compete application from 495 threads in flexible resource space.Due to this
When flexible resource Spatial Residual available thread resource it is enough, can distribute completely from 495 be used to competition thread in
Two scenes are distributed to use to taskB.So, 7 thread resources processing of the actual quota demands of taskB can be fully met
Demand.Certainly, in other job tasks, if actually required resource, which exceedes in fixed resource space, distributes to the job task
Least unit sequestered resources, then can be competed from flexible resource space application use.
It is as described above, in the fixed resource space of the present embodiment, distribute to the least unit of some job task every
It can not be used from other resources for not being applied to use in resource by other job task applications.A specific example is come
Say, if the least unit sequestered resources set are 5 threads, and finally 4 threads are used only in job task taskA, then
1 thread resources idle in taskA 5 thread resources are distributed in fixed resource space and are still retained in fixed assets
In source space, and subsequently also it is only capable of applying using by taskA.If taskB applies for 6 thread resources, in fixed resource space
In after the 5 thread resources applications of oneself, can not apply using that 1 thread resources (this free time idle in taskA
Thread resources be also sequestered resources), and can only apply in flexible resource space.
S3：At the end of the job task, the resource that will distribute to the fixed resource space of the job task is returned
To the flexible resource space.
When some job task processing terminates, the resource release occupied finishes, then is assigned to when can be by the task application
The least unit sequestered resources in fixed resource space are re-set as that the resource used can be competed in flexible resource space, by it
Return to flexible resource space.In such as implement scene of above-mentioned 500 thread resources, job task taskA and taskB thread resources
After distributing, fixed resource space is 10 threads, and flexible resource space is 490 threads.When job task taskB has been performed
Finish, after thread resources release, 5 thread resources that taskB is distributed in fixed resource space are repartitioned into flexible money
Source is empty, then now, fixed resource space is 10 threads, and flexible resource space is 495 threads.As shown in figure 5, Fig. 5 is this
A task terminates the schematic diagram that rear resource type is repartitioned in application.
Because the resource that task uses may include the resource in resource and flexible resource space in fixed resource space,
Therefore, the sequencing of resource release can also have different embodiments.In a kind of embodiment that the application provides, when described
During the resource that job task release uses, can the preferential flexible resource space of release busy resource, then release busy
The fixed resource space resource.So, the resource in the flexible resource space that job task takes can be more preferential, fast
Speed is released, in order to which the job task in other application flexible resource spaces is applied obtaining resource as soon as possible.Certainly, this Shen
The resource in fixed resource space can also be first discharged in other embodiment please, or is determined using the decision mechanism set
It is the resource for first discharging any segment space.
Job task takes whether resource can be released in time, be resource rationally reclaim one of reallocation it is important because
Element.In another embodiment for the methods described that the application provides, inspection job task state is periodically taken turns using timer, to judge
Whether job task terminates, as job task is stayed, then release resource in time.Therefore, in another embodiment of methods described,
It can determine that the job task terminates based on following manner：
Utilize the state of timing means timing detection operation task；
If the job task No Assets application record in default latent period, it is determined that the job task has been tied
Beam.
Such as timer can be utilized, regularly detect the execution state of each job task.If detect some operation
Task in default latent period (such as could be arranged to 5 minutes) interior task without thread application record, then can be with the task operation
Task is over, then further can and the thread resources in fixed resource space empty with the flexible resource of release busy.
In another implement scene of the processing method for the resource allocation that the application provides, it is possible that some spies
Different job task.When these special operation task resources distribute, if only distributing least unit sequestered resources, tend not to full
Foot processing needs, such as when minimum single sequestered resources be 5 threads, need to if some job task needs preferential urgent processing
11 thread resources are wanted, then after 5 exclusive threads are distributed in fixed resource space, also 6 threads are needed in flexible resource space
Middle competition application.To solve the above problems, further optimized allocation of resources strategy, another embodiment that the application provides
In, it can distribute exclusive resource according to the priority of job task for it accordingly, ensure the higher task of these priority more
Increase effect, smoothly perform.Specifically, methods described can also include：
S10：Obtain the priority of the job task；
Accordingly, if the priority of the job task reaches resource priority allocation level, according to described priority etc.
Level distributes corresponding prioritized resources to the fixed resource space from the flexible resource space, and is preferentially provided described
Distribute to the exclusive use of the job task in source.
In a specific example, if the priority of job task be divided into 0,1,2,3 (priority level reduces successively) and
Without priority level.Can be arranged on when the priority of job task reaches 2 and the above distributed for job task it is corresponding
Prioritized resources.Here can be unified fixed resource quantity in a kind of embodiment of described prioritized resources, such as preferentially
10 exclusive thread resources that the task of grade 0,1,2 is distributed in fixed resource space.Preferentially provided in another embodiment
Source can also be that different prioritized resources are divided according to priority level.Such as the job task taskC that priority level is 2,
10 thread resources are divided from flexible resource space and give job task taskC as the resource allocation in fixed resource space,
And for the job task taskD that priority level is 1, then 15 thread resources conducts can be divided from flexible resource space
Resource allocation in fixed resource space gives job task taskD.
So, the higher job task of priority level generally requires more exclusive resources and handled, and this implementation
Example can according to the priority of job task flexibly, adaptability give more exclusive resources so that task resource distributes more
Adduction is managed, and job task execution efficiency is more preferable, and system performance is more preferable.
Using embodiment described herein, because the resource in fixed resource space is monopolized for task, so upper
State in example, even if in the case that 100 tasks are full up, each task also all without competing, has accomplished resource isolation.Solely
It is inadequate to account for resource, sequestered resources application is less than then itself blocks, and belonging to itself task attribute causes, will not be because of a task
Occupy excess resource and cause the task of remaining exclusive resource do not used also to block.And there is no full up feelings in task
The resource for having flexible resource space again under condition can be used with free competition, give full play to resource efficiency.Even if there is new operation
During task but when the resource in preceding flexible resource space has had been used at present, the job task first time resource performed is only needed to wait for
It can apply to exclusive resource after release.Implementing application scheme, efficiency that resource uses, task blocking, systematic function etc. has
It is obviously improved.
Based on the processing method of resource allocation described above, the application also provides a kind of processing unit of resource allocation.
Described device can include the use of the system (including distributed system) of herein described method, software (application), module,
Component, server, client etc. and the device for combining necessary implementation hardware.Based on same innovation thinking, what the application provided
A kind of device in embodiment is as described in the following examples.It is similar to method to solve the implementation of problem due to device, because
The implementation of the specific device of this application may refer to the implementation of preceding method, repeats part and repeats no more.It is used below,
Term " unit " or " module " can realize the combination of the software and/or hardware of predetermined function.Although following examples are retouched
The device stated preferably is realized with software, but hardware, or the combination of software and hardware realization be also may and by structure
Think.Specifically, Fig. 6 is a kind of modular structure schematic diagram of the processing unit embodiment for resource allocation that the application provides, such as
Shown in Fig. 6, described device can include：
Resource division module 101, when can be used for receiving job task, distributed most from the flexible resource space of division
Fixed resource space of the subsection sequestered resources to division；
Resource distribution module 102, it can be used for distributing least unit sequestered resources from the fixed resource space to institute
State the exclusive use of job task；
Resource reclaim module 103, it can be used at the end of working as the job task, consolidating for the job task will be distributed to
The resource for determining resource space returns to the flexible resource space.
In the embodiment of device described above, the resource of the fixed resource space distribution uses for job task is exclusive,
Resource in the flexible resource space can be that job task competition uses.
Certainly, in other implementations, resource division module 101 and resource reclaim module 103 can also be merged
For a processing modules implement.Such as shown in Fig. 7, Fig. 7 is that the processing unit for another resource allocation that the application provides is implemented
The modular structure schematic diagram of example, the resource division module 104 in Fig. 7 can both be realized when receiving job task, from division
Fixed resource space of the least unit sequestered resources to division is distributed in flexible resource space, can also be realized when the operation is appointed
At the end of business, the resource in the fixed resource space for distributing to the job task is returned into the flexible resource space.
As described in preceding method, in another embodiment of described device, in order to further improve the service efficiency of resource,
Host performance is given full play to, can use following manner that the division in resource space and initial resource space is fixed：
The fixed resource space and flexible resource space are configured to, and the initial resource in fixed resource space is 0, flexibly
The initial resource of resource space is available total resources.
Described least unit sequestered resources can use various ways to determine, as operating personnel locates according in application scenarios
Quantity, degree of priority, the task resource service condition of the job task of reason, in addition operating personnel's experience etc. set least unit every
From resource.In the described device others embodiment that the application provides, the least unit sequestered resources are included using in following
Any one mode determine：
Determined according to available total resources and expected maximum task data amount；
Determined according to the expection that single job task is maximum using resource；
The individual task fixed space distribution resource of self-defined setting.
Concrete implementation mode is referred to described in preceding method embodiment, will not be described here.
Further optimized allocation of resources strategy, in another embodiment for the described device that the application provides, Ke Yigen
According to the priority of job task, exclusive resource is distributed for it accordingly, ensures that the higher task of these priority is more efficient, suitable
The execution of profit.Fig. 8 is the modular structure schematic diagram of the processing unit embodiment for another resource allocation that the application provides, and is such as schemed
Shown in 8, described device can also include：
Priority confirms module 105, can be used for the priority for obtaining the job task；
Accordingly, if the priority confirms that module 105 determines that the priority of the job task reaches resource priority point
With grade, then the resource distribution module 102 distributes least unit sequestered resources to the work from the fixed resource space
Industry task, which monopolizes use, to be included：
Corresponding prioritized resources are distributed to described solid from the flexible resource space according to the priority level
Determine resource space, and the prioritized resources are distributed into the exclusive use of the job task.
Job task takes whether resource can be released in time, be resource rationally reclaim one of reallocation it is important because
Element.In another embodiment for the methods described that the application provides, inspection job task state is periodically taken turns using timer, to judge
Whether job task terminates, as job task is stayed, then release resource in time.Fig. 9 is another resource point that the application provides
The modular structure schematic diagram for the processing unit embodiment matched somebody with somebody, as shown in figure 8, described device can also include：
Wheel inspection module 106, can be used for the state of timing detection operation task, and, it is described in default latent period
During job task No Assets application record, it is determined that the job task has terminated.
In a kind of embodiment of described device, when the resource that job task release uses, it can preferentially discharge and account for
The resource in the flexible resource space, then the resource in the fixed resource space of release busy.So, job task accounts for
The resource in flexible resource space can it is more preferential, be quickly obtained release, in order to which other apply for flexible resource space
Job task apply obtaining resource as soon as possible.Therefore, in another implementation for the described device that the application provides, the resource
At the end of recycling module 103 detects job task, the resource in the flexible resource space of preferential release busy, then discharge and account for
The resource in the fixed resource space.
The processing method for the resource allocation that the application provides can be referred to by the corresponding program of computing device in a computer
Make to realize, if the c++ language using windows operating systems using android and iOS system the realization of PC ends, being opened
Programming language is realized on mobile terminals.Specifically, a kind of processing unit for resource allocation that the application provides is another
In a kind of embodiment, described device can include processor and the memory for storing processor-executable instruction, described
Realized described in computing device during instruction：
When receiving job task, least unit sequestered resources consolidating to division is distributed from the flexible resource space of division
Determine resource space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into institute
State flexible resource space.
A kind of processing unit for resource allocation that the application provides, fixed resource space and spirit are divide into by host resource
Quick stock source space.Fixed resource space is distributed according to need to task resource and used as exclusive resource, and the withdrawal after using.And
The resource in flexible resource space can then be competed by task and used, and can both ensure that least resource was available (i.e. in some limit
Task is felt to perfect monopoly, and other tasks are uncompetitive), again can be at resource idle (other tasks use)
Obtain maximum resource availability.In the embodiment that the application provides, because the resource in fixed resource space is task
It is exclusive, so even if the full up situation of task, each task also all without competing, realize resource isolation.And in task
Do not have it is full up in the case of and there is flexible resource space to give full play to resource utilization with free competition, greatly improved
Virtualize the resource utilization and systematic function of unit.
Method or apparatus described in the above embodiments of the present application can be realized service logic and be recorded by computer program
On a storage medium, described storage medium can be read and be performed with computer, realize scheme described by the embodiment of the present application
Effect.Therefore, the application also provides a kind of computer-readable recording medium, is stored thereon with computer instruction, the instruction quilt
Following steps can be realized during execution：
When receiving job task, least unit sequestered resources consolidating to division is distributed from the flexible resource space of division
Determine resource space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into institute
State flexible resource space.
The computer-readable recording medium can include the physical unit for storage information, typically by message digit
Media after change again in a manner of using electricity, magnetic or optics etc. are stored.Computer-readable storage medium described in the present embodiment
Matter has and can included：Using electric energy mode storage information device such as, various memory, such as RAM, ROM；Utilize magnetic energy mode
The device of storage information such as, hard disk, floppy disk, tape, core memory, magnetic bubble memory, USB flash disk；Stored and believed using optical mode
The device of breath such as, CD or DVD.Certainly, the also readable storage medium storing program for executing of other modes, such as quantum memory, graphene storage
Device etc..
Device or method or computer-readable recording medium described above can be used in various electronic equipments, pass through by
Resource is divided into fixed resource space and flexible resource space, and fixed space is distributed according to need, and is finished recovery, and flexible space competes,
Realize that the colleague that resource is effectively isolated in electronic equipment can ensure resource utilization.Described electronic equipment is not limited to method reality
The host described in example is applied, the resource object for distributing processing is also not necessarily limited to field resources.Specifically, one kind that the application provides
In electronic equipment, processor and the memory for storing processor-executable instruction, the computing device can be included
Realized during the instruction：
When receiving job task, least unit sequestered resources consolidating to division is distributed from the flexible resource space of division
Determine resource space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into institute
State flexible resource space.
Figure 10 is the structural representation for a kind of electronic equipment that the application provides, and the resource of distribution can be in electronic equipment
Memory source or electronic equipment in other resources, or coupling or with electronic equipment communication connection other resources.
Need what is illustrated, device described above or computer-readable storage medium or electronic equipment can be with according to the description of embodiment of the method
Including other embodiments, such as the initial resource in fixed resource space is 0, and the initial resource in flexible resource space is available
Total resources, or, least unit sequestered resources are determined according to available total resources and expected maximum task data amount,
Or using timer poll job task state etc., concrete implementation mode is referred to the description of embodiment of the method, herein
Do not repeat one by one.
Processing method, device and the electronic equipment for a kind of resource allocation that the application provides, host resource divide into
Fixed resource space and flexible resource space.Fixed resource space is distributed according to need to task resource and used as exclusive resource, and
The withdrawal after having used.And the resource in flexible resource space can then be competed by task and used, it can both ensure that least resource could
, again can be in idle (its of resource with (i.e. task is felt to perfect monopoly in some limit, and other tasks are uncompetitive)
He does not use task) when obtain maximum resource availability.In the embodiment that the application provides, because fixed resource is empty
In resource monopolized for task, so even if the full up situation of task, each task realize money also all without competing
Source isolates.And task do not have it is full up in the case of have flexible resource space can be with free competition, having given full play to resource makes
With efficiency, the resource utilization and systematic function for virtualizing unit are greatly improved.
Although mentioned in teachings herein distributed using thread resources, the determination mode of least unit sequestered resources, task
The initial setting up of resource allocation policy, different type resource space during resource bid, the different operation systems for realizing this programme
System or the like data/resource set, obtain, interaction, the description such as calculate, judge, still, the application is not limited to necessary
It is to meet industry communication standard, standard database, computer disposal and storage rule or the situation described by the embodiment of the present application.
Some professional standards use embodiment amended slightly in self-defined mode or the practice processes of embodiment description
Can realize above-described embodiment it is identical, it is equivalent or it is close or deformation after it is anticipated that implementation result.Using these modifications or deformation
The embodiment of the acquisitions such as rear data acquisition, storage, judgement, processing mode, still may belong to the optional embodiment party of the application
Within the scope of case.
In the 1990s, the improvement for a technology can clearly distinguish be on hardware improvement (for example,
Improvement to circuit structures such as diode, transistor, switches) or software on improvement (improvement for method flow).So
And as the development of technology, the improvement of current many method flows can be considered as directly improving for hardware circuit.
Designer nearly all obtains corresponding hardware circuit by the way that improved method flow is programmed into hardware circuit.Cause
This, it cannot be said that the improvement of a method flow cannot be realized with hardware entities module.For example, PLD
(Programmable Logic Device, PLD) (such as field programmable gate array (Field Programmable Gate
Array, FPGA)) it is exactly such a integrated circuit, its logic function is determined by user to device programming.By designer
Voluntarily programming comes a digital display circuit " integrated " on a piece of PLD, without asking chip maker to design and make
Special IC chip.Moreover, nowadays, substitution manually makes IC chip, this programming is also used instead mostly " patrols
Volume compiler (logic compiler) " software realizes that software compiler used is similar when it writes with program development,
And the source code before compiling also write by handy specific programming language, this is referred to as hardware description language
(Hardware Description Language, HDL), and HDL is also not only a kind of, but have many kinds, such as ABEL
(Advanced Boolean Expression Language)、AHDL(Altera Hardware Description
Language)、Confluence、CUPL(Cornell University Programming Language)、HDCal、JHDL
(Java Hardware Description Language)、Lava、Lola、MyHDL、PALASM、RHDL(Ruby
Hardware Description Language) etc., VHDL (Very-High-Speed are most generally used at present
Integrated Circuit Hardware Description Language) and Verilog.Those skilled in the art also should
This understands, it is only necessary to method flow slightly programming in logic and is programmed into integrated circuit with above-mentioned several hardware description languages,
Can is readily available the hardware circuit for realizing the logical method flow.
Controller can be implemented in any suitable manner, for example, controller can take such as microprocessor or processing
Device and storage can by the computer of the computer readable program code (such as software or firmware) of (micro-) computing device
Read medium, gate, switch, application specific integrated circuit (Application Specific Integrated Circuit,
ASIC), the form of programmable logic controller (PLC) and embedded microcontroller, the example of controller include but is not limited to following microcontroller
Device：ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20 and Silicone Labs C8051F320, are deposited
Memory controller is also implemented as a part for the control logic of memory.It is also known in the art that except with
Pure computer readable program code mode realized beyond controller, completely can be by the way that method and step is carried out into programming in logic to make
Controller is obtained in the form of gate, switch, application specific integrated circuit, programmable logic controller (PLC) and embedded microcontroller etc. to come in fact
Existing identical function.Therefore this controller is considered a kind of hardware component, and various for realizing to including in it
The device of function can also be considered as the structure in hardware component.Or even, can be by for realizing that the device of various functions regards
For that not only can be the software module of implementation method but also can be the structure in hardware component.
System, device, module or the unit that above-described embodiment illustrates, it can specifically be realized by computer chip or entity,
Or realized by the product with certain function.One kind typically realizes that equipment is computer.Specifically, computer for example may be used
Think personal computer, laptop computer, vehicle-mounted human-computer interaction device, cell phone, camera phone, smart phone, individual
Digital assistants, media player, navigation equipment, electronic mail equipment, game console, tablet PC, wearable device or
The combination of any equipment in these equipment of person.
Although this application provides the method operating procedure as described in embodiment or flow chart, based on conventional or noninvasive
The means for the property made can include more or less operating procedures.The step of being enumerated in embodiment order is only numerous steps
A kind of mode in execution sequence, does not represent unique execution sequence., can be with when device in practice or end product perform
According to embodiment, either method shown in the drawings order performs or parallel performs (such as parallel processor or multiple threads
Environment, even distributed data processing environment).Term " comprising ", "comprising" or its any other variant are intended to
Nonexcludability includes, so that process, method, product or equipment including a series of elements not only will including those
Element, but also the other element including being not expressly set out, or it is this process, method, product or equipment also to include
Intrinsic key element.In the absence of more restrictions, be not precluded from the process including the key element, method, product or
Other identical or equivalent elements in person's equipment also be present.
For convenience of description, it is divided into various modules during description apparatus above with function to describe respectively.Certainly, this is being implemented
The function of each module can be realized in same or multiple softwares and/or hardware during application, can also will realize same work(
The module of energy is by combination realization of multiple submodule or subelement etc..Device embodiment described above is only schematic
, for example, the division of the unit, only a kind of division of logic function, can there is other dividing mode when actually realizing,
Such as multiple units or component can combine or be desirably integrated into another system, or some features can be ignored, or not hold
OK.It is another, shown or discussed mutual coupling or direct-coupling or communication connection can be by some interfaces,
The INDIRECT COUPLING or communication connection of device or unit, can be electrical, mechanical or other forms.
It is also known in the art that in addition to realizing controller in a manner of pure computer readable program code, it is complete
Entirely can by by method and step carry out programming in logic come controller with gate, switch, application specific integrated circuit, may be programmed
The form of logic controller and embedded microcontroller etc. realizes identical function.Therefore this controller is considered one kind
Hardware component, and what its inside was included is used to realize that the device of various functions can also to be considered as the structure in hardware component.Or
Person even, not only can be able to will be the software module of implementation method but also can be hardware for realizing that the device of various functions is considered as
Structure in part.
The present invention is the flow with reference to method according to embodiments of the present invention, equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that can be by every first-class in computer program instructions implementation process figure and/or block diagram
Journey and/or the flow in square frame and flow chart and/or block diagram and/or the combination of square frame.These computer programs can be provided
The processors of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce
A raw machine so that produced by the instruction of computer or the computing device of other programmable data processing devices for real
The device for the function of being specified in present one flow of flow chart or one square frame of multiple flows and/or block diagram or multiple square frames.
These computer program instructions, which may be alternatively stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that the instruction being stored in the computer-readable memory, which produces, to be included referring to
Make the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one square frame of block diagram or
The function of being specified in multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that counted
Series of operation steps is performed on calculation machine or other programmable devices to produce computer implemented processing, so as in computer or
The instruction performed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in individual square frame or multiple square frames.
In a typical configuration, computing device includes one or more processors (CPU), input/output interface, net
Network interface and internal memory.
Internal memory may include computer-readable medium in volatile memory, random access memory (RAM) and/or
The forms such as Nonvolatile memory, such as read-only storage (ROM) or flash memory (flash RAM).Internal memory is computer-readable medium
Example.
Computer-readable medium includes permanent and non-permanent, removable and non-removable media can be by any method
Or technology come realize information store.Information can be computer-readable instruction, data structure, the module of program or other data.
The example of the storage medium of computer includes, but are not limited to phase transition internal memory (PRAM), static RAM (SRAM), moved
State random access memory (DRAM), other kinds of random access memory (RAM), read-only storage (ROM), electric erasable
Programmable read only memory (EEPROM), fast flash memory bank or other memory techniques, read-only optical disc read-only storage (CD-ROM),
Digital versatile disc (DVD) or other optical storages, magnetic cassette tape, the storage of tape magnetic rigid disk or other magnetic storage apparatus
Or any other non-transmission medium, the information that can be accessed by a computing device available for storage.Define, calculate according to herein
Machine computer-readable recording medium does not include temporary computer readable media (transitory media), such as data-signal and carrier wave of modulation.
It will be understood by those skilled in the art that embodiments herein can be provided as method, system or computer program product.
Therefore, the application can be using the embodiment in terms of complete hardware embodiment, complete software embodiment or combination software and hardware
Form.Deposited moreover, the application can use to can use in one or more computers for wherein including computer usable program code
The shape for the computer program product that storage media is implemented on (including but is not limited to magnetic disk storage, CD-ROM, optical memory etc.)
Formula.
The application can be described in the general context of computer executable instructions, such as program
Module.Usually, program module includes performing particular task or realizes routine, program, object, the group of particular abstract data type
Part, data structure etc..The application can also be put into practice in a distributed computing environment, in these DCEs, by
Task is performed and connected remote processing devices by communication network.In a distributed computing environment, program module can be with
In the local and remote computer-readable storage medium including storage device.
Each embodiment in this specification is described by the way of progressive, identical similar portion between each embodiment
Divide mutually referring to what each embodiment stressed is the difference with other embodiment.It is real especially for system
For applying example, because it is substantially similar to embodiment of the method, so description is fairly simple, related part is referring to embodiment of the method
Part explanation.In the description of this specification, reference term " one embodiment ", " some embodiments ", " example ",
The description of " specific example " or " some examples " etc. means to combine specific features, structure, material that the embodiment or example describe
Or feature is contained at least one embodiment or example of the application.In this manual, to the schematic of above-mentioned term
Statement is necessarily directed to identical embodiment or example.Moreover, specific features, structure, material or the feature of description can
To be combined in an appropriate manner in any one or more embodiments or example.In addition, in the case of not conflicting, ability
The technical staff in domain can be by the different embodiments or example and the feature of different embodiments or example described in this specification
It is combined and combines.
Embodiments herein is the foregoing is only, is not limited to the application.For those skilled in the art
For, the application can have various modifications and variations.All any modifications made within spirit herein and principle, it is equal
Replace, improve etc., it should be included within the scope of claims hereof.
Claims (17)
1. a kind of processing method of resource allocation, methods described include：
When receiving job task, fixed assets of the least unit sequestered resources to division is distributed from the flexible resource space of division
Source space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into the spirit
Quick stock source space.
2. a kind of processing method of resource allocation as claimed in claim 1, the fixed resource space and flexible resource space
It is configured to, the initial resource in fixed resource space is 0, the initial resource in flexible resource space is available total resources.
3. a kind of processing method of resource allocation as claimed in claim 2, the resource conduct of the fixed resource space distribution
Job task is exclusive to be used, and the resource in the flexible resource space is competed as job task and used.
4. a kind of processing method of resource allocation as claimed in claim 1 or 2, the least unit sequestered resources include using
Any one mode in following determines：
Determined according to available total resources and expected maximum task data amount；
Determined according to the expection that single job task is maximum using resource；
The individual task fixed space distribution resource of self-defined setting.
A kind of 5. processing method of resource allocation as claimed in claim 4, if the job task requested resource received
More than the least unit sequestered resources, then least unit sequestered resources are distributed from the fixed resource space and give the operation
Task is monopolized after use, in addition to：
Competition application requested resource subtracts the resource after the least unit sequestered resources from the flexible resource space.
6. a kind of processing method of resource allocation as claimed in claim 4, methods described also include：
Obtain the priority of the job task；
Accordingly, if the priority of the job task reaches resource priority allocation level, according to the priority level from
Corresponding prioritized resources are distributed in the flexible resource space to the fixed resource space, and the prioritized resources are divided
Job task described in dispensing is exclusive to be used.
7. a kind of processing method of resource allocation as claimed in claim 1, the job task knot is determined based on following manner
Beam：
The state of timing detection operation task；
If the job task No Assets application record in default latent period, it is determined that the job task has terminated.
8. a kind of processing method of resource allocation as claimed in claim 1, when the resource that job task release uses,
The resource in the flexible resource space of preferential release busy, then the resource in the fixed resource space of release busy.
9. a kind of processing unit of resource allocation, described device include：
Resource division module, during for receiving job task, least unit isolation is distributed from the flexible resource space of division
Fixed resource space of the resource to division；
Resource distribution module, it is only to the job task for distributing least unit sequestered resources from the fixed resource space
Account for use；
Resource reclaim module, at the end of the job task, the fixed resource space of the job task will to be distributed to
Resource return to the flexible resource space.
10. a kind of processing unit of resource allocation as claimed in claim 9, the fixed resource space and flexible resource space
It is configured to, the initial resource in fixed resource space is 0, the initial resource in flexible resource space is available total resources.
11. a kind of processing unit of resource allocation as claimed in claim 9, the least unit sequestered resources are included under using
Any one mode in stating determines：
Determined according to available total resources and expected maximum task data amount；
Determined according to the expection that single job task is maximum using resource；
The individual task fixed space distribution resource of self-defined setting.
12. a kind of processing unit of resource allocation as claimed in claim 9, described device also include：
Priority confirms module, for obtaining the priority of the job task；
Accordingly, if the priority confirms that module determines that the priority of the job task reaches resource priority allocation level,
Then the resource distribution module distributes least unit sequestered resources from the fixed resource space and monopolized to the job task
Using including：
Corresponding prioritized resources are distributed to the fixed assets from the flexible resource space according to the priority level
Source space, and the prioritized resources are distributed into the exclusive use of the job task.
13. a kind of processing unit of resource allocation as claimed in claim 9, described device also include：
Wheel inspection module, for the state of timing detection operation task, and, the job task is without money in default latent period
During the application record of source, it is determined that the job task has terminated.
14. a kind of processing unit of resource allocation as claimed in claim 9, the resource reclaim module detect job task
At the end of, the resource in the flexible resource space of preferential release busy, then the money in the fixed resource space of release busy
Source.
15. a kind of processing unit of resource allocation, including processor and the memory for storing processor-executable instruction,
Realized described in the computing device during instruction：
When receiving job task, fixed assets of the least unit sequestered resources to division is distributed from the flexible resource space of division
Source space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into the spirit
Quick stock source space.
16. a kind of computer-readable recording medium, is stored thereon with computer instruction, following walk is realized in the instruction when being performed
Suddenly：
When receiving job task, fixed assets of the least unit sequestered resources to division is distributed from the flexible resource space of division
Source space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into the spirit
Quick stock source space.
17. a kind of electronic equipment, including processor and the memory for storing processor-executable instruction, the processor
Realized when performing the instruction：
When receiving job task, fixed assets of the least unit sequestered resources to division is distributed from the flexible resource space of division
Source space；
Least unit sequestered resources are distributed from the fixed resource space gives the job task exclusive use；
At the end of the job task, the resource in the fixed resource space for distributing to the job task is returned into the spirit
Quick stock source space.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710366928.5A CN107368367B (en) | 2017-05-23 | 2017-05-23 | Resource allocation processing method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710366928.5A CN107368367B (en) | 2017-05-23 | 2017-05-23 | Resource allocation processing method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107368367A true CN107368367A (en) | 2017-11-21 |
| CN107368367B CN107368367B (en) | 2021-03-02 |
Family
ID=60304893
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710366928.5A Active CN107368367B (en) | 2017-05-23 | 2017-05-23 | Resource allocation processing method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107368367B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109062702A (en) * | 2018-08-31 | 2018-12-21 | 中兴飞流信息科技有限公司 | A kind of computational resource allocation method, relevant apparatus and readable storage medium storing program for executing |
| CN109976672A (en) * | 2019-03-22 | 2019-07-05 | 深信服科技股份有限公司 | A kind of read/write conflict optimization method, device, electronic equipment and readable storage medium storing program for executing |
| CN110363319A (en) * | 2018-03-26 | 2019-10-22 | 阿里巴巴集团控股有限公司 | Resource allocation methods, server, resource claim method and client |
| CN111314401A (en) * | 2018-12-12 | 2020-06-19 | 百度在线网络技术（北京）有限公司 | Resource allocation method, device, system, terminal and computer readable storage medium |
| CN111597037A (en) * | 2020-04-15 | 2020-08-28 | 北京文思海辉金信软件有限公司 | Job distribution method and device, electronic equipment and readable storage medium |
| WO2023035664A1 (en) * | 2021-09-10 | 2023-03-16 | 中兴通讯股份有限公司 | Resource allocation method, cloud host, and computer-readable storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020133530A1 (en) * | 2001-03-15 | 2002-09-19 | Maarten Koning | Method for resource control including resource stealing |
| CN104636205A (en) * | 2014-12-26 | 2015-05-20 | 北京奇艺世纪科技有限公司 | Task seizing method and device |
| CN104937584A (en) * | 2012-12-19 | 2015-09-23 | 赛门铁克公司 | Providing optimized quality of service to prioritized virtual machines and applications based on quality of shared resources |
| CN105677481A (en) * | 2015-12-31 | 2016-06-15 | 联想(北京)有限公司 | Method and system for processing data and electronic equipment |
| CN105718316A (en) * | 2014-12-01 | 2016-06-29 | 中国移动通信集团公司 | Job scheduling method and apparatus |
| CN106681835A (en) * | 2016-12-28 | 2017-05-17 | 华为技术有限公司 | Resource allocation method and resource manager |
-
2017
- 2017-05-23 CN CN201710366928.5A patent/CN107368367B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020133530A1 (en) * | 2001-03-15 | 2002-09-19 | Maarten Koning | Method for resource control including resource stealing |
| CN104937584A (en) * | 2012-12-19 | 2015-09-23 | 赛门铁克公司 | Providing optimized quality of service to prioritized virtual machines and applications based on quality of shared resources |
| CN105718316A (en) * | 2014-12-01 | 2016-06-29 | 中国移动通信集团公司 | Job scheduling method and apparatus |
| CN104636205A (en) * | 2014-12-26 | 2015-05-20 | 北京奇艺世纪科技有限公司 | Task seizing method and device |
| CN105677481A (en) * | 2015-12-31 | 2016-06-15 | 联想(北京)有限公司 | Method and system for processing data and electronic equipment |
| CN106681835A (en) * | 2016-12-28 | 2017-05-17 | 华为技术有限公司 | Resource allocation method and resource manager |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110363319A (en) * | 2018-03-26 | 2019-10-22 | 阿里巴巴集团控股有限公司 | Resource allocation methods, server, resource claim method and client |
| CN110363319B (en) * | 2018-03-26 | 2023-09-29 | 阿里巴巴集团控股有限公司 | Resource allocation method, server, resource claim method and client |
| CN109062702A (en) * | 2018-08-31 | 2018-12-21 | 中兴飞流信息科技有限公司 | A kind of computational resource allocation method, relevant apparatus and readable storage medium storing program for executing |
| CN109062702B (en) * | 2018-08-31 | 2021-07-30 | 中兴飞流信息科技有限公司 | Computing resource allocation method, related device and readable storage medium |
| CN111314401A (en) * | 2018-12-12 | 2020-06-19 | 百度在线网络技术（北京）有限公司 | Resource allocation method, device, system, terminal and computer readable storage medium |
| CN111314401B (en) * | 2018-12-12 | 2023-06-23 | 百度在线网络技术（北京）有限公司 | Resource allocation method, device, system, terminal and computer readable storage medium |
| CN109976672A (en) * | 2019-03-22 | 2019-07-05 | 深信服科技股份有限公司 | A kind of read/write conflict optimization method, device, electronic equipment and readable storage medium storing program for executing |
| CN109976672B (en) * | 2019-03-22 | 2022-02-22 | 深信服科技股份有限公司 | Read-write conflict optimization method and device, electronic equipment and readable storage medium |
| CN111597037A (en) * | 2020-04-15 | 2020-08-28 | 北京文思海辉金信软件有限公司 | Job distribution method and device, electronic equipment and readable storage medium |
| WO2023035664A1 (en) * | 2021-09-10 | 2023-03-16 | 中兴通讯股份有限公司 | Resource allocation method, cloud host, and computer-readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107368367B (en) | 2021-03-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107368367A (en) | Processing method, device and the electronic equipment of resource allocation | |
| US8499010B2 (en) | Garbage collection in a multiple virtual machine environment | |
| CN103098014B (en) | Storage system | |
| US9229783B2 (en) | Methods and apparatus for resource capacity evaluation in a system of virtual containers | |
| US9262220B2 (en) | Scheduling workloads and making provision decisions of computer resources in a computing environment | |
| JP5911997B2 (en) | Apparatus, system, and memory management method | |
| CN109684074A (en) | Physical machine resource allocation methods and terminal device | |
| US20190188034A1 (en) | Thread pool and task queuing method and system | |
| JP2010282420A (en) | Management computer, resource management method, resource management program, recording medium, and information processing system | |
| CN108228672A (en) | A kind of metadata migration method, apparatus, system and equipment | |
| US10013264B2 (en) | Affinity of virtual processor dispatching | |
| CN106775493B (en) | A kind of storage control and I/O Request processing method | |
| CN109144710A (en) | Resource regulating method, device and computer readable storage medium | |
| CN107577523A (en) | A kind of method and device of tasks carrying | |
| US9104457B2 (en) | Virtual machine-to-image affinity on a physical server | |
| CN108255607A (en) | Task processing method, device, electric terminal and readable storage medium storing program for executing | |
| CN109240825A (en) | Elastic method for scheduling task, device, equipment and computer readable storage medium | |
| EP3516515B1 (en) | Scheduling of tasks in a multiprocessor device | |
| CN107291720A (en) | A kind of method, system and computer cluster for realizing batch data processing | |
| Chen et al. | Preemptive and low latency datacenter scheduling via lightweight containers | |
| CN104679575B (en) | The control system and its method of iostream | |
| CN105677481B (en) | A kind of data processing method, system and electronic equipment | |
| Zhang et al. | Workload consolidation in alibaba clusters: the good, the bad, and the ugly | |
| CN111125070A (en) | Data exchange method and platform | |
| JP2015022385A (en) | Virtual system and method for controlling virtual system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20201019 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Innovative advanced technology Co.,Ltd. Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant before: Advanced innovation technology Co.,Ltd. Effective date of registration: 20201019 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Advanced innovation technology Co.,Ltd. Address before: Greater Cayman, British Cayman Islands Applicant before: Alibaba Group Holding Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |