CN110347492A - Distributed task dispatching method and apparatus based on time parameter method - Google Patents

Distributed task dispatching method and apparatus based on time parameter method Download PDF

Info

Publication number
CN110347492A
CN110347492A CN201910637694.2A CN201910637694A CN110347492A CN 110347492 A CN110347492 A CN 110347492A CN 201910637694 A CN201910637694 A CN 201910637694A CN 110347492 A CN110347492 A CN 110347492A
Authority
CN
China
Prior art keywords
task
delayed tasks
time parameter
parameter method
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201910637694.2A
Other languages
Chinese (zh)
Inventor
陈海成
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Qianhai Momentum Technology Co Ltd
Original Assignee
Shenzhen Qianhai Momentum Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Qianhai Momentum Technology Co Ltd filed Critical Shenzhen Qianhai Momentum Technology Co Ltd
Priority to CN201910637694.2A priority Critical patent/CN110347492A/en
Publication of CN110347492A publication Critical patent/CN110347492A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/485Task life-cycle, e.g. stopping, restarting, resuming execution
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Abstract

The distributed task dispatching method and apparatus based on time parameter method that the embodiment of the invention provides a kind of, wherein a kind of distributed task dispatching method based on time parameter method is applied to task management center, which comprises obtain pending task;The pending task is sent to and performs effectively node, the node that performs effectively is for generating implementing result;When implementing result is failure, according to the pending task and preset time parameter method, delayed tasks corresponding with the pending task are generated;If current time matches with the delayed tasks, by the delayed tasks be sent to it is described perform effectively node, to execute the delayed tasks.It solves the problems, such as real-time task, the unappeasable delay disposal of timed task and periodic task institute, greatly improves traffic handing capacity under many scenes, while reducing the consumption of server performance.

Description

Distributed task dispatching method and apparatus based on time parameter method
Technical field
The present invention relates to field of computer technology, more particularly to a kind of distributed task dispatching side based on time parameter method Method and a kind of distributed task dispatching device based on time parameter method.
Background technique
The method of existing distributed task dispatching is that and have periodicity, meeting according to well-regulated expression formula strategy The distributed task scheduling of multiple embodiments is generated, which is unable to satisfy business processing demand, while it is largely interior to occupy server It deposits, influences the performance of server operation.
Summary of the invention
In view of the above problems, it proposes the embodiment of the present invention and overcomes the above problem or at least partly in order to provide one kind A kind of distributed task dispatching method based on time parameter method for solving the above problems and corresponding a kind of based on time parameter method Distributed task dispatching device.
To solve the above-mentioned problems, the embodiment of the invention discloses a kind of distributed task dispatching sides based on time parameter method Method is applied to task management center, which comprises
Obtain pending task;
The pending task is sent to and performs effectively node, the node that performs effectively is for generating implementing result;
When implementing result is failure, according to the pending task and preset time parameter method, generate with described wait hold The corresponding delayed tasks of row task;
If current time matches with the delayed tasks, by the delayed tasks be sent to it is described perform effectively node, with Execute the delayed tasks.
Further, the step of acquisition pending task, comprising:
The time parameter method is configured, and generates the task recognition number of the pending task, the task recognition number is used as The unique identification of the pending task;
The time parameter method and the task recognition number are stored to database.
Further, described according to the pending task and preset time parameter method, it generates and the pending task The step of corresponding delayed tasks, comprising:
The delayed tasks are generated according to current time and the preset time parameter method;
Delayed tasks identifier is generated according to the delayed tasks;
The delayed tasks identifier is stored to the database, and deletes pending task described in the database The corresponding task recognition number.
Further, described be sent to the pending task performs effectively node, and the node that performs effectively is used for After the step of generating implementing result, comprising:
When implementing result is successfully, the corresponding task recognition of pending task described in the database is deleted Number.
Further, if the current time matches with the delayed tasks, the delayed tasks, which are sent to, described to be had Effect executes node, the step of to execute the delayed tasks after, comprising:
The delayed tasks are sent to and perform effectively node, the node that performs effectively is for generating the delayed tasks Implementing result;
If the implementing result of the delayed tasks fails, new delayed tasks are regenerated according to the time parameter method, Until the time parameter method terminates.
Further, it if the implementing result of the delayed tasks fails, is regenerated according to the time parameter method New delayed tasks, until the step of time parameter method terminates, comprising:
If the new delayed tasks failure, generates prompt information;
Receive the operational order corresponding with the prompt information that user sends;
The implementing result of the new delayed tasks is determined according to the operational order.
The embodiment of the invention discloses a kind of distributed task dispatching device based on time parameter method is applied to task management Center, comprising:
Task acquisition module, for obtaining pending task;
Task management module performs effectively node for the pending task to be sent to, described to perform effectively node For generating implementing result;
Task execution module is used for when implementing result is failure, according to the pending task and preset time plan Slightly, delayed tasks corresponding with the pending task are generated;
The delayed tasks are sent to institute if matching for current time with the delayed tasks by task Postponement module It states and performs effectively node, to execute the delayed tasks.
Further, the task acquisition module, comprising:
Numbered cell for configuring the time parameter method, and generates the task recognition number of the pending task, and described Business identifier is used as the unique identification of the pending task;
Storage unit, for storing the time parameter method and the task recognition number to database.
The embodiment of the invention discloses a kind of electronic equipment, including processor, memory and it is stored on the memory And the computer program that can be run on the processor, it is realized when the computer program is executed by the processor as above The step of distributed task dispatching method based on time parameter method stated.
The embodiment of the invention discloses a kind of computer readable storage medium, stored on the computer readable storage medium Computer program realizes such as the above-mentioned distributed task scheduling tune based on time parameter method when the computer program is executed by processor The step of degree method.
The embodiment of the present invention includes following advantages: solving real-time task, timed task and periodic task cannot expire The problem of delay disposal of foot, traffic handing capacity under many scenes is greatly improved, while reducing the consumption of server performance.
Detailed description of the invention
Fig. 1 is a kind of step flow chart of distributed task dispatching embodiment of the method based on time parameter method of the invention;
Fig. 2 is a kind of step process of another embodiment of distributed task dispatching method based on time parameter method of the invention Figure;
Fig. 3 is a kind of step process of another embodiment of distributed task dispatching method based on time parameter method of the invention Figure;
Fig. 4 is a kind of structural block diagram of distributed task dispatching Installation practice based on time parameter method of the invention;
Fig. 5 is a kind of structural frames of another embodiment of distributed task dispatching device based on time parameter method of the invention Figure;
Fig. 6 is a kind of structural frames of another embodiment of distributed task dispatching device based on time parameter method of the invention Figure.
Specific embodiment
In order to make the foregoing objectives, features and advantages of the present invention clearer and more comprehensible, with reference to the accompanying drawing and specific real Applying mode, the present invention is described in further detail.
One of the core concepts of the embodiments of the present invention is, by obtaining pending task;Pending task is sent to Node is performed effectively, performs effectively node for generating implementing result;When implementing result is failure, according to pending task and Preset time parameter method generates delayed tasks corresponding with pending task;If current time matches with delayed tasks, will be delayed Task, which is sent to, performs effectively node, to execute delayed tasks.Solve real-time task, timed task and periodic task institute not The problem of delay disposal being able to satisfy, greatly improves traffic handing capacity under many scenes, while reducing disappearing for server performance Consumption.
Referring to Fig.1-3, a kind of distributed task dispatching embodiment of the method based on time parameter method of the invention is shown Flow chart of steps is applied to task management center, can specifically include following steps:
S101 obtains pending task;According to different business scenarios in the present embodiment, different time plans can be corresponded to Processing business is slightly carried out, in one embodiment, in settlement process, after system receives the result of upstream payment, can be produced The pending task of a raw settlement process, above-mentioned pending task are generated according to the time parameter method of above-mentioned upstream payment.
Pending task is sent to and performs effectively node by S102, performs effectively node for generating implementing result;This reality Apply in example by above-mentioned pending task push to it is effective execute node, to perform effectively node processing above-mentioned pending by above-mentioned After task, implementing result is obtained.When the corresponding execution node starting of each pending task can registration center into Row Node registry, the registration information of each node include Prot (port) and IP address, and above-mentioned task node and registration center are protected Packet communication effective status is held, registration center can acquire each service state for executing node in current cluster at any time, if There is execution node that cannot provide service or failure, redistribute service strategy, task is pushed to effective execution node.
S103, according to pending task and preset time parameter method, is generated and pending when implementing result is failure It is engaged in corresponding delayed tasks;The distributed task scheduling that can produce one-time consumption in the present embodiment, according to different business scene Time parameter method carries out business processing, and above-mentioned preset time parameter method is separated with ", ", as unit of millisecond, according to different industry The business preset different time parameter method of scene, such as: 20000,5000,5000,5000,720000.Time parameter method can be according to field Scape setting, such as settlement of transactions and result queries when system initialization, can read time parameter method configuration file, data are arrived in storage In library, when scene needs to generate pending task, corresponding time parameter method can be read from database, when generating task execution Between (for example 12:00:00 generates task, and reading time parameter method is 20s, then the task execution time is 12:00:20), and And above-mentioned pending task is saved to database, it distributes and pushes to task management.
Delayed tasks are sent to if current time matches with delayed tasks and perform effectively node by S104, to execute delay Task.In one embodiment, if implementing result is failed, it is also necessary to depend on other conditions, but other conditions are not also complete At when, system can generate a delayed tasks (above-mentioned delay according to current time (12:01:00) and time parameter method (30s) The execution time of task is 12:01:30), by the time parameter method storage of above-mentioned delayed tasks to database, and delete currently wait hold Row task;When reaching the execution time of delayed tasks, system will continue to for above-mentioned delayed tasks to be pushed to effective task section It is handled on point, and judges implementing result, if implementing result is failed, continue the time parameter method for reading above-mentioned delayed tasks, it is raw The time is executed at delay and generates next new delayed tasks, and so on, until task node processing is completed.
In the present embodiment, S101, the step of obtaining pending task, comprising:
S110, setup time strategy, and the task recognition number of pending task is generated, task recognition number is used as pending The unique identification of business;Task management center can generate task in the present embodiment, each task node can generate a task Identifier Task ID, above-mentioned task recognition number is that task management center is unique, and can be stored into database, for protecting Demonstrate,proving each task can only execute once in entire distributed business environment;Each task node can be when starting Registration center's registration, task node obtains to correspond in management role execution list effectively executes node, is pushed to execution node Execute business processing;It is after task management center discovery has available executions node, priority is maximum, will submit at first to Execution task is pushed to above-mentioned effective execution node;The idle execution node of comparison preferentially is distributed to, reaches load balancing Effect.
S111 stores time parameter method and task recognition number to database.By above-mentioned pending task in the present embodiment Time parameter method and task recognition number are saved to database, are distributed and are pushed to task management.
In the present embodiment, S103 is generated corresponding with pending task according to pending task and preset time parameter method Delayed tasks the step of, comprising:
S130 generates delayed tasks according to current time and preset time parameter method;
S131 generates delayed tasks identifier according to delayed tasks;
S132 stores delayed tasks identifier to database, and deletes the corresponding task of pending task in database Identifier.
In the present embodiment, if implementing result is failed, need to rely on other conditions, but other conditions do not complete also When, system can generate a delayed tasks according to current time (12:01:00) and time parameter method (30s), and (task is held The row time is 12:01:30) database is arrived in storage, and deletes above-mentioned pending task.
In the present embodiment, pending task is sent to and performs effectively node by S102, performs effectively node for generating After the step of implementing result, comprising:
When implementing result is successfully, the corresponding task recognition number of pending task in database is deleted.
In the present embodiment, delayed tasks are sent to if current time matches with delayed tasks and perform effectively section by S104 Point, the step of to execute delayed tasks after, comprising:
Delayed tasks are sent to and perform effectively node, perform effectively node for generating the implementing result of delayed tasks;
If the implementing result of delayed tasks fails, new delayed tasks are regenerated according to time parameter method, until the time Strategy terminates.
In the present embodiment, if the implementing result of delayed tasks fails, new delay is regenerated according to time parameter method Task, until the step of time parameter method terminates, comprising:
If new delayed tasks fail, prompt information is generated;
Receive the operational order corresponding with prompt information that user sends;
The implementing result of new delayed tasks is determined according to operational order.
In the present embodiment, above-mentioned pending task execution finishes and then feeds back corresponding implementing result and gives task pipe Reason center:
If the implementing result success of feedback, deletes current pending task, and above-mentioned pending task is handled successfully;
If the implementing result of feedback is failed, also need to rely on other conditions, but other conditions do not complete also When, system can generate a delayed tasks storage to database according to current time and time parameter method, and delete above-mentioned Pending task;When the time of equal delayed tasks reaches, system will continue to be pushed to delayed tasks on effective task node Reason business, until the processing of above-mentioned task node is completed;
When time parameter method reaches last time, if implementing result success, which is successful;If Implementing result is failed, then then needing instruction execution depending on the user's operation;Inside entire task node, it is assumed that hair Raw unknown exception, task management center meeting feedback result retries, until returning to implementing result.Present application addresses appoint in real time It is engaged in, the delay disposal problem of timed task and periodic task, greatly improves the processing capacity of task under a variety of scenes, simultaneously Reduce the consumption of server performance.
Referring to Fig. 4-6, a kind of device of distributed task dispatching based on time parameter method of the invention is shown, is applied In task management center, comprising:
Task acquisition module 201, for obtaining pending task;
Task management module 202 performs effectively node for pending task to be sent to, and performs effectively node for giving birth to At implementing result;
Task execution module 203 is used for when implementing result is failure, according to pending task and preset time plan Slightly, delayed tasks corresponding with pending task are generated;
Delayed tasks are sent to and perform effectively if matching for current time with delayed tasks by task Postponement module 204 Node, to execute delayed tasks.
In the present embodiment, task acquisition module 201, comprising:
Numbered cell 210 for setup time strategy, and generates the task recognition number of pending task, task recognition number Unique identification as pending task;
Storage unit 211, for storing time parameter method and task recognition number to database.
In the present embodiment, task execution module 203, comprising:
Task delay unit 230, for generating delayed tasks according to current time and preset time parameter method;
Be delayed coding unit 231, for generating delayed tasks identifier according to delayed tasks;
Be delayed storage unit 232, for storing delayed tasks identifier to database, and deletes pending in database The corresponding task recognition number of task.
In the present embodiment, further includes:
Database update module, for deleting corresponding of pending task in database when implementing result is successfully Business identifier.
In the present embodiment, further includes:
Delay product feedback module performs effectively node for being sent to delayed tasks, performs effectively node for giving birth to At the implementing result of delayed tasks;
Cycle task processing module regenerates if the implementing result for delayed tasks fails according to time parameter method New delayed tasks, until time parameter method terminates.
In the present embodiment, if the implementing result of delayed tasks fails, new delay is regenerated according to time parameter method Task, until the step of time parameter method terminates, comprising:
Cue module generates prompt information if failing for new delayed tasks;
Operation module is instructed, for receiving the operational order corresponding with prompt information of user's transmission;
Operational feedback module, for determining the implementing result of new delayed tasks according to operational order.
A kind of electronic equipment of the invention, including processor, memory and storage are on a memory and can be in processor The computer program of upper operation realizes that the above-mentioned distribution based on time parameter method such as is appointed when computer program is executed by processor The step of method dispatched of being engaged in.
A kind of computer readable storage medium of the invention stores computer program on computer readable storage medium, counts The step of method such as the above-mentioned distributed task dispatching based on time parameter method is realized when calculation machine program is executed by processor.
It should be noted that for simple description, therefore, it is stated as a series of action groups for embodiment of the method It closes, but those skilled in the art should understand that, embodiment of that present invention are not limited by the describe sequence of actions, because according to According to the embodiment of the present invention, some steps may be performed in other sequences or simultaneously.Secondly, those skilled in the art also should Know, the embodiments described in the specification are all preferred embodiments, and the related movement not necessarily present invention is implemented Necessary to example.
For device embodiment, since it is basically similar to the method embodiment, related so being described relatively simple Place illustrates referring to the part of embodiment of the method.
All the embodiments in this specification are described in a progressive manner, the highlights of each of the examples are with The difference of other embodiments, the same or similar parts between the embodiments can be referred to each other.
It should be understood by those skilled in the art that, the embodiment of the embodiment of the present invention can provide as method, apparatus or calculate Machine program product.Therefore, the embodiment of the present invention can be used complete hardware embodiment, complete software embodiment or combine software and The form of the embodiment of hardware aspect.Moreover, the embodiment of the present invention can be used one or more wherein include computer can With in the computer-usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) of program code The form of the computer program product of implementation.
The embodiment of the present invention be referring to according to the method for the embodiment of the present invention, terminal device (system) and computer program The flowchart and/or the block diagram of product describes.It should be understood that flowchart and/or the block diagram can be realized by computer program instructions In each flow and/or block and flowchart and/or the block diagram in process and/or box combination.It can provide these Computer program instructions are set to general purpose computer, special purpose computer, Embedded Processor or other programmable data processing terminals Standby processor is to generate a machine, so that being held by the processor of computer or other programmable data processing terminal devices Capable instruction generates for realizing in one or more flows of the flowchart and/or one or more blocks of the block diagram The device of specified function.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing terminal devices In computer-readable memory operate in a specific manner, so that instruction stored in the computer readable memory generates packet The manufacture of command device is included, which realizes in one side of one or more flows of the flowchart and/or block diagram The function of being specified in frame or multiple boxes.
These computer program instructions can also be loaded into computer or other programmable data processing terminal devices, so that Series of operation steps are executed on computer or other programmable terminal equipments to generate computer implemented processing, thus The instruction executed on computer or other programmable terminal equipments is provided for realizing in one or more flows of the flowchart And/or in one or more blocks of the block diagram specify function the step of.
Although the preferred embodiment of the embodiment of the present invention has been described, once a person skilled in the art knows bases This creative concept, then additional changes and modifications can be made to these embodiments.So the following claims are intended to be interpreted as Including preferred embodiment and fall into all change and modification of range of embodiment of the invention.
Finally, it is to be noted that, herein, relational terms such as first and second and the like be used merely to by One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operation Between there are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant meaning Covering non-exclusive inclusion, so that process, method, article or terminal device including a series of elements not only wrap Those elements are included, but also including other elements that are not explicitly listed, or further includes for this process, method, article Or the element that terminal device is intrinsic.In the absence of more restrictions, being wanted by what sentence "including a ..." limited Element, it is not excluded that there is also other identical elements in process, method, article or the terminal device for including the element.
The method and one kind of a kind of distributed task dispatching based on time parameter method provided by the present invention are based on above The device of the distributed task dispatching of time parameter method, is described in detail, and specific case used herein is to of the invention Principle and embodiment is expounded, method and its core of the invention that the above embodiments are only used to help understand Thought;At the same time, for those skilled in the art, according to the thought of the present invention, in specific embodiment and application range Upper there will be changes, in conclusion the contents of this specification are not to be construed as limiting the invention.

Claims (10)

1. a kind of distributed task dispatching method based on time parameter method, which is characterized in that it is applied to task management center, it is described Method includes:
Obtain pending task;
The pending task is sent to and performs effectively node, the node that performs effectively is for generating implementing result;
When implementing result is failure, according to the pending task and preset time parameter method, generate and described pending It is engaged in corresponding delayed tasks;
If current time matches with the delayed tasks, by the delayed tasks be sent to it is described perform effectively node, to execute The delayed tasks.
2. the method according to claim 1, wherein the step of acquisition pending task, comprising:
The time parameter method is configured, and generates the task recognition number of the pending task, the task recognition number is used as described The unique identification of pending task;
The time parameter method and the task recognition number are stored to database.
3. according to the method described in claim 2, it is characterized in that, described according to the pending task and preset time plan Slightly, the step of generating delayed tasks corresponding with the pending task, comprising:
The delayed tasks are generated according to current time and the preset time parameter method;
Delayed tasks identifier is generated according to the delayed tasks;
The delayed tasks identifier is stored to the database, and it is corresponding to delete pending task described in the database The task recognition number.
4. according to the method described in claim 2, it is characterized in that, described be sent to the pending task performs effectively section Point, the node that performs effectively were used for after the step of generating implementing result, comprising:
When implementing result is successfully, the corresponding task recognition number of pending task described in the database is deleted.
If 5. the method according to claim 1, wherein the current time matched with the delayed tasks, will The delayed tasks be sent to it is described perform effectively node, the step of to execute the delayed tasks after, comprising:
The delayed tasks are sent to and perform effectively node, the node that performs effectively is for generating holding for the delayed tasks Row result;
If the implementing result of the delayed tasks fails, new delayed tasks are regenerated according to the time parameter method, until The time parameter method terminates.
If 6. the method according to claim 1, wherein the implementing result of the delayed tasks fails, New delayed tasks are regenerated according to the time parameter method, until the step of time parameter method terminates, comprising:
If the new delayed tasks failure, generates prompt information;
Receive the operational order corresponding with the prompt information that user sends;
The implementing result of the new delayed tasks is determined according to the operational order.
7. a kind of distributed task dispatching device based on time parameter method, which is characterized in that be applied to task management center, packet It includes:
Task acquisition module, for obtaining pending task;
Task management module performs effectively node for the pending task to be sent to, and the node that performs effectively is used for Generate implementing result;
Task execution module is used for when implementing result is failure, raw according to the pending task and preset time parameter method At delayed tasks corresponding with the pending task;
Task Postponement module, if being matched with the delayed tasks for current time, by the delayed tasks be sent to described in have Effect executes node, to execute the delayed tasks.
8. device according to claim 7, which is characterized in that the task acquisition module, comprising:
Numbered cell for configuring the time parameter method, and generates the task recognition number of the pending task, and the task is known Alias is used as the unique identification of the pending task;
Storage unit, for storing the time parameter method and the task recognition number to database.
9. electronic equipment, which is characterized in that including processor, memory and be stored on the memory and can be at the place The computer program run on reason device is realized when the computer program is executed by the processor as appointed in claim 1 to 6 The step of distributed task dispatching method described in one based on time parameter method.
10. computer readable storage medium, which is characterized in that computer program is stored on the computer readable storage medium, Point as described in any one of claims 1 to 6 based on time parameter method is realized when the computer program is executed by processor The step of cloth method for scheduling task.
CN201910637694.2A 2019-07-15 2019-07-15 Distributed task dispatching method and apparatus based on time parameter method Pending CN110347492A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910637694.2A CN110347492A (en) 2019-07-15 2019-07-15 Distributed task dispatching method and apparatus based on time parameter method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910637694.2A CN110347492A (en) 2019-07-15 2019-07-15 Distributed task dispatching method and apparatus based on time parameter method

Publications (1)

Publication Number Publication Date
CN110347492A true CN110347492A (en) 2019-10-18

Family

ID=68176387

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910637694.2A Pending CN110347492A (en) 2019-07-15 2019-07-15 Distributed task dispatching method and apparatus based on time parameter method

Country Status (1)

Country Link
CN (1) CN110347492A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111782365A (en) * 2020-06-30 2020-10-16 北京百度网讯科技有限公司 Timed task processing method, device, equipment and storage medium
CN113703929A (en) * 2020-05-20 2021-11-26 中国移动通信集团浙江有限公司 Task scheduling method, system, computing device and storage medium
CN113835859A (en) * 2021-09-24 2021-12-24 成都质数斯达克科技有限公司 Task scheduling method, device and equipment and readable storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018000878A1 (en) * 2016-06-29 2018-01-04 华为技术有限公司 Distributed task processing method and apparatus
CN107908487A (en) * 2017-11-08 2018-04-13 中国平安人寿保险股份有限公司 Task control management method, device, equipment and computer-readable recording medium
CN108345977A (en) * 2017-01-25 2018-07-31 阿里巴巴集团控股有限公司 A kind of method for processing business and device
CN109144683A (en) * 2017-06-28 2019-01-04 北京京东尚科信息技术有限公司 Task processing method, device, system and electronic equipment

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018000878A1 (en) * 2016-06-29 2018-01-04 华为技术有限公司 Distributed task processing method and apparatus
CN108345977A (en) * 2017-01-25 2018-07-31 阿里巴巴集团控股有限公司 A kind of method for processing business and device
CN109144683A (en) * 2017-06-28 2019-01-04 北京京东尚科信息技术有限公司 Task processing method, device, system and electronic equipment
CN107908487A (en) * 2017-11-08 2018-04-13 中国平安人寿保险股份有限公司 Task control management method, device, equipment and computer-readable recording medium

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113703929A (en) * 2020-05-20 2021-11-26 中国移动通信集团浙江有限公司 Task scheduling method, system, computing device and storage medium
CN113703929B (en) * 2020-05-20 2023-08-01 中国移动通信集团浙江有限公司 Task scheduling method, system, computing device and storage medium
CN111782365A (en) * 2020-06-30 2020-10-16 北京百度网讯科技有限公司 Timed task processing method, device, equipment and storage medium
CN111782365B (en) * 2020-06-30 2024-03-08 北京百度网讯科技有限公司 Timed task processing method, device, equipment and storage medium
CN113835859A (en) * 2021-09-24 2021-12-24 成都质数斯达克科技有限公司 Task scheduling method, device and equipment and readable storage medium
CN113835859B (en) * 2021-09-24 2023-12-26 成都质数斯达克科技有限公司 Task scheduling method, device, equipment and readable storage medium

Similar Documents

Publication Publication Date Title
US10713088B2 (en) Event-driven scheduling using directed acyclic graphs
CN108595157B (en) Block chain data processing method, device, equipment and storage medium
EP2454666B1 (en) Fault tolerant batch processing
CN110347492A (en) Distributed task dispatching method and apparatus based on time parameter method
CN111641515B (en) VNF life cycle management method and device
US9542226B2 (en) Operating programs on a computer cluster
US10013288B2 (en) Data staging management system
CN111258726B (en) Task scheduling method and device
US7882232B2 (en) Rapid resource provisioning with automated throttling
CN108984105B (en) Method and device for distributing replication tasks in network storage device
CN114721801A (en) Dynamic scheduling method and device for batch task execution time
CN112783613B (en) Method and device for scheduling units
CN110737533A (en) task scheduling method and device, electronic equipment and storage medium
CN113434283B (en) Service scheduling method and device, server and computer readable storage medium
US20110023018A1 (en) Software platform and method of managing application individuals in the software platform
CN102868594A (en) Method and device for message processing
KR102268796B1 (en) Apparatus for processing PLC service based on hypervisor
CN116431191A (en) Online upgrading method, device, equipment and medium for storage cluster
CN115481435A (en) Data isolation method and system based on tenant
CN117203617A (en) Computing sharing among devices using a cluster of device OSs
CN114327752A (en) Micro-service configuration method, device and equipment
CN111651276A (en) Scheduling method and device and electronic equipment
CN115904707A (en) Parallel scheduling method, device and equipment
CN117651935A (en) FaaS controller and method for FaaS system
CN114296874A (en) Cross-machine-room mirror image synchronization method and device, computer equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20191018

RJ01 Rejection of invention patent application after publication