CN102915254A - Task management method and device - Google Patents
Task management method and device Download PDFInfo
- Publication number
- CN102915254A CN102915254A CN2011102193541A CN201110219354A CN102915254A CN 102915254 A CN102915254 A CN 102915254A CN 2011102193541 A CN2011102193541 A CN 2011102193541A CN 201110219354 A CN201110219354 A CN 201110219354A CN 102915254 A CN102915254 A CN 102915254A
- Authority
- CN
- China
- Prior art keywords
- task
- message queue
- distributed message
- priority
- system resource
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Multi Processors (AREA)
Abstract
The invention discloses task management method and device. The method includes: allowing a server to acquire priority of a task and store the task in a distributed message queue of the same priority according to the priority of the task; and allowing the server to call the corresponding task out of the distributed message queue according to a message about free system resources, and to distribute the task to the corresponding system resource. The task management method allows the server to store and run massive tasks which are managed and executed by a traditional client, allows the tasks taking long time to be focused and occupying massive client resources to stably run in the server, and allows a life cycle of all tasks from creation to scheduling to be executed efficiently and reasonably.
Description
Technical field
The present invention relates to computer realm, particularly relate to a kind of task management method and device.
Background technology
In the prior art, traditional task management mode is mounting software client on local computing, the beginning of task, execution and end by local people for carrying out control and management.If task execution time is long, for example, to the download of Internet resources, this task may be lasting takies the resources such as local central processing unit (CentralProcessing Unit is referred to as CPU), internal memory and the network bandwidth.
Traditional task scheduling Comparison of Management is paid close attention to task scheduling algorithm, comes high-level efficiency that a large amount of concurrent tasks are processed in real time by optimized algorithm more.Above-mentioned processing mode is so that the quantity size less of task, and the operation of task generally dispatched by operating system, limited in form the scope in task source.
Development along with the Milky Way, the contour performance supercomputer of nebula leads the server hardware processing power progressively to strengthen, the simultaneously research and development of cloud computing technology, and the computing power that large-scale data center or server can provide is more and more stronger.Therefore, be badly in need of at present a kind of mission bit stream dispatching method, make server end can preserve and move being carried out by the conventional client management in a large number of tasks, the task that making needs the long period to pay close attention to and take a large amount of client resources can be stable operates in server end.
Summary of the invention
The invention provides a kind of task management method and device, make server end can preserve and move being carried out by the conventional client management in a large number of tasks, the task that making needs the long period to pay close attention to and take a large amount of client resources can be stable operates in server end.
The invention provides a kind of task management method, comprising:
Server end obtains the precedence information of task, task is stored in the Distributed Message Queue of respective priority according to precedence information;
Server end accesses corresponding task according to the idle information of system resource and distributes corresponding system resource from Distributed Message Queue.
The present invention also provides a kind of task management device, is positioned at server end, comprising:
The task collection module, the precedence information for obtaining task sends to task in the Distributed Message Queue of respective priority according to precedence information;
Distributed Message Queue is used for the task in the Distributed Message Queue storage respective priority of different priorities;
Task scheduling modules is used for according to the idle information of system resource corresponding task being accessed and distributing corresponding system resource from Distributed Message Queue.
Beneficial effect of the present invention is as follows:
By dispatching and system resource allocation in the Distributed Message Queue that task is stored into respective priority, make server end can preserve and move being carried out by the conventional client management in a large number of task, the task that making needs the long period to pay close attention to and take a large amount of client resources can be stable operate in server end, make all tasks in the life cycle that is created to scheduling and finishes can by efficient, reasonably carry out.
Description of drawings
Fig. 1 is the process flow diagram of the task management method of the embodiment of the invention;
Fig. 2 is the schematic diagram that the optimum decision system of the task management method of the embodiment of the invention forms;
Fig. 3 is the preferred process process flow diagram of the task management method of the embodiment of the invention;
Fig. 4 is the process flow diagram of detailed processing of the task management method of the embodiment of the invention;
Fig. 5 is the structural representation of the task management device of the embodiment of the invention.
Embodiment
The invention provides a kind of task management method and device, make server end can preserve and move being carried out by the conventional client management in a large number of task, the task that making needs the long period to pay close attention to and take a large amount of client resources can be stable operate in server end, to realize safe storage and the scheduling of server end task.The technical scheme of the embodiment of the invention comprises task is deposited in the flow process of Distributed Message Queue and task shifted out the flow process of formation by scheduling strategy.Below in conjunction with accompanying drawing and embodiment, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, does not limit the present invention.
Embodiment of the method
According to embodiments of the invention, a kind of task management method is provided, Fig. 1 is the process flow diagram of the task management method of the embodiment of the invention, as shown in Figure 1, comprises following processing according to the task management method of the embodiment of the invention:
Step 101, server end are obtained the precedence information of task, task are stored in the Distributed Message Queue of respective priority according to precedence information; Need to prove; above-mentioned Distributed Message Queue can be configured to have the storing message formation of persistence ability; also can be configured to the formation of non-persistentization storing message; if Distributed Message Queue is configured to have the storing message formation of persistence ability, the task in the formation that can prevent in unusual or foreseeable situation is lost.In addition, above-mentioned distributed message team is distributed a plurality of fifo queue (that is to say, above-mentioned Distributed Message Queue can be the Distributed Message Queue of first in first out) with assigned priority as the storage container of mission bit stream object; And above-mentioned distributed message team can realize the active push function, when receiving scheduling signals, the head of the queue information of the formation that is scheduled is extruded formation, and perhaps the head of the queue task with high-priority queue initiatively sends to server end.
Particularly, in step 101, when server end obtains the precedence information of task, specifically comprise following processing: 1, in the situation that task is not carried precedence information, server end for task is distributed corresponding priority, and obtains corresponding precedence information according to the characteristic information of task; 2, in the situation that task carries precedence information, server end directly obtains the precedence information that carries in the task.
That is to say, in step 101, server end adds the respective priority formation by a kind of priority policy with task.
Step 102, server end access corresponding task according to the idle information of system resource and distribute corresponding system resource from Distributed Message Queue.
Step 102 specifically comprises following processing: 1, in the situation that can execute the task according to the idle information determining system resource of system resource, server end is notified corresponding Distributed Message Queue, receive the task of being positioned at the formation first place that this Distributed Message Queue pushes, and distribute corresponding system resource to carry out this task; Perhaps, the server end active is obtained task from the formation first place of the high priority Distributed Message Queue of Distributed Message Queue, and distributes corresponding system resource to carry out this task; 2, in the situation that can not execute the task according to the idle information determining system resource of system resource, server end isolation Distributed Message Queue forbids receiving the task that Distributed Message Queue pushes.
That is to say, when the required by task resource can obtain, server end distribution of notifications formula message queue, Distributed Message Queue according to priority pushes task, and server end distributes respective resources to carry out this task; When the required by task resource is all occupied, server end isolation message queue, no longer receiving queue task.When the resource space idle, server end is the task of obtaining from a certain high-priority queue initiatively.
In actual applications, in the situation that needs are carried out high-priority task, server end is waiting status with the task status of the low priority task of current execution from running state conversion, again low priority task is stored in the Distributed Message Queue of respective priority according to task status, and carry out high-priority task.
Preferably, before execution in step 102, server end can store the task in the Distributed Message Queue of limit priority in other Distributed Message Queue, and the current high-priority task of need carrying out being stored into the Head-of-line of the Distributed Message Queue of limit priority, the task in other Distributed Message Queue of will storing into again stores the back of high-priority task in the Distributed Message Queue of limit priority into.That is to say, the above-mentioned processing of the embodiment of the invention is by a kind of replacement policy, can guarantee preferentially that high-priority task seizes execution.
After step 102, server end can be according to current running status of executing the task, recomputate current priority of executing the task, improve or reduce current priority of executing the task according to result of calculation, and according to current priority of executing the task current task status of executing the task is set; In the situation that task status is set to waiting status, server end stores current executing the task in the Distributed Message Queue of respective priority into again, in the situation that task status is set to running status, server end continues to carry out current executing the task.
Be elaborated below in conjunction with the technique scheme of accompanying drawing to the embodiment of the invention.
Fig. 2 is the schematic diagram that the optimum decision system of the task management method of the embodiment of the invention forms, as shown in Figure 2, in this example, can create five resident Distributed Message Queue with different priorities, that is, Distributed Message Queue-1, Distributed Message Queue-2, Distributed Message Queue-3, Distributed Message Queue-4, Distributed Message Queue-5; In actual applications, can certainly create the Distributed Message Queue of more suitable application, also can be according to the Distributed Message Queue of the instant establishment respective priority of the characteristic attribute of task, destruction that can also be at any time is without the Distributed Message Queue of task, make the scheduling search of server end maintain a less scope, improve the efficient of response.As shown in Figure 2, task source-1, task source-2 ..., task source-N sends to server end with producing of task, server end carries out task and collects, subsequently, according to the precedence information of task, task is stored in respectively in the corresponding Distributed Message Queue, last, server end carries out task scheduling according to the idle condition of system resource from Distributed Message Queue.
Fig. 3 is the preferred process process flow diagram of the task management method of the embodiment of the invention, as shown in Figure 3, after server end carries out the task collection, high, medium and low precedence information according to task, task is stored in respectively in high priority Distributed Message Queue, medium priority Distributed Message Queue and the low priority Distributed Message Queue, subsequently, server end carries out task scheduling according to the idle condition of system resource from Distributed Message Queue.Need to prove, this example comprises two kinds of situations with the processing that enters Distributed Message Queue of task: situation one, server end deposit the task of formation in after confirming task priority; Two, task scheduling modules allows the swap out task of low priority of high-priority task, and the task status of task is waiting status and is reentered into Distributed Message Queue (that is, the flow process shown in the dotted arrow) from running state conversion.In addition, server end can also improve or reduce according to the running status of task the priority of task by methods such as weighting, measuring and calculating working times, change task status.
Fig. 4 is the process flow diagram of detailed processing of the task management method of the embodiment of the invention, as shown in Figure 4, comprises following processing:
Step 1, task source creation task, task call server end are carried out the interface that task is collected;
Step 2, server end receives the task that the task source sends, and the priority of task is analyzed, and obtains the precedence information of task;
Step 3, server end stores task in the different Distributed Message Queue into according to the precedence information of task;
Step 4, Distributed Message Queue active push task is to server end;
Step 5, server end can be according to the priority of task, the task of low priority stored in the Distributed Message Queue again, and with the task scheduling of high priority out;
Step 6, server end is scheduling task distributing system resource out;
Step 7, server end utilize system resource to carry out this task.
In sum, the technical scheme of the embodiment of the invention is stored in the task that the task source creates in the Distributed Message Queue of respective priority by assigned priority, Distributed Message Queue can push task dequeue for scheduled for executing, and dequeue also can wait task be scheduled.So that server end can respond task storage and the scheduling of the large quantity of task source initiation, make all tasks dispatch in the life cycle of finishing and to be carried out by efficient, rational from being created to.In addition, the embodiment of the invention is also used the push function of Distributed Message Queue flexibly, makes task can initiatively attempt applying for the resource execution, and the real-time of task is further enhanced; The embodiment of the invention is summarized as to deposit formation in and access formation by the flow process with task and carries out, make the management process of task more clear, have better extendability and exploitativeness, so that the realization of the existing and following task store and management that may occur can be more flexible.
Device embodiment
According to embodiments of the invention, a kind of task management device is provided, Fig. 5 is the structural representation of the task management device of the embodiment of the invention, as shown in Figure 5, task management device according to the embodiment of the invention comprises: task collection module 50, Distributed Message Queue 52, task scheduling modules 54 below are described in detail the modules of the embodiment of the invention.
That is to say, task collection module 50 is as the hinge module between task creation source and the Distributed Message Queue 52, be responsible for behind its characteristic information of the task analysis of receiving the priority of distributing priority or carrying according to task, task sent to the distributed queue of respective priority; Assessment of tasks priority can be deposited in Distributed Message Queue 52.
Distributed Message Queue 52 is used for the task in the Distributed Message Queue storage respective priority of different priorities;
Need to prove; above-mentioned Distributed Message Queue 52 can be configured to have the storing message formation of persistence ability; also can be configured to the formation of non-persistentization storing message; if Distributed Message Queue 52 is configured to have the storing message formation of persistence ability, the task in the formation that can prevent in unusual or foreseeable situation is lost.In addition, above-mentioned Distributed Message Queue 52 is as the storage container of mission bit stream object, it is distributed a plurality of fifo queue (that is to say, above-mentioned Distributed Message Queue can be the Distributed Message Queue of first in first out) with assigned priority; And above-mentioned Distributed Message Queue 52 can realize the active push function, when receiving scheduling signals, the head of the queue information of the formation that is scheduled is extruded formation, and perhaps the head of the queue task with high-priority queue initiatively sends to server end.
Distributed Message Queue 52 is further used for: the task in the Distributed Message Queue of limit priority is stored in other Distributed Message Queue, and the current high-priority task of need carrying out being stored into the Head-of-line of the Distributed Message Queue of limit priority, the task in other Distributed Message Queue of will storing into again stores the back of high-priority task in the Distributed Message Queue of limit priority into.The above-mentioned processing of the embodiment of the invention is by a kind of replacement policy, can guarantee preferentially that high-priority task seizes execution.
That is to say, when the required by task resource can obtain, task scheduling modules 54 distribution of notifications formula message queues 52, Distributed Message Queue 52 according to priority pushes task, and task scheduling modules 54 distributes respective resources to carry out this task; When the required by task resource is all occupied, task scheduling modules 54 isolation message queue 52, no longer receiving queue tasks.When the resource space idle, task scheduling modules 54 is the task of obtaining from a certain high-priority queue initiatively.
In sum, task scheduling modules 54 is responsible for dispatching being kept in the Distributed Message Queue 52 of task, and manages resource assurance tasks carrying that it has.
Be elaborated below in conjunction with the technique scheme of accompanying drawing to the embodiment of the invention.
As shown in Figure 2, in this example, can create five resident Distributed Message Queue with different priorities, that is, and Distributed Message Queue-1, Distributed Message Queue-2, Distributed Message Queue-3, Distributed Message Queue-4, Distributed Message Queue-5; In actual applications, can certainly create the Distributed Message Queue of more suitable application, also can be according to the Distributed Message Queue of the instant establishment respective priority of the characteristic attribute of task, destruction that can also be at any time is without the Distributed Message Queue of task, make the scheduling search of task scheduling modules 54 maintain a less scope, improve the efficient of response.As shown in Figure 2, task source-1, task source-2 ..., task source-N sends to task collection module 50 with producing of task, task collection module 50 carries out task and collects, subsequently, according to the precedence information of task, task is stored in respectively in the corresponding Distributed Message Queue 52, last, task scheduling modules 54 is carried out task scheduling according to the idle condition of system resource from Distributed Message Queue.
As shown in Figure 3, after task collection module 50 carries out the task collection, high, medium and low precedence information according to task, task is stored in respectively in high priority Distributed Message Queue, medium priority Distributed Message Queue and the low priority Distributed Message Queue, subsequently, task scheduling modules 54 is carried out task scheduling according to the idle condition of system resource from Distributed Message Queue 52.Need to prove, this example comprises two kinds of situations with the processing that enters Distributed Message Queue 52 of task: situation one, task collection module 50 deposit the task of formation in after confirming task priority; Two, task scheduling modules 54 allows the swap out task of low priority of high-priority task, and the task status of task is waiting status and is reentered into Distributed Message Queue 52 (that is, the flow process shown in the dotted arrow) from running state conversion.In addition, task scheduling modules 54 can also improve or reduce according to the running status of task the priority of task by methods such as weighting, measuring and calculating working times, change task status.
Fig. 4 is the process flow diagram of detailed processing of the task management method of the embodiment of the invention, as shown in Figure 4, comprises following processing:
Step 1, task source creation task, task call task collection module 50 are carried out the interface that task is collected;
Step 2, task collection module 50 receives the task that the task source sends, and the priority of task is analyzed, and obtains the precedence information of task;
Step 3, task collection module 50 stores task in the different Distributed Message Queue 52 into according to the precedence information of task;
Step 4, Distributed Message Queue 52 active push tasks are to task scheduling modules 54;
Step 5, task scheduling modules 54 can be according to the priority of task, the task of low priority stored in the Distributed Message Queue again, and with the task scheduling of high priority out;
Step 6, task scheduling modules 54 is scheduling task distributing system resource out;
Step 7, server end utilize system resource to carry out this task.
In sum, the technical scheme of the embodiment of the invention is stored in the task that the task source creates in the Distributed Message Queue of respective priority by assigned priority, Distributed Message Queue can push task dequeue for scheduled for executing, and dequeue also can wait task be scheduled.So that server end can respond task storage and the scheduling of the large quantity of task source initiation, make all tasks dispatch in the life cycle of finishing and to be carried out by efficient, rational from being created to.In addition, the embodiment of the invention is also used the push function of Distributed Message Queue flexibly, makes task can initiatively attempt applying for the resource execution, and the real-time of task is further enhanced; The embodiment of the invention is summarized as to deposit formation in and access formation by the flow process with task and carries out, make the management process of task more clear, have better extendability and exploitativeness, so that the realization of the existing and following task store and management that may occur can be more flexible.
Although be the example purpose, the preferred embodiments of the present invention are disclosed, it also is possible those skilled in the art will recognize various improvement, increase and replacement, therefore, scope of the present invention should be not limited to above-described embodiment.
Claims (10)
1. a task management method is characterized in that, comprising:
Server end obtains the precedence information of task, described task is stored in the Distributed Message Queue of respective priority according to described precedence information;
Described server end accesses corresponding task according to the idle information of system resource and distributes corresponding system resource from described Distributed Message Queue.
2. the method for claim 1 is characterized in that, the precedence information that described server end obtains task specifically comprises:
In the situation that described task is not carried precedence information, described server end for described task is distributed corresponding priority, and obtains corresponding precedence information according to the characteristic information of described task;
In the situation that described task carries described precedence information, described server end directly obtains the precedence information that carries in the described task.
3. the method for claim 1 is characterized in that, described Distributed Message Queue is: the Distributed Message Queue of first in first out.
4. method as claimed in claim 3 is characterized in that, described server end accesses corresponding task according to the idle information of system resource and distributes corresponding system resource specifically to comprise from described Distributed Message Queue:
In the situation that can execute the task according to the idle information determining system resource of described system resource, described server end is notified corresponding Distributed Message Queue, receive the task of being positioned at the formation first place that this Distributed Message Queue pushes, and distribute corresponding system resource to carry out this task; Perhaps, described server end active is obtained task from the formation first place of the high priority Distributed Message Queue of described Distributed Message Queue, and distributes corresponding system resource to carry out this task;
In the situation that can not execute the task according to the idle information determining system resource of described system resource, described server end is isolated described Distributed Message Queue, forbids receiving the task that described Distributed Message Queue pushes.
5. the method for claim 1 is characterized in that, described method also comprises:
In the situation that needs are carried out high-priority task, described server end is waiting status with the task status of the low priority task of current execution from running state conversion, again described low priority task is stored in the Distributed Message Queue of respective priority according to described task status, and carry out described high-priority task.
6. the method for claim 1 is characterized in that, described server end accesses corresponding task according to the idle information of system resource and distributes after the corresponding system resource from described Distributed Message Queue, and described method also comprises:
Described server end is according to current running status of executing the task, recomputate described current priority of executing the task, improve or reduce described current priority of executing the task according to result of calculation, and according to described current priority of executing the task described current task status of executing the task is set;
In the situation that described task status is set to waiting status, described server end stores described current executing the task in the Distributed Message Queue of respective priority into again, in the situation that described task status is set to running status, described server end continues to carry out described current executing the task.
7. the method for claim 1 is characterized in that, described server end accesses corresponding task according to the idle information of system resource and distributes before the corresponding system resource from described Distributed Message Queue, and described method also comprises:
Described server end stores the task in the Distributed Message Queue of limit priority in other Distributed Message Queue into, and the current high-priority task of need carrying out being stored into the Head-of-line of the Distributed Message Queue of described limit priority, the described task in other Distributed Message Queue of will storing into again stores the back of high-priority task described in the Distributed Message Queue of described limit priority into.
8. a task management device is characterized in that, is positioned at server end, and described device comprises:
The task collection module, the precedence information for obtaining task sends to described task in the Distributed Message Queue of respective priority according to described precedence information;
Described Distributed Message Queue is used for the task in the Distributed Message Queue storage respective priority of different priorities;
Task scheduling modules is used for according to the idle information of system resource corresponding task being accessed and distributing corresponding system resource from described Distributed Message Queue.
9. device as claimed in claim 8 is characterized in that,
Described task collection module specifically is used for: in the situation that described task is not carried precedence information, according to the characteristic information of described task, for described task is distributed corresponding priority, and obtain corresponding precedence information; In the situation that described task carries described precedence information, directly obtain the precedence information that carries in the described task;
Described task scheduling modules specifically is used for: in the situation that can execute the task according to the idle information determining system resource of described system resource, notify corresponding Distributed Message Queue, receive the task of being positioned at the formation first place that this Distributed Message Queue pushes, and distribute corresponding system resource to carry out this task; Perhaps, active is obtained task from the formation first place of the high priority Distributed Message Queue of described Distributed Message Queue, and distributes corresponding system resource to carry out this task; In the situation that can not execute the task according to the idle information determining system resource of described system resource, isolate described Distributed Message Queue, forbid receiving the task that described Distributed Message Queue pushes.
10. device as claimed in claim 8 is characterized in that,
Described task scheduling modules is further used for: in the situation that needs are carried out high-priority task, be waiting status with the task status of the low priority task of current execution from running state conversion, described low priority task is sent to described task collection module, and carry out described high-priority task; According to current running status of executing the task, recomputate described current priority of executing the task, improve or reduce described current priority of executing the task according to result of calculation, and according to described current priority of executing the task described current task status of executing the task is set; In the situation that described task status is set to waiting status, described current executing the task sent to described task collection module, in the situation that described task status is set to running status, continue to carry out described current executing the task;
Described Distributed Message Queue is further used for: the task in the Distributed Message Queue of limit priority is stored in other Distributed Message Queue, and the current high-priority task of need carrying out being stored into the Head-of-line of the Distributed Message Queue of described limit priority, the described task in other Distributed Message Queue of will storing into again stores the back of high-priority task described in the Distributed Message Queue of described limit priority into.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110219354.1A CN102915254B (en) | 2011-08-02 | 2011-08-02 | task management method and device |
| PCT/CN2012/072340 WO2012155628A1 (en) | 2011-08-02 | 2012-03-14 | Method and apparatus for task management |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110219354.1A CN102915254B (en) | 2011-08-02 | 2011-08-02 | task management method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102915254A true CN102915254A (en) | 2013-02-06 |
| CN102915254B CN102915254B (en) | 2018-04-06 |
Family
ID=47176237
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110219354.1A Expired - Fee Related CN102915254B (en) | 2011-08-02 | 2011-08-02 | task management method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102915254B (en) |
| WO (1) | WO2012155628A1 (en) |
Cited By (36)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103179009A (en) * | 2013-04-22 | 2013-06-26 | 烽火通信科技股份有限公司 | Dynamic adaptive calling method of distributed management system |
| CN103678488A (en) * | 2013-11-12 | 2014-03-26 | 德比软件(上海)有限公司 | Distributed mass dynamic task engine and method for processing data with same |
| CN104102740A (en) * | 2014-07-30 | 2014-10-15 | 精硕世纪科技（北京）有限公司 | Distribution type information acquisition system and method |
| CN104252390A (en) * | 2013-06-28 | 2014-12-31 | 华为技术有限公司 | Resource scheduling method, device and system |
| CN104915256A (en) * | 2015-06-05 | 2015-09-16 | 惠州Tcl移动通信有限公司 | Method and system for realizing real-time scheduling of task |
| CN104978232A (en) * | 2014-04-09 | 2015-10-14 | 阿里巴巴集团控股有限公司 | Computation resource capacity expansion method for real-time stream-oriented computation, computation resource release method for real-time stream-oriented computation, computation resource capacity expansion device for real-time stream-oriented computation and computation resource release device for real-time stream-oriented computation |
| CN105094972A (en) * | 2015-07-28 | 2015-11-25 | 百度在线网络技术（北京）有限公司 | Method and device for processing database operation tasks |
| CN106201676A (en) * | 2016-06-28 | 2016-12-07 | 浪潮软件集团有限公司 | Task allocation method and device |
| CN107423120A (en) * | 2017-04-13 | 2017-12-01 | 阿里巴巴集团控股有限公司 | Method for scheduling task and device |
| CN107665163A (en) * | 2016-07-29 | 2018-02-06 | 北京京东尚科信息技术有限公司 | The method and system of automation data backtracking |
| CN107733967A (en) * | 2017-07-24 | 2018-02-23 | 上海壹账通金融科技有限公司 | Processing method, device, computer equipment and the storage medium of pushed information |
| CN108205470A (en) * | 2016-12-20 | 2018-06-26 | 北京奇虎科技有限公司 | A kind of distribution ad data calculating task management system and method |
| CN108345501A (en) * | 2017-01-24 | 2018-07-31 | 全球能源互联网研究院 | A kind of distributed resource scheduling method and system |
| CN108563495A (en) * | 2018-04-08 | 2018-09-21 | 郑州云海信息技术有限公司 | The cloud resource queue graded dispatching system and method for data center's total management system |
| CN109388504A (en) * | 2018-09-26 | 2019-02-26 | 平安科技（深圳）有限公司 | Messageization docks processing method, device, computer equipment and storage medium |
| CN109408220A (en) * | 2017-08-17 | 2019-03-01 | 北京国双科技有限公司 | A kind of task processing method and device |
| CN109582446A (en) * | 2018-10-11 | 2019-04-05 | 中国建设银行股份有限公司 | Quasi real time asynchronous batch processing system, method, apparatus and storage medium |
| CN109582445A (en) * | 2018-09-29 | 2019-04-05 | 阿里巴巴集团控股有限公司 | Message treatment method, device, electronic equipment and computer readable storage medium |
| CN109756565A (en) * | 2018-12-26 | 2019-05-14 | 成都科来软件有限公司 | A kind of Multitask Data method for pushing based on statistical form |
| CN109814997A (en) * | 2019-01-18 | 2019-05-28 | 创新奇智(广州)科技有限公司 | A kind of distributed freedom equilibrium artificial intelligence method for scheduling task and system |
| CN110162418A (en) * | 2019-05-30 | 2019-08-23 | 努比亚技术有限公司 | Using cold start-up method, mobile terminal and computer readable storage medium |
| CN110210789A (en) * | 2019-06-17 | 2019-09-06 | 广东电网有限责任公司 | Resource distribution dispatching method, the device, equipment of power grid test business |
| CN110225102A (en) * | 2019-05-23 | 2019-09-10 | 北京小米移动软件有限公司 | Method, equipment and the system of pushed information |
| CN110569252A (en) * | 2018-05-16 | 2019-12-13 | 杭州海康威视数字技术股份有限公司 | Data processing system and method |
| CN110888726A (en) * | 2019-11-25 | 2020-03-17 | 中冶赛迪重庆信息技术有限公司 | Multitask concurrent processing method and system |
| CN111240865A (en) * | 2020-01-14 | 2020-06-05 | 山东汇贸电子口岸有限公司 | Elastic flexible activity priority management system and method based on message queue |
| CN111404838A (en) * | 2020-03-17 | 2020-07-10 | 上海云励科技有限公司 | Message processing method, device and equipment |
| CN111399989A (en) * | 2020-04-10 | 2020-07-10 | 中国人民解放军国防科技大学 | Task preemption scheduling method and system for container cloud |
| CN111709723A (en) * | 2020-07-20 | 2020-09-25 | 港胜技术服务(深圳)有限公司 | RPA business process intelligent processing method, device, computer equipment and storage medium |
| CN111784288A (en) * | 2020-06-29 | 2020-10-16 | 广州华多网络科技有限公司 | Task management method, device, system, storage medium and equipment |
| CN112269999A (en) * | 2020-11-04 | 2021-01-26 | 杭州迪普科技股份有限公司 | Vulnerability scanning task scheduling method, device, equipment and medium |
| CN112988374A (en) * | 2019-12-16 | 2021-06-18 | 阿里巴巴集团控股有限公司 | Data processing method, device, system and storage medium |
| CN113411226A (en) * | 2020-03-16 | 2021-09-17 | 北京奇虎科技有限公司 | Router distributed automatic test method, system, storage medium and computer equipment thereof |
| CN113411365A (en) * | 2020-03-17 | 2021-09-17 | ***通信集团山东有限公司 | Data processing method and device |
| CN113590299A (en) * | 2021-09-28 | 2021-11-02 | 南京国睿信维软件有限公司 | Conversion scheduling framework algorithm of high-concurrency high-availability heterogeneous system |
| CN115766613A (en) * | 2022-10-28 | 2023-03-07 | 华能信息技术有限公司 | Data transmission management method and system |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114693393A (en) * | 2014-01-22 | 2022-07-01 | 耐克创新有限合伙公司 | System and method for socially driven product offerings |
| CN113162990B (en) * | 2021-03-30 | 2022-08-16 | 杭州趣链科技有限公司 | Message sending method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3893136B2 (en) * | 2004-05-13 | 2007-03-14 | ファームウェアシステム株式会社 | Embedded computer control program, recording medium recording the program, and embedded system |
| CN101084680A (en) * | 2004-10-28 | 2007-12-05 | 意大利电信股份公司 | Method for managing resources in a platform for telecommunication service and/or network management, corresponding platform and computer program product therefor |
| CN101719931A (en) * | 2009-11-27 | 2010-06-02 | 南京邮电大学 | Multi-intelligent body-based hierarchical cloud computing model construction method |
| CN101743534A (en) * | 2007-07-16 | 2010-06-16 | 微软公司 | By increasing and shrinking resources allocation and dispatch |
| KR20100065572A (en) * | 2008-12-08 | 2010-06-17 | 재단법인대구경북과학기술원 | Method for re-defining priority and managing ready queue in system having static task define function and system for executing the method |
-
2011
- 2011-08-02 CN CN201110219354.1A patent/CN102915254B/en not_active Expired - Fee Related
-
2012
- 2012-03-14 WO PCT/CN2012/072340 patent/WO2012155628A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3893136B2 (en) * | 2004-05-13 | 2007-03-14 | ファームウェアシステム株式会社 | Embedded computer control program, recording medium recording the program, and embedded system |
| CN101084680A (en) * | 2004-10-28 | 2007-12-05 | 意大利电信股份公司 | Method for managing resources in a platform for telecommunication service and/or network management, corresponding platform and computer program product therefor |
| CN101743534A (en) * | 2007-07-16 | 2010-06-16 | 微软公司 | By increasing and shrinking resources allocation and dispatch |
| KR20100065572A (en) * | 2008-12-08 | 2010-06-17 | 재단법인대구경북과학기술원 | Method for re-defining priority and managing ready queue in system having static task define function and system for executing the method |
| CN101719931A (en) * | 2009-11-27 | 2010-06-02 | 南京邮电大学 | Multi-intelligent body-based hierarchical cloud computing model construction method |
Cited By (46)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103179009B (en) * | 2013-04-22 | 2016-01-13 | 烽火通信科技股份有限公司 | A kind of dynamic self-adapting call method of distributed management system |
| CN103179009A (en) * | 2013-04-22 | 2013-06-26 | 烽火通信科技股份有限公司 | Dynamic adaptive calling method of distributed management system |
| CN104252390B (en) * | 2013-06-28 | 2018-08-14 | 华为技术有限公司 | Resource regulating method, device and system |
| CN104252390A (en) * | 2013-06-28 | 2014-12-31 | 华为技术有限公司 | Resource scheduling method, device and system |
| CN103678488A (en) * | 2013-11-12 | 2014-03-26 | 德比软件(上海)有限公司 | Distributed mass dynamic task engine and method for processing data with same |
| CN104978232A (en) * | 2014-04-09 | 2015-10-14 | 阿里巴巴集团控股有限公司 | Computation resource capacity expansion method for real-time stream-oriented computation, computation resource release method for real-time stream-oriented computation, computation resource capacity expansion device for real-time stream-oriented computation and computation resource release device for real-time stream-oriented computation |
| CN104102740A (en) * | 2014-07-30 | 2014-10-15 | 精硕世纪科技（北京）有限公司 | Distribution type information acquisition system and method |
| CN104915256A (en) * | 2015-06-05 | 2015-09-16 | 惠州Tcl移动通信有限公司 | Method and system for realizing real-time scheduling of task |
| CN105094972A (en) * | 2015-07-28 | 2015-11-25 | 百度在线网络技术（北京）有限公司 | Method and device for processing database operation tasks |
| CN106201676A (en) * | 2016-06-28 | 2016-12-07 | 浪潮软件集团有限公司 | Task allocation method and device |
| CN107665163A (en) * | 2016-07-29 | 2018-02-06 | 北京京东尚科信息技术有限公司 | The method and system of automation data backtracking |
| CN107665163B (en) * | 2016-07-29 | 2021-03-30 | 北京京东尚科信息技术有限公司 | Method and system for automatic data backtracking |
| CN108205470A (en) * | 2016-12-20 | 2018-06-26 | 北京奇虎科技有限公司 | A kind of distribution ad data calculating task management system and method |
| CN108345501B (en) * | 2017-01-24 | 2021-10-29 | 全球能源互联网研究院有限公司 | Distributed resource scheduling method and system |
| CN108345501A (en) * | 2017-01-24 | 2018-07-31 | 全球能源互联网研究院 | A kind of distributed resource scheduling method and system |
| CN107423120A (en) * | 2017-04-13 | 2017-12-01 | 阿里巴巴集团控股有限公司 | Method for scheduling task and device |
| CN107423120B (en) * | 2017-04-13 | 2020-06-30 | 阿里巴巴集团控股有限公司 | Task scheduling method and device |
| CN107733967A (en) * | 2017-07-24 | 2018-02-23 | 上海壹账通金融科技有限公司 | Processing method, device, computer equipment and the storage medium of pushed information |
| CN107733967B (en) * | 2017-07-24 | 2020-01-07 | 深圳壹账通智能科技有限公司 | Processing method and device for push information, computer equipment and storage medium |
| CN109408220A (en) * | 2017-08-17 | 2019-03-01 | 北京国双科技有限公司 | A kind of task processing method and device |
| CN108563495A (en) * | 2018-04-08 | 2018-09-21 | 郑州云海信息技术有限公司 | The cloud resource queue graded dispatching system and method for data center's total management system |
| CN110569252A (en) * | 2018-05-16 | 2019-12-13 | 杭州海康威视数字技术股份有限公司 | Data processing system and method |
| CN109388504A (en) * | 2018-09-26 | 2019-02-26 | 平安科技（深圳）有限公司 | Messageization docks processing method, device, computer equipment and storage medium |
| CN109582445A (en) * | 2018-09-29 | 2019-04-05 | 阿里巴巴集团控股有限公司 | Message treatment method, device, electronic equipment and computer readable storage medium |
| CN109582446A (en) * | 2018-10-11 | 2019-04-05 | 中国建设银行股份有限公司 | Quasi real time asynchronous batch processing system, method, apparatus and storage medium |
| CN109756565A (en) * | 2018-12-26 | 2019-05-14 | 成都科来软件有限公司 | A kind of Multitask Data method for pushing based on statistical form |
| CN109814997A (en) * | 2019-01-18 | 2019-05-28 | 创新奇智(广州)科技有限公司 | A kind of distributed freedom equilibrium artificial intelligence method for scheduling task and system |
| CN110225102A (en) * | 2019-05-23 | 2019-09-10 | 北京小米移动软件有限公司 | Method, equipment and the system of pushed information |
| CN110162418A (en) * | 2019-05-30 | 2019-08-23 | 努比亚技术有限公司 | Using cold start-up method, mobile terminal and computer readable storage medium |
| CN110162418B (en) * | 2019-05-30 | 2023-06-27 | 努比亚技术有限公司 | Application cold start method, mobile terminal and computer readable storage medium |
| CN110210789A (en) * | 2019-06-17 | 2019-09-06 | 广东电网有限责任公司 | Resource distribution dispatching method, the device, equipment of power grid test business |
| CN110888726A (en) * | 2019-11-25 | 2020-03-17 | 中冶赛迪重庆信息技术有限公司 | Multitask concurrent processing method and system |
| CN112988374A (en) * | 2019-12-16 | 2021-06-18 | 阿里巴巴集团控股有限公司 | Data processing method, device, system and storage medium |
| CN111240865A (en) * | 2020-01-14 | 2020-06-05 | 山东汇贸电子口岸有限公司 | Elastic flexible activity priority management system and method based on message queue |
| CN113411226A (en) * | 2020-03-16 | 2021-09-17 | 北京奇虎科技有限公司 | Router distributed automatic test method, system, storage medium and computer equipment thereof |
| CN111404838A (en) * | 2020-03-17 | 2020-07-10 | 上海云励科技有限公司 | Message processing method, device and equipment |
| CN113411365A (en) * | 2020-03-17 | 2021-09-17 | ***通信集团山东有限公司 | Data processing method and device |
| CN111399989B (en) * | 2020-04-10 | 2022-11-18 | 中国人民解放军国防科技大学 | Container cloud-oriented task preemption and scheduling method and system |
| CN111399989A (en) * | 2020-04-10 | 2020-07-10 | 中国人民解放军国防科技大学 | Task preemption scheduling method and system for container cloud |
| CN111784288A (en) * | 2020-06-29 | 2020-10-16 | 广州华多网络科技有限公司 | Task management method, device, system, storage medium and equipment |
| CN111709723A (en) * | 2020-07-20 | 2020-09-25 | 港胜技术服务(深圳)有限公司 | RPA business process intelligent processing method, device, computer equipment and storage medium |
| CN111709723B (en) * | 2020-07-20 | 2023-11-28 | 港胜技术服务(深圳)有限公司 | RPA business process intelligent processing method, device, computer equipment and storage medium |
| CN112269999A (en) * | 2020-11-04 | 2021-01-26 | 杭州迪普科技股份有限公司 | Vulnerability scanning task scheduling method, device, equipment and medium |
| CN113590299A (en) * | 2021-09-28 | 2021-11-02 | 南京国睿信维软件有限公司 | Conversion scheduling framework algorithm of high-concurrency high-availability heterogeneous system |
| CN115766613A (en) * | 2022-10-28 | 2023-03-07 | 华能信息技术有限公司 | Data transmission management method and system |
| CN115766613B (en) * | 2022-10-28 | 2023-05-23 | 华能信息技术有限公司 | Data transmission management method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2012155628A1 (en) | 2012-11-22 |
| CN102915254B (en) | 2018-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102915254A (en) | Task management method and device | |
| Kaur et al. | Container-as-a-service at the edge: Trade-off between energy efficiency and service availability at fog nano data centers | |
| CN107038069B (en) | Dynamic label matching DLMS scheduling method under Hadoop platform | |
| CN102156665B (en) | Differential serving method for virtual system competition resources | |
| CN107479990A (en) | Distributed software service system | |
| CN109327509A (en) | A kind of distributive type Computational frame of the lower coupling of master/slave framework | |
| CN103927225B (en) | A kind of internet information processing optimization method of multi-core framework | |
| CN104123182B (en) | Based on the MapReduce task of client/server across data center scheduling system and method | |
| US20170185452A1 (en) | Apparatus and method for data processing | |
| CN109697122A (en) | Task processing method, equipment and computer storage medium | |
| WO2012113290A1 (en) | Gene computing system and method | |
| CN114610474B (en) | Multi-strategy job scheduling method and system under heterogeneous supercomputing environment | |
| CN109347757A (en) | Message congestion control method, system, equipment and storage medium | |
| WO2024016596A1 (en) | Container cluster scheduling method and apparatus, device, and storage medium | |
| Govindarajan et al. | Task scheduling in big data-review, research challenges, and prospects | |
| Perwej | The ambient scrutinize of scheduling algorithms in big data territory | |
| Yang et al. | An offloading strategy based on cloud and edge computing for industrial Internet | |
| CN106997304B (en) | Input and output event processing method and device | |
| Ullah et al. | Task Priority‐Based Cached‐Data Prefetching and Eviction Mechanisms for Performance Optimization of Edge Computing Clusters | |
| Lai et al. | Task scheduling for cloud based cyber-physical systems | |
| Gadre et al. | Investigating MapReduce framework extensions for efficient processing of geographically scattered datasets | |
| Uchechukwu et al. | Scalable analytic models for performance efficiency in the cloud | |
| Liao et al. | Efficient and fair scheduler of multiple resources for MapReduce system | |
| Yi et al. | An effective algorithm of jobs scheduling in clusters | |
| Upadhyay et al. | MRS-DP: Improving performance and resource utilization of big data applications with deadlines and priorities |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180406 Termination date: 20190802 |