Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear, completeSite preparation describes, it is clear that described embodiment is part of the embodiment of the present invention, instead of all the embodiments.Based on this hairEmbodiment in bright, those of ordinary skill in the art's acquired every other implementation without creative effortsExample, shall fall within the protection scope of the present invention.
First embodiment
First embodiment of the invention discloses a kind of task executing method.This method is generally in computer, mobile terminal etc.It is used in equipment.As shown in Figure 1, this method specifically includes the steps：
Step S101：Receive the instruction for the first task for performing the first application.
First application can carry out multiple tasks.User's if desired the first application execution first task, can be connect by the stepReceive the instruction for the first task for performing the first application.
Step S102：Judge first task classification whether be carrying out first application at least one task pointClass is identical.
Each task can be belonged in a generic task.Same generic task is performed by a process.Therefore, pass throughThis step can determine whether the classification of first task, be to perform the task using existing process so as to can determine, it is desired nonetheless to newbornThe task is performed into a process.
If the classification of first task is identical with the classification of the second task of the first application being carrying out, step is carried outS103；If the classification of first task is differed with the classification of all tasks of the first application being carrying out, step is carried outS104。
Step S103：First task is performed by the second process of the second task.
The classification of first task is identical with the classification of the second task of the first application being carrying out, then new without regenerationProcess, directly pass through the second process of the second task perform first task.
Step S104：Generate the first process.
If the classification of first task is differed with the classification of all tasks of the first application being carrying out, need to give birth toThe process of Cheng Xin performs the task.
Step S105：First task is performed by the first process.
After the first new process of generation, which is performed by the first process.If receive again execution with it is firstThe instruction for similar task of being engaged in then performs the task similar with first task by first process.
To sum up, the task executing method of first embodiment of the invention, for different classifications task respectively by differentProcess performs, so as to be changed into multi-process mode from traditional one process mode so that the robustness of this method is good, performs taskFast response time, resource utilization it is high.
Second embodiment
Second embodiment of the invention discloses a kind of task executing method.This method is generally in computer, mobile terminal etc.It is used in equipment.As shown in Fig. 2, this method specifically includes the steps：
Step S201：According to the degree of association between the multiple tasks of the first application, task is divided at least two classes.
Wherein, from the angle of the first achievable several functions of application, if having in function between task and taskAny nexus nature in poly-, sequential cohension, communication cohesion, it is believed that there is the degree of association, then by these between task and taskTask is divided into same class.For example, task can be divided into three classes：Resource management tasks class, message management task class, Multimedia TaskClass.
Wherein, following rules should be met for the first application：First index of the first application meets the first rule.
Specifically, the first index includes：Total memory usage, total CPU usage and the total frequently interaction rate of first application.First rule is：Total memory usage of first application is no more than first threshold, and total CPU usage of the first application is no more than theTwo threshold values and total frequent interactive rate of the first application are no more than third threshold value.Preferably, according to actual conditions, first thresholdIt can be set as the 80% of the available overall availability of memory.Second threshold can be set as the 80% of the available total occupancies of CPU.ThirdThreshold value can be set according to demand.In general, if the first index of the first application is unsatisfactory for the first rule, it is likely that calculatingThe system of machine, mobile terminal etc. generates harm, and therefore, it is necessary to limit the first index of the first application to meet the first rule.
Step S202：Judge whether the second index per generic task meets Second Rule and the third index per generic taskWhether it is located within the scope of first.
Specifically, the second index includes：Per the memory usage of generic task, CPU usage and frequently interact rate.Appoint per classThe memory usage of business, CPU usage and frequently interaction rate can according to the memory usage of each task in the generic task,CPU usage and the frequently acquisition of interaction rate.Generally, it hands over for the memory usage of each task, CPU usage and frequentlyMutual rate can be there are one theoretical value for using.Second Rule is：Memory usage per generic task is no more than the every of the first applicationThe average memory usage of generic task, CPU usage be no more than every generic task of the first application average CPU usage andFrequently interaction rate is no more than the average frequently interaction rate of every generic task of the first application.Being averaged for every generic task of first application is interiorUtilization rate is deposited as total memory usage of the first application divided by the quantity of the classification of the task of the first application.Every class of first applicationThe average CPU usage of task is total CPU usage of the first application divided by the quantity of the classification of the task of the first application.FirstThe average frequently interaction rate of every generic task of application is total frequent interactive rate of the first application divided by the class of the task of the first applicationOther quantity.In general, using the mean value of the first index as the standard of the second index per generic task, it may be such that the utilization of resourcesRate maximizes；Meanwhile if a generic task is more than the mean value, other generic tasks may be caused to perform difficulty, therefore, it is necessary to limitThe second index per generic task meets Second Rule.For example, task has been divided into Resource management tasks class and Multimedia Task class,Total memory usage of first application is 80%, total CPU usage is 80% and total frequently interaction rate is 80%, then per generic taskCorresponding memory usage, CPU usage and frequent interaction rate are no more than 40%.
Specifically, third index is：Memory usage, CPU usage and the frequently interaction of every generic task of first applicationThe sum of rate.Preferably, this first ranging from 50%~100%.For example, the memory usage of Resource management tasks class for 30%,CPU usage is 30% and frequently interaction rate is 20%, then the memory usage of Resource management tasks class, CPU usage and frequencyThe sum of numerous interactive rate is 80%, within the scope of above-mentioned preferred first, therefore, is met the requirements.If beyond the first rangeThe upper limit then shows that the process assumes responsibility for too many task, and load is heavier, less efficient；If beyond the lower limit of the first range, tableThe task that the bright process undertakes is very little, the wasting of resources；Therefore, it is necessary to limit the third index of every generic task be located at the first range itIt is interior.
If the second index of any generic task is unsatisfactory for Second Rule or third index exceeds the upper limit of the first range,Carry out step S203；If the third index of any generic task exceeds the lower limit of the first range, step S204 is carried out.If appoint per classSecond index of business meets Second Rule and the third index per generic task is located within the scope of first, then completion of classifying canStep S205 is carried out, which can be for users to use.
Step S203：The degree of association between multiple tasks in the generic task, which is classified again.
By the step so that sorted the second index per generic task meets Second Rule and third index position againWithin the scope of first.
Classify again is for the generic task for being unsatisfactory for above-mentioned requirements.The generic task can be further divided at leastTwo classes.During classifying again, from the achievable different function angle of each task of the generic task or from suchThe attribute of each task of business sets out, and also classifies according to the degree of association between task.For example, it is that audio is appointed according to Multimedia TaskBusiness or video task, according to the degree of association between task, Multimedia Task 1 and Multimedia Task are further divided by Multimedia Task2。
Sorted the second index per generic task meets Second Rule again and third index is located within the scope of first,This, which classifies just to calculate again, completes, and therefore, then can return to step S202 after classifying and is judged.
It should be understood that above-mentioned classifying again is a dynamic process, it can constantly be repeated up to every one kindSecond index of task meets Second Rule and third index is located within the scope of first.
It should be understood that after classifying again, with the variation of classification quantity and the variation of the task quantity per generic task,Per the memory usage of generic task, CPU usage and rate is frequently interacted, the average memory usage, average CPU per generic task account forWith rate, average frequently interaction rate, the memory usage per generic task, CPU usage and frequently the sum of interaction rate can all becomeWhen changing, then making a decision, need to be judged using updated data.
Step S204：It is same generic task by the generic task and a kind of task merging of third index minimum.
By the step so that the second index of every generic task after merging meets Second Rule and third index is located atWithin the scope of first.
By the step, it can make in the task merging that some are not necessarily to individually classify to other generic tasks, so as to maximumThe utilization resource of change.With a kind of task merging of third index minimum, the merging can be mitigated to the maximum extent to original classificationIt influences.
Second index of every generic task after merging meets Second Rule and third index is located within the scope of first, shouldMerge just to calculate and complete, therefore, after merging can return to step S202 and judged.
It should be understood that above-mentioned merging is a dynamic process, it can constantly be repeated up to appointing for every one kindSecond index of business meets Second Rule and third index is located within the scope of first.
It should be understood that merge after, with classification quantity variation and per generic task task quantity variation, oftenThe memory usage of generic task, CPU usage and rate is frequently interacted, the average memory usage, average CPU per generic task occupyThe sum of rate, average frequently interaction rate, the memory usage per generic task, CPU usage and frequent interaction rate can all change,When making a decision again, need to be judged using updated data.
It should be understood that the above-mentioned process classified and merged again is not two completely isolated processes, sometimes, in order toIt meets the requirements, needs to classify and merge interaction progress again, the second index that could realize finally makes every generic task meets the second ruleThen and third index is located within the scope of first.
After classification is met the requirements, the corresponding task of the first application execution can be started.
Step S205：Start the first application, receive the instruction for performing at least one task.
After starting the first application, user may need one task of the application execution, it may be desired to which the application execution is at leastTherefore two tasks, by the step, can receive the corresponding instruction for performing task.
Step S206：Obtain the classification of at least one task.
By the step, the classification of each task is obtained, to determine to need to generate several processes.
Step S207：At least one process is generated according to the classification of at least one task.
Wherein, a generic task corresponds to a process.If an only generic task, a process is generated；If there isMulticlass task then needs to generate multiple processes.
Step S208：Corresponding at least one task is performed by least one process.
By the step, performed by the process of every generic task per generic task, multiple kinds are performed so as to avoid one processThe task of class so that response speed is slow, resource utilization is low.
During execution task, possible user may require that using new task is performed again, then can pass through following stepsSuddenly the new task is performed.
Step S209：Receive the instruction for the first task for performing the first application.
User's if desired one new first task of the first application execution can receive the first application of execution by the stepFirst task instruction.
Step S210：Judge first task classification whether be carrying out first application at least one task pointClass is identical.
Since same generic task is performed by a process.Therefore, the class of first task is can determine whether by this stepNot, so as to can determine it is to perform the task using existing process, it is desired nonetheless to which a newly-generated process performs the task.
If the classification of first task is identical with the classification of the second task of the first application being carrying out, step is carried outS211；If the classification of first task is differed with the classification of all tasks of the first application being carrying out, step is carried outS212。
Step S211：First task is performed by the second process of the second task.
The classification of first task is identical with the classification of the second task of the first application being carrying out, then without new in generationProcess, directly pass through the second process of the second task perform first task.
Step S212：Generate the first process.
If the classification of first task is differed with the classification of all tasks of the first application being carrying out, need to give birth toThe process of Cheng Xin performs the task.
Step S213：First task is performed by the first process.
After the first new process of generation, which is performed by the first process.If receive again execution with it is firstThe instruction for similar task of being engaged in then performs the task similar with first task by first process.
Preferably, although before the first application is started, according to theoretical value, the task of first application is carried outRational classification, but during possible actual practice, still there is certain deviation with theoretical value for various reasons, becauseThis, in order to avoid ready-made classification goes wrong, the method for the present embodiment can also change well in advance in actual practiceClassification.Specifically, this method further includes the steps：
The first step：During execution task, if the second index of any task is unsatisfactory for Second Rule or thirdIndex exceeds the upper limit of the first range, then the generic task is classified again, so that sorted the second finger per generic task againMark meets Second Rule and third index is located within the scope of first.
Second step：If the third index of any generic task exceeds the lower limit of the first range, which is referred to thirdThe minimum a kind of task merging of mark is same generic task, so that the second index of every generic task after merging meets Second Rule simultaneouslyAnd third index is located within the scope of first.
It reclassifies by above-mentioned, when the first application performs task again, is then generated by the classification after reclassifyingProcess performs corresponding task.
The detailed process of two above-mentioned steps is identical with the step S203 and S204 of preparation stage, repeats no more again.
To sum up, the task executing method of second embodiment of the invention, by advance to different task Rational Classification, so as toSame generic task is performed in application, process can be generated according to the classification of pending task starting first, for different classificationsTask performed respectively by different process, so as to be changed into multi-process mode from traditional one process mode so that weThe robustness of method is good, the fast response time of execution task, resource utilization height.
It should be noted that for embodiment of the method, in order to be briefly described, therefore it is all expressed as to a series of action groupIt closes, but those skilled in the art should know, the embodiment of the present invention is not limited by described sequence of movement, because according toAccording to the embodiment of the present invention, certain steps may be used other sequences or be carried out at the same time.Secondly, those skilled in the art also shouldKnow, embodiment described in this description belongs to preferred embodiment, and the involved action not necessarily present invention is implementedNecessary to example.
3rd embodiment
Third embodiment of the invention discloses a kind of task execution system.The system generally can be in computer, mobile terminalEtc. use in equipment.As shown in figure 3, the system specifically includes following module：
First receiving module 301, for receiving the instruction for the first task for performing the first application.
First judgment module 302, for judge first task classification whether be carrying out first application at leastThe classification of one task is identical.
First execution module 303, if classification and the second task of the first application for being carrying out for first taskClassify identical, then first task is performed by the second process of the second task.
First generation module 304, if classification and all tasks of the first application for being carrying out for first taskClassification differs, then generates the first process.
Second execution module 305 performs first task for passing through the first process.
To sum up, the task execution system of third embodiment of the invention, for different classifications task respectively by differentProcess performs, so as to be changed into multi-process mode from traditional one process mode so that the robustness of this system is good, performs taskFast response time, resource utilization it is high.
Fourth embodiment
Fourth embodiment of the invention discloses a kind of task execution system.The system generally can be in computer, mobile terminalEtc. use in equipment.As shown in figure 4, the system specifically includes following module：First receiving module 401, the first judgment module402nd, the first execution module 403, the first generation module 404 and the second execution module 405.In above-mentioned module and 3rd embodimentThe function of identical module is identical, and details are not described herein.
Preferably, which further includes：
Starting module 406, for before receiving the instruction for performing first task, starting the first application, receiving and perform at leastThe instruction of one task.
Acquisition module 407, for obtaining the classification of at least one task.
Second generation module 408, for generating at least one process according to the classification of at least one task.
Wherein, a generic task corresponds to a process.
Third execution module 409, for performing corresponding at least one task by least one process.
Preferably, which further includes：
First sort module 410, the step of for starting the first application, receiving the instruction for performing at least one task itBefore, according to the degree of association between the multiple tasks of the first application, task is divided at least two classes.
Wherein, the first index of the first application meets the first rule.
First index includes：Total memory usage, total CPU usage and the total frequently interaction rate of first application.
First rule is：Total memory usage of first application is no more than first threshold, total CPU usage of the first applicationIt is no more than third threshold value no more than second threshold and the first total frequent interactive rate applied.
Preferably, which further includes：
For the degree of association between the multiple tasks according to the first application, task is divided at least for second judgment module 411After the step of two classes, judge whether the second index per generic task meets Second Rule and the third index per generic task and beIt is no to be located within the scope of first.
Second sort module 412, if the second index for any generic task is unsatisfactory for Second Rule or third indexBeyond the upper limit of the first range, then the degree of association between the multiple tasks in the generic task, which is divided againClass, so that sorted the second index per generic task meets Second Rule again and third index is located within the scope of first.
First merging module 413, if the third index for any generic task exceeds the lower limit of the first range, by suchA kind of task merging of task and third index minimum is same generic task, so that the second index of every generic task after merging expiresSufficient Second Rule and third index are located within the scope of first.
Wherein, the second index includes：Per the memory usage of generic task, CPU usage and frequently interact rate.
Second Rule is：The average memory that memory usage per generic task is no more than every generic task of the first application usesRate, CPU usage are no more than the average CPU usage of every generic task of the first application and frequently interaction rate is no more than firstThe average frequently interaction rate of every generic task of application.
Third index is：The sum of memory usage, CPU usage and frequent interaction rate of every generic task of first application.
Preferably, which further includes：
Third sort module 414, for during execution task, if the second index of any task is unsatisfactory for secondRule or third index exceed the upper limit of the first range, then the generic task are classified again, so that sorted per class againSecond index of task meets Second Rule and third index is located within the scope of first.
Second merging module 415, if the third index for any generic task exceeds the lower limit of the first range, by suchA kind of task merging of task and third index minimum is same generic task, so that the second index of every generic task after merging expiresSufficient Second Rule and third index are located within the scope of first.
To sum up, the task execution system of 4th example of the invention, by advance to different task Rational Classification, so as toStart first and perform same generic task in application, process can be generated according to the classification of pending task, for different classificationsTask is performed respectively by different processes, so as to be changed into multi-process mode from traditional one process mode so that this systemRobustness it is good, to perform the fast response time of task, resource utilization high.
For device embodiment, since it is basicly similar to embodiment of the method, so description is fairly simple, it is relatedPart illustrates referring to the part of embodiment of the method.
Each embodiment in this specification is described by the way of progressive, the highlights of each of the examples are withThe difference of other embodiment, just to refer each other for identical similar part between each embodiment.
It should be understood by those skilled in the art that, the embodiment of the embodiment of the present invention can be provided as method, apparatus or calculateMachine program product.Therefore, the embodiment of the present invention can be used complete hardware embodiment, complete software embodiment or combine software andThe form of the embodiment of hardware aspect.Moreover, the embodiment of the present invention can be used one or more wherein include computer canWith in the computer-usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) of program codeThe form of the computer program product of implementation.
The embodiment of the present invention be with reference to according to the method for the embodiment of the present invention, terminal device (system) and computer programThe flowchart and/or the block diagram of product describes.It should be understood that flowchart and/or the block diagram can be realized by computer program instructionsIn each flow and/or block and flowchart and/or the block diagram in flow and/or box combination.These can be providedComputer program instructions are set to all-purpose computer, special purpose computer, Embedded Processor or other programmable data processing terminalsStandby processor is to generate a machine so that is held by the processor of computer or other programmable data processing terminal equipmentsCapable instruction generation is used to implement in one flow of flow chart or multiple flows and/or one box of block diagram or multiple boxesThe device for the function of specifying.
These computer program instructions, which may also be stored in, can guide computer or other programmable data processing terminal equipmentsIn the computer-readable memory to work in a specific way so that the instruction being stored in the computer-readable memory generates packetThe manufacture of command device is included, which realizes in one flow of flow chart or multiple flows and/or one side of block diagramThe function of being specified in frame or multiple boxes.
These computer program instructions can be also loaded into computer or other programmable data processing terminal equipments so thatSeries of operation steps are performed on computer or other programmable terminal equipments to generate computer implemented processing, thusThe instruction offer performed on computer or other programmable terminal equipments is used to implement in one flow of flow chart or multiple flowsAnd/or specified in one box of block diagram or multiple boxes function the step of.
Although the preferred embodiment of the embodiment of the present invention has been described, those skilled in the art once know baseThis creative concept can then make these embodiments other change and modification.So appended claims are intended to be construed toIncluding preferred embodiment and fall into all change and modification of range of embodiment of the invention.
Finally, it is to be noted that, herein, relational terms such as first and second and the like be used merely to byOne entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operationBetween there are any actual relationship or orders.Moreover, term " comprising ", "comprising" or its any other variant meaningCovering non-exclusive inclusion, so that process, method, article or terminal device including a series of elements are not only wrappedThose elements are included, but also including other elements that are not explicitly listed or are further included as this process, method, articleOr the element that terminal device is intrinsic.In the absence of more restrictions, it is wanted by what sentence "including a ..." limitedElement, it is not excluded that also there are other identical elements in the process including the element, method, article or terminal device.
Above to a kind of task executing method provided by the present invention and system, it is described in detail, it is used hereinSpecific case is expounded the principle of the present invention and embodiment, to understand the explanation of above example is only intended to helpingThe method and its core concept of the present invention；Meanwhile for those of ordinary skill in the art, thought according to the present invention is havingThere will be changes in body embodiment and application range, in conclusion the content of the present specification should not be construed as to the present inventionLimitation.