CN106406845A - A task processing method and device - Google Patents
A task processing method and device Download PDFInfo
- Publication number
- CN106406845A CN106406845A CN201510481590.9A CN201510481590A CN106406845A CN 106406845 A CN106406845 A CN 106406845A CN 201510481590 A CN201510481590 A CN 201510481590A CN 106406845 A CN106406845 A CN 106406845A
- Authority
- CN
- China
- Prior art keywords
- tasks
- task
- resource
- mark
- stored
- 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.)
- Pending
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a task processing method and device. The method comprises the steps of controlling a thread to extract a resource identifier from a preset resource identifier list, wherein the preset resource identifier list stores at least one resource identifier, each resource identifier is corresponding to a task set, each task set comprises at last one to-be-processed task, and all the to-be-processed tasks in each task set are not being processed; controlling the thread to acquire a preset number of to-be-processed tasks from the task set corresponding to the resource identifier; controlling the thread to process the preset number of to-be-processed tasks. According to the embodiments of the invention, a task set with all the included to-be-processed tasks not being processed can be acquired directly and rapidly via a preset resource identifier list, and a to-be-processed task can be acquired from the task set for processing; the whole processing process does not cost the time for traversing task sets, so that the method and the device can increase the processing efficiency.
Description
Technical field
The present invention relates to field of computer technology, more particularly, to a kind of task processing method and device.
Background technology
Resource is can be by things such as the request of thread process or computing units, and different resources can be according to respective feature
Classified.For example, simple digital operation expression formula is considered a kind of resource, and addition is a kind of resource, with
And subtraction is a kind of resource etc..
Wherein, every kind of resource all corresponds to a set of tasks, and set of tasks includes at least one waiting task.For example,
Addition resource corresponds to an addition set of tasks, and addition set of tasks includes task " 2+3 " and task " 4+5 ".Task
" 2+3 " be calculate 2 and 3 and, task " 4+5 " be calculating 4 and 5 and.
Wherein, when computer needs the task in the corresponding set of tasks to resource to process, need to control one
Individual thread obtains one of the corresponding set of tasks of resource task, then controls this thread that this task is processed.
Multiple different threads can not process the multiple tasks in the corresponding set of tasks of same resource simultaneously respectively, i.e. in office
In the meaning moment, in the corresponding set of tasks of any one resource, only one of which task can be processed.
Wherein, in order to process to waiting task, the corresponding task-set of all resources of one thread traverses of terminal control
Close, when traversing the corresponding set of tasks of resource, judge to whether there is by other threads in this set of tasks
Processing of task.If not existing by the task of other thread process in this set of tasks, from this set of tasks
Obtain a task to be processed.If existed in this set of tasks by the task of other thread process；Under then traveling through
The corresponding set of tasks of one resource, judges to whether there is by the task of other thread process in next task set,
Until find one inclusion task all not by the set of tasks of other thread process till.
However, it is found by the inventors that, in the prior art, the most of the time during controlling thread process task is spent
Take in traversal set of tasks, thus resulting in the need for taking a lot of time could having processed in all set of tasks of task,
Treatment effeciency is relatively low.
Content of the invention
For overcoming problem present in correlation technique, the present invention provides a kind of task processing method and device.
According to embodiments of the present invention in a first aspect, providing a kind of task processing method, methods described includes：
A thread is controlled to extract the mark of a resource from default resource identifier lists；Described default resource identification table
In store the mark of at least one resource, the mark of each described resource corresponds to a set of tasks, described set of tasks
Include at least one waiting task, all waiting tasks that described set of tasks includes all are not processed；
Described thread is controlled to obtain predetermined number waiting task from the corresponding set of tasks of the mark of described resource；
Control described thread that described predetermined number waiting task is processed.
Wherein, the described thread of described control obtains predetermined number task from the corresponding set of tasks of described resource identification,
Including：
Control described thread from the corresponding set of tasks of described resource identification, obtain storage time earliest predetermined number
Pending task.
Wherein, the described thread of described control, from the corresponding set of tasks of described resource identification, obtains storage time earliest
The pending task of predetermined number, including：
Locally stored described set of tasks is corresponding, right between task identification and storage time to control described thread to obtain
Should be related to；
Obtain local current time；
Described corresponding relation is searched with described current time apart from corresponding farthest of predetermined number storage time
Business mark；
The corresponding waiting task of the described task identification of each finding is obtained respectively from described set of tasks.
Further, methods described also includes：
When being disposed to described predetermined number waiting task；Described predetermined number is deleted from described set of tasks
Individual waiting task；
Judge to whether there is waiting task in described set of tasks；
When there is waiting task in described set of tasks, then the mark of described resource is stored in described resource identification row
In table；
When there is not waiting task in described set of tasks, delete the corresponding set of tasks of mark of described resource.
Further, methods described also includes：
Receive the mark storage request carrying task and goal resource to be stored；Described storage request is used for task to be stored
Store to the corresponding set of tasks of mark of target resource；
Judge locally to whether there is the corresponding set of tasks of mark of described target resource；
When the corresponding set of tasks of the mark that locally there is described target resource, described task to be stored is stored in target
In the corresponding set of tasks of resource identification；
When locally there is not the corresponding set of tasks of mark of described target resource, the mark creating described target resource is right
The set of tasks answered；Described task to be stored is stored in the set of tasks of described establishment；And by described target resource
Mark be stored in described default resource identifier lists.
Second aspect according to embodiments of the present invention, provides a kind of Task Processing Unit, and described device includes：
Extraction module, for controlling a thread to extract the mark of a resource from default resource identifier lists；Described
The mark of at least one resource is stored, the mark of each described resource corresponds to a set of tasks in default resource identification table,
Described set of tasks includes at least one waiting task, and all waiting tasks that described set of tasks includes are all not
It is processed；
Acquisition module, for controlling described thread to obtain predetermined number from the corresponding set of tasks of the mark of described resource
Waiting task；
Processing module, for controlling described thread that described predetermined number waiting task is processed.
Wherein, described acquisition module includes：
Acquiring unit, for controlling described thread from the corresponding set of tasks of described resource identification, obtains storage time
The pending task of early predetermined number.
Wherein, described acquiring unit includes：
First acquisition subelement, for controlling described thread to obtain, locally stored described set of tasks is corresponding, task mark
Know the corresponding relation and storage time between；
Second acquisition subelement, for obtaining local current time；
Search subelement, deposit apart from farthest predetermined number with described current time for searching in described corresponding relation
Storage time corresponding task identification；
3rd acquisition subelement, corresponds to for obtaining the described task identification of each finding from described set of tasks respectively
Waiting task.
Further, described device also includes：
First removing module, for when being disposed to described predetermined number waiting task；From described set of tasks
The described predetermined number waiting task of middle deletion；
First judge module, for judging to whether there is waiting task in described set of tasks；
First memory module, for when there is waiting task in described set of tasks, then depositing the mark of described resource
Storage is in described resource identifier lists；
Second removing module, for when there is not waiting task in described set of tasks, deleting the mark of described resource
Corresponding set of tasks.
Wherein, described device also includes：
Receiver module, for receiving the mark storage request carrying task and goal resource to be stored；Described storage request is used
In task to be stored being stored to the corresponding set of tasks of mark of target resource；
Second judge module, for judging locally to whether there is the corresponding set of tasks of mark of described target resource；
Second memory module, for when the corresponding set of tasks of the mark that locally there is described target resource, treating described
Store tasks are stored in the corresponding set of tasks of target resource identifier；
Creation module, for when locally there is not the corresponding set of tasks of mark of described target resource, creating described mesh
The corresponding set of tasks of mark of mark resource；Described task to be stored is stored in the set of tasks of described establishment；And
The mark of described target resource is stored in described default resource identifier lists.
The technical scheme that embodiments of the invention provide can include following beneficial effect：In the present invention, control a line
Journey extracts the mark of a resource from default resource identifier lists；At least one is stored in described default resource identification table
The mark of individual resource, the mark of each described resource corresponds to a set of tasks, and described set of tasks includes at least one
Waiting task；All waiting tasks that described set of tasks includes all are not processed；Control described thread from
Predetermined number waiting task is obtained in the corresponding set of tasks of described resource identification；Control described thread to described default
Individual several waiting task is processed.In inventive embodiments, traversal set of tasks need not be taken a significant amount of time, pass through
The waiting task that default resource identifier lists just can get directly and rapidly an inclusion is not all processed
Set of tasks, then from this set of tasks obtain a waiting task processed.Need not spend in whole processing procedure
In the time of traversal set of tasks, accordingly, with respect to prior art, the embodiment of the present invention can improve treatment effeciency to expense.
It should be appreciated that above general description and detailed description hereinafter are only exemplary and explanatory, can not
Limit the present invention.
Brief description
Accompanying drawing herein is merged in specification and constitutes the part of this specification, shows the enforcement meeting the present invention
Example, and be used for explaining the principle of the present invention together with specification.
Fig. 1 is a kind of flow chart of the task processing method according to an exemplary embodiment.
Fig. 2 is a kind of flow chart of the task processing method according to an exemplary embodiment.
Fig. 3 is a kind of block diagram of the Task Processing Unit according to an exemplary embodiment.
Specific embodiment
Here will in detail exemplary embodiment be illustrated, its example is illustrated in the accompanying drawings.Explained below is related to attached
During figure, unless otherwise indicated, the same numbers in different accompanying drawings represent same or analogous key element.Following exemplary is implemented
Embodiment described in example does not represent all embodiments consistent with the present invention.On the contrary, they be only with such as
The example of the consistent apparatus and method of some aspects being described in detail in appended claims, the present invention.
Fig. 1 is a kind of flow chart of the task processing method according to an exemplary embodiment, the holding of the embodiment of the present invention
Row main body can be terminal etc., as shown in figure 1, the method comprises the following steps.
In step S101, a thread is controlled to extract the mark of a resource from default resource identifier lists；
Wherein, this thread is idle thread, i.e. this thread is not process any task at present.
The mark of at least one resource is stored, the mark of each resource corresponds to a task-set in default resource identification table
Close, set of tasks includes at least one waiting task；All waiting tasks that described set of tasks includes are all not
It is processed；
In embodiments of the present invention, after terminal extracts the mark of a resource from default resource identifier lists, preset
The mark of this resource is will no longer be present in resource identifier lists.
In step s 102, control this thread to obtain predetermined number from the corresponding set of tasks of the mark of this resource to treat
Process task；
Control this thread to obtain the set of tasks corresponding with this resource identification, from this set of tasks, then obtain default
Several waiting tasks.
Predetermined number can be 1,2 or 3 etc., and the present invention is not limited to this.In embodiments of the present invention, preset
Number is preferably 1.So, terminal can control this thread to obtain 1 task from this set of tasks.
Wherein, in embodiments of the present invention, the task in each set of tasks is that terminal is added in advance.
Terminal can receive other equipment transmission carry task and goal resource to be stored mark storage request it is also possible to
The mark storage request carrying task and goal resource to be stored of receiving user's input；This storage is asked for will be to be stored
Task stores to the corresponding set of tasks of mark of target resource；
When terminal receives the mark storage request carrying task and goal resource to be stored, judge locally to whether there is mesh
The corresponding set of tasks of mark of mark resource；Wherein, the mark of local each set of tasks corresponding resource of difference existing
It is stored in default identification list, therefore can search whether the mark that there is target resource in default the Resources list,
If there is target resource in default identification list identifies the corresponding task of mark it is determined that locally there is target resource
Set.
When determining the corresponding set of tasks of the mark that locally there is target resource, task to be stored is stored in target money
Source identifies in corresponding set of tasks；
However, when determining the corresponding set of tasks of mark that locally there is not target resource, creating the mark of target resource
Know corresponding set of tasks；Task to be stored is stored in the set of tasks of establishment；Next, so that terminal afterwards
Control thread can get this task to be stored, need the mark of target resource is stored in default resource identifier lists.
Wherein, the storage time of each task that terminal stores in this set of tasks is different, and terminal can priority treatment be deposited
Storage time earliest task,
Therefore, in this step, thread can be controlled from the corresponding set of tasks of resource identification, obtain storage time earliest
The pending task of predetermined number, concrete acquisition process includes following flow process：
11) locally stored this set of tasks is corresponding, between task identification and storage time, to control this thread to obtain
Corresponding relation；
Wherein, all corresponding corresponding relation between task identification and storage time of any one set of tasks.This correspondence
The corresponding task of all task identifications that relation includes is stored in this set of tasks.Any bar in this corresponding relation
When storage time in record is that the corresponding task of the task identification in recording is stored in the storage in this set of tasks by this
Between.For other each set of tasks, same.
Wherein, each task has a task identification, for unique mark task.
When a task is stored in this set of tasks by terminal, the current time of terminal can be obtained, and conduct stores this
The storage moment of business, then using the task identification of this task and this storage time as a record storage in this set of tasks
In corresponding relation between all corresponding, task identification and storage time.Afterwards when terminal control has processed this task,
The record of the task identification including this task can be deleted from above-mentioned corresponding relation.
12), obtain local current time；
Obtain the current time of terminal local.
13), search with current time apart from the farthest corresponding task of predetermined number storage time in this corresponding relation
Mark；
Wherein it is possible to each record calculating in above-mentioned corresponding relation includes the difference between storage time and current time
Value, obtains the predetermined number storage time of the difference maximum and current time between, looks into respectively from above-mentioned corresponding relation
Look for the corresponding task identification of each storage time of acquisition.
14), obtain the corresponding waiting task of each task identification finding from set of tasks respectively.
So realize, from the corresponding set of tasks of resource identification, obtaining storage time earliest predetermined number pending
Task.
In step s 103, control this thread that this predetermined number waiting task is processed.
In embodiment shown in Fig. 1 of the present invention, a thread is controlled to extract a money from default resource identifier lists
The mark in source；The mark of at least one resource is stored, the mark of each described resource is right in described default resource identification table
Answer a set of tasks, described set of tasks includes at least one waiting task；The institute that described set of tasks includes
Task to be handled is not all processed；Described thread is controlled to obtain from the corresponding set of tasks of described resource identification in advance
If individual several waiting task；Control described thread that described predetermined number waiting task is processed.Real in invention
Apply in example, traversal set of tasks need not be taken a significant amount of time, just can be directly and fast by default resource identifier lists
Speed gets the set of tasks that the waiting task of an inclusion be not all processed, then obtains one from this set of tasks
Individual waiting task is processed.The time for traveling through set of tasks, therefore, phase need not be spent in whole processing procedure
For prior art, the embodiment of the present invention can improve treatment effeciency.
In still another embodiment of the process, referring to Fig. 2, the method also includes：
In step s 201, when being disposed to this predetermined number waiting task, delete from this set of tasks
This predetermined number waiting task；
In embodiments of the present invention, when having processed this waiting task, if not deleting from this treats from this set of tasks
Reason task, then after other threads of terminal control extract the mark of this resource from default resource identifier lists afterwards, will
This set of tasks is got according to the mark of this resource, is so likely to will get this again from this set of tasks
Business, and then thread will be controlled again this task to be processed.However, due to processing to this task, no
Again this task need to be processed, so will result in and repeat to process, waste system resource.
Therefore, waste system resource in order to avoid repeating to process this task, when to the process of predetermined number waiting task
When finishing, need to delete this predetermined number waiting task from set of tasks.
In step S202, judge to whether there is waiting task in this set of tasks；
When there is waiting task in this set of tasks, in step S203, then the mark of this resource is stored in money
In the identification list of source；
In embodiments of the present invention, if also there are one or more waiting tasks in this set of tasks, need afterwards
Waiting task in this set of tasks is proceeded process, accordingly, it would be desirable to the mark of resource is stored in resource again
In identification list, so, one thread of terminal control just can extract this resource from default resource identifier lists afterwards
Mark, and then this set of tasks can be obtained according to the mark of this resource, and to the waiting task in this set of tasks
Processed.
Otherwise, if the mark of resource is not stored in resource identifier lists again, one thread of terminal control exists afterwards
Look up the mark less than this resource in default resource identifier lists, also just this task cannot be obtained according to the mark of this resource
Set, and would not this waiting task in this set of tasks be processed.
When there is not waiting task in this set of tasks, in step S204, the mark deleting this resource is corresponding
Set of tasks.
Wherein, because the set of tasks not storing waiting task is also required to committed memory space, therefore, when this task-set
When there is not waiting task in conjunction, then can determine that this set of tasks has not had effective, therefore, deposit to save
Storage space, can delete the corresponding set of tasks of resource identification.
Fig. 3 is a kind of block diagram of the Task Processing Unit according to an exemplary embodiment.With reference to Fig. 3, this device bag
Include：
Extraction module 11, for controlling a thread to extract the mark of a resource from default resource identifier lists；Institute
State the mark storing at least one resource in default resource identification table, the mark of each described resource corresponds to a task-set
Close, described set of tasks includes at least one waiting task, all waiting tasks that described set of tasks includes
All it is not processed；
Acquisition module 12, for controlling described thread to obtain predetermined number from the corresponding set of tasks of the mark of described resource
Individual waiting task；
Processing module 13, for controlling described thread that described predetermined number waiting task is processed.
In embodiment shown in Fig. 3 of the present invention, a thread is controlled to extract a money from default resource identifier lists
The mark in source；The mark of at least one resource is stored, the mark of each described resource is right in described default resource identification table
Answer a set of tasks, described set of tasks includes at least one waiting task；The institute that described set of tasks includes
Task to be handled is not all processed；Described thread is controlled to obtain from the corresponding set of tasks of described resource identification in advance
If individual several waiting task；Control described thread that described predetermined number waiting task is processed.Real in invention
Apply in example, traversal set of tasks need not be taken a significant amount of time, just can be directly and fast by default resource identifier lists
Speed gets the set of tasks that the waiting task of an inclusion be not all processed, then obtains one from this set of tasks
Individual waiting task is processed.The time for traveling through set of tasks, therefore, phase need not be spent in whole processing procedure
For prior art, the embodiment of the present invention can improve treatment effeciency.
Wherein, described acquisition module 12 includes：
Acquiring unit, for controlling described thread from the corresponding set of tasks of described resource identification, obtains storage time
The pending task of early predetermined number.
Wherein, described acquiring unit includes：
First acquisition subelement, for controlling described thread to obtain, locally stored described set of tasks is corresponding, task mark
Know the corresponding relation and storage time between；
Second acquisition subelement, for obtaining local current time；
Search subelement, deposit apart from farthest predetermined number with described current time for searching in described corresponding relation
Storage time corresponding task identification；
3rd acquisition subelement, corresponds to for obtaining the described task identification of each finding from described set of tasks respectively
Waiting task.
Further, described device also includes：
First removing module, for when being disposed to described predetermined number waiting task；From described set of tasks
The described predetermined number waiting task of middle deletion；
First judge module, for judging to whether there is waiting task in described set of tasks；
First memory module, for when there is waiting task in described set of tasks, then depositing the mark of described resource
Storage is in described resource identifier lists；
Second removing module, for when there is not waiting task in described set of tasks, deleting the mark of described resource
Corresponding set of tasks.
Further, described device also includes：
Receiver module, for receiving the mark storage request carrying task and goal resource to be stored；Described storage request is used
In task to be stored being stored to the corresponding set of tasks of mark of target resource；
Second judge module, for judging locally to whether there is the corresponding set of tasks of mark of described target resource；
Second memory module, for when the corresponding set of tasks of the mark that locally there is described target resource, treating described
Store tasks are stored in the corresponding set of tasks of target resource identifier；
Creation module, for when locally there is not the corresponding set of tasks of mark of described target resource, creating described mesh
The corresponding set of tasks of mark of mark resource；Described task to be stored is stored in the set of tasks of described establishment；And
The mark of described target resource is stored in described default resource identifier lists.
With regard to the device in above-described embodiment, wherein the concrete mode of modules execution operation is in relevant the method
It has been described in detail in embodiment, explanation will be not set forth in detail herein.
Those skilled in the art, after considering specification and putting into practice invention disclosed herein, will readily occur to other of the present invention
Embodiment.The application is intended to any modification, purposes or the adaptations of the present invention, these modifications, purposes
Or adaptations follow the present invention general principle and include the present invention undocumented in the art known often
Know or conventional techniques.Description and embodiments be considered only as exemplary, true scope and spirit of the invention by under
The claim in face is pointed out.
It is described above and precision architecture illustrated in the accompanying drawings it should be appreciated that the invention is not limited in, and
Various modifications and changes can carried out without departing from the scope.The scope of the present invention only to be limited by appended claim.
Claims (10)
1. a kind of task processing method is it is characterised in that methods described includes：
A thread is controlled to extract the mark of a resource from default resource identifier lists；Described default resource identification table
In store the mark of at least one resource, the mark of each described resource corresponds to a set of tasks, described set of tasks
Include at least one waiting task, all waiting tasks that described set of tasks includes all are not processed；
Described thread is controlled to obtain predetermined number waiting task from the corresponding set of tasks of the mark of described resource；
Control described thread that described predetermined number waiting task is processed.
2. method according to claim 1 is it is characterised in that the described thread of described control is from described resource identification pair
Predetermined number task is obtained in the set of tasks answered, including：
Control described thread from the corresponding set of tasks of described resource identification, obtain storage time earliest predetermined number
Pending task.
3. method according to claim 2 is it is characterised in that the described thread of described control is from described resource identification pair
In the set of tasks answered, obtain the pending task of storage time earliest predetermined number, including：
Locally stored described set of tasks is corresponding, right between task identification and storage time to control described thread to obtain
Should be related to；
Obtain local current time；
Described corresponding relation is searched with described current time apart from the farthest corresponding task of predetermined number storage time
Mark；
The corresponding waiting task of the described task identification of each finding is obtained respectively from described set of tasks.
4. method according to claim 1 is it is characterised in that methods described also includes：
When being disposed to described predetermined number waiting task；Described predetermined number is deleted from described set of tasks
Individual waiting task；
Judge to whether there is waiting task in described set of tasks；
When there is waiting task in described set of tasks, then the mark of described resource is stored in described resource identification row
In table；
When there is not waiting task in described set of tasks, delete the corresponding set of tasks of mark of described resource.
5. method according to claim 4 is it is characterised in that methods described also includes：
Receive the mark storage request carrying task and goal resource to be stored；Described storage request is used for task to be stored
Store to the corresponding set of tasks of mark of target resource；
Judge locally to whether there is the corresponding set of tasks of mark of described target resource；
When the corresponding set of tasks of the mark that locally there is described target resource, described task to be stored is stored in target
In the corresponding set of tasks of resource identification；
When locally there is not the corresponding set of tasks of mark of described target resource, the mark creating described target resource is right
The set of tasks answered；Described task to be stored is stored in the set of tasks of described establishment；And by described target resource
Mark be stored in described default resource identifier lists.
6. a kind of Task Processing Unit is it is characterised in that described device includes：
Extraction module, for controlling a thread to extract the mark of a resource from default resource identifier lists；Described
The mark of at least one resource is stored, the mark of each described resource corresponds to a set of tasks in default resource identification table,
Described set of tasks includes at least one waiting task, and all waiting tasks that described set of tasks includes are all not
It is processed；
Acquisition module, for controlling described thread to obtain predetermined number from the corresponding set of tasks of the mark of described resource
Waiting task；
Processing module, for controlling described thread that described predetermined number waiting task is processed.
7. device according to claim 6 is it is characterised in that described acquisition module includes：
Acquiring unit, for controlling described thread from the corresponding set of tasks of described resource identification, obtains storage time
The pending task of early predetermined number.
8. device according to claim 7 is it is characterised in that described acquiring unit includes：
First acquisition subelement, for controlling described thread to obtain, locally stored described set of tasks is corresponding, task mark
Know the corresponding relation and storage time between；
Second acquisition subelement, for obtaining local current time；
Search subelement, deposit apart from farthest predetermined number with described current time for searching in described corresponding relation
Storage time corresponding task identification；
3rd acquisition subelement, corresponds to for obtaining the described task identification of each finding from described set of tasks respectively
Waiting task.
9. device according to claim 6 is it is characterised in that described device also includes：
First removing module, for when being disposed to described predetermined number waiting task；From described set of tasks
The described predetermined number waiting task of middle deletion；
First judge module, for judging to whether there is waiting task in described set of tasks；
First memory module, for when there is waiting task in described set of tasks, then depositing the mark of described resource
Storage is in described resource identifier lists；
Second removing module, for when there is not waiting task in described set of tasks, deleting the mark of described resource
Corresponding set of tasks.
10. device according to claim 9 is it is characterised in that described device also includes：
Receiver module, for receiving the mark storage request carrying task and goal resource to be stored；Described storage request is used
In task to be stored being stored to the corresponding set of tasks of mark of target resource；
Second judge module, for judging locally to whether there is the corresponding set of tasks of mark of described target resource；
Second memory module, for when the corresponding set of tasks of the mark that locally there is described target resource, treating described
Store tasks are stored in the corresponding set of tasks of target resource identifier；
Creation module, for when locally there is not the corresponding set of tasks of mark of described target resource, creating described mesh
The corresponding set of tasks of mark of mark resource；Described task to be stored is stored in the set of tasks of described establishment；And
The mark of described target resource is stored in described default resource identifier lists.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510481590.9A CN106406845A (en) | 2015-08-03 | 2015-08-03 | A task processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510481590.9A CN106406845A (en) | 2015-08-03 | 2015-08-03 | A task processing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106406845A true CN106406845A (en) | 2017-02-15 |
Family
ID=58008352
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510481590.9A Pending CN106406845A (en) | 2015-08-03 | 2015-08-03 | A task processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106406845A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106789361A (en) * | 2017-02-16 | 2017-05-31 | 郑州云海信息技术有限公司 | Event-handling method and device under a kind of cloud computing environment |
| CN107222555A (en) * | 2017-06-27 | 2017-09-29 | 聚好看科技股份有限公司 | Message treatment method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101299677A (en) * | 2008-04-30 | 2008-11-05 | 中兴通讯股份有限公司 | Method for sharing unity service course by multiple courses |
| CN102122252A (en) * | 2011-03-14 | 2011-07-13 | 华中科技大学 | Method for designing thread pool capable of ensuring temporal succession |
| US20140019982A1 (en) * | 2012-07-13 | 2014-01-16 | Rekesh John | Core-affine processing on symmetric multiprocessing systems |
| CN103810072A (en) * | 2012-11-09 | 2014-05-21 | 上海飞田通信技术有限公司 | Device and method for guaranteeing order execution of multithread tasks |
| CN104238999A (en) * | 2013-06-09 | 2014-12-24 | 阿里巴巴集团控股有限公司 | Task scheduling method and device based on horizontal partitioning type distributed database |
-
2015
- 2015-08-03 CN CN201510481590.9A patent/CN106406845A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101299677A (en) * | 2008-04-30 | 2008-11-05 | 中兴通讯股份有限公司 | Method for sharing unity service course by multiple courses |
| CN102122252A (en) * | 2011-03-14 | 2011-07-13 | 华中科技大学 | Method for designing thread pool capable of ensuring temporal succession |
| US20140019982A1 (en) * | 2012-07-13 | 2014-01-16 | Rekesh John | Core-affine processing on symmetric multiprocessing systems |
| CN103810072A (en) * | 2012-11-09 | 2014-05-21 | 上海飞田通信技术有限公司 | Device and method for guaranteeing order execution of multithread tasks |
| CN104238999A (en) * | 2013-06-09 | 2014-12-24 | 阿里巴巴集团控股有限公司 | Task scheduling method and device based on horizontal partitioning type distributed database |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106789361A (en) * | 2017-02-16 | 2017-05-31 | 郑州云海信息技术有限公司 | Event-handling method and device under a kind of cloud computing environment |
| CN107222555A (en) * | 2017-06-27 | 2017-09-29 | 聚好看科技股份有限公司 | Message treatment method and device |
| CN107222555B (en) * | 2017-06-27 | 2020-08-25 | 聚好看科技股份有限公司 | Message processing method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102483731B (en) | Have according to search load by the medium of the fingerprint database of equilibrium | |
| US11914565B1 (en) | System and method for identifying matching portions of two sets of data in a multiprocessor system | |
| CN106126326A (en) | Timing task management method and apparatus | |
| CN106227751A (en) | A kind of scan method storing file and scanning device | |
| CN106168963B (en) | Real-time streaming data processing method and device and server | |
| CN104182519B (en) | A kind of file scanning method and device | |
| CN106055704A (en) | Image retrieving and matching method and system | |
| CN106815258A (en) | A kind of date storage method and coordinator node | |
| US10417042B2 (en) | Data persistence method and system thereof in stream computing | |
| CN111726249A (en) | Configuration file processing method and device of network equipment | |
| EP2778921A2 (en) | A method and a system for distributed processing of a datasheet | |
| CN106406845A (en) | A task processing method and device | |
| CN112529711A (en) | Transaction processing method and device based on block chain virtual machine multiplexing | |
| CN112231524B (en) | Data fusion method and device, storage medium and electronic equipment | |
| CN107784588A (en) | Insurance user information merging method and device | |
| EP4404052A3 (en) | Finite state machines for implementing workflows for data objects managed by a data processing system | |
| CN105897841A (en) | Scheduling method, device and system for network resource processing and sub scheduler | |
| CN106775437A (en) | Method of data synchronization and device | |
| CN109165305B (en) | Characteristic value storage and retrieval method and device | |
| CN110162666A (en) | A kind of the execution method and executive device of retrieval tasks | |
| CN106888195A (en) | Verification method and device | |
| CN107239328A (en) | Method for allocating tasks and device | |
| CN113742426B (en) | Data synchronization method, device, equipment, server and storage medium | |
| CN106469166A (en) | A kind of information processing method and device | |
| CN110543887A (en) | Target analysis method and device, electronic equipment and readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170215 |