CN101963922A - Task processing method and device - Google Patents
Task processing method and device Download PDFInfo
- Publication number
- CN101963922A CN101963922A CN 201010299851 CN201010299851A CN101963922A CN 101963922 A CN101963922 A CN 101963922A CN 201010299851 CN201010299851 CN 201010299851 CN 201010299851 A CN201010299851 A CN 201010299851A CN 101963922 A CN101963922 A CN 101963922A
- Authority
- CN
- China
- Prior art keywords
- task
- exclusive
- correspondence
- tasks
- formation
- 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
Images
Abstract
The invention provides a task processing method and device. The method comprises the following steps: step102, the input tasks are received; step 104, whether the tasks have synchronous attributes is judged, if so, the step 106 is performed; if not, the step 110 is performed; step 106, according to the synchronous attributes of the tasks, the exclusion tasks corresponding to the tasks are searched in the currently executed task; step 108, if the exclusion tasks corresponding to the tasks exist in the currently executed task, the tasks are not executed until the exclusion tasks do not exist in the currently executed task; and step 110, the tasks are executed. The invention also provides a task processing device. According to the technical scheme of the invention, synchronous queuing is performed on the tasks in constraint relations, thus avoiding the competition between the tasks; then the execution hysteresis of the tasks in the queue is adjusted by means of the priority; and the wait queue and the set task number are utilized to execute the maximum number of tasks, thus the load capacity can be controlled and the good system scalability can be obtained.
Description
Technical field
The present invention relates to the task treatment technology, relate in particular to task processing method and device.
Background technology
In business management software, there is a large amount of asynchronous task, such as sending various notices (message, note, Email etc.), carry out some auto-action (calling service etc. automatically).Along with the increase of user's pressure, can produce these a large amount of tasks at short notice.Existing solution generally is divided into two kinds: a kind of is that these tasks are entered a first-in first-out (FIFO) formation, carries out in order one by one then; Another then is by a thread pool, multithreading tasks in parallel is carried out.The former advantage is can be owing to task does not too much take a large amount of system resource, and shortcoming is to have wasted computing machine parallel processing capability, inefficiency.The latter's advantage be as much as possible maximum using the computation capability of system, but shortcoming also clearly, on the one hand owing to carrying out simultaneously of task may exist constraint or competitive relation, needing to cause thread synchronization, (thread switches just to have brought extra system overhead, lock competition etc.), under the many situations of constraint and competitive relation between the task, can cause system effectiveness low on the contrary, on the other hand because most of thread pool can't provide good retractility (load is controlled), cause under the heavy load situation excessively the taking of system resource, influenced user experience greatly.
Therefore, need a kind of task processing mode, can maximally utilise the parallel ability of computing machine, and avoid because the thread synchronization that the constraint between the task brings, expend the problem of system resource.
Summary of the invention
In view of more than, technical scheme of the present invention technical matters to be solved is, a kind of task processing method and device are provided, and can maximally utilise the parallel ability of computing machine, and avoid because the thread synchronization brought of constraint between the task, expend the problem of system resource.
The invention provides a kind of task processing method, comprising: step 102 receives importing of task; Step 104 judges whether described task has synchronization properties, when described task has synchronization properties, enters step 106, when described task does not have synchronization properties, enters step 110; Described step 106 according to the synchronization properties of described task, is searched the exclusive task of described task correspondence in current executing the task; Step 108 when having the exclusive task of described task correspondence in current executing the task, is not carried out described task, does not have the exclusive task of described task correspondence in described current executing the task, and described step 110 is carried out described task.By this technical scheme, cause contention owing to vie each other in the time of can avoiding executing the task simultaneously to system resource, guaranteed the order and the efficient of executing the task, rationally utilize the system for computer resource.
In technique scheme, preferably, in the described step 108, when in current executing the task, having the exclusive task of described task correspondence, according to the synchronization properties of described task, with of the exclusive formation of described Task Distribution, when in described current executing the task, not having the exclusive task of described task correspondence to correspondence, in the exclusive formation of described task correspondence, take out described task, with pending.
In technique scheme, preferably, all tasks in the exclusive formation all have priority, when taking out task from described exclusive formation, take out the highest task of priority earlier.By this technical scheme, regulate the order that the task that guaranteed is carried out by priority.
In technique scheme, preferably, in described step 110, the thread execution that described task provides by thread pool.
In technique scheme, preferably, in described step 110, described current executing the task during all threads that take described thread pool, make described task enter waiting status, in described thread pool, have vacant thread, use the described task of described vacant thread execution.By this technical scheme, the retractility of control system well.
In technique scheme, preferably, all tasks that are in described waiting status all have priority, when a vacant thread only occurring in described thread pool, a described vacant thread are used for the highest task of execution priority.By this technical scheme, make that the task in the waiting list also has priority.
In technique scheme, preferably, in the described step 108, described task has a plurality of synchronization properties, and a plurality of exclusive task that in current executing the task, has the different synchronization properties of corresponding task, according to the degree of priority of described different synchronization properties, with of the exclusive formation of described Task Distribution to the highest synchronization properties correspondence of degree of priority, exclusive formation comprises: overall exclusive formation, and the task in the exclusive formation of the described overall situation can only be carried out separately; The exclusive formation of classification, the task in the exclusive formation of described classification can not be carried out simultaneously with the task of the exclusive formation corresponding types of described classification.
Pass through technique scheme, the task that will have restriction relation by the realization isochronous queue is lined up synchronously, avoided the competition between the task, utilize priority to regulate task executions hysteresis quality in the formation then, simultaneously by waiting list with the maximum number that number of tasks can be executed the task simultaneously is set, make load capacity controlled, have good system's retractility.
The present invention also provides a kind of Task Processing Unit, comprise: scheduler module, whether the task of judging input has synchronization properties, when described task has synchronization properties, described task is committed to synchronization control module, when described task does not have synchronization properties, described task is committed to task execution module; Described synchronization control module, synchronization properties according to described task, in current executing the task, search the exclusive task of described task correspondence, and when in described current executing the task, not having the exclusive task of described task correspondence, described task is committed to described task execution module by described scheduler module; Described task execution module is carried out described task.By this technical scheme, cause contention owing to vie each other in the time of can avoiding executing the task simultaneously to system resource, guaranteed the order and the efficient of executing the task, rationally utilize the system for computer resource.
In technique scheme, preferably, also comprise: the isochronous queue module, exclusive formation is provided, when there is the exclusive task of described task correspondence in described synchronization control module in current executing the task, synchronization properties according to described task, by the exclusive formation that described Task Distribution is extremely corresponding of described isochronous queue module, when in described current executing the task, not having the exclusive task of described task correspondence, in the exclusive formation of described task correspondence, take out described task by described isochronous queue module, by described scheduler module described task is committed to described task execution module, with pending.
In technique scheme, preferably, described isochronous queue module is also formulated dissimilar exclusive formations for the user.By this technical scheme, make task handling more flexible.
Pass through technique scheme, the task that will have restriction relation by the realization isochronous queue is lined up synchronously, avoided the competition between the task, utilize priority to regulate task executions hysteresis quality in the formation then, simultaneously by waiting list with the maximum number that number of tasks can be executed the task simultaneously is set, make load capacity controlled, have good system's retractility.
Description of drawings
Fig. 1 is the process flow diagram of task processing method according to an embodiment of the invention;
Fig. 2 is the block diagram of Task Processing Unit according to an embodiment of the invention;
Fig. 3 is the high-level schematic functional block diagram of Task Processing Unit according to an embodiment of the invention;
Fig. 4 is the operation synoptic diagram of the task execution module of Task Processing Unit according to an embodiment of the invention with the work of state machine mode; And
Fig. 5 is the process flow diagram of task processing method according to an embodiment of the invention.
Embodiment
In order more to be expressly understood above-mentioned purpose of the present invention, feature and advantage, the present invention is further described in detail below in conjunction with the drawings and specific embodiments.
Set forth a lot of details in the following description so that fully understand the present invention, still, the present invention can also adopt other to be different from other modes described here and implement, and therefore, the present invention is not limited to the restriction of following public specific embodiment.
Fig. 1 is the process flow diagram of task processing method according to an embodiment of the invention.
As shown in Figure 1, task processing method comprises according to an embodiment of the invention: step 102 receives importing of task; Step 104 judges whether described task has synchronization properties, when described task has synchronization properties, enters step 106, when described task does not have synchronization properties, enters step 110; Described step 106 according to the synchronization properties of described task, is searched the exclusive task of described task correspondence in current executing the task; Step 108 when having the exclusive task of described task correspondence in current executing the task, is not carried out described task, does not have the exclusive task of described task correspondence in described current executing the task, and described step 110 is carried out described task.By such technical scheme, cause contention owing to vie each other in the time of can avoiding executing the task simultaneously to system resource, guaranteed the order and the efficient of executing the task, rationally utilize the system for computer resource.
In technique scheme, in the described step 108, when in current executing the task, having the exclusive task of described task correspondence, synchronization properties according to described task, with of the exclusive formation of described Task Distribution to correspondence, when in described current executing the task, not having the exclusive task of described task correspondence, in the exclusive formation of described task correspondence, take out described task, with pending.
In technique scheme, all tasks in the exclusive formation all have priority, when taking out task from described exclusive formation, take out the highest task of priority earlier.Like this, regulate the order that the task that guaranteed is carried out by priority.
In technique scheme, in described step 110, the thread execution that described task provides by thread pool.
In technique scheme, in described step 110, described current executing the task during all threads that take described thread pool makes described task enter waiting status, has vacant thread in described thread pool, uses the described task of described vacant thread execution.Therefore, the retractility of control system well.
In technique scheme, all tasks that are in described waiting status all have priority, when a vacant thread only occurring in described thread pool, a described vacant thread are used for the highest task of execution priority.By this technical scheme, make that the task in the waiting list also has priority.
In technique scheme, in the described step 108, described task has a plurality of synchronization properties, and a plurality of exclusive task that in current executing the task, has the different synchronization properties of corresponding task, degree of priority according to described different synchronization properties, with the exclusive formation of described Task Distribution to the highest synchronization properties correspondence of degree of priority, exclusive formation comprises: overall exclusive formation, and the task in the exclusive formation of the described overall situation can only be carried out separately; The exclusive formation of classification, the task in the exclusive formation of described classification can not be carried out simultaneously with the task of the exclusive formation corresponding types of described classification.
Pass through technique scheme, the task that will have restriction relation by the realization isochronous queue is lined up synchronously, avoided the competition between the task, utilize priority to regulate task executions hysteresis quality in the formation then, simultaneously by waiting list with the maximum number that number of tasks can be executed the task simultaneously is set, make load capacity controlled, have good system's retractility.
Fig. 2 is the block diagram of Task Processing Unit according to an embodiment of the invention.
As shown in Figure 2, Task Processing Unit 200 comprises according to an embodiment of the invention: scheduler module 202, whether the task of judging input has synchronization properties, when described task has synchronization properties, described task is committed to synchronization control module, when described task does not have synchronization properties, described task is committed to task execution module; Described synchronization control module 204, synchronization properties according to described task, in current executing the task, search the exclusive task of described task correspondence, and when in described current executing the task, not having the exclusive task of described task correspondence, described task is committed to described task execution module by described scheduler module; Described task execution module 206 is carried out described task.By such technical scheme, cause contention owing to vie each other in the time of can avoiding executing the task simultaneously to system resource, guaranteed the order and the efficient of executing the task, rationally utilize the system for computer resource.
In technique scheme, can also comprise: the isochronous queue module, exclusive formation is provided, when there is the exclusive task of described task correspondence in described synchronization control module in current executing the task, synchronization properties according to described task, by the exclusive formation that described Task Distribution is extremely corresponding of described isochronous queue module, when in described current executing the task, not having the exclusive task of described task correspondence, in the exclusive formation of described task correspondence, take out described task by described isochronous queue module, by described scheduler module described task is committed to described task execution module, with pending.
In technique scheme, described isochronous queue module is also formulated dissimilar exclusive formations for the user.Therefore, make task handling more flexible.
Pass through technique scheme, the task that will have restriction relation by the realization isochronous queue is lined up synchronously, avoided the competition between the task, utilize priority to regulate task executions hysteresis quality in the formation then, simultaneously by waiting list with the maximum number that number of tasks can be executed the task simultaneously is set, make load capacity controlled, have good system's retractility.
Fig. 3 is the high-level schematic functional block diagram of Task Processing Unit according to an embodiment of the invention.
As shown in Figure 3, dispatching control module 302 (being equivalent to the scheduler module 202 among Fig. 2 embodiment): as central control module, by the synchronous and execution of coordinate synchronization control module 304 and task execution module 306 control tasks.
Synchronization control module 304: be responsible for the synchro control (going out to join the team) of synchronous task, and provide and to execute the task according to synchronous regime.
Task execution module 306: be responsible for the concrete execution of task with the pattern of state machine.State machine is divided into three kinds of states as shown in Figure 4: idle (Idle), can move (Running), fully loaded (Overflow).
Isochronous queue module 308: the specific implementation of synchronization policy, multiple synchronization policy can be provided, synchronously classification is synchronous etc. as exclusive, and the mode by formation realizes various synchronous behaviors.
Waiting list module 312: for executable task provides the retractility support.
Priority control module 310: be responsible for isochronous queue and waiting list provides priority control in the mode of Priority Queues.
Wherein, Fig. 4 is the operation synoptic diagram of the task execution module of Task Processing Unit according to an embodiment of the invention with the work of state machine mode.The Idle state shows that promptly task execution module 306 no any tasks are in execution, when distributing, task is converted into the Running state, the Running state promptly shows has task in task execution module 306 operations, but also have vacant thread to use, when having reached maximum number Running state, moving of task promptly is converted into the Overflow state, be under Idle or the Running state, task execution module 306 will be carried out after receiving distributing of task immediately, be under the Overflow state, with the task waiting list module 312 retractility of control system (so can well) of joining the team, after the task of current certain execution is finished, state will be converted into the Running state again again, going out group task then from waiting list carries out, equally, when task is all finished, state will be converted into the Idle state again, and execution moves in circles; Task executions is on the operating system thread pool, so task executions and whole scheduling process be asynchronous, can not block scheduling thread, simultaneously the maximum number that can execute the task by task execution module 306 dynamic appointing systems of user.
Fig. 5 is the process flow diagram of task processing method according to an embodiment of the invention.
As shown in Figure 5, in step 502, input needs the task of processing.
In step 504, obtain a collection of task in the mode in the time interval by interface or data query source, whether task is carried out synchro control according to the determined property of task, be then to enter step 506, otherwise enter step 518.
In step 506, task is carried out synchro control.
In step 508, according to the determined property of task whether be exclusive synchronously, be then to enter step 510, otherwise enter step 512.
In step 510, task is entered overall exclusive formation.
In step 512, judge that whether task is that classification is synchronous, is then to enter step 514, otherwise enters step 516.
In step 514, task is entered the classification isochronous queue.
In step 516, task is carried out other synchronous processing.
In step 518, task is sent with charge free and carried out.
In step 520, judge whether task is in executable state, is then to enter step 522, otherwise enter step 524.
In step 522, task is entered waiting list.
In step 524,, carry out this task according to operational scheme shown in Figure 4.
Here, need to prove, when will the task of joining the team carrying out synchro control, use the formation of different synchronization policies to come the synchronous wait of control task.Isochronous queue comprises: overall exclusive formation, referring to this generic task can only carry out separately on a computing machine at one time, do not allow other tasks to carry out simultaneously, entry condition has overall exclusive task for needing only in current carrying out of the task, and other tasks just must enter this formation and wait for synchronously; The exclusive formation of classification refers to according to user-defined certain classification, carries out in current system as long as belong to the task of this classification, and the formation that so just must enter this classification is waited for synchronously.Other isochronous queues refer to because the present invention has extendability, and the user can define the formation with other synchronization policies.
Following rule is all followed in the realization of any isochronous queue:
1. formation is divided into two states: synchronous regime a) ready state b);
2. be under the ready state, the operation of can joining the team also can go out team's operation, is converted into synchronous regime if go out group operation queue state;
3. be under the synchronous regime, can join the team, but can not go out team, if receive synchronous control signal, quene state is converted to ready state;
By as above rule, from abstract viewpoint definition synchronous semanteme, go specific implementation and specifically need leave each task for each formation synchronously with which or any generic task.Be in the ready state isochronous queue by traversal, it is gone out team's operation, the task queue that obtains is the tabulation of can executing the task.
It should be noted that and mixing under the synchronous mode, when promptly this task may need to carry out synchro control by a plurality of isochronous queues, may lose preferential on a part of sequential, cause task to be carried out and lag behind.Be introduced into overall exclusive formation as certain task A, and then certain task B directly enters the classification isochronous queue after one minute, suppose that on the priority level of task A and the B body of attending to the basic or the fundamental in office be consistent, task A will be in advance in task B on sequential so now, according to the sequential principle of priority, task A should have precedence over task B, overall then exclusive formation is received synchronization notice and is discharged task A, task A then enters classification isochronous queue (the task B of being later than enters the time of this formation), at this moment lead over task B for the execution sequence of support mission A, just will control the priority level of raising task A by priority.Same, the task in the waiting list having passed through synchro control after, also lost on the sequential preferentially, be similarly head it off, waiting list also needs to regulate priority.
In addition, after a task executes, the thread at this task place will adjust back and notify the end of this task synchronous, after having notice, find the isochronous queue of this task correspondence, notify this formation to finish synchronously then by the attribute of this task, cause the isochronous queue state to change, then retrieve the formation that is in ready state again and return the tabulation of to execute the task, again these tasks are carried out task and carry out, repeat manner of execution shown in Figure 4.
By technique scheme, can realize a kind of task processing method and device, it has following advantage:
1. will there be the task of restriction relation to rank, it is carried out in order, cause contention owing to vie each other when having avoided carrying out simultaneously, both reach synchronous purpose, improve system effectiveness simultaneously again system resource.
2. extendible blendable multistage isochronous queue implementation method can be supported multiple isochronous queue and mix use, regulates the order problem that the task that guaranteed is carried out by priority simultaneously.
3. utilize maximum number of tasks and waiting list are set, come the retractility of control system, make load capacity controlled, more reasonable use system for computer resource by the mode of queuing.
4. the task executing method based on the state machine pattern is proposed, with respect to traditional pass through a poll cross-thread every obtain task from formation because it does not need the poll thread, its reliability and efficient all significantly improve.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a task processing method is characterized in that, comprising:
Step 102 receives importing of task;
Step 104 judges whether described task has synchronization properties, when described task has synchronization properties, enters step 106, when described task does not have synchronization properties, enters step 110;
Described step 106 according to the synchronization properties of described task, is searched the exclusive task of described task correspondence in current executing the task;
Step 108 when having the exclusive task of described task correspondence in current executing the task, is not carried out described task, does not have the exclusive task of described task correspondence in described current executing the task,
Described step 110 is carried out described task.
2. task processing method according to claim 1, it is characterized in that, in the described step 108, when in current executing the task, having the exclusive task of described task correspondence, according to the synchronization properties of described task, with of the exclusive formation of described Task Distribution, when in described current executing the task, not having the exclusive task of described task correspondence to correspondence, in the exclusive formation of described task correspondence, take out described task, with pending.
3. task processing method according to claim 2 is characterized in that, all tasks in the exclusive formation all have priority, when taking out task from described exclusive formation, takes out the highest task of priority earlier.
4. task processing method according to claim 2 is characterized in that, in described step 110, and the thread execution that described task provides by thread pool.
5. task processing method according to claim 4, it is characterized in that, in described step 110, described current executing the task during all threads that take described thread pool, make described task enter waiting status, in described thread pool, there is vacant thread, uses the described task of described vacant thread execution.
6. task processing method according to claim 5, it is characterized in that, all tasks that are in described waiting status all have priority, when a vacant thread only occurring in described thread pool, a described vacant thread are used for the highest task of execution priority.
7. according to each described task processing method in the claim 2 to 6, it is characterized in that, in the described step 108, described task has a plurality of synchronization properties, and a plurality of exclusive task that in current executing the task, has the different synchronization properties of corresponding task, according to the degree of priority of described different synchronization properties, with of the exclusive formation of described Task Distribution to the highest synchronization properties correspondence of degree of priority
Exclusive formation comprises:
The exclusive formation of the overall situation, the task in the exclusive formation of the described overall situation can only be carried out separately;
The exclusive formation of classification, the task in the exclusive formation of described classification can not be carried out simultaneously with the task of the exclusive formation corresponding types of described classification.
8. a Task Processing Unit is characterized in that, comprising:
Scheduler module judges whether the task of input has synchronization properties, when described task has synchronization properties, described task is committed to synchronization control module, when described task does not have synchronization properties, described task is committed to task execution module;
Described synchronization control module, synchronization properties according to described task, in current executing the task, search the exclusive task of described task correspondence, and when in described current executing the task, not having the exclusive task of described task correspondence, described task is committed to described task execution module by described scheduler module;
Described task execution module is carried out described task.
9. Task Processing Unit according to claim 8 is characterized in that, also comprises:
The isochronous queue module, exclusive formation is provided, when there is the exclusive task of described task correspondence in described synchronization control module in current executing the task, synchronization properties according to described task, by the exclusive formation that described Task Distribution is extremely corresponding of described isochronous queue module, when in described current executing the task, not having the exclusive task of described task correspondence, in the exclusive formation of described task correspondence, take out described task by described isochronous queue module, by described scheduler module described task is committed to described task execution module, with pending.
10. Task Processing Unit according to claim 9 is characterized in that, described isochronous queue module is also formulated dissimilar exclusive formations for the user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010299851 CN101963922B (en) | 2010-09-29 | 2010-09-29 | Task processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010299851 CN101963922B (en) | 2010-09-29 | 2010-09-29 | Task processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101963922A true CN101963922A (en) | 2011-02-02 |
| CN101963922B CN101963922B (en) | 2012-12-05 |
Family
ID=43516801
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010299851 Active CN101963922B (en) | 2010-09-29 | 2010-09-29 | Task processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101963922B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102591722A (en) * | 2011-12-31 | 2012-07-18 | 龙芯中科技术有限公司 | NoC (Network-on-Chip) multi-core processor multi-thread resource allocation processing method and system |
| CN103399795A (en) * | 2013-06-28 | 2013-11-20 | 贵阳朗玛信息技术股份有限公司 | Address book synchronizing method and device |
| CN104461710A (en) * | 2014-12-12 | 2015-03-25 | 北京国双科技有限公司 | Method and device for processing tasks |
| CN104731651A (en) * | 2013-12-20 | 2015-06-24 | 南京南瑞继保电气有限公司 | Power automation task scheduling and triggering method, system and processor |
| CN105740065A (en) * | 2016-01-20 | 2016-07-06 | 浪潮(北京)电子信息产业有限公司 | Method and device for controlling execution of asynchronous tasks |
| CN106201671A (en) * | 2015-04-29 | 2016-12-07 | 北大方正集团有限公司 | Method for scheduling task and device in one cluster deployed environment |
| CN106855825A (en) * | 2015-12-08 | 2017-06-16 | 中国移动通信集团公司 | A kind of task processing method and its device |
| CN107491350A (en) * | 2017-09-05 | 2017-12-19 | 武汉斗鱼网络科技有限公司 | Interface task call method and device |
| CN109240811A (en) * | 2018-08-09 | 2019-01-18 | 武汉斗鱼网络科技有限公司 | A kind of task executing method and device |
| CN110083442A (en) * | 2019-03-18 | 2019-08-02 | 咪咕文化科技有限公司 | A kind of operating method of user task, server and can storage medium |
| CN112217849A (en) * | 2019-07-11 | 2021-01-12 | 奇安信科技集团股份有限公司 | Task scheduling method and system in SD-WAN (secure digital-Wide area network) system and computer equipment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1366636A (en) * | 2000-04-26 | 2002-08-28 | 三菱电机株式会社 | Computer system and computer-readable record medium |
| EP1826671A2 (en) * | 2006-02-24 | 2007-08-29 | Samsung Electronics Co., Ltd. | Interruptible thread synchronization method and apparatus |
| CN101739293A (en) * | 2009-12-24 | 2010-06-16 | 航天恒星科技有限公司 | Method for scheduling satellite data product production tasks in parallel based on multithread |
-
2010
- 2010-09-29 CN CN 201010299851 patent/CN101963922B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1366636A (en) * | 2000-04-26 | 2002-08-28 | 三菱电机株式会社 | Computer system and computer-readable record medium |
| EP1826671A2 (en) * | 2006-02-24 | 2007-08-29 | Samsung Electronics Co., Ltd. | Interruptible thread synchronization method and apparatus |
| CN101739293A (en) * | 2009-12-24 | 2010-06-16 | 航天恒星科技有限公司 | Method for scheduling satellite data product production tasks in parallel based on multithread |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102591722B (en) * | 2011-12-31 | 2014-06-25 | 龙芯中科技术有限公司 | NoC (Network-on-Chip) multi-core processor multi-thread resource allocation processing method and system |
| CN102591722A (en) * | 2011-12-31 | 2012-07-18 | 龙芯中科技术有限公司 | NoC (Network-on-Chip) multi-core processor multi-thread resource allocation processing method and system |
| CN103399795A (en) * | 2013-06-28 | 2013-11-20 | 贵阳朗玛信息技术股份有限公司 | Address book synchronizing method and device |
| CN104731651B (en) * | 2013-12-20 | 2018-08-17 | 南京南瑞继保电气有限公司 | The power automation task scheduling and method of trigger mechanism, system and processor |
| CN104731651A (en) * | 2013-12-20 | 2015-06-24 | 南京南瑞继保电气有限公司 | Power automation task scheduling and triggering method, system and processor |
| CN104461710A (en) * | 2014-12-12 | 2015-03-25 | 北京国双科技有限公司 | Method and device for processing tasks |
| CN106201671B (en) * | 2015-04-29 | 2019-10-15 | 北大方正集团有限公司 | Method for scheduling task and device in one cluster deployed environment |
| CN106201671A (en) * | 2015-04-29 | 2016-12-07 | 北大方正集团有限公司 | Method for scheduling task and device in one cluster deployed environment |
| CN106855825A (en) * | 2015-12-08 | 2017-06-16 | 中国移动通信集团公司 | A kind of task processing method and its device |
| CN105740065A (en) * | 2016-01-20 | 2016-07-06 | 浪潮(北京)电子信息产业有限公司 | Method and device for controlling execution of asynchronous tasks |
| CN107491350A (en) * | 2017-09-05 | 2017-12-19 | 武汉斗鱼网络科技有限公司 | Interface task call method and device |
| CN109240811A (en) * | 2018-08-09 | 2019-01-18 | 武汉斗鱼网络科技有限公司 | A kind of task executing method and device |
| CN109240811B (en) * | 2018-08-09 | 2020-07-31 | 武汉斗鱼网络科技有限公司 | Task execution method and device |
| CN110083442A (en) * | 2019-03-18 | 2019-08-02 | 咪咕文化科技有限公司 | A kind of operating method of user task, server and can storage medium |
| CN110083442B (en) * | 2019-03-18 | 2021-12-07 | 咪咕文化科技有限公司 | User task operation method, server and storage medium |
| CN112217849A (en) * | 2019-07-11 | 2021-01-12 | 奇安信科技集团股份有限公司 | Task scheduling method and system in SD-WAN (secure digital-Wide area network) system and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101963922B (en) | 2012-12-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101963922B (en) | Task processing method and device | |
| CN108920261B (en) | Two-stage adaptive scheduling method suitable for massive parallel data processing tasks | |
| CN103197968B (en) | A kind of thread pool disposal route and system merging synchronous asynchronous feature | |
| CN102096599A (en) | Multi-queue task scheduling method and related system and equipment | |
| CN101452404B (en) | Task scheduling apparatus and method for embedded operating system | |
| CN1327349C (en) | Task level resource administration method for micro-kernel embedded real-time operation systems | |
| CN102455933B (en) | Method for increasing multi-tasking efficiency through thread management | |
| CN109684060B (en) | Mixed scheduling method for multiple types of time-critical tasks | |
| CN101694631B (en) | Real time job dispatching patcher and method | |
| CN101414270A (en) | Method for implementing assist nuclear task dynamic PRI scheduling with hardware assistant | |
| CN104199730B (en) | A kind of single thread multi-task processing method based on synchronous i/o multiplexing mechanism | |
| CN101051280A (en) | Intelligent card embedded operation system and its control method | |
| CN109697122A (en) | Task processing method, equipment and computer storage medium | |
| CN101923487A (en) | Comprehensive embedded type real-time period task scheduling method | |
| CN103500119B (en) | A kind of method for allocating tasks based on pre-scheduling | |
| CN103491174A (en) | Periodic/aperiodic mixed real-time task scheduling method based on delay servers | |
| CN110427257A (en) | Multi-task scheduling method, device and computer readable storage medium | |
| CN106445659B (en) | A kind of spacecraft periodically blendes together Random Task dispatching method | |
| CN103488531A (en) | Software and hardware mixing real-time task scheduling method based on multi-core processor and FPGA | |
| Li et al. | Task scheduling algorithm for heterogeneous real-time systems based on deadline constraints | |
| CN103677959B (en) | A kind of virtual machine cluster migration method and system based on multicast | |
| CN105049372A (en) | Method of expanding message middleware throughput and system thereof | |
| CN102567120B (en) | Node scheduling priority determining method and node scheduling priority determining device | |
| CN102573073B (en) | Resource allocation method and system for physical layer of terminal | |
| CN109614222A (en) | A kind of multithreading resource allocation methods |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee |
Owner name: YONYOU NETWORK TECHNOLOGY CO., LTD. Free format text: FORMER NAME: UFIDA SOFTWARE CO., LTD. |
|
| CP03 | Change of name, title or address |
Address after: 100094 Haidian District North Road, Beijing, No. 68 Patentee after: Yonyou Network Technology Co., Ltd. Address before: 100094 Beijing city Haidian District North Road No. 68, UFIDA Software Park Patentee before: UFIDA Software Co., Ltd. |