CN109656706A - Distributed task dispatching method, system, equipment and medium - Google Patents

Distributed task dispatching method, system, equipment and medium Download PDF

Info

Publication number
CN109656706A
CN109656706A CN201811592149.8A CN201811592149A CN109656706A CN 109656706 A CN109656706 A CN 109656706A CN 201811592149 A CN201811592149 A CN 201811592149A CN 109656706 A CN109656706 A CN 109656706A
Authority
CN
China
Prior art keywords
task
node
execution
actuator
names
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
CN201811592149.8A
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.)
Jiangsu Manyun Software Technology Co Ltd
Original Assignee
Jiangsu Manyun Software 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 Jiangsu Manyun Software Technology Co Ltd filed Critical Jiangsu Manyun Software Technology Co Ltd
Priority to CN201811592149.8A priority Critical patent/CN109656706A/en
Publication of CN109656706A publication Critical patent/CN109656706A/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

Abstract

The invention discloses a kind of distributed task dispatching method, system, equipment and media, comprising: receives the task requests issued by client, includes task names in task requests;In response to task requests, an actuator is matched according to task names, at least one is connected in actuator for executing the execution node of task corresponding with task names;An execution node being connected with actuator is obtained as task node according to a selection strategy;It issues one to task node to execute instruction, so that task node executes the corresponding task of task names;The implementing result that task node issues is received, and implementing result is fed back into client.The present invention realizes that the United Dispatching of task, actuator are realized with the communication of multiple tasks node and control the execution of each task node by scheduler;By the same configuration of scheduler, can matching rapidly and efficiently obtain task node, to provide respective service.

Description

Distributed task dispatching method, system, equipment and medium
Technical field
The present invention relates to a kind of task schedule fields, more specifically, be related to a kind of distributed task dispatching method, System, equipment and medium.
Background technique
The Distributed Architecture that existing task schedule uses relies on for light-task-scheduler (LTS) Distributed scheduling frame of the zookeeper or redis as registration center, more heavy, lower deployment cost is higher, lacks and unsuccessfully accuses Alert mechanism.And another distributed timing frame Elastic-Job, it is again based on the solution of zookeeper, is deployed to This is higher, and administration interface function is simple, and flexibility is poor, lacks unsuccessfully alarming mechanism.
Summary of the invention
In view of the problems of the existing technology, the purpose of the present invention is to provide a kind of distributed task dispatching method, be System, equipment and medium, including scheduler and actuator realize that the United Dispatching of task, actuator are realized by scheduler With the communication of multiple tasks node and control the execution of each task node;Individual equipment in cluster can arrange single appoint Business node or multiple tasks node, realize the flexible configuration of task node;It, can be quick by the same configuration of scheduler Efficient matching obtains task node, to provide respective service.
According to an aspect of the present invention, a kind of distributed task dispatching method is provided, comprising:
The task requests issued by client are received, include task names in the task requests;
In response to the task requests, an actuator is matched according to the task names, is connected at least in the actuator One for executing the execution node of task corresponding with the task names;
An execution node being connected with the actuator is obtained as task node according to a selection strategy;
It issues one to the task node to execute instruction, so that the task node execution task names are corresponding Task;
The implementing result that the task node issues is received, and the implementing result is fed back into the client.
Preferably, the selection strategy specifically includes the following steps:
The node listing being stored in the actuator is extracted, includes the node for executing node in the node listing Address;
A node address is obtained in the node listing;
Heartbeat detection is carried out to the execution node according to the node address;
If the execution node is by the heartbeat detection, using the execution node as the task node.
Preferably, one node address of acquisition in the node listing is set forth in specifically include:
Each node address in the node listing is mapped in a node serial number;
The node serial number is formed into a number queue;
The node serial number is randomly selected in the number queue;
The corresponding node address of the node serial number randomly selected is extracted from the node listing.
Preferably, one node address of acquisition in the node listing is set forth in specifically include:
Each current task sum for executing node is obtained according to the node address in the node listing;
The execution node is ranked up from small to large according to the current task sum, one is obtained and executes queue;
From with extracting the node for being located at the execution node of head of the queue in the execution queue in the node listing Location.
Preferably, if the task node executes the corresponding mission failure of the task names, warning information is generated.
Preferably, the warning information is sent to the client in a manner of mail.
Preferably, the distributed task dispatching method includes:
Dispatching platform receives the task requests issued by client, includes task names in the task requests;
The dispatching platform matches an actuator, the execution in response to the task requests, according to the task names At least one is connected in device for executing the execution node of task corresponding with the task names;
The dispatching platform obtains an execution node conduct being connected with the actuator according to a selection strategy Task node;
The actuator issues one to the task node and executes instruction, so that the task node executes the task The corresponding task of title;
The dispatching platform receives the implementing result that the task node issues, and the implementing result is fed back to described Client.
According to the present invention on one side, a kind of distributed task dispatching system is provided characterized by comprising
Receiving module receives the task requests issued by client, includes task names in the task requests;
Matching module matches an actuator according to the task names, in the actuator in response to the task requests At least one is connected with for executing the execution node of task corresponding with the task names;
Selecting module obtains an execution node being connected with the actuator as task according to a selection strategy Node;
Module is issued, Xiang Suoshu task node issues one and executes instruction, so that the task node executes the task The corresponding task of title;
Feedback module receives the implementing result that the task node issues, and the implementing result is fed back to the visitor Family end.
According to the present invention on one side, a kind of distributed task dispatching equipment is provided characterized by comprising
Processor;
Memory, wherein being stored with the executable instruction of the processor;
Wherein, the processor is configured to execute above-mentioned distributed task dispatching side via the executable instruction is executed The step of method.
According to an aspect of the present invention, a kind of computer readable storage medium is provided, for storing program, feature exists In described program is performed the step of realizing above-mentioned distributed task dispatching method.
The beneficial effect of above-mentioned technical proposal is:
Distributed task dispatching method, system, equipment and medium of the invention, including scheduler and actuator, pass through Scheduler realizes that the United Dispatching of task, actuator realize the communication with multiple tasks node and control each task node Execution;Individual equipment in cluster can arrange individual task node or multiple tasks node, realize task node Flexible configuration;By the same configuration of scheduler, can matching rapidly and efficiently obtain task node, to provide corresponding clothes Business.
Other features and advantages of the present invention and various embodiments of the present invention structurally and operationally, will referring to Attached drawing is described in detail.It should be noted that the present invention is not limited to specific embodiments described hereins.It is given herein these The purpose that embodiment is merely to illustrate that.
Detailed description of the invention
Upon reading the detailed description of non-limiting embodiments with reference to the following drawings, other feature of the invention, Objects and advantages will become more apparent upon.
Fig. 1 is a kind of specific implementation scene of distributed task dispatching method in preferred embodiment of the invention;
Fig. 2 is a kind of flow diagram of distributed task dispatching method in preferred embodiment of the invention;
Fig. 3 is a kind of flow diagram of selection strategy in preferred embodiment of the invention;
Fig. 4 is a kind of flow diagram that node address is obtained in node listing in preferred embodiment of the invention;
Fig. 5 is another process signal that node address is obtained in node listing in preferred embodiment of the invention Figure;
Fig. 6 is a kind of structural block diagram of distributed task dispatching system in preferred embodiment of the invention;
Fig. 7 is a kind of distributed task dispatching equipment in preferred embodiment of the invention;
Fig. 8 is a kind of structural schematic diagram of computer readable storage medium in preferred embodiment of the invention.
From the detailed description below in conjunction with attached drawing, the features and advantages of the present invention will become more apparent.Through attached drawing, Identical attached drawing identifies respective element.In the accompanying drawings, same reference numerals be indicated generally at it is identical, functionally similar and/or Similar element in structure.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete Site preparation description, it is clear that the described embodiment is only a part of the embodiment of the present invention, instead of all the embodiments.Based on this Embodiment in invention, those of ordinary skill in the art are obtained every other under the premise of not making the creative labor Embodiment shall fall within the protection scope of the present invention.
" first " used herein, " second " and similar word are not offered as any sequence, quantity or again The property wanted, and be used only to distinguish different component parts.The similar word such as " comprising " or "comprising" means before there is the word The element or object in face are covered the element for appearing in the word presented hereinafter or object and its are equal, and are not excluded for other elements Or object." connection " either the similar word such as " connected " is not limited to physics or mechanical connection, but can be with It is either direct or indirect including electrical connection."upper", "lower", "left", "right" etc. are only used for indicating relative position Relationship, after the absolute position for being described object changes, then the relative positional relationship may also correspondingly change.
It should be noted that in the absence of conflict, the feature in embodiment and embodiment in the present invention can phase Mutually combination.
The present invention will be further explained below with reference to the attached drawings and specific examples, but not as the limitation of the invention.
Fig. 1 is a kind of specific implementation scene of distributed task dispatching method.In implement scene shown in fig. 1, including with Family equipment 101, executes equipment 103, the first application apparatus 104, the second application apparatus 105 and third application at controlling equipment 102 Equipment 106.Operation is by client in user equipment 101, and operation has scheduler in controlling equipment 102, executes and runs in equipment 103 There is actuator, and the first application apparatus 104, the second application apparatus 105 and third application apparatus 106 are used as an execution node To execute task.First application apparatus 104, the second application apparatus 105 and third application apparatus 106 constitute an application collection Group.User equipment 101 is connected by network with controlling equipment 102, and controlling equipment 102 is connected by network with equipment 103 is executed, And it executes equipment 103 and is connected with each application apparatus by network.The user equipment 101 can be but not limited to any one can With the human-computer interaction electronic product interacted with user, such as: smart phone, tablet computer and desktop computer etc..The use The operating system of family equipment 101 can be any operating system, such as: Android operation system, IOS operating system.Execution is set It can be but not limited to a kind of instruction that can be set or store according to realization for 103 and controlling equipment 102, carry out numerical value automatically It calculates and the electronic equipment of information processing, hardware includes but is not limited to microprocessor, specific integrated circuit (ASIC), may be programmed Logical device (PLD), field programmable gate array (FPGA), digital signal processor (DSP) and embedded device etc..It executes Equipment 103 and controlling equipment 102 can also be desktop computer, network host, single network server, multiple network servers The cloud that cluster or multiple servers are constituted;Here, cloud is by a large amount of computers or net based on cloud computing (Cloud Computing) Network server is constituted, wherein cloud computing is one kind of distributed computing, is made of the computer of a group loose couplings virtual super Grade computer.Network can include but is not limited to internet, wide area network, Metropolitan Area Network (MAN), VPN network, wireless self-organization network (Ad Hoc network) etc..First application apparatus 104, the second application apparatus 105 and third application apparatus 106 can be but not limited to one Kind can be according to the instruction for setting or storing be realized, automatic progress numerical value calculates and the electronic equipment of information processing, hardware packet Include but be not limited to microprocessor, specific integrated circuit (ASIC), programmable logic device (PLD), field programmable gate array (FPGA), digital signal processor (DSP) and embedded device etc., being also possible to but be not limited to any one can be with user The human-computer interaction electronic product interacted.
In some embodiments, actuator and scheduler can be run in the same equipment, for example, server, movement are eventually End, desktop computer etc..One application apparatus can run multiple execution nodes.Each executes node for executing a Xiang Teding Task, the execution node include node address, task names and port numbers, that is, pass through node address, task names and end Slogan is assured that a unique execution node.The execution node can be an independent application as shown in Figure 1 Equipment is also possible to a dummy node.
Below based on the specific implementation scene of distributed task dispatching method shown in fig. 1, to the distribution in the application Method for scheduling task is specifically described.
Fig. 2 is a kind of flow diagram of distributed task dispatching method.Fig. 2 shows distributed task dispatching method packet It includes: step S202, step S204, step S206, step S208 and step S210.
In step S202, the task requests issued by client are received, include task names in the task requests, It is received by the scheduler run in controlling equipment 102 and is asked by the task that the client run in user equipment 101 issues It asks.When client needs a certain service, a task requests are issued to scheduler, include the task names in the task requests (service).The arbitrary equipment that can also be in application cluster of task requests is issued, for example, it may be the first application apparatus 104, Second application apparatus 105 or third application apparatus 106.
In step S204, scheduler matches an actuator, institute in response to the task requests, according to the task names It states and is connected at least one in actuator for executing the execution node of task corresponding with the task names.Each actuator Multiple execution nodes are connected with, each execution node is for executing a kind of i.e. offer service of task.According to the clothes in task requests Business title can match to obtain corresponding actuator, that is, the corresponding task of the service name being connected in executable task requests is held The actuator of row node.For example, controlling equipment 102 shown in Fig. 1 is matched to have obtained shown in Fig. 1 and be held according to task requests Row equipment 103 runs actuator in the execution equipment 103.
In step S206, scheduler obtains an execution section being connected with the actuator according to a selection strategy Point is used as task node.Scheduler obtains an execution node according to selection strategy and executes client institute as task node The task of request.
Fig. 3 is a kind of flow diagram of selection strategy.Selection strategy shown in Fig. 3 is specifically includes the following steps: step Rapid S302, step S304, step S306 and step S308.In step s 302, scheduler extraction is stored in the actuator In node listing, include the node address for executing node in the node listing, node address is the execution node institute In the IP address of equipment.In step s 304, a node address is obtained in Yu Suoshu node listing.Scheduler is in node A node address is obtained in list, that is, selects an execution node.In step S306, scheduler is according to the node address Heartbeat detection is carried out to the execution node.Scheduler is asked to one spy work of execution node transmission is acquired in step s 304 It asks, contains a character group in spy request living, which is made of 28 ascii characters.It is had received when executing node After spy request living, the character group is extracted, adds 8 to obtain new ascii character in the ASCII character of each character, to will visit Character group in request living is transformed into a new feedback character group, for example, including " a " transformation " i " in character group.It then will be anti- Feedback character group is sent back in scheduler, and scheduler verifies the feedback character group, and after being verified, i.e., the execution node is logical Cross heartbeat detection.In step S308, if the execution node by the heartbeat detection, using the execution node as institute State task node.The execution node obtained in step s 304 has passed through heartbeat detection, then the task node is active node, will The execution node is as task node.
Fig. 4 is a kind of flow diagram that node address is obtained in node listing.Step S304 is specifically included: step S402, step S404, step S406 and step S408.In step S402, scheduler will be each in the node listing The node address is mapped in a node serial number.The all corresponding node of each of node listing node address is compiled Number, all node serial numbers are continuous number.In step s 404, the node serial number is formed a number queue by scheduler. All node serial numbers are ranked up according to sequence from big to small, form a number queue later.In step S406, The node serial number is randomly selected in the number queue.One is generated between number queue maxima and minima Random number, i.e., at random obtain a node serial number.In step S408, scheduler extracts random choosing from the node listing The corresponding node address of the node serial number taken.Node address corresponding to the node serial number obtained in step S406 It is required node address.
Fig. 5 is another flow diagram that node address is obtained in node listing.In some embodiments, step S304 It specifically includes: step S502, step S504 and step S506.In step S502, scheduler is according in the node listing The node address obtain it is each it is described execute node current task sum.Executing node, it includes a task queue, Task in the task queue is all current task, is to need to be implemented node to be executed.Scheduler is connected according to node address Application apparatus to where the execution node, it is total so as to transfer the current task in task queue belonging to the execution node Number.In step S504, scheduler is from small to large ranked up the execution node according to the current task sum, obtains One executes queue.Execution node in address list is ranked up all in accordance with current task sum, and current task sum is smaller more Close to head of the queue.In step S506, scheduler in the node listing from extracting in the execution queue positioned at described in head of the queue Execute the node address of node.The execution node at head of the queue in execution queue, which is that current task sum is least, executes section Point can optimize the configuration of whole system using the execution node as task node, improve application cluster and provide the efficiency of service.
In step S208, actuator issues one to the task node and executes instruction, so that the task node is held The corresponding task of the row task names.The task node of execution task has been determined by step S206, and actuator is to the task Node transmission executes instruction.For example, by http protocol, executing equipment 103 in Fig. 1 and being applied by http protocol to first Equipment 104, the second application apparatus 105 or third application apparatus 106 send one and execute instruction, run on the first application apparatus 104, Task node in second application apparatus 105 or third application apparatus 106 is executed instruction in response to this to be executed.If described The corresponding mission failure of the node execution task names of being engaged in, then generate warning information.The warning information is in a manner of mail It is sent to the client.
In step S210, scheduler receives the implementing result that the task node issues, and the implementing result is anti- It is fed to the client.
In some embodiments, distributed task dispatching method may comprise steps of:
Scheduler receives the task requests issued by client, includes task names in the task requests;
The scheduler matches an actuator, the actuator in response to the task requests, according to the task names In be connected at least one for executing execution node of task corresponding with the task names;
The scheduler obtains the execution node that one is connected with the actuator and be used as according to a selection strategy appoints Business node;
The actuator issues one to the task node and executes instruction, so that the task node executes the task The corresponding task of title;
The scheduler receives the implementing result that the task node issues, and the implementing result is fed back to the visitor Family end.
According to an aspect of the present invention, a kind of distributed task dispatching system is provided.
Fig. 6 is a kind of structural block diagram of distributed task dispatching system.The distributed task dispatching system 500 includes:
Receiving module 501 receives the task requests issued by client, includes task names in the task requests;
Matching module 502 matches an actuator, the execution according to the task names in response to the task requests At least one is connected in device for executing the execution node of task corresponding with the task names;
Selecting module 503 obtains an execution node conduct being connected with the actuator according to a selection strategy Task node;
Module 504 is issued, Xiang Suoshu task node issues one and executes instruction, so that the task node executes described appoint The corresponding task of title of being engaged in;
Feedback module 505 receives the implementing result that the task node issues, and the implementing result is fed back to described Client.
According to an aspect of the present invention, a kind of distributed task dispatching equipment 102 is provided, comprising: processor;Storage Device, wherein being stored with the executable instruction of processor;Wherein, processor executes interface dynamic life to executable instruction when executed The step of at method.
Fig. 7 is a kind of distributed task dispatching equipment of the invention.It is described referring to Fig. 7 according to the present invention this The electronic equipment 600 of embodiment.The electronic equipment 600 that Fig. 7 is shown is only an example, should not be to the embodiment of the present invention Function and use scope bring any restrictions.
As shown in fig. 7, electronic equipment 600 is showed in the form of universal computing device.The component of electronic equipment 600 can wrap Include but be not limited to: at least one processing unit 610, at least one storage unit 620, connection different platform component (including storage Unit 620 and processing unit 610) bus 630, display unit 640 etc..
Wherein, storage unit is stored with program code, and program code can be executed with unit 610 processed, so that processing is single Member 610 executes various exemplary implementations according to the present invention described in this specification above-mentioned electronic prescription circulation processing method part The step of mode.For example, processing unit 610 can execute step as shown in Figure 2.
Storage unit 620 may include the readable medium of volatile memory cell form, such as Random Access Storage Unit (RAM) 6201 and/or cache memory unit 6202, it can further include read-only memory unit (ROM) 6203.
Storage unit 620 can also include program/utility with one group of (at least one) program module 6205 6204, such program module 6205 includes but is not limited to: operating system, one or more application program, other program moulds It may include the realization of network environment in block and program data, each of these examples or certain combination.
Bus 630 can be to indicate one of a few class bus structures or a variety of, including storage unit bus or storage Cell controller, peripheral bus, graphics acceleration port, processing unit use any bus structures in a variety of bus structures Local bus.
Electronic equipment 600 can also be with one or more external equipments 700 (such as keyboard, sensing equipment, bluetooth equipment Deng) communication, can also be enabled a user to one or more equipment interact with the electronic equipment 600 communicate, and/or with make Any equipment (such as the router, modulation /demodulation that the electronic equipment 600 can be communicated with one or more of the other calculating equipment Device etc.) communication.This communication can be carried out by input/output (I/O) interface 650.Also, electronic equipment 600 can be with By network adapter 660 and one or more network (such as local area network (LAN), wide area network (WAN) and/or public network, Such as internet) communication.Network adapter 660 can be communicated by bus 630 with other modules of electronic equipment 600.It should Understand, although not shown in the drawings, other hardware and/or software module can be used in conjunction with electronic equipment 600, including but unlimited In: microcode, device driver, redundant processing unit, external disk drive array, RAID system, tape drive and number According to backup storage platform etc..
According to an aspect of the present invention, a kind of computer readable storage medium is provided, for storing program, described program It is performed the step of realizing the above method.
Fig. 8 is a kind of structural schematic diagram of computer readable storage medium of the invention.Refering to what is shown in Fig. 8, describing root It, can be read-only using portable compact disc according to the program product 800 for realizing the above method of embodiments of the present invention Memory (CD-ROM) and including program code, and can be run on terminal device, such as PC.However, of the invention Program product it is without being limited thereto, in this document, readable storage medium storing program for executing can be it is any include or storage program tangible medium, The program can be commanded execution system, device or device use or in connection.
Program product can be using any combination of one or more readable mediums.Readable medium can be readable signal Jie Matter or readable storage medium storing program for executing.Readable storage medium storing program for executing for example can be but be not limited to electricity, magnetic, optical, electromagnetic, infrared ray or partly lead System, device or the device of body, or any above combination.More specific example (the non exhaustive column of readable storage medium storing program for executing Table) it include: the electrical connection with one or more conducting wires, portable disc, hard disk, random access memory (RAM), read-only storage Device (ROM), erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disc read only memory (CD- ROM), light storage device, magnetic memory device or above-mentioned any appropriate combination.
Computer readable storage medium may include in a base band or as carrier wave a part propagate data-signal, In carry readable program code.The data-signal of this propagation can take various forms, including but not limited to electromagnetic signal, Optical signal or above-mentioned any appropriate combination.Readable storage medium storing program for executing can also be any readable Jie other than readable storage medium storing program for executing Matter, the readable medium can send, propagate or transmit for by instruction execution system, device or device use or and its The program of combined use.The program code for including on readable storage medium storing program for executing can transmit with any suitable medium, including but not It is limited to wireless, wired, optical cable, RF etc. or above-mentioned any appropriate combination.
The program for executing operation of the present invention can be write with any combination of one or more programming languages Code, programming language include object oriented program language-Java, C++ etc., further include conventional process Formula programming language-such as " C " language or similar programming language.Program code can be calculated fully in user It executes in equipment, partly executed on user equipment 101, being executed as an independent software package, partially in user's calculating Upper side point is executed on a remote computing or is executed in remote computing device or server completely.It is being related to far Journey calculates in the situation of equipment, and remote computing device can pass through the network of any kind, including local area network (LAN) or wide area network (WAN), it is connected to user calculating equipment, or, it may be connected to external computing device (such as utilize ISP To be connected by internet).
To sum up, distributed task dispatching method, system, equipment and medium of the invention, including scheduler and actuator, Realize that the United Dispatching of task, actuator realize the communication with multiple tasks node and control each task by scheduler The execution of node;Individual equipment in cluster can arrange individual task node or multiple tasks node, realize task section The flexible configuration of point;By the same configuration of scheduler, can matching rapidly and efficiently obtain task node, to provide corresponding Service.
The above content is a further detailed description of the present invention in conjunction with specific preferred embodiments, and it cannot be said that Specific implementation of the invention is only limited to these instructions.For those of ordinary skill in the art to which the present invention belongs, exist Under the premise of not departing from present inventive concept, a number of simple deductions or replacements can also be made, all shall be regarded as belonging to of the invention Protection scope.

Claims (10)

1. a kind of distributed task dispatching method characterized by comprising
The task requests issued by client are received, include task names in the task requests;
In response to the task requests, an actuator is matched according to the task names, is connected at least one in the actuator For executing the execution node of task corresponding with the task names;
An execution node being connected with the actuator is obtained as task node according to a selection strategy;
It issues one to the task node to execute instruction, so that the task node executes described task names corresponding Business;
The implementing result that the task node issues is received, and the implementing result is fed back into the client.
2. distributed task dispatching method according to claim 1, which is characterized in that the selection strategy specifically include with Lower step:
The node listing that is stored in the actuator is extracted, includes the node for executing node in the node listing Location;
A node address is obtained in the node listing;
Heartbeat detection is carried out to the execution node according to the node address;
If the execution node is by the heartbeat detection, using the execution node as the task node.
3. distributed task dispatching method according to claim 2, which is characterized in that be set forth in the node listing and obtain The node address is taken to specifically include:
Each node address in the node listing is mapped in a node serial number;
The node serial number is formed into a number queue;
The node serial number is randomly selected in the number queue;
The corresponding node address of the node serial number randomly selected is extracted from the node listing.
4. distributed task dispatching method according to claim 2, which is characterized in that be set forth in the node listing and obtain The node address is taken to specifically include:
Each current task sum for executing node is obtained according to the node address in the node listing;
The execution node is ranked up from small to large according to the current task sum, one is obtained and executes queue;
From being extracted in the node listing in the execution queue positioned at the node address of the execution node of head of the queue.
5. distributed task dispatching method according to claim 1, which is characterized in that if described in task node execution The corresponding mission failure of task names, then generate warning information.
6. distributed task dispatching method according to claim 5, which is characterized in that the warning information is with the side of mail Formula is sent to the client.
7. distributed task dispatching method according to claim 1 characterized by comprising
Scheduler receives the task requests issued by client, includes task names in the task requests;
The scheduler matches an actuator in response to the task requests, according to the task names, connects in the actuator There is at least one for executing the execution node of task corresponding with the task names;
The scheduler obtains an execution node being connected with the actuator as task section according to a selection strategy Point;
The actuator issues one to the task node and executes instruction, so that the task node executes the task names Corresponding task;
The scheduler receives the implementing result that the task node issues, and the implementing result is fed back to the client End.
8. a kind of distributed task dispatching system characterized by comprising
Receiving module receives the task requests issued by client, includes task names in the task requests;
Matching module matches an actuator according to the task names, is connected in the actuator in response to the task requests At least one is used to execute the execution node of task corresponding with the task names;
Selecting module obtains an execution node being connected with the actuator as task section according to a selection strategy Point;
Module is issued, Xiang Suoshu task node issues one and executes instruction, so that the task node executes the task names Corresponding task;
Feedback module receives the implementing result that the task node issues, and the implementing result is fed back to the client.
9. a kind of distributed task dispatching equipment characterized by comprising
Processor;
Memory, wherein being stored with the executable instruction of the processor;
Wherein, the processor is configured to come any one of perform claim requirement 1-7 institute via the execution executable instruction The step of stating distributed task dispatching method.
10. a kind of computer readable storage medium, for storing program, which is characterized in that described program is performed realization power Benefit requires the step of distributed task dispatching method described in any one of 1-7.
CN201811592149.8A 2018-12-25 2018-12-25 Distributed task dispatching method, system, equipment and medium Pending CN109656706A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811592149.8A CN109656706A (en) 2018-12-25 2018-12-25 Distributed task dispatching method, system, equipment and medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811592149.8A CN109656706A (en) 2018-12-25 2018-12-25 Distributed task dispatching method, system, equipment and medium

Publications (1)

Publication Number Publication Date
CN109656706A true CN109656706A (en) 2019-04-19

Family

ID=66116099

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811592149.8A Pending CN109656706A (en) 2018-12-25 2018-12-25 Distributed task dispatching method, system, equipment and medium

Country Status (1)

Country Link
CN (1) CN109656706A (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110287228A (en) * 2019-05-20 2019-09-27 广西电网有限责任公司 Implementation method based on dispatching of power netwoks domain equipment monitoring real-time data acquisition
CN110727505A (en) * 2019-12-17 2020-01-24 杭州连银科技有限公司 Distributed task scheduling and service monitoring system capable of being hot-loaded
CN111046031A (en) * 2019-12-13 2020-04-21 智器云南京信息科技有限公司 Data processing method, system, terminal equipment and storage medium
CN111338775A (en) * 2020-02-21 2020-06-26 南京领行科技股份有限公司 Method and equipment for executing timing task
CN111782366A (en) * 2020-06-30 2020-10-16 中国工商银行股份有限公司 Distributed task scheduling method and device
CN111930489A (en) * 2020-09-15 2020-11-13 南京领行科技股份有限公司 Task scheduling method, device, equipment and storage medium
WO2020248626A1 (en) * 2019-06-10 2020-12-17 北京达佳互联信息技术有限公司 Task execution method, apparatus, device and system, and storage medium
CN112448977A (en) * 2019-08-30 2021-03-05 北京京东尚科信息技术有限公司 System, method, apparatus and computer readable medium for assigning tasks
CN113094164A (en) * 2021-04-27 2021-07-09 上海商汤科技开发有限公司 Task processing device and method, computer equipment and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105760240A (en) * 2014-12-16 2016-07-13 航天信息股份有限公司 Distributed task processing method and device
CN106909451A (en) * 2017-02-28 2017-06-30 郑州云海信息技术有限公司 A kind of distributed task dispatching system and method
CN107016480A (en) * 2016-01-28 2017-08-04 五八同城信息技术有限公司 Method for scheduling task, apparatus and system
CN107025136A (en) * 2016-01-29 2017-08-08 中兴通讯股份有限公司 A kind of decentralization resource regulating method and system
CN108304255A (en) * 2017-12-29 2018-07-20 北京城市网邻信息技术有限公司 Distributed task dispatching method and device, electronic equipment and readable storage medium storing program for executing

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105760240A (en) * 2014-12-16 2016-07-13 航天信息股份有限公司 Distributed task processing method and device
CN107016480A (en) * 2016-01-28 2017-08-04 五八同城信息技术有限公司 Method for scheduling task, apparatus and system
CN107025136A (en) * 2016-01-29 2017-08-08 中兴通讯股份有限公司 A kind of decentralization resource regulating method and system
CN106909451A (en) * 2017-02-28 2017-06-30 郑州云海信息技术有限公司 A kind of distributed task dispatching system and method
CN108304255A (en) * 2017-12-29 2018-07-20 北京城市网邻信息技术有限公司 Distributed task dispatching method and device, electronic equipment and readable storage medium storing program for executing

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110287228B (en) * 2019-05-20 2022-08-23 广西电网有限责任公司 Method for realizing real-time data acquisition based on power grid dispatching domain equipment monitoring
CN110287228A (en) * 2019-05-20 2019-09-27 广西电网有限责任公司 Implementation method based on dispatching of power netwoks domain equipment monitoring real-time data acquisition
WO2020248626A1 (en) * 2019-06-10 2020-12-17 北京达佳互联信息技术有限公司 Task execution method, apparatus, device and system, and storage medium
US11556380B2 (en) 2019-06-10 2023-01-17 Beijing Dajia Internet Information Technology Co., Ltd. Task execution method, apparatus, device and system, and storage medium
CN112448977A (en) * 2019-08-30 2021-03-05 北京京东尚科信息技术有限公司 System, method, apparatus and computer readable medium for assigning tasks
CN111046031A (en) * 2019-12-13 2020-04-21 智器云南京信息科技有限公司 Data processing method, system, terminal equipment and storage medium
CN110727505A (en) * 2019-12-17 2020-01-24 杭州连银科技有限公司 Distributed task scheduling and service monitoring system capable of being hot-loaded
CN110727505B (en) * 2019-12-17 2020-04-10 杭州连银科技有限公司 Distributed task scheduling and service monitoring system capable of being hot-loaded
CN111338775A (en) * 2020-02-21 2020-06-26 南京领行科技股份有限公司 Method and equipment for executing timing task
CN111338775B (en) * 2020-02-21 2022-06-07 南京领行科技股份有限公司 Method and equipment for executing timing task
CN111782366A (en) * 2020-06-30 2020-10-16 中国工商银行股份有限公司 Distributed task scheduling method and device
CN111930489A (en) * 2020-09-15 2020-11-13 南京领行科技股份有限公司 Task scheduling method, device, equipment and storage medium
CN113094164A (en) * 2021-04-27 2021-07-09 上海商汤科技开发有限公司 Task processing device and method, computer equipment and storage medium

Similar Documents

Publication Publication Date Title
CN109656706A (en) Distributed task dispatching method, system, equipment and medium
CN104395886A (en) Multi-tenant middleware cloud service technology
JP6753200B2 (en) Methods, systems and computer programs for cloud-based computing clusters for simulated operator training systems
CN110110543A (en) Data processing method, device, server and storage medium
CN103270492A (en) Hardware accelerated graphics for network enabled applications
US9459897B2 (en) System and method for providing data analysis service in cloud environment
US10599107B2 (en) System and method for smart grid dynamic regulation pools
Misra et al. Optimal gateway selection in sensor–cloud framework for health monitoring
CN108287764A (en) Distributed task dispatching method and its system, storage medium, electronic equipment
CN103853596A (en) Common contiguous memory region optimized long distance virtual machine migration
CN107637026A (en) Order is performed in virtual machine instance in a distributed computing environment
CN109783472A (en) Moving method, device, computer equipment and the storage medium of table data
CN103677970A (en) System and method for achieving combination display of terminal local desktop and far-end virtual desktop
CN110020733A (en) Replacing options, system, equipment and the medium of vehicle maintenance consumptive material
KR101426994B1 (en) Apparatus and method of sharing data using topology of mobile portable devices
JP2022521887A (en) Native code generation for cloud services
CN107615711A (en) System for event propagation
CN107203408A (en) The methods, devices and systems of redirection
CN109683917A (en) For the method for being deployed in application server, equipment and medium will to be applied
CN109858975A (en) More conversation type smart allocation methods, system, equipment and storage medium
CN109902182A (en) Knowledge data processing method, device, equipment and storage medium
US20240053973A1 (en) Deployable container scheduling and execution on cloud development environment
CN108713199A (en) Right management method, system, mobile terminal, shared charging equipment and server
CN105653290B (en) Data interactive method and system
CN107231291A (en) A kind of micro services partition method and device suitable for electric network information physical system

Legal Events

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

Application publication date: 20190419