CN105511956A - Method and system for task scheduling based on share scheduling information - Google Patents
Method and system for task scheduling based on share scheduling information Download PDFInfo
- Publication number
- CN105511956A CN105511956A CN201410495014.5A CN201410495014A CN105511956A CN 105511956 A CN105511956 A CN 105511956A CN 201410495014 A CN201410495014 A CN 201410495014A CN 105511956 A CN105511956 A CN 105511956A
- Authority
- CN
- China
- Prior art keywords
- subtask
- data
- node
- task
- sub
- 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
Abstract
The invention discloses a method and a system for task scheduling based on share scheduling information. The method comprises: a master scheduling node generating master scheduling data, sending the master scheduling data to a first subtask node; the first subtask node receiving the master scheduling data from the master scheduling node, after a subtask is executed, filling an execution result in a subtask execution data table, and sending the subtask execution data table to the next subtask node; processing by the next subtask node, until sending the subtask execution data table to the nth subtask node, the nth subtask node processing according to the filled data, and filling a processing result in the subtask execution data table, and sending the subtask execution data table to the master scheduling node. In the method, the master scheduling node interacts with the nth sub-node once, cost of a system is saved, and processing delay caused by interaction and communication of the master scheduling node and each subnode is reduced.
Description
Technical field
The invention belongs to computer task scheduling field, particularly relate to a kind of method for scheduling task based on shared schedule information and system.
Background technology
Along with telecommunications industry is growing, telecommunication service is also thereupon complicated, there is complex process and the calculating of a large amount of fusion products in telecommunication charging system.
A kind of situation is, when process ticket expense, charge system will carry out a large amount of accumulated process and accumulation calculates.Such as, Zhang San, Li Si, king five telephone expenses add up.
Another situation is, be associated process and calculating.Such as, Zhang San's telephone expenses reach 100 yuan, and Li Si can enjoy telephone expenses seventy percent discount.Li Si's telephone expenses arrive 150 yuan, and king five can enjoy telephone expenses fufty percent discount.
In traditional charging cloud system, have a total point of adjustment, n child node is distributed in subtask by total point of adjustment, carries out, after accumulated process, result being returned to total point of adjustment through each child node.Namely, total point of adjustment will carry out with n child node alternately, causing a large amount of system overheads respectively, and total point of adjustment and the mutual of each child node can produce processing delay with communicating.
Summary of the invention
The technical problem to be solved in the present invention is that total point of adjustment will carry out with n child node alternately, causing a large amount of system overheads respectively, and total point of adjustment and the mutual of each child node can produce processing delay with communicating.
According to an aspect of the present invention, propose a kind of method for scheduling task based on shared schedule information, comprising:
Total point of adjustment generates total adjusting data, and described total adjusting data comprises the execution sequence of subtask, the positional information of subtask node and subtask and performs tables of data;
Total adjusting data is sent to first sub-task node;
First sub-task node receives total adjusting data from total point of adjustment, after subtasking, execution result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to next subtask node;
Execution result, until (n-1)th sub-task node receives total adjusting data from last sub-task node, after subtasking, is inserted subtask and is performed tables of data by second sub-task node, and subtask is performed tables of data and send to next subtask node;
N-th subtask node receives total adjusting data from (n-1)th sub-task node, and the data according to having filled in process, and result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to total point of adjustment.
Further, the step of the execution sequence of total point of adjustment generation subtask is:
Total point of adjustment analyzes the correlativity between n subtask;
The priority depending on the subtask that other subtasks perform is set to the priority of the subtask relied on lower than it, and arranges from big to small according to this priority, obtain the execution sequence of the subtask corresponding with priority orders.
Further, the step carrying out processing according to the data filled in is:
If when the result of (n-1)th sub-task node does not meet the condition arranged, then data and the file of the n-th subtask node reading self process;
If when the result of (n-1)th sub-task node meets the condition of setting, then the n-th subtask node calculates according to the data of self and file, and jointly processes according to the information corresponding with the condition arranged.
Further, total point of adjustment preserves total adjusting data.
Further, performed task is charging, and charging result is inserted subtask execution tables of data.
According to a further aspect of the invention, also propose a kind of task scheduling system based on shared schedule information, comprising:
Total point of adjustment, for generating total adjusting data, described total adjusting data comprises the execution sequence of subtask, the positional information of subtask node and subtask and performs tables of data, and total adjusting data is sent to first sub-task node;
N sub-task node, wherein:
First sub-task node is used for receiving total adjusting data from total point of adjustment, after subtasking, execution result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to next subtask node;
Second sub-task node is until (n-1)th sub-task node is used for receiving total adjusting data from last sub-task node, after subtasking, execution result is inserted subtask and perform tables of data, and subtask is performed tables of data and send to next subtask node;
N-th subtask node is used for receiving total adjusting data from (n-1)th sub-task node, and the data according to having filled in process, and result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to total point of adjustment.
Further, total point of adjustment is for analyzing the correlativity between n subtask, the priority depending on the subtask that other subtasks perform is set to the priority of the subtask relied on lower than it, and arrange from big to small according to this priority, obtain the execution sequence of the subtask corresponding with priority orders.
Further, the n-th subtask node is not when the result of (n-1)th sub-task node meets the condition arranged, then the data and the file that read self process; When the result of (n-1)th sub-task node meets the condition of setting, calculate according to self data and file, and jointly process according to the information corresponding with the condition arranged.
Further, total point of adjustment is for preserving total adjusting data.
Further, n the task performed by sub-task node is charging, and charging result is inserted subtask execution tables of data.
In the present invention, the sub-task node sequential processes subtask of n performs tables of data, and is processed according to the data filled in by the n-th subtask node, result is inserted subtask execution tables of data, and subtask is performed tables of data and send to total point of adjustment.Therefore, total point of adjustment is only carried out once mutual with the n-th child node, save system overhead, and, decrease because of total point of adjustment and the mutual of each child node and the produced processing delay that communicates.
By referring to the detailed description of accompanying drawing to exemplary embodiment of the present invention, further feature of the present invention and advantage thereof will become clear.
Accompanying drawing explanation
What form a part for instructions drawings describes embodiments of the invention, and together with the description for explaining principle of the present invention.
With reference to accompanying drawing, according to detailed description below, clearly the present invention can be understood, wherein:
Fig. 1 is a kind of schematic diagram of the method for scheduling task embodiment based on shared schedule information.
Figure 2 shows that the schematic diagram of charging task scheduling embodiment.
Fig. 3 is a kind of schematic diagram of the task scheduling system embodiment based on shared schedule information.
Embodiment
Various exemplary embodiment of the present invention is described in detail now with reference to accompanying drawing.It should be noted that: unless specifically stated otherwise, otherwise positioned opposite, the numerical expression of the parts of setting forth in these embodiments and step and numerical value do not limit the scope of the invention.
Meanwhile, it should be understood that for convenience of description, the size of the various piece shown in accompanying drawing is not draw according to the proportionate relationship of reality.
Illustrative to the description only actually of at least one exemplary embodiment below, never as any restriction to the present invention and application or use.
May not discuss in detail for the known technology of person of ordinary skill in the relevant, method and apparatus, but in the appropriate case, described technology, method and apparatus should be regarded as a part of authorizing instructions.
In all examples with discussing shown here, any occurrence should be construed as merely exemplary, instead of as restriction.Therefore, other example of exemplary embodiment can have different values.
It should be noted that: represent similar terms in similar label and letter accompanying drawing below, therefore, once be defined in an a certain Xiang Yi accompanying drawing, then do not need to be further discussed it in accompanying drawing subsequently.
For making the object, technical solutions and advantages of the present invention clearly understand, below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in more detail.
Fig. 1 is a kind of schematic diagram of the method for scheduling task embodiment based on shared schedule information.The method comprises the following steps:
In step 110, total point of adjustment generates total adjusting data, and described total adjusting data comprises the execution sequence of subtask, the positional information of subtask node and subtask and performs tables of data, and total adjusting data is sent to first sub-task node.
Determine first sub-task node according to the subtask execution sequence in total adjusting data, and determine the position of first sub-task node according to the positional information of subtask node, so that total adjusting data is sent to first sub-task node.Similar, for second sub-task node until (n-1)th sub-task node, be all determine its next subtask node and position according to total adjusting data.
Subtask performs the execution data that tables of data comprises each subtask node.It is empty that initialized subtask performs tables of data.
Wherein, total point of adjustment preserves total adjusting data.Owing to preserving total adjusting data, then directly can read total adjusting data and to go forward side by side row relax.Thus can treatment effeciency be improved.
Wherein, the step of the execution sequence of total point of adjustment generation subtask is:
Total point of adjustment analyzes the correlativity between n subtask;
The priority depending on the subtask that other subtasks perform is set to the priority of the subtask relied on lower than it, and arranges from big to small according to this priority, obtain the execution sequence of the subtask corresponding with priority orders.
Such as, preserve user-selected telephone expenses set meal in subscriber data, comprise set meal 1 and set meal 2, wherein, set meal 1 is the local call 50 minutes of this user oneself, and exceed by normal rate charging, that is, subtask 1 is self call meters of this user; Set meal 2 is the unit at this user place or all message minutes of group, is 800 minutes, exceedes by normal rate charging, that is, subtask 2 is unit or group user's charging at this user place.Thus, it is relevant for can analyzing subtask 1 and subtask 2.That is, carry out, between each subtask of processing, there is correlativity based on same user profile.
Because this user is the unit at its place or a group user's part, so, the charging of this set meal 2 will depend on set meal 1, that is, subtask 2 will depend on subtask 1, then subtask 1 comes before subtask 2.Namely, for any one subtask node a, the execution of this subtask node a will depend on another subtask node b, then previous just at subtask node a of the execution sequence of subtask node b.
It will be understood by those skilled in the art that here just for illustrating the execution sequence how determining subtask, should not be construed as limitation of the present invention.
In step 120, first sub-task node receives total adjusting data from total point of adjustment, after subtasking, execution result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to next subtask node.
In step 130, second sub-task node is until (n-1)th sub-task node receives total adjusting data from last sub-task node, after subtasking, execution result is inserted subtask and perform tables of data, and subtask is performed tables of data and send to next subtask node.
In step 140, the n-th subtask node receives total adjusting data from (n-1)th sub-task node, and the data according to having filled in process, and result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to total point of adjustment.
Such as, the individual task performed by sub-task node of said n is charging, and execution result is charging result, and charging result is inserted subtask execution tables of data.
Wherein, the step carrying out processing according to the data filled in is:
If when the result of (n-1)th sub-task node does not meet the condition arranged, then data and the file of the n-th subtask node reading self process;
If when the result of (n-1)th sub-task node meets the condition of setting, then the n-th subtask node calculates according to the data of self and file, and jointly processes according to the information corresponding with the condition arranged.
Such as, subtask is charging subtask, and when the charging result of (n-1)th sub-task node does not meet the condition arranged, then data and the file of the n-th subtask node reading self carry out charging; If when the charging result of (n-1)th sub-task node meets the condition of setting, then the n-th subtask node is according to the data of self and file computational costs, and jointly carries out charging according to the information corresponding with the condition arranged.It will be understood by those skilled in the art that it is that the present invention will be described for charging here, especially the processing procedure of the n-th child node is described, should not be construed as limitation of the present invention.
In this embodiment, n sub-task node sequential processes subtask performs tables of data, and processed according to the data filled in by the n-th subtask node, result is inserted subtask and perform tables of data, and subtask is performed tables of data and send to total point of adjustment.Therefore, total point of adjustment is only carried out once mutual with the n-th child node, save system overhead, and, decrease because of total point of adjustment and the mutual of each child node and the produced processing delay that communicates.
With reference to the accompanying drawings the present invention is described more fully, exemplary embodiment of the present invention is wherein described.Figure 2 shows that the schematic diagram of charging task scheduling embodiment.
Suppose a task: the telephone expenses calculating king five.Wherein, the business background of this task is that Zhang San's telephone expenses reach 100 yuan, and Li Si can enjoy telephone expenses seventy percent discount; Li Si's telephone expenses arrive 150 yuan, and king five can enjoy telephone expenses fufty percent discount.
If A node king five, B node Li Si, C node Zhang San.Process the telephone expenses that first this charging task will read Zhang San, then read the telephone expenses of Li Si, finally calculate the telephone expenses of king five, king five finally completes this charging task.Complete the telephone expenses task calculating A node king five, the execution sequence of the subtask of needs: Zhang San C → Li Si B → king five A.
Task is not issued A node king five by total point of adjustment, but issues C node Zhang San, and sends total adjusting data to Zhang San.Zhang San performs according to subtask the telephone expenses that tables of data fills in Zhang San, searches B node Li Si, total adjusting data is issued Li Si according to total adjusting data.
Li Si fills in the data of Li Si, searches A node king five, data is issued king five.
King five finally receives data, and the inside contains Zhang San and the populated subtask of Li Si performs tables of data, and read corresponding data, if Li Si's telephone expenses arrive 150 yuan, then result is telephone expenses fufty percent discount.Otherwise, carry out charging according to normal rate.
Visible, total point of adjustment and A node king five have and for once mutual.If this task has n subtask, so A node and total point of adjustment are also only have 1 time alternately, promote significantly than traditional n-1 time.
Fig. 3 is a kind of schematic diagram of the task scheduling system embodiment based on shared schedule information.This system comprises: total point of adjustment and n sub-task node.Wherein:
Total point of adjustment, for generating total adjusting data, described total adjusting data comprises the execution sequence of subtask, the positional information of subtask node and subtask and performs tables of data, and total adjusting data is sent to first sub-task node.
In an embodiment of the present invention, total point of adjustment is for analyzing the correlativity between n subtask, the priority depending on the subtask that other subtasks perform is set to the priority of the subtask relied on lower than it, and arrange from big to small according to this priority, obtain the execution sequence of the subtask corresponding with priority orders.
Such as, preserve user-selected telephone expenses set meal in subscriber data, comprise set meal 1 and set meal 2, wherein, set meal 1 is the local call 50 minutes of this user oneself, and exceed by normal rate charging, that is, subtask 1 is self call meters of this user; Set meal 2 is the unit at this user place or all message minutes of group, is 800 minutes, exceedes by normal rate charging, that is, subtask 2 is unit or group user's charging at this user place.Thus, it is relevant for can analyzing subtask 1 and subtask 2.That is, carry out, between each subtask of processing, there is correlativity based on same user profile.
Because this user is the unit at its place or a group user's part, so, the charging of this set meal 2 will depend on set meal 1, that is, subtask 2 will depend on subtask 1, then subtask 1 comes before subtask 2.Namely, for any one subtask node a, the execution of this subtask node a will depend on another subtask node b, then previous just at subtask node a of the execution sequence of subtask node b.
It will be understood by those skilled in the art that here just for illustrating the execution sequence how determining subtask, should not be construed as limitation of the present invention.
In an embodiment of the present invention, total point of adjustment determines first sub-task node according to the subtask execution sequence in total adjusting data, and determine the position of first sub-task node according to the positional information of subtask node, so that total adjusting data is sent to first sub-task node.Similar, for second sub-task node until (n-1)th sub-task node, be all determine its next subtask node and position according to total adjusting data.
Subtask performs the execution data that tables of data comprises each subtask node.It is empty that initialized subtask performs tables of data.
Wherein, total point of adjustment preserves total adjusting data.Owing to preserving total adjusting data, then directly can read total adjusting data and to go forward side by side row relax.Thus can treatment effeciency be improved.
N sub-task node, wherein:
First sub-task node is used for receiving total adjusting data from total point of adjustment, after subtasking, execution result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to next subtask node;
Second sub-task node is until (n-1)th sub-task node is used for receiving total adjusting data from last sub-task node, after subtasking, execution result is inserted subtask and perform tables of data, and subtask is performed tables of data and send to next subtask node;
N-th subtask node is used for receiving total adjusting data from (n-1)th sub-task node, and the data according to having filled in process, and result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to total point of adjustment.Such as, the individual task performed by sub-task node of said n is charging, and execution result is charging result, and charging result is inserted subtask execution tables of data.
In an embodiment of the present invention, the n-th subtask node is not when the result of (n-1)th sub-task node meets the condition arranged, then the data and the file that read self process; When the result of (n-1)th sub-task node meets the condition of setting, calculate according to self data and file, and jointly process according to the information corresponding with the condition arranged.
Such as, subtask is charging subtask, and when the charging result of (n-1)th sub-task node does not meet the condition arranged, then data and the file of the n-th subtask node reading self carry out charging; If when the charging result of (n-1)th sub-task node meets the condition of setting, then the n-th subtask node is according to the data of self and file computational costs, and jointly carries out charging according to the information corresponding with the condition arranged.It will be understood by those skilled in the art that it is that the present invention will be described for charging here, especially the processing procedure of the n-th child node is described, should not be construed as limitation of the present invention.
In this embodiment, n sub-task node sequential processes subtask performs tables of data, and processed according to the data filled in by the n-th subtask node, result is inserted subtask and perform tables of data, and subtask is performed tables of data and send to total point of adjustment.Therefore, total point of adjustment is only carried out once mutual with the n-th child node, save system overhead, and, decrease because of total point of adjustment and the mutual of each child node and the produced processing delay that communicates.
So far, the present invention is described in detail.In order to avoid covering design of the present invention, details more known in the field are not described.Those skilled in the art, according to description above, can understand how to implement technical scheme disclosed herein completely.
Method of the present invention and device may be realized in many ways.Such as, any combination by software, hardware, firmware or software, hardware, firmware realizes method of the present invention and device.Said sequence for the step of described method is only to be described, and the step of method of the present invention is not limited to above specifically described order, unless specifically stated otherwise.In addition, in certain embodiments, can be also record program in the recording medium by the invention process, these programs comprise the machine readable instructions for realizing according to method of the present invention.Thus, the present invention also covers the recording medium stored for performing the program according to method of the present invention.
Although be described in detail specific embodiments more of the present invention by example, it should be appreciated by those skilled in the art, above example is only to be described, instead of in order to limit the scope of the invention.It should be appreciated by those skilled in the art, can without departing from the scope and spirit of the present invention, above embodiment be modified.Scope of the present invention is limited by claims.
Claims (10)
1., based on a method for scheduling task for shared schedule information, comprising:
Total point of adjustment generates total adjusting data, and described total adjusting data comprises the execution sequence of subtask, the positional information of subtask node and subtask and performs tables of data;
Total adjusting data is sent to first sub-task node;
First sub-task node receives total adjusting data from total point of adjustment, after subtasking, execution result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to next subtask node;
Execution result, until (n-1)th sub-task node receives total adjusting data from last sub-task node, after subtasking, is inserted subtask and is performed tables of data by second sub-task node, and subtask is performed tables of data and send to next subtask node;
N-th subtask node receives total adjusting data from (n-1)th sub-task node, and the data according to having filled in process, and result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to total point of adjustment.
2., according to claim 1 based on the method for scheduling task of shared schedule information, comprising:
The step that total point of adjustment generates the execution sequence of subtask is:
Total point of adjustment analyzes the correlativity between n subtask;
The priority depending on the subtask that other subtasks perform is set to the priority of the subtask relied on lower than it, and arranges from big to small according to this priority, obtain the execution sequence of the subtask corresponding with priority orders.
3. according to claim 1 or 2 based on the method for scheduling task of shared schedule information, comprising:
According to the step that the data filled in carry out processing be:
If when the result of (n-1)th sub-task node does not meet the condition arranged, then data and the file of the n-th subtask node reading self process;
If when the result of (n-1)th sub-task node meets the condition of setting, then the n-th subtask node calculates according to the data of self and file, and jointly processes according to the information corresponding with the condition arranged.
4. according to claim 1 or 2 based on the method for scheduling task of shared schedule information, comprising:
Total point of adjustment preserves total adjusting data.
5. according to claim 1 or 2 based on the method for scheduling task of shared schedule information, comprising:
Performed task is charging, and charging result is inserted subtask execution tables of data.
6., based on a task scheduling system for shared schedule information, comprising:
Total point of adjustment, for generating total adjusting data, described total adjusting data comprises the execution sequence of subtask, the positional information of subtask node and subtask and performs tables of data, and total adjusting data is sent to first sub-task node;
N sub-task node, wherein:
First sub-task node is used for receiving total adjusting data from total point of adjustment, after subtasking, execution result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to next subtask node;
Second sub-task node is until (n-1)th sub-task node is used for receiving total adjusting data from last sub-task node, after subtasking, execution result is inserted subtask and perform tables of data, and subtask is performed tables of data and send to next subtask node;
N-th subtask node is used for receiving total adjusting data from (n-1)th sub-task node, and the data according to having filled in process, and result is inserted subtask and performs tables of data, and subtask is performed tables of data and send to total point of adjustment.
7., according to claim 6 based on the task scheduling system of shared schedule information, comprising:
Total point of adjustment is for analyzing the correlativity between n subtask, the priority depending on the subtask that other subtasks perform is set to the priority of the subtask relied on lower than it, and arrange from big to small according to this priority, obtain the execution sequence of the subtask corresponding with priority orders.
8. according to claim 6 or 7 based on the task scheduling system of shared schedule information, comprising:
N-th subtask node is not when the result of (n-1)th sub-task node meets the condition arranged, then the data and the file that read self process; When the result of (n-1)th sub-task node meets the condition of setting, calculate according to self data and file, and jointly process according to the information corresponding with the condition arranged.
9. according to claim 6 or 7 based on the task scheduling system of shared schedule information, comprising:
Total point of adjustment is for preserving total adjusting data.
10. according to claim 6 or 7 based on the task scheduling system of shared schedule information, comprising:
N the task performed by sub-task node is charging, and charging result is inserted subtask execution tables of data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410495014.5A CN105511956B (en) | 2014-09-24 | 2014-09-24 | A kind of method for scheduling task and system based on shared scheduling information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410495014.5A CN105511956B (en) | 2014-09-24 | 2014-09-24 | A kind of method for scheduling task and system based on shared scheduling information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105511956A true CN105511956A (en) | 2016-04-20 |
| CN105511956B CN105511956B (en) | 2019-04-16 |
Family
ID=55719960
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410495014.5A Active CN105511956B (en) | 2014-09-24 | 2014-09-24 | A kind of method for scheduling task and system based on shared scheduling information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105511956B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109120706A (en) * | 2018-08-28 | 2019-01-01 | 中国邮政储蓄银行股份有限公司 | Business scheduling method and system |
| CN109800078A (en) * | 2018-12-12 | 2019-05-24 | 北京三快在线科技有限公司 | A kind of task processing method, task distribution terminal and task execution terminal |
| CN111435938A (en) * | 2019-01-14 | 2020-07-21 | 阿里巴巴集团控股有限公司 | Data request processing method, device and equipment |
| CN114489867A (en) * | 2022-04-19 | 2022-05-13 | 浙江大华技术股份有限公司 | Algorithm module scheduling method, algorithm module scheduling device and readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050071842A1 (en) * | 2003-08-04 | 2005-03-31 | Totaletl, Inc. | Method and system for managing data using parallel processing in a clustered network |
| CN101388844A (en) * | 2008-11-07 | 2009-03-18 | 东软集团股份有限公司 | Data flow processing method and system |
| WO2012022084A1 (en) * | 2010-08-19 | 2012-02-23 | 中兴通讯股份有限公司 | Method and equipment for managing resources by network administrator |
| CN103559082A (en) * | 2013-11-04 | 2014-02-05 | 北京华胜天成科技股份有限公司 | Distributed task scheduling method, device and system based on queues |
| CN103970611A (en) * | 2014-05-05 | 2014-08-06 | 神华集团有限责任公司 | Task processing method based on computer cluster |
-
2014
- 2014-09-24 CN CN201410495014.5A patent/CN105511956B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050071842A1 (en) * | 2003-08-04 | 2005-03-31 | Totaletl, Inc. | Method and system for managing data using parallel processing in a clustered network |
| CN101388844A (en) * | 2008-11-07 | 2009-03-18 | 东软集团股份有限公司 | Data flow processing method and system |
| WO2012022084A1 (en) * | 2010-08-19 | 2012-02-23 | 中兴通讯股份有限公司 | Method and equipment for managing resources by network administrator |
| CN103559082A (en) * | 2013-11-04 | 2014-02-05 | 北京华胜天成科技股份有限公司 | Distributed task scheduling method, device and system based on queues |
| CN103970611A (en) * | 2014-05-05 | 2014-08-06 | 神华集团有限责任公司 | Task processing method based on computer cluster |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109120706A (en) * | 2018-08-28 | 2019-01-01 | 中国邮政储蓄银行股份有限公司 | Business scheduling method and system |
| CN109800078A (en) * | 2018-12-12 | 2019-05-24 | 北京三快在线科技有限公司 | A kind of task processing method, task distribution terminal and task execution terminal |
| CN109800078B (en) * | 2018-12-12 | 2020-04-28 | 北京三快在线科技有限公司 | Task processing method, task distribution terminal and task execution terminal |
| CN111435938A (en) * | 2019-01-14 | 2020-07-21 | 阿里巴巴集团控股有限公司 | Data request processing method, device and equipment |
| CN114489867A (en) * | 2022-04-19 | 2022-05-13 | 浙江大华技术股份有限公司 | Algorithm module scheduling method, algorithm module scheduling device and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105511956B (en) | 2019-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104077671B (en) | A kind of stored method and system of sync vault | |
| CN105511956A (en) | Method and system for task scheduling based on share scheduling information | |
| CN104156392A (en) | Personalized recommendation method and system for friends and applications | |
| CN104598551A (en) | Data statistics method and device | |
| WO2014158769A1 (en) | Capacity calculator | |
| US11818231B2 (en) | Logical node distributed signature decision system and a method thereof | |
| CN105303410B (en) | Virtual article sharing method and device | |
| JP2016521422A5 (en) | ||
| CN110460435B (en) | Data interaction method and device, server and electronic equipment | |
| CN105183585B (en) | Data backup method and device | |
| CN105577710A (en) | Service providing method, service acquiring method, devices and system | |
| CN108038009A (en) | Front and back end exchange method, device and computer equipment based on Web applications | |
| CN104506636B (en) | A kind of method of data synchronization and device | |
| CN106302368B (en) | Transaction methods and device | |
| CN106296796B (en) | Information processing method, information processing unit and user equipment | |
| CN109800074A (en) | Task data concurrently executes method, apparatus and electronic equipment | |
| CN110082713A (en) | Localization method, terminal device and storage medium | |
| CN109345252A (en) | A kind of online trading control method, device and computer equipment | |
| CN106411545A (en) | Service attribute counting method and device | |
| CN110662188B (en) | Charging method and system | |
| CN103002053A (en) | Profit maximization scheduling method and system of cloud computing | |
| US20210385634A1 (en) | Method of determining shared service index based on shared service of communication credential | |
| CN115098558A (en) | Flight data statistical method and device | |
| JP2019045970A (en) | Distributed system, backend service, edge server and method therefor | |
| CN106250205B (en) | A kind of virtual machine method for customizing and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |