CN107832135A - A kind of method for allocating tasks and terminal - Google Patents
A kind of method for allocating tasks and terminal Download PDFInfo
- Publication number
- CN107832135A CN107832135A CN201711203025.1A CN201711203025A CN107832135A CN 107832135 A CN107832135 A CN 107832135A CN 201711203025 A CN201711203025 A CN 201711203025A CN 107832135 A CN107832135 A CN 107832135A
- Authority
- CN
- China
- Prior art keywords
- packet
- value
- parameter
- subtask
- obtains
- 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
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 present invention relates to data processing field, more particularly to a kind of method for allocating tasks and terminal.More than one task order that the present invention is received by obtaining in same time interval；The task order includes more than one subtask；Identical subtask in one above task order is divided to same packet, obtains grouping set；Parameter preset set；The parameter sets include being grouped included subtask number parameter and packet creation time parameter；According to the weighted value of each packet of parameter value calculation of the parameter sets corresponding with each packet in the grouping set；The order being performed according to each packet of the weighted value of each packet arrangement.Realize the average response time for shortening received task order in a period of time.
Description
Technical field
The present invention relates to data processing field, more particularly to a kind of method for allocating tasks and terminal.
Background technology
The patent document of Application No. 201610121630.3 provides a kind of method for allocating tasks and system, and it is stored with can
The distribution information of extension, the distribution information include distribution type, allocation rule and executor, each distribution type corresponding at least one
Allocation rule, the corresponding at least executor of each allocation rule, it includes：S1, obtain a task distribution request, task distribution
Request includes task to be allocated and unique ID number；S2, the distribution type in the distribution information matched according to the task to be allocated；
S3, the task to be allocated allocation rule corresponding with the distribution type that this is matched matched, entered if the match is successful
Step S4；S4, the task distribution request is sent to executor corresponding to the allocation rule matched to the Mission Success to be allocated.Tool
There is versatility, task to be allocated can be distributed to by corresponding executor according to distribution type and allocation rule.
But when same executor is when need to performing for task is more, executor can only according to received task according to
The secondary subtask for performing each task and including, cause to be arranged in the response time length of task rearward.
The content of the invention
The technical problems to be solved by the invention are：How the average sound of a period of time in received task order is shortened
Between seasonable.
In order to solve the above-mentioned technical problem, the technical solution adopted by the present invention is：
The present invention provides a kind of method for allocating tasks, including：
Obtain more than one the task order received in same time interval；The task order includes more than one son
Task；
Identical subtask in one above task order is divided to same packet, obtains grouping set；
Parameter preset set；The parameter sets include being grouped included subtask number parameter and packet creation time
Parameter；
According to each packet of parameter value calculation of the parameter sets corresponding with each packet in the grouping set
Weighted value；
The order being performed according to each packet of the weighted value of each packet arrangement.
The present invention also provides a kind of task distribution terminal, including one or more processors and memory, the memory
Have program stored therein, and be configured to by one or more of computing device following steps：
Obtain more than one the task order received in same time interval；The task order includes more than one son
Task；
Identical subtask in one above task order is divided to same packet, obtains grouping set；
Parameter preset set；The parameter sets include being grouped included subtask number parameter and packet creation time
Parameter；
According to each packet of parameter value calculation of the parameter sets corresponding with each packet in the grouping set
Weighted value；
According to the weighted value of each packet, each order for being grouped and being performed is arranged.
The beneficial effects of the present invention are：In multiple tasks order of the invention by will be received in same time interval
Identical subtask is divided to same packet, and the Time alignment point that the subtask quantity in each packet and packet create
The execution sequence of group so that executor can preferentially disposable batch quantity performed be more and task receives time identical earlier
Subtask, when the subtask of a packet is finished, receive in same time interval comprising the son in described one packet
The task order of task can obtain feedback information, when shortening the average response of the task order received in a period
Between.Also, executor performs specific task by packet, the subtask included in each packet is identical, is advantageous to raising and holds
The operating efficiency of passerby, so as to further shorten the average response time of task order.
Brief description of the drawings
Fig. 1 is a kind of FB(flow block) of the embodiment of method for allocating tasks provided by the invention；
Fig. 2 is a kind of structured flowchart of the embodiment of task distribution terminal provided by the invention；
Label declaration：
1st, processor；2nd, memory.
Embodiment
To describe the technology contents of the present invention, the objects and the effects in detail, below in conjunction with embodiment and coordinate attached
Figure is explained.
Fig. 1 and Fig. 2 is refer to,
As shown in figure 1, the present invention provides a kind of method for allocating tasks, including：
Obtain more than one the task order received in same time interval；The task order includes more than one son
Task；
Identical subtask in one above task order is divided to same packet, obtains grouping set；
Parameter preset set；The parameter sets include being grouped included subtask number parameter and packet creation time
Parameter；
According to each packet of parameter value calculation of the parameter sets corresponding with each packet in the grouping set
Weighted value；
The order being performed according to each packet of the weighted value of each packet arrangement.
Further, it is every according to the parameter value calculation of the parameter sets corresponding with each packet in the grouping set
The weighted value of one packet, it is specially：
S1, a packet is obtained from the grouping set；
S2, the value for obtaining each parameter in the parameter sets corresponding with described one packet, obtain set of parameter values；
S3, described one weighted value being grouped is calculated according to the set of parameter values；
S4, step S1 to S4 is repeated, until the grouping set is traversed.
Further, the S3 is specially：
The value for being grouped creation time parameter corresponding with described one packet is obtained from the set of parameter values, during establishment
Between；The creation time is timestamp；
The creation time is subtracted 1,000,000, obtains the first parameter value；
The value of the included subtask number parameter of packet corresponding with described one packet is obtained from the parameter sets,
Obtain subtask number；
The subtask number is multiplied by 10,000, obtains the second parameter value；
According to first parameter value and second parameter value and, obtain described one weighted value being grouped.
Seen from the above description, the more expressions of subtask quantity in packet have more orders after packet is performed
Task receives feedback information, and the more early explanation of creation time receives the more early of task order corresponding with subtask, these tasks
The stand-by period of order is longer, needs timely processing.Therefore, according to the subtask quantity and packet creation time included in a packet
The weighted value that sequencing is performed for arranging is calculated, is advantageous to shorten the average sound of received task order in a period of time
Between seasonable.
Further, according to first parameter value and second parameter value and, obtain described one weight being grouped
Value, it is specially：
The parameter sets also include subtask difficult parameters；
The value of subtask difficult parameters corresponding with described one packet is obtained from the parameter sets, obtains difficulty value；
Difficult, neutralization that the difficulty value includes is easily；
The sum of first parameter value and second parameter value is calculated, obtains the 3rd parameter value；
When the difficulty value is difficult, the 3rd parameter value is subtracted 100,000, obtains the weighted value of a packet；
When the difficulty value is middle, the 3rd parameter value is subtracted 50,000, obtains the weighted value of a packet；
When the difficulty value is easy, the weighted value that the 3rd parameter value is described one packet is set.
Seen from the above description, the time spent by the more big then completion subtask of the difficulty value that subtask is completed is more, this
Subtask during invention considers the complexity completed subtask, task order reception time corresponding with subtask and is grouped
Quantity, be advantageous to shorten a period of time in task order average response time.
Further, it is characterised in that also include：
Default two or more task distribution platform；
Use data corresponding with subtask in the described two above task distribution platforms of same data standard standardization；
The task order is received from described two above task distribution platforms.
Seen from the above description, by the way that the subtask data normalization in different task distribution platform is standardized so that
After task order is received, identical subtask can be accurately and quickly identified.
As shown in Fig. 2 the present invention also provides a kind of task distribution terminal, including one or more processors 1 and memory
2, the memory 2 has program stored therein, and is configured to perform following steps by one or more of processors 1：
Obtain more than one the task order received in same time interval；The task order includes more than one son
Task；
Identical subtask in one above task order is divided to same packet, obtains grouping set；
Parameter preset set；The parameter sets include being grouped included subtask number parameter and packet creation time
Parameter；
According to each packet of parameter value calculation of the parameter sets corresponding with each packet in the grouping set
Weighted value；
The order being performed according to each packet of the weighted value of each packet arrangement.
Further, it is every according to the parameter value calculation of the parameter sets corresponding with each packet in the grouping set
The weighted value of one packet, it is specially：
S1, a packet is obtained from the grouping set；
S2, the value for obtaining each parameter in the parameter sets corresponding with described one packet, obtain set of parameter values；
S3, described one weighted value being grouped is calculated according to the set of parameter values；
S4, step S1 to S4 is repeated, until the grouping set is traversed.
Further, the S3 is specially：
The value for being grouped creation time parameter corresponding with described one packet is obtained from the set of parameter values, during establishment
Between；The creation time is timestamp；
The creation time is subtracted 1,000,000, obtains the first parameter value；
The value of the included subtask number parameter of packet corresponding with described one packet is obtained from the parameter sets,
Obtain subtask number；
The subtask number is multiplied by 10,000, obtains the second parameter value；
According to first parameter value and second parameter value and, obtain described one weighted value being grouped.
Further, according to first parameter value and second parameter value and, obtain described one weight being grouped
Value, it is specially：
The parameter sets also include subtask difficult parameters；
The value of subtask difficult parameters corresponding with described one packet is obtained from the parameter sets, obtains difficulty value；
Difficult, neutralization that the difficulty value includes is easily；
The sum of first parameter value and second parameter value is calculated, obtains the 3rd parameter value；
When the difficulty value is difficult, the 3rd parameter value is subtracted 100,000, obtains the weighted value of a packet；
When the difficulty value is middle, the 3rd parameter value is subtracted 50,000, obtains the weighted value of a packet；
When the difficulty value is easy, the weighted value that the 3rd parameter value is described one packet is set.
Further, in addition to：
Default two or more task distribution platform；
Use data corresponding with subtask in the described two above task distribution platforms of same data standard standardization；
The task order is received from described two above task distribution platforms.
Embodiments of the invention one are：
The present embodiment provides a kind of method for allocating tasks, including：
S1, obtain more than one the task order received in same time interval；The task order include one with
Upper subtask.
Alternatively, two or more task distribution platform is preset；It is described two to take up an official post using the standardization of same data standard
Data corresponding with subtask in business distribution platform；The task order is received from described two above task distribution platforms.
For example, the morning 9 on November 22nd, 2017:30 to 9:During 40,3 task orders are received.Wherein, 9:31 taps
Receive order 1, the subtask in order 1 includes that Tomato omelette is a and shredded pork with green pepper is a；9:34 taps receive order
2, the subtask in order 2 includes that Tomato omelette is a, boiling live fish is a and fries water spinach portion；9:38 taps are received
To order 3, the subtask in order 3 includes two parts of boiling live fish and shredded pork with green pepper is a.
S2, identical subtask in one above task order is divided to same packet, obtains grouping set.
For example, first is grouped into 2 parts of Tomato omelette, second packet is 2 parts of shredded pork with green pepper, and the 3rd is grouped into boiling work
3 parts of fish, the 4th is grouped into and fries 1 part of water spinach.
S3, parameter preset set；The parameter sets include being grouped included subtask number parameter and packet creates
Time parameter.
S4, each packet of parameter value calculation according to the parameter sets corresponding with each packet in the grouping set
Weighted value.Specially：
S41, a packet is obtained from the grouping set；Obtain each in the parameter sets corresponding with described one packet
The value of parameter, obtains set of parameter values.
For example, set of parameter values corresponding to the first packet is：{ subtask quantity：2, it is grouped creation time：
1511314800}；Set of parameter values is corresponding to second packet：{ subtask quantity：2, it is grouped creation time：
1511314800}；3rd packet corresponding to set of parameter values be：{ subtask quantity：3, it is grouped creation time：
1511314800}；4th packet corresponding to set of parameter values be：{ subtask quantity：1, it is grouped creation time：
1511314800}.Because the present embodiment is in the morning 9 on November 22nd, 2017:40 points create aforementioned four packet, therefore above-mentioned four
The packet creation time parameter value of individual packet is and the morning 9 on November 22nd, 2017:Timestamp corresponding to 40.
S42, described one weighted value being grouped is calculated according to the set of parameter values.
Wherein, there are following two implementations in the S42 steps.
First implementation：Packet creation time parameter corresponding with described one packet is obtained from the set of parameter values
Value, creation time；The creation time is timestamp；
The creation time is subtracted 1,000,000, obtains the first parameter value；
The value of the included subtask number parameter of packet corresponding with described one packet is obtained from the parameter sets,
Obtain subtask number；
The subtask number is multiplied by 10,000, obtains the second parameter value；
According to first parameter value and second parameter value and, obtain described one weighted value being grouped.
For example, the weighted value of the first packet is：1511314800-1000000+2*10000=1510334800；Second point
Group weighted value be：1511314800-1000000+2*10000=1510334800；3rd packet weighted value be：
1511314800-1000000+3*10000=1510344800；4th packet weighted value be：1511314800-1000000+
1*10000=1510324800.
Second implementation：The parameter sets also include subtask difficult parameters；
The value of subtask difficult parameters corresponding with described one packet is obtained from the parameter sets, obtains difficulty value；
Difficult, neutralization that the difficulty value includes is easily；
The sum of first parameter value and second parameter value is calculated, obtains the 3rd parameter value；
When the difficulty value is difficult, the 3rd parameter value is subtracted 100,000, obtains the weighted value of a packet；
When the difficulty value is middle, the 3rd parameter value is subtracted 50,000, obtains the weighted value of a packet；
When the difficulty value is easy, the weighted value that the 3rd parameter value is described one packet is set.
For example, the difficulty value of the subtask Tomato omelette of the first packet is easy, the difficulty of second packet shredded pork with green pepper
In being worth and being, the difficulty value of the 3rd packet boiling live fish is difficult, and the difficulty value that water spinach is fried in the 4th packet is easy.Therefore, first
The weighted value of packet is 1511314800-1000000+2*10000=1510334800；The weighted value of second packet is
1511314800-1000000+2*10000-50000=1510284800；The weighted value of 3rd packet is 1511314800-
1000000+3*10000-100000=1510344800=1510244800；4th packet weighted value be：1511314800-
1000000+1*10000=1510324800.
S43, step S41 to S43 is repeated, until the grouping set is traversed.
S5, the order being performed according to each packet of the weighted value of each packet arrangement.
Wherein, weighted value is smaller, and priority is higher.
Embodiments of the invention two are：
The present embodiment provides a kind of task distribution terminal, including one or more processors 1 and memory 2, the storage
Device 2 has program stored therein, and is configured to perform following steps by one or more of processors 1：
S1, obtain more than one the task order received in same time interval；The task order include one with
Upper subtask.
Alternatively, two or more task distribution platform is preset；It is described two to take up an official post using the standardization of same data standard
Data corresponding with subtask in business distribution platform；The task order is received from described two above task distribution platforms.
S2, identical subtask in one above task order is divided to same packet, obtains grouping set.
S3, parameter preset set；The parameter sets include being grouped included subtask number parameter and packet creates
Time parameter.
S4, each packet of parameter value calculation according to the parameter sets corresponding with each packet in the grouping set
Weighted value.Specially：
S41, a packet is obtained from the grouping set；Obtain each in the parameter sets corresponding with described one packet
The value of parameter, obtains set of parameter values.
S42, described one weighted value being grouped is calculated according to the set of parameter values.
Wherein, there are following two implementations in the S42 steps.
First implementation：Packet creation time parameter corresponding with described one packet is obtained from the set of parameter values
Value, creation time；The creation time is timestamp；
The creation time is subtracted 1,000,000, obtains the first parameter value；
The value of the included subtask number parameter of packet corresponding with described one packet is obtained from the parameter sets,
Obtain subtask number；
The subtask number is multiplied by 10,000, obtains the second parameter value；
According to first parameter value and second parameter value and, obtain described one weighted value being grouped.
Second implementation：The parameter sets also include subtask difficult parameters；
The value of subtask difficult parameters corresponding with described one packet is obtained from the parameter sets, obtains difficulty value；
Difficult, neutralization that the difficulty value includes is easily；
The sum of first parameter value and second parameter value is calculated, obtains the 3rd parameter value；
When the difficulty value is difficult, the 3rd parameter value is subtracted 100,000, obtains the weighted value of a packet；
When the difficulty value is middle, the 3rd parameter value is subtracted 50,000, obtains the weighted value of a packet；
When the difficulty value is easy, the weighted value that the 3rd parameter value is described one packet is set.
S43, step S41 to S43 is repeated, until the grouping set is traversed.
S5, the order being performed according to each packet of the weighted value of each packet arrangement.
Wherein, weighted value is smaller, and priority is higher.
In summary, a kind of method for allocating tasks provided by the invention and terminal, by will be received in same time interval
To multiple tasks order in identical subtask be divided to same packet, and the subtask quantity in each packet and point
The execution sequence for the Time alignment packet that group creates so that executor can preferentially disposable batch quantity performed be more and task connects
Identical subtask earlier between time receiving, when the subtask of a packet is finished, the bag that is received in same time interval
Task order containing the subtask in described one packet can obtain feedback information, shorten being received in a period for task
The average response time of order.Also, executor performs specific task by packet, the subtask phase included in each packet
Together, be advantageous to improve the operating efficiency of executor, so as to further shorten the average response time of task order.
Embodiments of the invention are the foregoing is only, are not intended to limit the scope of the invention, it is every to utilize this hair
The equivalents that bright specification and accompanying drawing content are made, or the technical field of correlation is directly or indirectly used in, similarly include
In the scope of patent protection of the present invention.
Claims (10)
- A kind of 1. method for allocating tasks, it is characterised in that including：Obtain more than one the task order received in same time interval；The task order includes more than one son and appointed Business；Identical subtask in one above task order is divided to same packet, obtains grouping set；Parameter preset set；The parameter sets include being grouped included subtask number parameter and packet creation time ginseng Number；According to the weight of each packet of parameter value calculation of the parameter sets corresponding with each packet in the grouping set Value；The order being performed according to each packet of the weighted value of each packet arrangement.
- 2. method for allocating tasks according to claim 1, it is characterised in that according in the grouping set with each packet The weighted value of each packet of parameter value calculation of the corresponding parameter sets, it is specially：S1, a packet is obtained from the grouping set；S2, the value for obtaining each parameter in the parameter sets corresponding with described one packet, obtain set of parameter values；S3, described one weighted value being grouped is calculated according to the set of parameter values；S4, step S1 to S4 is repeated, until the grouping set is traversed.
- 3. method for allocating tasks according to claim 2, it is characterised in that the S3 is specially：The value of packet creation time parameter corresponding with described one packet, creation time are obtained from the set of parameter values；Institute It is timestamp to state creation time；The creation time is subtracted 1,000,000, obtains the first parameter value；The value of the included subtask number parameter of packet corresponding with described one packet is obtained from the parameter sets, is obtained Subtask number；The subtask number is multiplied by 10,000, obtains the second parameter value；According to first parameter value and second parameter value and, obtain described one weighted value being grouped.
- 4. method for allocating tasks according to claim 3, it is characterised in that according to first parameter value and described second The sum of parameter value, the weighted value of a packet is obtained, is specially：The parameter sets also include subtask difficult parameters；The value of subtask difficult parameters corresponding with described one packet is obtained from the parameter sets, obtains difficulty value；It is described Difficult, neutralization that difficulty value includes is easily；The sum of first parameter value and second parameter value is calculated, obtains the 3rd parameter value；When the difficulty value is difficult, the 3rd parameter value is subtracted 100,000, obtains the weighted value of a packet；When the difficulty value is middle, the 3rd parameter value is subtracted 50,000, obtains the weighted value of a packet；When the difficulty value is easy, the weighted value that the 3rd parameter value is described one packet is set.
- 5. method for allocating tasks according to claim 1, it is characterised in that also include：Default two or more task distribution platform；Use data corresponding with subtask in the described two above task distribution platforms of same data standard standardization；The task order is received from described two above task distribution platforms.
- A kind of 6. task distribution terminal, it is characterised in that including one or more processors and memory, the memory storage There is program, and be configured to by one or more of computing device following steps：Obtain more than one the task order received in same time interval；The task order includes more than one son and appointed Business；Identical subtask in one above task order is divided to same packet, obtains grouping set；Parameter preset set；The parameter sets include being grouped included subtask number parameter and packet creation time ginseng Number；According to the weight of each packet of parameter value calculation of the parameter sets corresponding with each packet in the grouping set Value；The order being performed according to each packet of the weighted value of each packet arrangement.
- 7. task distribution terminal according to claim 6, it is characterised in that according in the grouping set with each packet The weighted value of each packet of parameter value calculation of the corresponding parameter sets, it is specially：S1, a packet is obtained from the grouping set；S2, the value for obtaining each parameter in the parameter sets corresponding with described one packet, obtain set of parameter values；S3, described one weighted value being grouped is calculated according to the set of parameter values；S4, step S1 to S4 is repeated, until the grouping set is traversed.
- 8. task distribution terminal according to claim 7, it is characterised in that the S3 is specially：The value of packet creation time parameter corresponding with described one packet, creation time are obtained from the set of parameter values；Institute It is timestamp to state creation time；The creation time is subtracted 1,000,000, obtains the first parameter value；The value of the included subtask number parameter of packet corresponding with described one packet is obtained from the parameter sets, is obtained Subtask number；The subtask number is multiplied by 10,000, obtains the second parameter value；According to first parameter value and second parameter value and, obtain described one weighted value being grouped.
- 9. task distribution terminal according to claim 8, it is characterised in that according to first parameter value and described second The sum of parameter value, the weighted value of a packet is obtained, is specially：The parameter sets also include subtask difficult parameters；The value of subtask difficult parameters corresponding with described one packet is obtained from the parameter sets, obtains difficulty value；It is described Difficult, neutralization that difficulty value includes is easily；The sum of first parameter value and second parameter value is calculated, obtains the 3rd parameter value；When the difficulty value is difficult, the 3rd parameter value is subtracted 100,000, obtains the weighted value of a packet；When the difficulty value is middle, the 3rd parameter value is subtracted 50,000, obtains the weighted value of a packet；When the difficulty value is easy, the weighted value that the 3rd parameter value is described one packet is set.
- 10. task distribution terminal according to claim 6, it is characterised in that also include：Default two or more task distribution platform；Use data corresponding with subtask in the described two above task distribution platforms of same data standard standardization；The task order is received from described two above task distribution platforms.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711203025.1A CN107832135A (en) | 2017-11-27 | 2017-11-27 | A kind of method for allocating tasks and terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711203025.1A CN107832135A (en) | 2017-11-27 | 2017-11-27 | A kind of method for allocating tasks and terminal |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107832135A true CN107832135A (en) | 2018-03-23 |
Family
ID=61645908
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711203025.1A Pending CN107832135A (en) | 2017-11-27 | 2017-11-27 | A kind of method for allocating tasks and terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107832135A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109656698A (en) * | 2018-12-14 | 2019-04-19 | 平安城市建设科技(深圳)有限公司 | Task processing method, management platform, actuating station and computer readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104932903A (en) * | 2015-07-13 | 2015-09-23 | 珠海优特电力科技股份有限公司 | Multi-menu combined cooking control method and system |
| CN104991821A (en) * | 2015-06-29 | 2015-10-21 | 北京奇虎科技有限公司 | Monitor task batch processing method and apparatus |
| CN105224289A (en) * | 2014-07-03 | 2016-01-06 | 阿里巴巴集团控股有限公司 | A kind of action message matching process and equipment |
| CN106095545A (en) * | 2016-06-01 | 2016-11-09 | 东软集团股份有限公司 | Method for scheduling task and device |
-
2017
- 2017-11-27 CN CN201711203025.1A patent/CN107832135A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105224289A (en) * | 2014-07-03 | 2016-01-06 | 阿里巴巴集团控股有限公司 | A kind of action message matching process and equipment |
| CN104991821A (en) * | 2015-06-29 | 2015-10-21 | 北京奇虎科技有限公司 | Monitor task batch processing method and apparatus |
| CN104932903A (en) * | 2015-07-13 | 2015-09-23 | 珠海优特电力科技股份有限公司 | Multi-menu combined cooking control method and system |
| CN106095545A (en) * | 2016-06-01 | 2016-11-09 | 东软集团股份有限公司 | Method for scheduling task and device |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109656698A (en) * | 2018-12-14 | 2019-04-19 | 平安城市建设科技(深圳)有限公司 | Task processing method, management platform, actuating station and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8898172B2 (en) | Parallel generation of topics from documents | |
| CN110083528A (en) | Distribution method, device, computer equipment and the storage medium of test assignment | |
| CN107562528B (en) | Unitized on-demand computing method supporting multiple computing frameworks and related device | |
| CN107748696A (en) | The method and terminal device of a kind of task scheduling | |
| US10007495B2 (en) | Code generation method for scheduling processors using hook function and exception handling function | |
| AU2019204138A1 (en) | Techniques for case allocation | |
| US20160371123A1 (en) | Data Processing Method and Apparatus | |
| CN106257893A (en) | Storage server task response method, client, server and system | |
| US20150113542A1 (en) | Knapsack-based sharing-aware scheduler for coprocessor-based compute clusters | |
| CN106339802A (en) | Task allocation method, task allocation device and electronic equipment | |
| CN105303307B (en) | Method and device for distributing work tasks | |
| CN110162398B (en) | Scheduling method and device of disease analysis model and terminal equipment | |
| CN107832135A (en) | A kind of method for allocating tasks and terminal | |
| CN114625507A (en) | Task scheduling method, system, equipment and storage medium based on directed acyclic graph | |
| CN111475137A (en) | Method, system and equipment for predicting software development requirements | |
| CN111158800A (en) | Method and device for constructing task DAG based on mapping relation | |
| CN114896029A (en) | Power system simulation optimization calculation method, device, equipment and readable storage medium | |
| CN109800078A (en) | A kind of task processing method, task distribution terminal and task execution terminal | |
| CN108833505B (en) | Data request processing method, server and storage medium | |
| CN110175073B (en) | Scheduling method, sending method, device and related equipment of data exchange job | |
| CN106598726A (en) | Multi-task management system and distributed deployment method thereof | |
| CN115309527A (en) | Multitask scheduling method and device and electronic equipment | |
| CN110135685A (en) | A kind of distribution method and device of product design task | |
| EP3200083A1 (en) | Resource scheduling method and related apparatus | |
| CN105429733B (en) | A kind of message scheduling sending method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for 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: 20180323 |