CN105808333A - Task distribution method and system - Google Patents
Task distribution method and system Download PDFInfo
- Publication number
- CN105808333A CN105808333A CN201610121630.3A CN201610121630A CN105808333A CN 105808333 A CN105808333 A CN 105808333A CN 201610121630 A CN201610121630 A CN 201610121630A CN 105808333 A CN105808333 A CN 105808333A
- Authority
- CN
- China
- Prior art keywords
- task
- distribution
- executor
- request
- allocation rule
- 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
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
Abstract
The invention provides a task distribution method and system. According to the method, expandable distribution information is stored, wherein the distribution information comprises distribution types, distribution rules and executers, each distribution type corresponds to at least one distribution rule and each distribution rule corresponds to at least one executer. The method comprises the following steps: S1, obtaining a task distribution request, wherein the task distribution request comprises a to-be-distributed task and a unique ID number; S2, matching a distribution type in the distribution information according to the to-be-distributed task; S3, matching the to-be-distributed task with a distribution rule corresponding to the matched distribution type, and entering step S4 if the matching is successful; S4, sending the task distribution request to an executer corresponding to the distribution rule successfully matched with the to-be-matched task. The method and system have universality and can be used for distributing to-be-distributed tasks to corresponding executers according to the distribution types and the distribution rules.
Description
Technical field
The present invention relates to a kind of method for allocating tasks and system.
Background technology
Refer to that the property value according to task assigns the task to the main body specified and gone containing semantic task distribution.Such as task T, it has attribute P1 and P2, distributes to main body S1 as P1=1, distributes to main body S2 as P2=2.Task distribution system such as MicrosoftASP.NETMVC (the ASP.NETWeb application framework based on MVC pattern that official of Microsoft provides that there is currently, wherein, MVC is the one in three kinds of ASP.NET programming modes) in use Route (route) be exactly different task requests is distributed to concrete executor go execution.
Currently, with corresponding business model close-coupled more than the realization of distribution task, its allocation rule is excessively simple and can not or be difficult to change, usually allocation rule is fixing, if needing new allocation rule, then needing new allocator, it is impossible to change behavior during distribution, such as the function such as the distribution of allocation strategy, viscous and associated allocation is unreliable.Visible, current task distribution system can not or be difficult to change allocation rule, it is impossible to or be difficult to add or amendment distribution type, it is impossible to or be difficult to change assigning process.
Summary of the invention
The technical problem to be solved in the present invention is that the allocation rule in order to overcome task distribution system of the prior art to adopt is excessively simple and allocation rule fixes the defect causing that existing system flexibility is poor, do not have versatility, it is provided that one method for allocating tasks and system.
The present invention solves above-mentioned technical problem by following technical proposals:
The present invention provides a kind of method for allocating tasks, it is characterized in that, its storage has extendible distribution information, this distribution information includes distribution type, allocation rule and executor, the corresponding at least one allocation rule of each distribution type, the corresponding at least one executor of each allocation rule, it comprises the following steps:
S1, obtain one task distribution request, this task allocation request packet draws together task to be allocated and unique ID (identification) number；
S2, mate the distribution type in this distribution information according to this task to be allocated；
S3, the allocation rule that this task to be allocated is corresponding with the distribution type matched is mated, if the match is successful, enter step S4；
S4, the distribution request of this task is sent executor corresponding to allocation rule to this Mission Success to be allocated coupling.
In this programme, user can update allocation rule at any time, adds or reduces distribution type and executor's main body, namely distributing type, allocation rule and executor and be extendible.
If it is preferred that it fails to match, enter step S5: the display one task distribution failure information containing the distribution request of this task.
It is preferred that set allocation rule corresponding to this distribution type matched as N number of, i=1, step S3Including:
S31, generate an assignment expression according to this task to be allocated and i-th allocation rule；
S32, the result of calculation that judges this assignment expression whether be true, if very then entering step S4, otherwise enter step S33；
S33, judge whether i < N, if then i=i+1, and again perform S31。
It is preferred that this distribution information also includes allocation strategy, the corresponding allocation strategy of each distribution type, in step S4In, according to this allocation strategy, the distribution request of this task is sent to the executor of this correspondence.
It is preferred that in step S1Include afterwards:
Judging whether the distribution request of this task was once assigned with, if then sending the distribution request of this task to the executor being once assigned with, otherwise entering step S2。
It is preferred that the distribution request of this task also includes relating attribute, in step S1Include afterwards:
Judge that whether this relating attribute is identical with the relating attribute in a certain task distribution request distributed before, if then by executor corresponding for this task distribution request transmission to this task distribution request distributed before, otherwise entrance step S2。
The present invention also provides for a kind of task distribution system, it is characterized in that, its storage has extendible distribution information, this distribution information includes distribution type, allocation rule and executor, the corresponding at least one allocation rule of each distribution type, the corresponding at least one executor of each allocation rule, this task distribution system includes:
One acquisition module, is used for obtaining a task distribution request, and this task allocation request packet draws together task to be allocated and unique No. ID；
One first matching module, for mating the distribution type in this distribution information according to this task to be allocated；
One second matching module, for the allocation rule that this task to be allocated is corresponding with the distribution type matched being mated, calls one first sending module when the match is successful；
This first sending module is for by executor corresponding for this task distribution request transmission to the allocation rule of this Mission Success to be allocated coupling.
It is preferred that this task distribution system also includes a display module, this display module for showing a task distribution failure information containing the distribution request of this task when it fails to match.
It is preferred that set allocation rule corresponding to this distribution type matched as N number of, i=1, this second matching module includes a generation unit, one first judging unit and one second judging unit；
This generation unit is for generating an assignment expression according to this task to be allocated and i-th allocation rule；
Whether this first judging unit is true for judging the result of calculation of this assignment expression, this the first sending module is being called for true time, otherwise call this second judge module and judge whether i < N, if then i=i+1, and again call this generation unit.
It is preferred that this distribution information also includes allocation strategy, the corresponding allocation strategy of each distribution type, this first sending module is for sending to the executor of this correspondence according to this allocation strategy by the distribution request of this task.
It is preferred that this task distribution system also includes one the 3rd judge module and one second sending module；
3rd judge module is used for judging whether the distribution request of this task was once assigned with, and sending the distribution request of this task to the executor being once assigned with if then calling this second sending module, otherwise calling this first matching module.
It is preferred that the distribution request of this task also includes relating attribute, this task distribution system also includes one the 4th judge module and one the 3rd sending module；
4th judge module is for judging that whether this relating attribute is identical with the relating attribute in a certain task distribution request distributed before, if then calling the 3rd sending module the distribution request of this task is sent the executor that this task distribution request extremely distributed before is corresponding, otherwise call this first matching module.
Meeting on the basis of this area general knowledge, above-mentioned each optimum condition, can combination in any, obtain the preferred embodiments of the invention.
The actively progressive effect of the present invention is in that:
The method for allocating tasks of the present invention and system, have versatility, it is possible to according to distributing type and allocation rule, task to be allocated is distributed to corresponding executor.
Accompanying drawing explanation
Fig. 1 is the flow chart of the method for allocating tasks of present pre-ferred embodiments.
Fig. 2 is the structured flowchart of the task distribution system of present pre-ferred embodiments.
Detailed description of the invention
Mode by the examples below further illustrates the present invention, but does not therefore limit the present invention among described scope of embodiments.
The present embodiment provides a kind of method for allocating tasks, its storage has extendible distribution information, this distribution information includes distribution type, allocation rule, executor and allocation strategy, namely it is all extendible for distributing type, allocation rule, executor and allocation strategy, wherein, the corresponding allocation strategy of each distribution type, the corresponding at least one allocation rule of each distribution type, the corresponding at least one executor of each allocation rule.
As it is shown in figure 1, this method for allocating tasks comprises the following steps:
Step 101, the task that obtains distribute request, and this task allocation request packet draws together task to be allocated, unique No. ID and relating attribute；
Step 102, mate the distribution type in this distribution information according to this task to be allocated；
Step 103, the allocation rule that this task to be allocated is corresponding with the distribution type matched is mated, if the match is successful, enter step 104, if it fails to match, enter step 105；
Step 104, the distribution request of this task sent to the executor corresponding to allocation rule of this Mission Success to be allocated coupling according to this allocation strategy, process ends；
Step 105, the display one task distribution failure information containing the distribution request of this task, process ends.
Wherein, if allocation rule corresponding to this distribution type matched is N number of, i=1, step 103 includes:
S31, generate an assignment expression according to this task to be allocated and i-th allocation rule,；
S32, the result of calculation that judges this assignment expression whether be true, if very then entering step 104, otherwise enter step S33；
S33, judge whether i < N, if then i=i+1, and again perform S31。
In addition, this method for allocating tasks also includes viscous assigning process and associated allocation process, wherein viscous assigning process includes judging whether the distribution request of this task was once assigned with, if then sending the distribution request of this task to the executor being once assigned with, otherwise enters step 102.
Associated allocation process includes judging that whether this relating attribute is identical with the relating attribute in a certain task distribution request distributed before, if then by executor corresponding for this task distribution request transmission to this task distribution request distributed before, otherwise entrance step 102.
The present embodiment also provides for a kind of task distribution system, its storage has extendible distribution information, this distribution information includes distribution type, allocation rule, executor and allocation strategy, the corresponding allocation strategy of each distribution type, the corresponding at least one allocation rule of each distribution type, the corresponding at least one executor of each allocation rule.
As in figure 2 it is shown, this task distribution system includes acquisition module 1,1 first matching module 2,1 second matching module 3,1 first sending module 4, display module 5, the 3rd judge module 6,1 second sending module 7, the 4th judge module 8 and one the 3rd sending module 9.
This acquisition module 1 is used for obtaining a task distribution request, and this task allocation request packet draws together task to be allocated, unique No. ID and relating attribute.
This first matching module 2 is for mating the distribution type in this distribution information according to this task to be allocated.
This second matching module 3, for the allocation rule that this task to be allocated is corresponding with the distribution type matched being mated, calls this first sending module 4 when the match is successful.
This first sending module 4 is used in executor corresponding for this task distribution request transmission to the allocation rule of this Mission Success to be allocated coupling according to this allocation strategy.
This display module 5 for showing a task distribution failure information containing the distribution request of this task when it fails to match.
3rd judge module 6 is used for judging whether the distribution request of this task was once assigned with, and sending the distribution request of this task to the executor being once assigned with if then calling this second sending module 7, otherwise calling this first matching module.
4th judge module 8 is for judging that whether this relating attribute is identical with the relating attribute in a certain task distribution request distributed before, if then calling the 3rd sending module 9 the distribution request of this task is sent the executor that this task distribution request extremely distributed before is corresponding, otherwise call this first matching module.
Wherein, if allocation rule corresponding to this distribution type matched is N number of, i=1, this second matching module 3 includes a generation unit, one first judging unit and one second judging unit.
This generation unit is for generating an assignment expression according to this task to be allocated and i-th allocation rule；Whether this first judging unit is true for judging the result of calculation of this assignment expression, this the first sending module is being called for true time, otherwise call this second judge module and judge whether i < N, if then i=i+1, and again call this generation unit.
In order to enable those skilled in the art to be more fully understood that the present embodiment, name a specific example and illustrate:
If distribution type includes air ticket, train ticket and hotel, distribution type " air ticket " is to there being 5 allocation rule, wherein first allocation rule is (p1=1) && (p2=3), second allocation rule be (p1=2) && (p2=4), wherein " p1 " represents domestic/international, and numerical value " 1 " represents domestic, numerical value " 2 " represents the world, p2 represents urgent/not urgent, and numerical value " 3 " represents urgent, and numerical value " 4 " represents not urgent.
Obtaining a task distribution request, this task allocation request packet draws together task to be allocated (namely buying the not urgent air ticket in the world) and unique No. ID, is air ticket according to this task to be allocated this distribution type known；The allocation rule (i.e. above-mentioned 5 allocation rule) that this task to be allocated is corresponding with distribution type " air ticket " is mated, owing to this task to be allocated is international, not urgent, then p1=2, p2=4, the assignment expression thus generated is (2=1) && (4=3), the result of calculation of this assignment expression is false, then use second allocation rule, the assignment expression generated is (1=1) && (3=3), the result of calculation of this assignment expression is true, then by executor corresponding for this task distribution request transmission to second allocation rule.
Although the foregoing describing the specific embodiment of the present invention, it will be appreciated by those of skill in the art that these are merely illustrative of, protection scope of the present invention is defined by the appended claims.Those skilled in the art is under the premise without departing substantially from principles of the invention and essence, it is possible to these embodiments are made various changes or modifications, but these change and amendment each falls within protection scope of the present invention.
Claims (12)
1. a method for allocating tasks, it is characterised in that its storage has extendible distribution information, this distribution information includes distribution type, allocation rule and executor, the corresponding at least one allocation rule of each distribution type, the corresponding at least one executor of each allocation rule, it comprises the following steps:
S1, obtain one task distribution request, this task allocation request packet draws together task to be allocated and unique No. ID；
S2, mate the distribution type in this distribution information according to this task to be allocated；
S3, the allocation rule that this task to be allocated is corresponding with the distribution type matched is mated, if the match is successful, enter step S4；
S4, the distribution request of this task is sent executor corresponding to allocation rule to this Mission Success to be allocated coupling.
2. method for allocating tasks as claimed in claim 1, it is characterised in that if it fails to match, enter step S5: the display one task distribution failure information containing the distribution request of this task.
3. method for allocating tasks as claimed in claim 1, it is characterised in that set allocation rule corresponding to this distribution type matched as N number of, i=1, step S3Including:
S31, generate an assignment expression according to this task to be allocated and i-th allocation rule,；
S32, the result of calculation that judges this assignment expression whether be true, if very then entering step S4, otherwise enter step S33；
S33, judge whether i < N, if then i=i+1, and again perform S31。
4. method for allocating tasks as claimed in claim 1, it is characterised in that this distribution information also includes allocation strategy, the corresponding allocation strategy of each distribution type, in step S4In, according to this allocation strategy, the distribution request of this task is sent to the executor of this correspondence.
5. method for allocating tasks as claimed in claim 1, it is characterised in that in step S1Include afterwards:
Judging whether the distribution request of this task was once assigned with, if then sending the distribution request of this task to the executor being once assigned with, otherwise entering step S2。
6. method for allocating tasks as claimed in claim 1, it is characterised in that the distribution request of this task also includes relating attribute, in step S1Include afterwards:
Judge that whether this relating attribute is identical with the relating attribute in a certain task distribution request distributed before, if then by executor corresponding for this task distribution request transmission to this task distribution request distributed before, otherwise entrance step S2。
7. a task distribution system, it is characterised in that its storage has extendible distribution information, this distribution information includes distribution type, allocation rule and executor, the corresponding at least one allocation rule of each distribution type, the corresponding at least one executor of each allocation rule, this task distribution system includes:
One acquisition module, is used for obtaining a task distribution request, and this task allocation request packet draws together task to be allocated and unique No. ID；
One first matching module, for mating the distribution type in this distribution information according to this task to be allocated；
One second matching module, for the allocation rule that this task to be allocated is corresponding with the distribution type matched being mated, calls one first sending module when the match is successful；
This first sending module is for by executor corresponding for this task distribution request transmission to the allocation rule of this Mission Success to be allocated coupling.
8. task distribution system as claimed in claim 7, it is characterised in that this task distribution system also includes a display module, this display module for showing a task distribution failure information containing the distribution request of this task when it fails to match.
9. task distribution system as claimed in claim 7, it is characterised in that setting allocation rule corresponding to this distribution type matched as N number of, i=1, this second matching module includes a generation unit, one first judging unit and one second judging unit；
This generation unit is for generating an assignment expression according to this task to be allocated and i-th allocation rule；
Whether this first judging unit is true for judging the result of calculation of this assignment expression, this the first sending module is being called for true time, otherwise call this second judge module and judge whether i < N, if then i=i+1, and again call this generation unit.
10. task distribution system as claimed in claim 7, it is characterized in that, this distribution information also includes allocation strategy, the corresponding allocation strategy of each distribution type, and this first sending module is for sending to the executor of this correspondence according to this allocation strategy by the distribution request of this task.
11. task distribution system as claimed in claim 7, it is characterised in that this task distribution system also includes one the 3rd judge module and one second sending module；
3rd judge module is used for judging whether the distribution request of this task was once assigned with, and sending the distribution request of this task to the executor being once assigned with if then calling this second sending module, otherwise calling this first matching module.
12. task distribution system as claimed in claim 7, it is characterised in that the distribution request of this task also includes relating attribute, and this task distribution system also includes one the 4th judge module and one the 3rd sending module；
4th judge module is for judging that whether this relating attribute is identical with the relating attribute in a certain task distribution request distributed before, if then calling the 3rd sending module the distribution request of this task is sent the executor that this task distribution request extremely distributed before is corresponding, otherwise call this first matching module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610121630.3A CN105808333B (en) | 2016-03-04 | 2016-03-04 | Method for allocating tasks and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610121630.3A CN105808333B (en) | 2016-03-04 | 2016-03-04 | Method for allocating tasks and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105808333A true CN105808333A (en) | 2016-07-27 |
| CN105808333B CN105808333B (en) | 2019-07-26 |
Family
ID=56466393
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610121630.3A Active CN105808333B (en) | 2016-03-04 | 2016-03-04 | Method for allocating tasks and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105808333B (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106601034A (en) * | 2016-11-22 | 2017-04-26 | 成都民航空管科技发展有限公司 | ATC-system-based flight runway distribution method and device |
| CN107067128A (en) * | 2016-12-08 | 2017-08-18 | 阿里巴巴集团控股有限公司 | Task quality detecting method, the method and device for determining dereferenced user |
| CN107169639A (en) * | 2017-04-27 | 2017-09-15 | 北京云测信息技术有限公司 | A kind of test assignment distribution method and device |
| CN107220750A (en) * | 2017-05-15 | 2017-09-29 | 泰康保险集团股份有限公司 | Document classifying method and device |
| CN107562546A (en) * | 2017-09-18 | 2018-01-09 | 上海量明科技发展有限公司 | Method for allocating tasks, device and JICQ |
| CN107742178A (en) * | 2017-09-18 | 2018-02-27 | 上海量明科技发展有限公司 | Task quantifies method and device |
| CN107767007A (en) * | 2016-09-05 | 2018-03-06 | 北京三快在线科技有限公司 | Method for allocating tasks and device |
| CN107784418A (en) * | 2016-11-14 | 2018-03-09 | 平安科技（深圳）有限公司 | List data distribution method and device |
| CN108197776A (en) * | 2017-12-12 | 2018-06-22 | 链家网（北京）科技有限公司 | A kind of method for allocating tasks and device |
| CN108197778A (en) * | 2017-12-15 | 2018-06-22 | 远光软件股份有限公司 | A kind of method for allocating tasks and device |
| CN108197808A (en) * | 2017-12-29 | 2018-06-22 | 广东溢达纺织有限公司 | Production task distribution method, device and system |
| CN109002355A (en) * | 2018-06-06 | 2018-12-14 | 阿里巴巴集团控股有限公司 | Handle distribution method, device and the equipment of request |
| CN110162386A (en) * | 2019-04-04 | 2019-08-23 | 口碑(上海)信息技术有限公司 | A kind of mission dispatching method and device |
| CN111190739A (en) * | 2019-12-31 | 2020-05-22 | 西安翔腾微电子科技有限公司 | Resource allocation method and device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070129983A1 (en) * | 2005-12-01 | 2007-06-07 | Siemens Medical Solutions Health Services Corporation | Task and Workflow Management System for Healthcare and other Applications |
| CN102541652A (en) * | 2010-12-09 | 2012-07-04 | 上海杉达学院 | Service dispatching method of cluster system |
| CN103795804A (en) * | 2014-02-24 | 2014-05-14 | 华为技术有限公司 | Storage resource scheduling method and storage calculation system |
| CN104765643A (en) * | 2015-03-25 | 2015-07-08 | 华迪计算机集团有限公司 | Method and system for achieving hybrid scheduling of cloud computing resources |
| CN104765641A (en) * | 2014-01-02 | 2015-07-08 | 中国移动通信集团安徽有限公司 | Job scheduling method and system |
-
2016
- 2016-03-04 CN CN201610121630.3A patent/CN105808333B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070129983A1 (en) * | 2005-12-01 | 2007-06-07 | Siemens Medical Solutions Health Services Corporation | Task and Workflow Management System for Healthcare and other Applications |
| CN102541652A (en) * | 2010-12-09 | 2012-07-04 | 上海杉达学院 | Service dispatching method of cluster system |
| CN104765641A (en) * | 2014-01-02 | 2015-07-08 | 中国移动通信集团安徽有限公司 | Job scheduling method and system |
| CN103795804A (en) * | 2014-02-24 | 2014-05-14 | 华为技术有限公司 | Storage resource scheduling method and storage calculation system |
| CN104765643A (en) * | 2015-03-25 | 2015-07-08 | 华迪计算机集团有限公司 | Method and system for achieving hybrid scheduling of cloud computing resources |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107767007A (en) * | 2016-09-05 | 2018-03-06 | 北京三快在线科技有限公司 | Method for allocating tasks and device |
| CN107784418B (en) * | 2016-11-14 | 2020-11-03 | 平安科技（深圳）有限公司 | List data distribution method and device |
| CN107784418A (en) * | 2016-11-14 | 2018-03-09 | 平安科技（深圳）有限公司 | List data distribution method and device |
| CN106601034B (en) * | 2016-11-22 | 2019-08-02 | 成都民航空管科技发展有限公司 | Flight runway assignment method and device based on ATC system |
| CN106601034A (en) * | 2016-11-22 | 2017-04-26 | 成都民航空管科技发展有限公司 | ATC-system-based flight runway distribution method and device |
| CN107067128A (en) * | 2016-12-08 | 2017-08-18 | 阿里巴巴集团控股有限公司 | Task quality detecting method, the method and device for determining dereferenced user |
| CN107169639A (en) * | 2017-04-27 | 2017-09-15 | 北京云测信息技术有限公司 | A kind of test assignment distribution method and device |
| CN107220750A (en) * | 2017-05-15 | 2017-09-29 | 泰康保险集团股份有限公司 | Document classifying method and device |
| CN107562546B (en) * | 2017-09-18 | 2020-06-16 | 上海量明科技发展有限公司 | Task allocation method and device and instant messaging tool |
| CN107742178A (en) * | 2017-09-18 | 2018-02-27 | 上海量明科技发展有限公司 | Task quantifies method and device |
| CN107562546A (en) * | 2017-09-18 | 2018-01-09 | 上海量明科技发展有限公司 | Method for allocating tasks, device and JICQ |
| CN108197776A (en) * | 2017-12-12 | 2018-06-22 | 链家网（北京）科技有限公司 | A kind of method for allocating tasks and device |
| CN108197778A (en) * | 2017-12-15 | 2018-06-22 | 远光软件股份有限公司 | A kind of method for allocating tasks and device |
| CN108197808A (en) * | 2017-12-29 | 2018-06-22 | 广东溢达纺织有限公司 | Production task distribution method, device and system |
| CN108197808B (en) * | 2017-12-29 | 2023-10-20 | 广东溢达纺织有限公司 | Production task distribution method, device and system |
| CN109002355A (en) * | 2018-06-06 | 2018-12-14 | 阿里巴巴集团控股有限公司 | Handle distribution method, device and the equipment of request |
| CN109002355B (en) * | 2018-06-06 | 2022-04-05 | 创新先进技术有限公司 | Distribution method, device and equipment for processing requests |
| CN110162386A (en) * | 2019-04-04 | 2019-08-23 | 口碑(上海)信息技术有限公司 | A kind of mission dispatching method and device |
| CN110162386B (en) * | 2019-04-04 | 2021-05-18 | 口碑(上海)信息技术有限公司 | Task issuing method and device |
| CN111190739A (en) * | 2019-12-31 | 2020-05-22 | 西安翔腾微电子科技有限公司 | Resource allocation method and device, electronic equipment and storage medium |
| CN111190739B (en) * | 2019-12-31 | 2023-09-01 | 西安翔腾微电子科技有限公司 | Resource allocation method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105808333B (en) | 2019-07-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105808333A (en) | Task distribution method and system | |
| EP3678358B1 (en) | Api hybrid multi-tenant routing method, system, and api gateway | |
| CN106055381B (en) | A kind of method and apparatus creating virtual machine | |
| US20070050227A1 (en) | Automated workflow composable action model | |
| CN109189856A (en) | Distributed data base service management, device, server and storage medium | |
| CN109886693B (en) | Consensus realization method, device, equipment and medium for block chain system | |
| CN110557416B (en) | Multi-node collaborative blocking method and system | |
| CN106301772A (en) | Cipher set-up method, device and for arranging the device of password | |
| CN106648900A (en) | Smart television-based supercomputing method and system | |
| US7730093B2 (en) | Method for controlling access to the resources of a data processing system, data processing system, and computer program | |
| CN105376309B (en) | Access gateway allocation method and device | |
| US9542161B2 (en) | Method and system for generating a source code for a computer program for execution and simulation of a process | |
| Hunsberger | Group decision making and temporal reasoning | |
| CN104063451B (en) | A kind of database connection management method and system | |
| CN112003931B (en) | Method and system for deploying scheduling controller and related components | |
| CN113194012A (en) | Multi-agent management method, framework, equipment and storage medium based on Internet of things | |
| CN110544159B (en) | Map information processing method and device, readable storage medium and electronic equipment | |
| CN108156194A (en) | A kind of form data processing method | |
| CN111611081B (en) | Request method, request device, computer equipment and storage medium | |
| CN107122362A (en) | Cloud database resource extends the method and system with service extension | |
| Graw et al. | Distributed modeling and distributed enaction of business processes | |
| CN112328532B (en) | Method and device for multi-GPU communication, storage medium and electronic device | |
| Hackmann et al. | Mobiwork: mobile workflow for manets | |
| CN113419839A (en) | Resource scheduling method and device for multi-type jobs, electronic equipment and storage medium | |
| CN113722729A (en) | Authority management method, device, terminal, server 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |