CN105824699A - Distributed task scheduling apparatus and method - Google Patents
Distributed task scheduling apparatus and method Download PDFInfo
- Publication number
- CN105824699A CN105824699A CN201510005025.5A CN201510005025A CN105824699A CN 105824699 A CN105824699 A CN 105824699A CN 201510005025 A CN201510005025 A CN 201510005025A CN 105824699 A CN105824699 A CN 105824699A
- Authority
- CN
- China
- Prior art keywords
- task
- waiting
- waiting task
- module
- processing module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Multi Processors (AREA)
Abstract
The invention discloses a distributed task scheduling apparatus and method. The apparatus comprises a task processing module, a to-be-processed task module and a task scheduling module, wherein the task scheduling module can load a to-be processed task to the to-be-processed task module according to a change condition of the to-be-processed task fed back by the to-be-processed task module; according to a task processing result fed back by the task processing module, a to-be-processed task stored in the to-be-processed task module can be distributed to the task processing module; and problems of poor scheduling system extension, poor maintenance and inflexibility of scheduling in the prior art can be solved.
Description
Technical field
The present invention relates to business support technical field, be specifically related to a kind of distributed task dispatching device and method.
Background technology
In business support system, in order to meet service application demand, it is frequently necessary to by batch tasks timer-triggered scheduler system, business is scheduling, existing batch tasks timer-triggered scheduler system is realized by control loading thread, distribution thread, process thread pool, task queue by controller, loading thread to be responsible for choosing task from job order and task distribution being put in task queue, distribution thread is responsible for distributing to the task in task queue process thread process.In existing task scheduling system, load thread after task list gets data, if queue does not has space, need monitor task queue repeatedly, execution efficiency is low, and system capability cannot extend, and loading thread and distribution thread exist single node problem, once certain thread occurs abnormal, and whole application cannot normally perform.
Therefore, need one badly can solve to dispatch inflexible device.
Summary of the invention
The embodiment of the present invention provides a kind of distributed task dispatching device and method, dispatches inflexible problem in order to solve dispatching patcher of the prior art.
To achieve these goals, embodiments provide a kind of distributed task dispatching device, including: task processing module, waiting task module and task scheduling modules；
Described task processing module, processes for the waiting task that described task scheduling modules is distributed is distributed to server, and feeds back task disposition to described task scheduling modules；
Described waiting task module, for receiving the waiting task that described task scheduling modules loads, is stored in corresponding memory element by the waiting task loaded, so that described task scheduling modules is scheduling according to the priority of the waiting task loaded；And, to the change conditions of described task scheduling modules feedback waiting task；
Described task scheduling modules, for the waiting task change conditions according to described waiting task module feedback, waiting task is loaded to described waiting task module, according to the task result of described task processing module feedback, the waiting task deposited in described waiting task module is distributed to described task processing module.
It is preferred that described task processing module is additionally operable to the load condition to described task scheduling modules feedback server；
Described task scheduling modules is used for load condition and the waiting task change conditions of described waiting task module feedback of the server according to described task processing module feedback, and the waiting task deposited in described waiting task module is distributed to described task processing module.
It is preferred that described task scheduling modules specifically for:
If the load of the server of described task processing module feedback is less than threshold value, and the waiting task change conditions of described waiting task module feedback is newly-increased waiting task, the waiting task deposited in described waiting task module is distributed to described task processing module.
It is preferred that described task scheduling modules specifically for:
It is deleted if the waiting task change conditions of described waiting task module feedback is described waiting task, loads waiting task to described pending module.
It is preferred that described waiting task module includes high priority memory element, medium priority memory element and low priority memory element, it is respectively used to deposit the waiting task of corresponding priority；
Described task scheduling modules is specifically for preferentially distributing to described task processing module by the waiting task in described high priority memory element.
It is preferred that described task scheduling modules includes task load units and task allocation unit.
The embodiment of the present invention additionally provides a kind of distributed task dispatching method based on said apparatus, and the method includes:
Obtain the waiting task change conditions of waiting task module feedback；
According to the waiting task change conditions of described waiting task module feedback, load waiting task to described waiting task module；
The task result of acquisition task processing module feedback；
According to the task result of described task processing module feedback, the waiting task deposited in described waiting task module is distributed to described task processing module.
It is preferred that described method also includes:
Obtain the load condition of the server of described task processing module feedback；
The load condition of the server according to described task processing module feedback and the waiting task change conditions of described waiting task feedback, distribute to described task processing module by the waiting task deposited in described waiting task module.
Preferably, the load condition of the described server according to described task processing module feedback and the waiting task change conditions of described waiting task feedback, the waiting task deposited in described waiting task module is distributed to described task processing module, including:
If the load of the server of described task processing module feedback is less than threshold value, and the waiting task change conditions of described waiting task module feedback is newly-increased waiting task, the waiting task deposited in described waiting task module is distributed to described task processing module.
It is preferred that the described waiting task change conditions according to described waiting task module feedback, load waiting task to described waiting task module, including:
It is deleted if the waiting task change conditions of described waiting task module feedback is described waiting task, loads waiting task to described pending module.
Distributed scheduling device in above-described embodiment, including task processing module, waiting task module and task scheduling modules, described task processing module, process for the waiting task that described task scheduling modules is distributed is distributed to server, and feed back task disposition to described task scheduling modules, described waiting task module, for receiving the waiting task that described task scheduling modules loads, the waiting task loaded is stored in the memory element of correspondence by the priority according to the waiting task loaded, so that described task scheduling modules is scheduling, and, change conditions to described task scheduling modules feedback waiting task；Described task scheduling modules, for the waiting task change conditions according to described waiting task module feedback, waiting task is loaded to described waiting task module, task result according to described task processing module feedback, the waiting task deposited in described waiting task module is distributed to described task processing module, is ensured motility and the promptness of task scheduling by the trigger mechanism between each module..
Accompanying drawing explanation
For the technical scheme being illustrated more clearly that in the embodiment of the present invention, in describing embodiment below, the required accompanying drawing used is briefly introduced, apparently, accompanying drawing in describing below is only some embodiments of the present invention, from the point of view of those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the structural representation of a kind of distributed scheduling device in the embodiment of the present invention；
Fig. 2 is the schematic flow sheet of a kind of distributed scheduling method in the embodiment of the present invention.
Detailed description of the invention
In order to make the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing, the present invention is described in further detail, it is clear that described embodiment is only some embodiments of the present invention rather than whole embodiments.Based on the embodiment in the present invention, all other embodiments that those of ordinary skill in the art are obtained under not making creative work premise, broadly fall into the scope of protection of the invention.
In embodiments of the present invention, active task list is the table in physical library, including the definition of all active tasks, enters task status, scheduling time, scheduling rule and marketing term etc..Many in view of there is task, in the case of resource is few, task needs time segment to run.Task run duration occur following situation to exit (manually suspend, time-outs that swap out, non-working time section time-out, manual termination), now task status can be updated in active task list, the most again other tasks being loaded into internal memory to process, the burst of similar operations system performs.When task is initial, the time started of campaign definitions is exactly the next scheduling time in active task list, afterwards the swapping out of task, suspend, the operation such as recovery, all can revise scheduling time next time, arrive this time, expression task meets execution condition.
Fig. 1 shows the structure of a kind of distributed task dispatching device, and this device can perform the distributed task dispatching method shown in Fig. 2, and this device may be located in business support system.As it can be seen, this device includes: task processing module 101, waiting task module 103 and task scheduling modules 102.
Described task processing module 101, processes for the waiting task that described task scheduling modules 102 is distributed is distributed to server, and feeds back task disposition to described task scheduling modules 102；Described task processing module 101 can manage multiple server, and described waiting task is distributed to server process.
Described waiting task module 103, for receiving the waiting task that described task scheduling modules 102 loads, the waiting task loaded is stored in the memory element of correspondence by the priority according to the waiting task loaded, so that described task scheduling modules 102 is scheduling；And, the change conditions of waiting task is fed back to described task scheduling modules 102.Described waiting task module 103 includes high priority memory element, medium priority memory element and low priority memory element, deposit the waiting task of corresponding priority respectively, waiting task in high priority memory element preferential can be distributed to task processing module 101 by task scheduling modules 102, and the priority of its follow-up waiting task is correspondingly improved.
Described task scheduling modules 102, for the waiting task change conditions fed back according to described waiting task module 103, waiting task is loaded to described waiting task module 103, according to the task result of described task processing module 101 feedback, the waiting task deposited in described waiting task module 103 is distributed to described task processing module 101.Described task scheduling modules 102 includes task load units and task allocation unit, and task load units and task allocation unit are positioned at same server, and described task scheduling modules 102 is provided with two mutual backup servers.
Concrete, it being deleted if the waiting task change conditions of described waiting task module 103 feedback is described waiting task, described task scheduling modules 102 loads waiting task to described pending module.
Preferably, described task processing module 101 is additionally operable to the load condition to described task scheduling modules 102 feedback server；Described task scheduling modules 102 is used for load condition and the waiting task change conditions of described waiting task module 103 feedback of the server according to described task processing module 101 feedback, and the waiting task deposited in described waiting task module 103 is distributed to described task processing module 101.Task scheduling modules 102 may determine that the load condition of the server for processing task is come and the waiting task change conditions of waiting task module 103 feedback decides whether to distribute described waiting task to described task processing module 101.
Concrete, when the load of the server of described task processing module 101 feedback is less than threshold value (if threshold value is 80%), and the waiting task change conditions of described waiting task module 103 feedback is newly-increased waiting task, the waiting task deposited in described waiting task module 103 is distributed to described task processing module 101 by the most described task scheduling modules 102.
Concrete, by multiple servers, task processing module 101, task scheduling modules 102 and waiting task module 103 support that it operates, as task processing module has N number of server 101 times, each server is registered in task processing module 101 times as child node, after the tasks carrying on this server is complete, this child node can be deleted, and in time receiving new task, re-registers child node information；Multiple servers under task scheduling modules 102, each server all can receive the task action result of task processing module 101, the task in job order is loaded into pending module etc..The problem that multiserver mechanism solves dispatching patcher poor expandability in prior art, maintainability is poor, node is the most single, enhances the job stability of dispatching patcher.
Above-described embodiment shows, the waiting task change conditions fed back according to described waiting task module 103 by described task scheduling modules 102, waiting task is loaded to described waiting task module 103, task result according to described task processing module 101 feedback, the waiting task deposited in described waiting task module 103 is distributed to described task processing module 101, can solve dispatching patcher autgmentability of the prior art poor, maintainable poor, dispatch the problems such as dumb.
In order to preferably explain the present invention, embodiments provide concrete enforcement scene, and implementation process.
In embodiments of the present invention, distributed scheduling device includes task scheduling modules 102, waiting task module 103, task processing module 101, described module can have subelement, data and subelement directory name automatic numbering can be stored, can monitor, including storage data modification, the change etc. of subelement catalogue.
Wherein said waiting task module 103 is used for depositing waiting task, manages the storing sub-units of high, medium and low three ranks, has the task queue of regular length under each storing sub-units.
Described task scheduling modules 102 management role loading server and task distribution server, monitor described waiting task module 103 and task processing module 101 simultaneously, i.e. waiting task module 103 feeds back the change conditions of the waiting task that described waiting task module 103 manages to task scheduling modules 102, such as newly-increased waiting task, delete the change conditions such as waiting task.
Task processing module 101 manages multiple server, and the plurality of server, for processing the task of described task processing module 101 distribution, feeds back the load condition of the server of task disposition and responsible process task simultaneously to described task scheduling modules 102.
Described waiting task module 103 and described task processing module 101 are provided with the service of loading, distribution service and process the Mission Monitor of service, when there being event change, described waiting task module 103 and described task processing module 101 can be to task scheduling modules 102 feedback event situations of change, as newly increased task, task is deleted, task such as has processed at the change conditions, it is possible to achieve dispatching device task loads, distribute and harmony that process etc. services.
Loading service is to be realized by task load units, managed by task scheduling modules 102, it is responsible for from active task list meeting the task (next time scheduling time < current time) of execution condition, " the height being loaded under waiting task module 103 according to time order and function order, in, the end " three storing sub-units task queue in, wherein three high, normal, basic storing sub-units, the waiting task of the most corresponding three priority, the message queue of corresponding three regular lengths, meet the task of execution condition, can be loaded into from active task list in three corresponding priority storing sub-units by task load units.
Task load units monitors the change conditions of the waiting task of 103 times high, medium and low storing sub-units of waiting task module simultaneously, after waiting task is allocated away, task load units can load new task for waiting task module 103 from active task list.
Distribution service is to be performed by task allocation unit, managed by task scheduling modules 102, it is responsible for from the storing sub-units of 103 high, medium and low three ranks of waiting task module, reading next task Tn and distributing to 101 times idle servers of task processing module, represent after being allocated successfully that this waiting task is deleted from described waiting task module 103, described waiting task module 103 has waiting task to be deleted to described task scheduling modules 102 feedback, can load new waiting task.
Just during sub-distribution task, can respectively from high, medium and low three storing sub-units ratio order according to 6:3:1 read task, distribute to the server of free time, the reading upper limit of the most each storing sub-units is separately positioned on the index data of storing sub-units.After successfully waiting task is distributed to server, task allocation unit can record the index data being currently located waiting task module 103, distributes next time on the basis of current record index data.
Such as, the index data (such as: in | 2) of task allocation unit record waiting task module 103 record, represent that last time has taken 2 times from middle rank storing sub-units, search middle rank storing sub-units and read upper data=3, due to 2 < 3, expression can also read a subtask from middle rank storing sub-units, then the waiting task taking sequence number minimum from middle rank storing sub-units distributes to task processing module 101, after being allocated successfully, waiting task module 103 is set and currently reads index data for " in | 3 ", after distribution Mission Success, waiting task module 103 notifies that task scheduling modules 102 loads new task to middle rank storing sub-units.
In task scheduling modules 102 after waiting task module 103 loads new waiting task, if the server free of the responsible process task of task processing module 101 feedback, then waiting task corresponding in waiting task module 103 is distributed to task processing module 101 by task allocation unit.
Based on above-mentioned distributed scheduling device, Fig. 2 shows the flow process of a kind of distributed task dispatching method, and this flow process can be performed by above-mentioned distributed scheduling device, and these flow process concrete steps include:
Step S201, obtains the waiting task change conditions of waiting task module 103 feedback.
Concrete, after waiting task is allocated away, waiting task module 103 can be fed back waiting task and be deleted, after loading new waiting task to waiting task module 103, waiting task module 103 can feed back newly-increased waiting task, accordingly, it would be desirable to obtain the waiting task change conditions of waiting task module 103 feedback.
Step S202, according to the waiting task change conditions of described waiting task module 103 feedback, loads waiting task to described waiting task module 103.
Concrete, if the waiting task change conditions of described waiting task module 103 feedback is newly-increased waiting task, then from active task list, reads new task, load new waiting task to waiting task module 103.
Step S203, obtains the task result of task processing module 101 feedback.
Concrete, task processing module 101, after its server process managed its being responsible for of task complete, can be fed back the task result that task has processed, need the task result that acquisition task processing module 101 is fed back.
Step S204, according to the task result of described task processing module 101 feedback, distributes to described task processing module 101 by the waiting task deposited in described waiting task module 103.
After the complete task of server process of task processing module 101 management, the waiting task deposited is distributed to task processing module 101, during distribution, be allocated according to the priority of waiting task in waiting task module 103.
Preferably, in described step S203, also obtain the load condition of the server of task processing module 101 feedback, the load condition of the server according to described task processing module 101 feedback and the waiting task change conditions of described waiting task feedback, distribute to described task processing module 101 by the waiting task deposited in described waiting task module 103.
Concrete, if the load of the server of described task processing module 101 feedback is less than threshold value (if threshold value is 80%), and the waiting task change conditions of described waiting task module 103 feedback is newly-increased waiting task, the waiting task deposited in described waiting task module 103 is distributed to described task processing module 101.
In sum, the waiting task change conditions that the present invention is fed back according to described waiting task module 103 by described task scheduling modules 102 in implementing, waiting task is loaded to described waiting task module 103, task result according to described task processing module 101 feedback, the waiting task deposited in described waiting task module 103 is distributed to described task processing module 101, can solve dispatching patcher autgmentability of the prior art poor, maintainable poor, dispatch the problems such as dumb.
The present invention is to describe with reference to method, equipment (system) and the flow chart of computer program according to embodiments of the present invention and/or block diagram.It should be understood that can be by the flow process in each flow process in computer program instructions flowchart and/or block diagram and/or square frame and flow chart and/or block diagram and/or the combination of square frame.These computer program instructions can be provided to produce a machine to the processor of general purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device so that the instruction performed by the processor of computer or other programmable data processing device is produced for realizing the device of function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions may be alternatively stored in and can guide in the computer-readable memory that computer or other programmable data processing device work in a specific way, the instruction making to be stored in this computer-readable memory produces the manufacture including command device, and this command device realizes the function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, make to perform sequence of operations step on computer or other programmable devices to produce computer implemented process, thus the instruction performed on computer or other programmable devices provides the step of the function specified in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame for realization.
Although preferred embodiments of the present invention have been described, but those skilled in the art once know basic creative concept, then these embodiments can be made other change and amendment.So, claims are intended to be construed to include preferred embodiment and fall into all changes and the amendment of the scope of the invention.
Obviously, those skilled in the art can carry out various change and modification without departing from the spirit and scope of the present invention to the present invention.So, if these amendments of the present invention and modification belong within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention is also intended to comprise these change and modification.
Claims (10)
1. a distributed task dispatching device, it is characterised in that including: task processing module, waiting task module and task scheduling modules；
Described task processing module, processes for the waiting task that described task scheduling modules is distributed is distributed to server, and feeds back task disposition to described task scheduling modules；
Described waiting task module, for receiving the waiting task that described task scheduling modules loads, is stored in corresponding memory element by the waiting task loaded, so that described task scheduling modules is scheduling according to the priority of the waiting task loaded；And, to the change conditions of described task scheduling modules feedback waiting task；
Described task scheduling modules, for the waiting task change conditions according to described waiting task module feedback, waiting task is loaded to described waiting task module, according to the task result of described task processing module feedback, the waiting task deposited in described waiting task module is distributed to described task processing module.
2. device as claimed in claim 1, it is characterised in that described task processing module is additionally operable to the load condition to described task scheduling modules feedback server；
Described task scheduling modules is used for load condition and the waiting task change conditions of described waiting task feedback of the server according to described task processing module feedback, and the waiting task deposited in described waiting task module is distributed to described task processing module.
3. device as claimed in claim 2, it is characterised in that described task scheduling modules specifically for:
If the load of the server of described task processing module feedback is less than threshold value, and the waiting task change conditions of described waiting task module feedback is newly-increased waiting task, the waiting task deposited in described waiting task module is distributed to described task processing module.
4. device as claimed in claim 1, it is characterised in that described task scheduling modules specifically for:
It is deleted if the waiting task change conditions of described waiting task module feedback is described waiting task, loads waiting task to described pending module.
5. device as claimed in claim 1, it is characterised in that described waiting task module includes high priority memory element, medium priority memory element and low priority memory element, is respectively used to deposit the waiting task of corresponding priority；
Described task scheduling modules is specifically for preferentially distributing to described task processing module by the waiting task in described high priority memory element.
6. the device as described in claim 1 to 5 is arbitrary, it is characterised in that described task scheduling modules includes task load units and task allocation unit.
7. a distributed task dispatching method based on device as described in claim 1 to 6 is arbitrary, it is characterised in that the method includes:
Obtain the waiting task change conditions of waiting task module feedback；
According to the waiting task change conditions of described waiting task module feedback, load waiting task to described waiting task module；
The task result of acquisition task processing module feedback；
According to the task result of described task processing module feedback, the waiting task deposited in described waiting task module is distributed to described task processing module.
8. method as claimed in claim 7, it is characterised in that described method also includes:
Obtain the load condition of the server of described task processing module feedback；
The load condition of the server according to described task processing module feedback and the waiting task change conditions of described waiting task feedback, distribute to described task processing module by the waiting task deposited in described waiting task module.
9. method as claimed in claim 8, it is characterized in that, the load condition of the described server according to described task processing module feedback and the waiting task change conditions of described waiting task feedback, the waiting task deposited in described waiting task module is distributed to described task processing module, including:
If the load of the server of described task processing module feedback is less than threshold value, and the waiting task change conditions of described waiting task module feedback is newly-increased waiting task, the waiting task deposited in described waiting task module is distributed to described task processing module.
10. method as claimed in claim 7, it is characterised in that the described waiting task change conditions according to described waiting task module feedback, loads waiting task to described waiting task module, including:
It is deleted if the waiting task change conditions of described waiting task module feedback is described waiting task, loads waiting task to described pending module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510005025.5A CN105824699A (en) | 2015-01-06 | 2015-01-06 | Distributed task scheduling apparatus and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510005025.5A CN105824699A (en) | 2015-01-06 | 2015-01-06 | Distributed task scheduling apparatus and method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105824699A true CN105824699A (en) | 2016-08-03 |
Family
ID=56513663
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510005025.5A Pending CN105824699A (en) | 2015-01-06 | 2015-01-06 | Distributed task scheduling apparatus and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105824699A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106776462A (en) * | 2017-01-06 | 2017-05-31 | 河南工程学院 | A kind of computer and its operating method with multiprocessor |
| CN107291538A (en) * | 2017-06-14 | 2017-10-24 | 中国人民解放军信息工程大学 | The mimicry cloud construction method of oriented mission and the method for scheduling task based on mimicry cloud, device, system |
| CN109976902A (en) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | Task processing method, system, electronic equipment and computer-readable medium |
| CN111045807A (en) * | 2019-12-17 | 2020-04-21 | 深圳前海环融联易信息科技服务有限公司 | Zookeeper task processing method and device, computer equipment and storage medium |
| CN111459666A (en) * | 2020-03-26 | 2020-07-28 | 北京金山云网络技术有限公司 | Task dispatching method and device, task execution system and server |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6584489B1 (en) * | 1995-12-07 | 2003-06-24 | Microsoft Corporation | Method and system for scheduling the use of a computer system resource using a resource planner and a resource provider |
| CN101004743A (en) * | 2006-01-21 | 2007-07-25 | 鸿富锦精密工业（深圳）有限公司 | Distribution type file conversion system and method |
| CN101359295A (en) * | 2007-08-01 | 2009-02-04 | 阿里巴巴集团控股有限公司 | Batch task scheduling and allocating method and system |
| CN101464810A (en) * | 2008-12-31 | 2009-06-24 | 金蝶软件（中国）有限公司 | Service program processing method and server |
| US20110231856A1 (en) * | 2010-03-16 | 2011-09-22 | Samsung Electronics Co., Ltd | System and method for dynamically managing tasks for data parallel processing on multi-core system |
-
2015
- 2015-01-06 CN CN201510005025.5A patent/CN105824699A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6584489B1 (en) * | 1995-12-07 | 2003-06-24 | Microsoft Corporation | Method and system for scheduling the use of a computer system resource using a resource planner and a resource provider |
| CN101004743A (en) * | 2006-01-21 | 2007-07-25 | 鸿富锦精密工业（深圳）有限公司 | Distribution type file conversion system and method |
| CN101359295A (en) * | 2007-08-01 | 2009-02-04 | 阿里巴巴集团控股有限公司 | Batch task scheduling and allocating method and system |
| CN101464810A (en) * | 2008-12-31 | 2009-06-24 | 金蝶软件（中国）有限公司 | Service program processing method and server |
| US20110231856A1 (en) * | 2010-03-16 | 2011-09-22 | Samsung Electronics Co., Ltd | System and method for dynamically managing tasks for data parallel processing on multi-core system |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106776462A (en) * | 2017-01-06 | 2017-05-31 | 河南工程学院 | A kind of computer and its operating method with multiprocessor |
| CN106776462B (en) * | 2017-01-06 | 2021-04-30 | 河南工程学院 | Computer with multiple processors and operation method thereof |
| CN107291538A (en) * | 2017-06-14 | 2017-10-24 | 中国人民解放军信息工程大学 | The mimicry cloud construction method of oriented mission and the method for scheduling task based on mimicry cloud, device, system |
| CN107291538B (en) * | 2017-06-14 | 2020-08-21 | 中国人民解放军信息工程大学 | Mimicry cloud construction method for tasks and task scheduling method, device and system based on mimicry cloud |
| CN109976902A (en) * | 2017-12-28 | 2019-07-05 | 北京京东尚科信息技术有限公司 | Task processing method, system, electronic equipment and computer-readable medium |
| CN111045807A (en) * | 2019-12-17 | 2020-04-21 | 深圳前海环融联易信息科技服务有限公司 | Zookeeper task processing method and device, computer equipment and storage medium |
| CN111045807B (en) * | 2019-12-17 | 2024-05-14 | 深圳前海环融联易信息科技服务有限公司 | Method, device, computer equipment and storage medium for processing task based on zookeeper |
| CN111459666A (en) * | 2020-03-26 | 2020-07-28 | 北京金山云网络技术有限公司 | Task dispatching method and device, task execution system and server |
| WO2021190088A1 (en) * | 2020-03-26 | 2021-09-30 | 北京金山云网络技术有限公司 | Task distribution method and apparatus, and task execution system and server |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105824699A (en) | Distributed task scheduling apparatus and method | |
| CN107241281B (en) | Data processing method and device | |
| CN105760234A (en) | Thread pool management method and device | |
| CN106817408B (en) | Distributed server cluster scheduling method and device | |
| CN107832143B (en) | Method and device for processing physical machine resources | |
| CN104699542A (en) | Task processing method and system | |
| CN109766172B (en) | Asynchronous task scheduling method and device | |
| CN112114950A (en) | Task scheduling method and device and cluster management system | |
| CN104750690A (en) | Query processing method, device and system | |
| CN107818012B (en) | Data processing method and device and electronic equipment | |
| CN105871580A (en) | Cross-cluster automation dispatching operation system and method | |
| CN107515781B (en) | Deterministic task scheduling and load balancing system based on multiple processors | |
| CN111260240B (en) | Task allocation method and device | |
| CN111045811A (en) | Task allocation method and device, electronic equipment and storage medium | |
| CN110471774A (en) | A kind of data processing method and device based on unified task schedule | |
| CN112463395A (en) | Resource allocation method, device, equipment and readable storage medium | |
| CN116166395A (en) | Task scheduling method, device, medium and electronic equipment | |
| CN114625533A (en) | Distributed task scheduling method and device, electronic equipment and storage medium | |
| WO2021197477A1 (en) | Device scheduling method and apparatus for high-bay warehouse | |
| CN111143063B (en) | Task resource reservation method and device | |
| CN113326025A (en) | Single cluster remote continuous release method and device | |
| CN112486638A (en) | Method, apparatus, device and storage medium for executing processing task | |
| CN115170026A (en) | Task processing method and device | |
| CN105700949A (en) | Data processing method and device based on multi-core processor | |
| CN115658292A (en) | Resource scheduling method, device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20160803 |