CN104601704A - Task based group dispatching data processing method and system - Google Patents
Task based group dispatching data processing method and system Download PDFInfo
- Publication number
- CN104601704A CN104601704A CN201510024925.4A CN201510024925A CN104601704A CN 104601704 A CN104601704 A CN 104601704A CN 201510024925 A CN201510024925 A CN 201510024925A CN 104601704 A CN104601704 A CN 104601704A
- Authority
- CN
- China
- Prior art keywords
- subtask
- task
- terminal
- dispatch
- schedulable condition
- 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
Landscapes
- Telephonic Communication Services (AREA)
Abstract
The invention provides task based group dispatching data processing method and system. The method specifically comprises the steps of setting and pre-storing tasks to be processed through a dispatching server side; dividing the tasks to be processed into a plurality of sub-tasks according a preset rule; setting a plurality of dispatching conditions for each sub-task and weight parameters corresponding to the dispatching conditions; calculating the optimal dispatching terminal for correspondingly performing each sub-task according to a preset algorithm and based on the dispatching conditions and the weight parameters corresponding to the dispatching conditions when that the tasks to be processed occur is detected by the dispatching server side; pushing the sub-task information to the optimal dispatching terminal corresponding to each sub-task; receiving the sub-task information through the optimal dispatching terminal; correspondingly processing the sub-tasks; submitting the processing result to the dispatching server after the tasks are finished. With the adoption of the method and system, the task dispatching process is optimized, and the task dispatching efficiency is increased.
Description
Technical field
The present invention relates to colony dispatching technical field, particularly relate to a kind of colony dispatching data processing method and system of task based access control.
Background technology
Trunked Radio System is a kind of mobile communication system for group communication command scheduling, is mainly used in professional moving communicating field, as industries such as police service, electric power, civil aviatons.Existing Trunked Radio System mainly comprises the functions such as voice scheduling, video dispatching and position trace scheduling.Trunked Radio System generally includes dispatching desk, dispatch terminal and dispatch server three parts.The workflow of dispatching patcher is normally: dispatcher or administrative staff create group on dispatching desk, dispatcher monitors the state of each member of each group, in monitor procedure, certain event occurs, dispatcher analyzes and judges the group that reply event carries out processing or individual, initiate group calling or individual calling to group or individual, commander and scheduling group or individual respond event and process.
Existing task scheduling flow process is: after detecting that task occurs, and needs through dispatcher to the analysis of task with judge to determine task treatment people, and implements task scheduling; Or initiate group calling by dispatcher, after waiting for that corresponding treatment people is replied group calling, to treatment people allocation schedule task.
Therefore, there is following defect in existing implementation: owing to need by dispatcher, to the analysis of task, judgement and scheduling, therefore existing task low-response, process risk not in time; For the task that some promptly happens suddenly, task may be caused to deal with improperly.
Therefore, prior art has yet to be improved and developed.
Summary of the invention
The technical problem to be solved in the present invention is, for the above-mentioned defect of prior art, a kind of colony dispatching data processing method and system of task based access control are provided, be intended to by real-time optimization task scheduling flow process of the present invention, solve, the process defect not in time slow to task processing response that exist in prior art, thus improve the efficiency of colony dispatching task response.
The technical scheme that technical solution problem of the present invention adopts is as follows:
A colony dispatching data processing method for task based access control, wherein, comprises step:
S1, to arrange at dispatch server end and to prestore pending task;
S2, described pending task is preset regular partition according to one is multiple subtask, and arranges multiple schedulable condition and the weight parameter corresponding to schedulable condition for each subtask;
S3, when dispatch server end detects that pending task occurs, according to described schedulable condition and the weight parameter corresponding to schedulable condition, calculate according to a pre-defined algorithm and perform optimal scheduling terminal corresponding to each subtask, then the optimal scheduling terminal corresponding to each subtask pushes subtask information;
S4, described optimal scheduling terminal receive described subtask information, make respective handling to described subtask, and task completes backward dispatch server end and submits result to.
The colony dispatching data processing method of described task based access control, wherein, described step S2 also comprises:
S21, be the different schedulable conditions setting of each subtask weight parameter corresponding to schedulable condition, described weight parameter is for choosing the schedulable condition of demand fulfillment when deployed successively according to the height of weight parameter value.
The colony dispatching data processing method of described task based access control, wherein, described step S3 specifically comprises step:
S31, to pre-set and the adaptive index of the different schedulable condition in the corresponding each subtask of memory scheduling terminal;
S32, when dispatch server end detects that pending task occurs, select the highest corresponding schedulable condition of weight parameter in each subtask, and search dispatch terminal the highest in the adaptive index of pre-stored according to the described schedulable condition selected;
If S33 searches the highest dispatch terminal in the adaptive index of pre-stored be in idle condition according to the described schedulable condition selected, then setting described idle dispatch terminal is optimal scheduling terminal corresponding to described subtask;
If S34 searches the highest dispatch terminal in the adaptive index of pre-stored according to the described schedulable condition selected be in busy state, then search the secondary high idle dispatch terminal of adaptive index further; If there is no idle dispatch terminal under current scheduling condition, then select weight parameter time high corresponding schedulable condition further, repeat step S33;
If the dispatch terminal that S35 searches the adaptive index of pre-stored the highest according to the described schedulable condition selected has multiple, then the adaptive index of more described multiple dispatch terminal under the schedulable condition that weight is time high further, repeats S33 and S34.
The colony dispatching data processing method of described task based access control, wherein, described step S3 also comprises: the optimal scheduling terminal that described dispatch server end is corresponding to each subtask pushes subtask information, comprises note or audio call form.
The colony dispatching data processing method of described task based access control, wherein, described step S4 specifically comprises step:
Optimal scheduling terminal corresponding to S41, subtask receives described subtask information, and respective handling is made to described subtask, after processing task, send subtask performance and the process of optimal scheduling terminal implementation status confirmation to subtask to described dispatch server end;
S42, described dispatch server end are modified according to described subtask performance to the schedulable condition of corresponding subtask and the weight parameter corresponding to schedulable condition and preserve;
S43, described dispatch server end are modified according to the adaptive index of described dispatch terminal implementation status to the different schedulable condition in the corresponding subtask of corresponding dispatch terminal and preserve.
A colony dispatching data handling system for task based access control, wherein, comprising:
Task pretreatment module, for arranging at dispatch server end and prestoring pending task;
Subtask decomposing module is multiple subtask for described pending task is preset regular partition according to one, and arranges multiple schedulable condition and the weight parameter corresponding to schedulable condition for each subtask;
Dispatch terminal determination module, during for detecting that when dispatch server end pending task occurs, according to described schedulable condition and the weight parameter corresponding to schedulable condition, calculate according to a pre-defined algorithm and perform optimal scheduling terminal corresponding to each subtask, then the optimal scheduling terminal corresponding to each subtask pushes subtask information;
Task processing module, receives described subtask information for described optimal scheduling terminal, makes respective handling to described subtask, and task completes backward dispatch server end and submits result to.
The colony dispatching data handling system of described task based access control, wherein, described subtask decomposing module also comprises:
Schedulable condition priority level initializing unit, for the weight parameter that the different schedulable condition settings for each subtask are corresponding to schedulable condition, described weight parameter is used for the schedulable condition choosing demand fulfillment when deployed according to the height of weight parameter value successively.
The colony dispatching data handling system of described task based access control, wherein, described dispatch terminal determination module specifically comprises:
Dispatch terminal pretreatment unit, for pre-setting and the adaptive index of the different schedulable condition in the corresponding each subtask of memory scheduling terminal;
Detecting unit, during for detecting that when dispatch server end pending task occurs, selecting the highest corresponding schedulable condition of weight parameter in each subtask, and searching dispatch terminal the highest in the adaptive index of pre-stored according to the described schedulable condition selected;
First identifying unit, if for searching the highest dispatch terminal in the adaptive index of pre-stored be in idle condition according to the described schedulable condition selected, then setting described idle dispatch terminal is optimal scheduling terminal corresponding to described subtask;
Second identifying unit, if be in busy state for searching the highest dispatch terminal in the adaptive index of pre-stored according to the described schedulable condition selected, then searches the secondary high idle dispatch terminal of adaptive index further; If there is no idle dispatch terminal under current scheduling condition, then select weight parameter time high corresponding schedulable condition further;
3rd identifying unit, if having multiple for the dispatch terminal searching the adaptive index of pre-stored the highest according to the described schedulable condition selected, then the adaptive index of more described multiple dispatch terminal under the schedulable condition that weight is time high further.
The colony dispatching data handling system of described task based access control, wherein, described task processing module specifically comprises:
Task process confirmation unit, described subtask information is received for the optimal scheduling terminal that subtask is corresponding, and respective handling is made to described subtask, after processing task, send subtask performance and the process of optimal scheduling terminal implementation status confirmation to subtask to described dispatch server end;
First amendment unit, modifies and preserves according to described subtask performance to the schedulable condition of corresponding subtask and the weight parameter corresponding to schedulable condition for described dispatch server end;
Second amendment unit, modifies for described dispatch server end according to the adaptive index of described dispatch terminal implementation status to the different schedulable condition in the corresponding subtask of corresponding dispatch terminal and preserves.
The colony dispatching data handling system of described task based access control, wherein, described dispatch terminal determination module also comprises: the optimal scheduling terminal that described dispatch server end is corresponding to each subtask pushes subtask information, comprises note or audio call form.
The colony dispatching data processing method of a kind of task based access control provided by the present invention and system, described method specifically comprises: arrange at dispatch server end and prestore pending task; It is multiple subtask that described pending task is preset regular partition according to one, and arranges multiple schedulable condition and the weight parameter corresponding to schedulable condition for each subtask; When dispatch server end detects that pending task occurs, according to described schedulable condition and the weight parameter corresponding to schedulable condition, calculate according to a pre-defined algorithm and perform optimal scheduling terminal corresponding to each subtask, then the optimal scheduling terminal corresponding to each subtask pushes subtask information; Described optimal scheduling terminal receives described subtask information, makes respective handling to described subtask, and task completes backward dispatch server end and submits result to.Real-time optimization of the present invention task scheduling flow process, ensure that the scheduling flow of task is the optimal process that current system can complete this scheduler task, thus reach task process corresponding fast, process effect timely; And voice and video scheduling is only simply carried out to conventional cluster dispatching method expand, also extend the use field of colony dispatching simultaneously.
Accompanying drawing explanation
Fig. 1 is the flow chart of the first preferred embodiment of the colony dispatching data processing method of the task of the present invention is based on.
Fig. 2 is the flow chart of the second preferred embodiment of the colony dispatching data processing method of the task of the present invention is based on.
Fig. 3 is the functional block diagram of the first preferred embodiment of the colony dispatching data handling system of the task of the present invention is based on.
Fig. 4 is the cut-away view of the dispatch terminal determination module of the first preferred embodiment of the colony dispatching data handling system of the task of the present invention is based on.
Fig. 5 is the cut-away view of the task processing module of the first preferred embodiment of the colony dispatching data handling system of the task of the present invention is based on.
Embodiment
The invention discloses a kind of colony dispatching data processing method, system of task based access control, for making object of the present invention, technical scheme and advantage clearly, clearly, developing simultaneously referring to accompanying drawing, the present invention is described in more detail for embodiment.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
Refer to Fig. 1, Fig. 1 is the flow chart of the first preferred embodiment of the colony dispatching data processing method of the task of the present invention is based on.The colony dispatching data processing method of the task based access control shown in Fig. 1, comprising:
Step S101, to arrange at dispatch server end and to prestore pending task.
Step S102, described pending task is preset regular partition according to one is multiple subtask, and arranges multiple schedulable condition and the weight parameter corresponding to schedulable condition for each subtask.
In the embodiment of the present invention, need arrange at dispatch server end and prestore pending task, setting rule by described pending Task-decomposing according to one is afterwards multiple subtask.Such as, the line maintenance task of certain electric power saving overhauling company, line maintenance task is divided into multiple subtask by section by dispatcher, as setting is divided into one section every 50KM, then setting 100KM-150KM is a maintenance subtask, and 150KM-200KM is a maintenance subtask, and the rest may be inferred for all the other.
Dispatch server is these subtask preassignment schedulable conditions and the weight parameter corresponding to schedulable condition afterwards, can distribute multiple condition, and each condition configures a corresponding weight parameter.Such as: dispatcher to assign weight parameter according to the subtask that each maintenance section geographical conditions or actual conditions are these segmentations, such as each maintenance cross-talk task setting two schedulable conditions, be respectively technical ability exponential sum environmental index, described technical ability exponential representation performs the skill proficiency of this section of maintenance required by task GPRS; Described environmental index represents the distance degree performing this section of maintenance task.In detail, the weight parameter of the technical ability index of setting 100KM-150KM section is 0.2, and the weight parameter of environmental index is 0.1; The weight parameter of the technical ability index of 150KM-200KM section is 0.1, and the weight parameter of environmental index is 0.2.
Further, in the embodiment of the present invention, for the weight parameter that the different schedulable condition settings of each subtask are corresponding to schedulable condition, described weight parameter is used for the schedulable condition choosing demand fulfillment when deployed according to the height of weight parameter value successively, that is, the schedulable condition priority in subtask is according to the weight parameter value corresponding with it height sequencing selection successively.Such as, the schedulable condition prioritization of the subtask of 100KM-150KM section is that technical ability index is greater than environmental index; And the schedulable condition prioritization of 150KM-200KM section is environmental index is greater than technical ability index.
Step S103, when dispatch server end detects that pending task occurs, according to described schedulable condition and the weight parameter corresponding to schedulable condition, calculate according to a pre-defined algorithm and perform optimal scheduling terminal corresponding to each subtask, then the optimal scheduling terminal corresponding to each subtask pushes subtask information.
In the embodiment of the present invention, described step S103 specifically comprises step:
S31, to pre-set and the adaptive index of the different schedulable condition in the corresponding each subtask of memory scheduling terminal;
S32, when dispatch server end detects that pending task occurs, select the highest corresponding schedulable condition of weight parameter in each subtask, and search dispatch terminal the highest in the adaptive index of pre-stored according to the described schedulable condition selected;
If S33 searches the highest dispatch terminal in the adaptive index of pre-stored be in idle condition according to the described schedulable condition selected, then setting described idle dispatch terminal is optimal scheduling terminal corresponding to described subtask;
If S34 searches the highest dispatch terminal in the adaptive index of pre-stored according to the described schedulable condition selected be in busy state, then search the secondary high idle dispatch terminal of adaptive index further; If there is no idle dispatch terminal under current scheduling condition, then select weight parameter time high corresponding schedulable condition further, repeat step S33;
If the dispatch terminal that S35 searches the adaptive index of pre-stored the highest according to the described schedulable condition selected has multiple, then the adaptive index of more described multiple dispatch terminal under the schedulable condition that weight is time high further, repeats S33 and S34.
That is: in dispatch server, pre-set the adaptive index of the also different schedulable condition in the corresponding each subtask of memory scheduling terminal, dispatcher receives maintenance task, by job invocation to maintenance dispatch server, multiple subtasks that maintenance dispatch server finds this maintenance task and decomposes in pre-setting of task; Overhaul dispatch server afterwards according to the schedulable condition of each subtask and weight parameter, calculate idle dispatch terminal corresponding to subtasking according to predefine algorithm, mark it for optimal scheduling terminal.Such as, when setting performs the terminal of 100KM-150KM section maintenance task, the weight of technical ability index is high, prioritizing selection meets the terminal of technical ability index, the technical ability index that the terminal A prestored completes 100KM-150KM cross-talk task is 0.3, the technical ability index that dispatch terminal B completes this cross-talk task is 0.1, so overhauls dispatching patcher and this scheduling sublayer task can be distributed to dispatch terminal A automatically and complete; If dispatch terminal A be in busy state (as: dispatch terminal A carrying out certain task or dispatch terminal A online, cannot call scheduling), then select weight parameter time high corresponding schedulable condition further, i.e. environmental index, continues to judge that under the environmental index adaptive index of each dispatch terminal is the highest and as the free time.For another example, when setting performs the terminal of 150KM-200KM section maintenance task, environmental index weight is high, preferentially meets environmental index, if the non-occupied terminal C distance execution place, subtask prestored is nearest, represents that the adaptive index of C to environmental index is the highest, therefore select terminal C to complete this task.If under present weight parameter, the adaptive index of the different schedulable condition in the corresponding each subtask of multiple dispatch terminal is identical, even terminal C is identical with the distance of D, the now adaptive index of more described multiple dispatch terminal different schedulable condition in each subtask of correspondence of weight parameter time relative superiority or inferiority further, namely the technical ability index of two terminals is judged, if the skilled index of the technical ability of terminal D is better than terminal C, then now select terminal D as the optimal scheduling terminal of this subtask.
Preferably, the optimal scheduling terminal of each subtask can be weaved into group by dispatch server.If certain task has multiple subtask, then need the multiple different terminal of scheduling to go to perform, now these dispatch terminals can join in a dispatch group and be convenient to coordinate between terminal by dispatch server.
Step S104, described optimal scheduling terminal receive described subtask information, make respective handling to described subtask, and task completes backward dispatch server end and submits result to.
In the embodiment of the present invention, described step S104 specifically comprises step:
Optimal scheduling terminal corresponding to S41, subtask receives described subtask information, and respective handling is made to described subtask, after processing task, send subtask performance and the process of optimal scheduling terminal implementation status confirmation to subtask to described dispatch server end;
S42, described dispatch server end are modified according to described subtask performance to the schedulable condition of corresponding subtask and the weight parameter corresponding to schedulable condition and preserve;
S43, described dispatch server end are modified according to the adaptive index of described dispatch terminal implementation status to the different schedulable condition in the corresponding subtask of corresponding dispatch terminal and preserve.
That is, dispatch server pushes subtask information according to result of calculation to each optimal scheduling terminal, preferably, pushes subtask information and uses note or audio call form; Dispatch terminal receives task, and staff belonging to it views task and executes the task; Staff executes task, feedback implementation status; The schedulable condition of server according to subtask performance adjustment subtask and the weight parameter of correspondence, the condition of subtask scheduling condition sequence when the data after adjustment were executed the task as next time; Adjust terminal to the adaptive index of certain subtask scheduling condition according to implementation status, the data after adjustment can be used as the sort criteria of next dispatch terminal simultaneously.
Such as, after the maintenance subtask of 100KM-150KM section completes, the weight parameter of this cross-talk task technical ability index is adjusted to 0.1 by server, the weight parameter of environmental index is adjusted to 0.2, represents that the terminal the most adaptive to environmental condition is selected in scheduling next time this section of maintenance priority of task; For another example, if dispatch terminal B has been assigned the maintenance task of 100KM-150KM section, after completing, system is according to performance, and terminal B is adjusted to 0.2 at the skilled index of the technical ability of this section by 0.1, represents that terminal B increases in the maintenance technical ability of this section.
Below by by concrete Application Example, the present invention will be further described.Fig. 2 is the second preferred embodiment flow chart of the colony dispatching data processing method of the task of the present invention is based on.As shown in Figure 2, step is comprised:
S20, dispatch server pre-set and stores pending task.
S21, be one or more subtask by task predecomposition on dispatch server.
Described decomposition can according to actual conditions, the line maintenance task of such as certain electric power saving overhauling company, and line maintenance task can be divided into subtask by section by dispatcher.Such as set and be divided into one section every 50KM, then setting 100KM-150KM is a maintenance subtask, and 150KM-200KM is a maintenance subtask, and the rest may be inferred for all the other.
S22, be the multiple schedulable condition of these subtask preassignment and corresponding weight parameter on the server.
The schedulable condition of described subtask can be one or more, and each condition configures a corresponding weight parameter.Such as: dispatcher to assign weight parameter according to the subtask that each maintenance section geographical conditions or actual conditions are these segmentations, such as each maintenance cross-talk task setting two schedulable conditions, be respectively technical ability exponential sum environmental index, described technical ability exponential representation performs the skill proficiency of this section of maintenance required by task GPRS; Described environmental index represents the distance performing this section of maintenance task.In detail, the technical ability index of setting 100KM-150KM section is 0.2, and environmental index is 0.1; The technical ability index of 150KM-200KM section is 0.1, and environmental index is 0.2.
Further, for the weight parameter that the different schedulable condition settings of each subtask are corresponding to schedulable condition, described weight parameter is used for the schedulable condition choosing demand fulfillment when deployed according to the height of weight parameter value successively, that is, the schedulable condition priority in subtask is according to the weight parameter value corresponding with it height sequencing selection successively.Such as, the schedulable condition prioritization of the subtask of 100KM-150KM section is that technical ability index is greater than environmental index; And the schedulable condition prioritization of 150KM-200KM section is environmental index is greater than technical ability index.
S23, simultaneously on the server for dispatch terminal arranges the adaptive index of corresponding subtask difference schedulable condition.
S24, dispatcher detect needs operation dispatching task, selects pre-setting of task from server, inquires the subtask of this task and the schedulable condition of subtask and the weight parameter corresponding with schedulable condition simultaneously.
The schedulable condition that in S25, server chooser task, highest weighting parameter is corresponding.
S26, server are searched should the highest dispatch terminal of the adaptive index of schedulable condition according to the schedulable condition selected.
S27, judge this schedulable condition under this dispatch terminal whether be in idle condition.
If this dispatch terminal of S28 is in busy state, then the secondary high terminal of optional m igration terminal adaptation index; If all dispatch terminals are all in busy state under this schedulable condition, then select the secondary high schedulable condition of weight parameter, repeat S26.
If this dispatch terminal of S29 is in idle condition, then judge that this dispatch terminal is as optimal scheduling terminal, the optimal scheduling terminal of each subtask is weaved into group by server afterwards, and pending task is issued to dispatch terminal group.
That is, the rule of the idle dispatch terminal of the calculating optimum in the present embodiment is: arrange at dispatch server end in advance and store the adaptive index of the corresponding subtask scheduling condition of each dispatch terminal; When dispatch server end detects that pending task occurs, according to the schedulable condition weight parameter selection scheduling condition of the subtask of setting, the adaptive index of each dispatch terminal prestored to selected subtask scheduling condition is contrasted; Select the idle and dispatch terminal that adaptive index is the highest, and to set the highest dispatch terminal of described adaptive index be optimal scheduling terminal corresponding to subtask.If when the dispatch terminal that adaptive index is the highest is in busy state, then selects the secondary high schedulable condition of weight parameter further, repeat this step, until select schedulable terminal.
Such as, when setting performs the terminal of 100KM-150KM section maintenance task, preferentially meet technical ability index, the adaptive index of technical ability that the terminal A prestored completes 100KM-150KM cross-talk task is 0.3, the adaptive index of technical ability that dispatch terminal B completes this cross-talk task is 0.1, so overhauls dispatching patcher and this scheduling sublayer task can be distributed to dispatch terminal A automatically and complete; If dispatch terminal A is performing other tasks when maybe cannot call out, then selecting weight parameter time high corresponding schedulable condition further, i.e. environmental index, continuing to judge that the adaptive index of each dispatch terminal is the highest under environmental index.For another example, when setting performs the terminal of 150KM-200KM section maintenance task, preferentially meet environmental index, if the adaptive index of the non-occupied terminal C environment prestored is the highest, then select C.If terminal C is identical with the adaptive index of the environment of D, compare technical ability exponential quantity further, if the skilled index of the technical ability of terminal D is better than terminal C, then now select terminal D as the optimal scheduling terminal of this subtask.
S30, dispatch terminal group receive task, notify that belonging to it, staff executes the task.
S31, staff execute task, by dispatch terminal to server feedback implementation status.
S32, server, according to the weight parameter of implementation status adjustment subtask, complete the adaptive index of subtask simultaneously according to implementation status adjustment terminal.
In the present embodiment, dispatch terminal feeds back corresponding implementation status after executing task, server is according to the schedulable condition of subtask performance adjustment subtask and corresponding weight parameter, the condition of the priority of subtask sequence when data after adjustment were executed the task as next time, completes the adaptive index of certain scheduling sublayer task simultaneously according to implementation status adjustment terminal; Data after adjustment can be used as the sort criteria of next dispatch terminal.
Such as, after the maintenance subtask of 100KM-150KM section completes, the weight parameter of this cross-talk task technical ability index is adjusted to 0.1 by server, the weight parameter of environmental index is 0.2, represents that the requirement of scheduling next time this section of maintenance task technical ability index reduces, adjusts the distance and wait the rising of environmental index priority; For another example, if dispatch terminal B has been assigned the maintenance task of 100KM-150KM section, after completing, system is according to performance, terminal B is adjusted to 0.3 at the adaptive index of the technical ability of this section by 0.2, represents that terminal B increases in the maintenance technical ability of this section.
Therefore, real-time optimization of the present invention task scheduling flow process, ensure that the scheduling flow of task is the optimal process that current system can complete this scheduler task, and voice and video scheduling is only simply carried out to conventional cluster dispatching method expand, also extend the use field of colony dispatching simultaneously, improve the efficiency of task scheduling.The method overcomes, the process defect not in time slow to task processing response that exist in prior art, has the rapid advantage timely of colony dispatching task response.
Based on above-described embodiment, the present invention also provides a kind of colony dispatching data handling system of task based access control, as shown in Figure 3, comprising:
Task pretreatment module 100, for arranging at dispatch server end and prestoring pending task; As detailed above.
Subtask decomposing module 200 is multiple subtask for described pending task is preset regular partition according to one, and arranges multiple schedulable condition and the weight parameter corresponding to schedulable condition for each subtask; As detailed above.
Dispatch terminal determination module 300, during for detecting that when dispatch server end pending task occurs, according to described schedulable condition and the weight parameter corresponding to schedulable condition, calculate according to a pre-defined algorithm and perform optimal scheduling terminal corresponding to each subtask, then the optimal scheduling terminal corresponding to each subtask pushes subtask information; As detailed above.
Task processing module 400, receives described subtask information for described optimal scheduling terminal, makes respective handling to described subtask, and task completes backward dispatch server end and submits process knot to; As detailed above.
Further, described subtask decomposing module also comprises:
Schedulable condition priority level initializing unit, for the weight parameter that the different schedulable condition settings for each subtask are corresponding to schedulable condition, described weight parameter is used for the schedulable condition choosing demand fulfillment when deployed according to the height of weight parameter value successively; As detailed above.
Further, the colony dispatching data handling system of described task based access control, as shown in Figure 4, described dispatch terminal determination module 300 also comprises:
Dispatch terminal pretreatment unit 310, for pre-setting and the adaptive index of the different schedulable condition in the corresponding each subtask of memory scheduling terminal; As detailed above.
Detecting unit 320, during for detecting that when dispatch server end pending task occurs, select the highest corresponding schedulable condition of weight parameter in each subtask, and search dispatch terminal the highest in the adaptive index of pre-stored according to the described schedulable condition selected; As detailed above.
First identifying unit 330, if for searching the highest dispatch terminal in the adaptive index of pre-stored be in idle condition according to the described schedulable condition selected, then setting described idle dispatch terminal is optimal scheduling terminal corresponding to described subtask; As detailed above.
Second identifying unit 340, if be in busy state for searching the highest dispatch terminal in the adaptive index of pre-stored according to the described schedulable condition selected, then searches the secondary high idle dispatch terminal of adaptive index further; If there is no idle dispatch terminal under current scheduling condition, then select weight parameter time high corresponding schedulable condition further; As detailed above.
3rd identifying unit 350, if having multiple for the dispatch terminal searching the adaptive index of pre-stored the highest according to the described schedulable condition selected, then the adaptive index of more described multiple dispatch terminal under the schedulable condition that weight is time high further; As detailed above.
Further, the colony dispatching data handling system of described task based access control, as shown in Figure 5, described task processing module 400 specifically comprises:
Task process confirmation unit 410, described subtask information is received for the optimal scheduling terminal that subtask is corresponding, and respective handling is made to described subtask, after processing task, send subtask performance and the process of optimal scheduling terminal implementation status confirmation to subtask to described dispatch server end; As detailed above.
First amendment unit 420, modifies and preserves according to described subtask performance to the schedulable condition of corresponding subtask and the weight parameter corresponding to schedulable condition for described dispatch server end; As detailed above.
Second amendment unit 430, modifies for described dispatch server end according to the adaptive index of described dispatch terminal implementation status to the different schedulable condition in the corresponding subtask of corresponding dispatch terminal and preserves; As detailed above.
Further, described dispatch terminal determination module also comprises: the optimal scheduling terminal that described dispatch server end is corresponding to each subtask pushes subtask information, comprises note or audio call form.
In sum, the colony dispatching data processing method of a kind of task based access control provided by the present invention and system, described method specifically comprises: arrange at dispatch server end and prestore pending task; It is multiple subtask that described pending task is preset regular partition according to one, and arranges multiple schedulable condition and the weight parameter corresponding to schedulable condition for each subtask; When dispatch server end detects that pending task occurs, according to described schedulable condition and the weight parameter corresponding to schedulable condition, calculate according to a pre-defined algorithm and perform optimal scheduling terminal corresponding to each subtask, then the optimal scheduling terminal corresponding to each subtask pushes subtask information; Described optimal scheduling terminal receives described subtask information, makes respective handling to described subtask, and task completes backward dispatch server end and submits result to.Real-time optimization of the present invention task scheduling flow process, ensure that the scheduling flow of task is the optimal process that current system can complete this scheduler task, and voice and video scheduling is only simply carried out to conventional cluster dispatching method expand, also extend the use field of colony dispatching simultaneously.The method overcomes, the process defect not in time slow to task processing response that exist in prior art, has the rapid advantage timely of colony dispatching task response.
Should be understood that, application of the present invention is not limited to above-mentioned citing, for those of ordinary skills, can be improved according to the above description or convert, and all these improve and convert the protection range that all should belong to claims of the present invention.
Claims (10)
1. a colony dispatching data processing method for task based access control, is characterized in that, comprise step:
S1, to arrange at dispatch server end and to prestore pending task;
S2, described pending task is preset regular partition according to one is multiple subtask, and arranges multiple schedulable condition and the weight parameter corresponding to schedulable condition for each subtask;
S3, when dispatch server end detects that pending task occurs, according to described schedulable condition and the weight parameter corresponding to schedulable condition, calculate according to a pre-defined algorithm and perform optimal scheduling terminal corresponding to each subtask, then the optimal scheduling terminal corresponding to each subtask pushes subtask information;
S4, described optimal scheduling terminal receive described subtask information, make respective handling to described subtask, and task completes backward dispatch server end and submits result to.
2. the colony dispatching data processing method of task based access control according to claim 1, is characterized in that, described step S2 also comprises:
S21, be the different schedulable conditions setting of each subtask weight parameter corresponding to schedulable condition, described weight parameter is for choosing the schedulable condition of demand fulfillment when deployed successively according to the height of weight parameter value.
3. the colony dispatching data processing method of task based access control according to claim 2, is characterized in that, described step S3 specifically comprises step:
S31, to pre-set and the adaptive index of the different schedulable condition in the corresponding each subtask of memory scheduling terminal;
S32, when dispatch server end detects that pending task occurs, select the highest corresponding schedulable condition of weight parameter in each subtask, and search dispatch terminal the highest in the adaptive index of pre-stored according to the described schedulable condition selected;
If S33 searches the highest dispatch terminal in the adaptive index of pre-stored be in idle condition according to the described schedulable condition selected, then setting described idle dispatch terminal is optimal scheduling terminal corresponding to described subtask;
If S34 searches the highest dispatch terminal in the adaptive index of pre-stored according to the described schedulable condition selected be in busy state, then search the secondary high idle dispatch terminal of adaptive index further; If there is no idle dispatch terminal under current scheduling condition, then select weight parameter time high corresponding schedulable condition further, repeat step S33;
If the dispatch terminal that S35 searches the adaptive index of pre-stored the highest according to the described schedulable condition selected has multiple, then the adaptive index of more described multiple dispatch terminal under the schedulable condition that weight is time high further, repeats S33 and S34.
4. the colony dispatching data processing method of task based access control according to claim 1, it is characterized in that, described step S3 also comprises: the optimal scheduling terminal that described dispatch server end is corresponding to each subtask pushes subtask information, comprises note or audio call form.
5. the colony dispatching data processing method of task based access control according to claim 1, is characterized in that, described step S4 specifically comprises step:
Optimal scheduling terminal corresponding to S41, subtask receives described subtask information, and respective handling is made to described subtask, after processing task, send subtask performance and the process of optimal scheduling terminal implementation status confirmation to subtask to described dispatch server end;
S42, described dispatch server end are modified according to described subtask performance to the schedulable condition of corresponding subtask and the weight parameter corresponding to schedulable condition and preserve;
S43, described dispatch server end are modified according to the adaptive index of described dispatch terminal implementation status to the different schedulable condition in the corresponding subtask of corresponding dispatch terminal and preserve.
6. a colony dispatching data handling system for task based access control, is characterized in that, comprising:
Task pretreatment module, for arranging at dispatch server end and prestoring pending task;
Subtask decomposing module is multiple subtask for described pending task is preset regular partition according to one, and arranges multiple schedulable condition and the weight parameter corresponding to schedulable condition for each subtask;
Dispatch terminal determination module, during for detecting that when dispatch server end pending task occurs, according to described schedulable condition and the weight parameter corresponding to schedulable condition, calculate according to a pre-defined algorithm and perform optimal scheduling terminal corresponding to each subtask, then the optimal scheduling terminal corresponding to each subtask pushes subtask information;
Task processing module, receives described subtask information for described optimal scheduling terminal, makes respective handling to described subtask, and task completes backward dispatch server end and submits result to.
7. the colony dispatching data handling system of task based access control according to claim 6, it is characterized in that, described subtask decomposing module also comprises:
Schedulable condition priority level initializing unit, for the weight parameter that the different schedulable condition settings for each subtask are corresponding to schedulable condition, described weight parameter is used for the schedulable condition choosing demand fulfillment when deployed according to the height of weight parameter value successively.
8. the colony dispatching data handling system of task based access control according to claim 7, it is characterized in that, described dispatch terminal determination module specifically comprises:
Dispatch terminal pretreatment unit, for pre-setting and the adaptive index of the different schedulable condition in the corresponding each subtask of memory scheduling terminal;
Detecting unit, during for detecting that when dispatch server end pending task occurs, selecting the highest corresponding schedulable condition of weight parameter in each subtask, and searching dispatch terminal the highest in the adaptive index of pre-stored according to the described schedulable condition selected;
First identifying unit, if for searching the highest dispatch terminal in the adaptive index of pre-stored be in idle condition according to the described schedulable condition selected, then setting described idle dispatch terminal is optimal scheduling terminal corresponding to described subtask;
Second identifying unit, if be in busy state for searching the highest dispatch terminal in the adaptive index of pre-stored according to the described schedulable condition selected, then searches the secondary high idle dispatch terminal of adaptive index further; If there is no idle dispatch terminal under current scheduling condition, then select weight parameter time high corresponding schedulable condition further;
3rd identifying unit, if having multiple for the dispatch terminal searching the adaptive index of pre-stored the highest according to the described schedulable condition selected, then the adaptive index of more described multiple dispatch terminal under the schedulable condition that weight is time high further.
9. the colony dispatching data handling system of task based access control according to claim 6, it is characterized in that, described task processing module specifically comprises:
Task process confirmation unit, described subtask information is received for the optimal scheduling terminal that subtask is corresponding, and respective handling is made to described subtask, after processing task, send subtask performance and the process of optimal scheduling terminal implementation status confirmation to subtask to described dispatch server end;
First amendment unit, modifies and preserves according to described subtask performance to the schedulable condition of corresponding subtask and the weight parameter corresponding to schedulable condition for described dispatch server end;
Second amendment unit, modifies for described dispatch server end according to the adaptive index of described dispatch terminal implementation status to the different schedulable condition in the corresponding subtask of corresponding dispatch terminal and preserves.
10. the colony dispatching data handling system of task based access control according to claim 6, it is characterized in that, described dispatch terminal determination module also comprises: the optimal scheduling terminal that described dispatch server end is corresponding to each subtask pushes subtask information, comprises note or audio call form.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510024925.4A CN104601704B (en) | 2015-01-19 | 2015-01-19 | The colony dispatching data processing method and system of a kind of task based access control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510024925.4A CN104601704B (en) | 2015-01-19 | 2015-01-19 | The colony dispatching data processing method and system of a kind of task based access control |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104601704A true CN104601704A (en) | 2015-05-06 |
| CN104601704B CN104601704B (en) | 2018-05-18 |
Family
ID=53127197
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510024925.4A Active CN104601704B (en) | 2015-01-19 | 2015-01-19 | The colony dispatching data processing method and system of a kind of task based access control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104601704B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107025131A (en) * | 2016-02-01 | 2017-08-08 | 腾讯科技（深圳）有限公司 | A kind of method for scheduling task and device |
| CN109344079A (en) * | 2018-10-31 | 2019-02-15 | 广东高云半导体科技股份有限公司 | Placement-and-routing's regression testing method, system, equipment and storage medium |
| CN111104223A (en) * | 2019-12-17 | 2020-05-05 | 腾讯科技（深圳）有限公司 | Task processing method and device, computer readable storage medium and computer equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050070320A1 (en) * | 2003-09-26 | 2005-03-31 | Dent Paul W. | Method and apparatus to reduce dispatch delays in dispatch communication networks |
| CN101510280A (en) * | 2009-02-25 | 2009-08-19 | 中国网络通信集团公司 | Platform for optimizing and scheduling task |
| CN102339233A (en) * | 2010-07-15 | 2012-02-01 | 戴元顺 | Cloud computing centralized management platform |
| CN103336709A (en) * | 2013-06-01 | 2013-10-02 | 北京华胜天成科技股份有限公司 | Method and system for realizing virtual distributed unified management in cluster |
| CN103902379A (en) * | 2012-12-25 | 2014-07-02 | ***通信集团公司 | Task scheduling method and device and server cluster |
-
2015
- 2015-01-19 CN CN201510024925.4A patent/CN104601704B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050070320A1 (en) * | 2003-09-26 | 2005-03-31 | Dent Paul W. | Method and apparatus to reduce dispatch delays in dispatch communication networks |
| CN101510280A (en) * | 2009-02-25 | 2009-08-19 | 中国网络通信集团公司 | Platform for optimizing and scheduling task |
| CN102339233A (en) * | 2010-07-15 | 2012-02-01 | 戴元顺 | Cloud computing centralized management platform |
| CN103902379A (en) * | 2012-12-25 | 2014-07-02 | ***通信集团公司 | Task scheduling method and device and server cluster |
| CN103336709A (en) * | 2013-06-01 | 2013-10-02 | 北京华胜天成科技股份有限公司 | Method and system for realizing virtual distributed unified management in cluster |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107025131A (en) * | 2016-02-01 | 2017-08-08 | 腾讯科技（深圳）有限公司 | A kind of method for scheduling task and device |
| WO2017133487A1 (en) * | 2016-02-01 | 2017-08-10 | 腾讯科技（深圳）有限公司 | Service scheduling method and device, and computer storage medium |
| CN109344079A (en) * | 2018-10-31 | 2019-02-15 | 广东高云半导体科技股份有限公司 | Placement-and-routing's regression testing method, system, equipment and storage medium |
| CN111104223A (en) * | 2019-12-17 | 2020-05-05 | 腾讯科技（深圳）有限公司 | Task processing method and device, computer readable storage medium and computer equipment |
| CN111104223B (en) * | 2019-12-17 | 2023-06-09 | 腾讯科技（深圳）有限公司 | Task processing method, device, computer readable storage medium and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104601704B (en) | 2018-05-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109878959B (en) | Sorting scheduling method and device, warehousing system and readable storage medium | |
| CN105933372B (en) | Task distributes execution method, server and terminal | |
| CN110555665B (en) | Production plan generation method and device | |
| US9378511B2 (en) | Real-time appointment of enterprise mobile agents in response to customer requests | |
| CN108345501A (en) | A kind of distributed resource scheduling method and system | |
| CN104253850A (en) | Distributed task scheduling method and system | |
| KR20200134747A (en) | Controlling method for multiple dispatching strategies of a plurality of transportation equipments in container terminal | |
| CN104601704A (en) | Task based group dispatching data processing method and system | |
| CN106295927B (en) | Method and device for allocating tasks to operator | |
| CN110909962A (en) | Automatic approval method based on RPA robot sharing center | |
| CN105205399A (en) | Vulnerability scanning tool scheduling method and system | |
| CN115271556B (en) | Robot task scheduling method and device, readable storage medium and electronic equipment | |
| CN116361006B (en) | Method and system for collaborative scheduling of computing network resources oriented to memory computing separation | |
| CN109377063A (en) | A kind of method for scheduling task, device, equipment and storage medium | |
| CN106127410A (en) | Housekeeping service monitoring and managing method, Apparatus and system | |
| CN113867181A (en) | Robot cooperation method and device and first robot | |
| CN113268331A (en) | Robot calling method, robot calling device, management system and storage medium | |
| CN115660261B (en) | Production order information processing method, computer device and storage medium | |
| CN107885589B (en) | Job scheduling method and device | |
| CN110780869A (en) | Distributed batch scheduling | |
| CN110717662A (en) | Task allocation method, device, equipment and storage medium | |
| CN109598450B (en) | A kind of distributive knowledge network dispatching method towards fixed point output | |
| CN109634749B (en) | Distributed unified scheduling method and device | |
| Badr et al. | Integrating transportation scheduling with production scheduling for FMS: An agent-based approach | |
| CN105491042B (en) | The control method and system of more alert joint logistics |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 518054 Guangdong city of Shenzhen province Nanshan District Nanyou Avenue West Coast Building 18 layer 1801 Applicant after: Shenzhen Putian yitonge technology Limited by Share Ltd Address before: 518054 Guangdong city of Shenzhen province Nanshan District Nanyou Avenue West Coast Building 18 layer 1801 Applicant before: SHENZHEN PTYT TECHNOLOGY CO., LTD. |
|
| COR | Change of bibliographic data | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |