CN110287022A - A kind of scheduling node selection method, device, storage medium and server - Google Patents
A kind of scheduling node selection method, device, storage medium and server Download PDFInfo
- Publication number
- CN110287022A CN110287022A CN201910452776.XA CN201910452776A CN110287022A CN 110287022 A CN110287022 A CN 110287022A CN 201910452776 A CN201910452776 A CN 201910452776A CN 110287022 A CN110287022 A CN 110287022A
- Authority
- CN
- China
- Prior art keywords
- scheduling node
- node
- information
- scheduling
- task
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
Abstract
The embodiment of the present application discloses a kind of scheduling node selection method, device, storage medium and server, wherein method includes: that the current node information of each scheduling node is obtained in key assignments storage system ETCD when receiving business task；Obtain the indication information of each scheduling node；The indication information of current node information and each scheduling node based on each scheduling node determines optimal scheduling node in each scheduling node.Therefore, it continues to receive load problem caused by new task using the embodiment of the present application, when can be to avoid some scheduling node failure or heavy task.
Description
Technical field
This application involves field of computer technology more particularly to a kind of scheduling node selection method, device, storage medium and
Server.
Background technique
In existing distributed scheduling system, when receiving business task, usually directly by the business task with
Machine or sequence are sent to a scheduling node, and distributing to a certain worker node processing under its node by the application node should
Task.For example, business task 1 can be distributed to scheduling node 1 when system is connected to business task 1, be connected to business task 2
When, business task 2 is assigned to scheduling node 2, and so on.Until after all scheduling nodes received business task,
Receive next business task by scheduling node 1 again again.And once some scheduling node breaks down, system still will
Business task is distributed to the scheduling node, so that the business task of will lead to can not be handled.
Summary of the invention
The embodiment of the present application provides a kind of scheduling node selection method, device, storage medium and server, can be to avoid
It continues to receive load problem caused by new task when some scheduling node failure or heavy task.The technical solution is such as
Under:
In a first aspect, the embodiment of the present application provides a kind of scheduling node selection method, which comprises
When receiving business task, the current node information of each scheduling node is obtained in key assignments storage system ETCD；
Obtain the indication information of each scheduling node；
The indication information of current node information and each scheduling node based on each scheduling node, described each
Optimal scheduling node is determined in scheduling node.
Optionally, after the optimal scheduling node determining in each scheduling node, further includes:
The business task is distributed using the optimal scheduling node.
Optionally, the index of the current node information based on each scheduling node and each scheduling node is believed
Breath determines optimal scheduling node in each scheduling node, comprising:
Calculate the indication information of each scheduling node and the integrated information of current node information；
Target scheduling Node indicated by optimal synthesis information in the integrated information is determined as optimal scheduling node.
Optionally, described when receiving business task, before the task type for obtaining the business task, further includes:
Each scheduling node is registered in ETCD, obtains each registration scheduling node；
The current node information of each scheduling node is recorded in by the current node information for obtaining each scheduling node
Under each registration scheduling node.
Optionally, the method also includes:
Real-time update is carried out to the current node information under each registration scheduling node.
Second aspect, the embodiment of the present application provide a kind of scheduling node selection device, and described device includes:
Nodal information obtains module, for obtaining each tune in key assignments storage system ETCD when receiving business task
Spend the current node information of node；
Indication information obtains module, for obtaining the indication information of each scheduling node；
Scheduling node determining module, for current node information and each scheduling section based on each scheduling node
The indication information of point determines optimal scheduling node in each scheduling node.
Optionally, described device further include:
Task allocating module, for distributing the business task using the optimal scheduling node.
Optionally, the scheduling node determining module, comprising:
Integrated information computing unit, for calculating the indication information of each scheduling node and the synthesis of current node information
Information；
Scheduling node determination unit, for by target dispatch section indicated by the optimal synthesis information in the integrated information
Point is determined as optimal scheduling node.
Optionally, described device further include:
Node registry module obtains each registration scheduling node for registering each scheduling node in ETCD；
Information logging modle, for obtaining the current node information of each scheduling node, by each scheduling node
Current node information is recorded under each registration scheduling node.
Optionally, described device further include:
Information updating module, for carrying out real-time update to the current node information under each registration scheduling node.
The third aspect, the embodiment of the present application provide a kind of computer storage medium, and the computer storage medium is stored with
A plurality of instruction, described instruction are suitable for being loaded by processor and executing above-mentioned method and step.
Fourth aspect, the embodiment of the present application provide a kind of server, it may include: processor and memory；Wherein, described to deposit
Reservoir is stored with computer program, and the computer program is suitable for being loaded by the processor and executing above-mentioned method and step.
The technical solution bring beneficial effect that some embodiments of the application provide includes at least:
In the application one or more embodiment, when receiving business task, obtained in key assignments storage system ETCD
Take the current node information of each scheduling node；Obtain the indication information of each scheduling node；Based on each scheduling node
The indication information of current node information and each scheduling node determines optimal scheduling node in each scheduling node.
By reference ETCD, the present node index of each scheduling node can be inquired, and after the indication information of comprehensive each scheduling node, it can
To determine the scheduling node of current most suitable distribution business task, so as to avoid some scheduling node failure or task heavy
When continue to receive new task caused by load problem.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of application for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of network architecture schematic diagram of scheduling node selection system provided by the embodiments of the present application；
Fig. 2 is a kind of flow diagram of scheduling node selection method provided by the embodiments of the present application；
Fig. 3 is a kind of flow diagram of scheduling node selection method provided by the embodiments of the present application；
Fig. 4 is a kind of structural schematic diagram of scheduling node selection device provided by the embodiments of the present application；
Fig. 5 is a kind of structural schematic diagram of scheduling node selection device provided by the embodiments of the present application；
Fig. 6 is a kind of structural schematic diagram of scheduling node determining module provided by the embodiments of the present application；
Fig. 7 is a kind of structural schematic diagram of server provided by the embodiments of the present application.
Specific embodiment
To keep the purposes, technical schemes and advantages of the application clearer, below in conjunction with attached drawing to the embodiment of the present application
Mode is described in further detail.
In the following description when referring to the accompanying drawings, unless otherwise indicated, the same numbers in different attached drawings indicate same or similar
Element.Embodiment described in following exemplary embodiment does not represent all embodiment party consistent with the application
Formula.On the contrary, they are only the consistent device and method of as detailed in the attached claim, the application some aspects
Example.
In the description of the present application, it is to be understood that term " first ", " second " etc. are used for description purposes only, without
It can be interpreted as indication or suggestion relative importance.For the ordinary skill in the art, on being understood with concrete condition
State the concrete meaning of term in this application.In addition, unless otherwise indicated, " multiple " refer to two in the description of the present application
Or it is more than two."and/or" describes the incidence relation of affiliated partner, indicates may exist three kinds of relationships, for example, A and/or B,
Can indicate: individualism A exists simultaneously A and B, these three situations of individualism B.Character "/" typicallys represent forward-backward correlation pair
As if a kind of relationship of "or".
The application is illustrated below with reference to specific embodiment.
It referring to Figure 1, is a kind of network architecture schematic diagram of scheduling node selection system provided by the embodiments of the present application.Such as
Shown in Fig. 1, the network architecture may include distributed scheduling system, include key assignments storage system in distributed scheduling system
(a distributed, consistent key-value store for shared configuration and
Service discovery, ETCD).It further include a service node and multiple scheduling nodes in distributed scheduling system,
As scheduling node 1, scheduling node 2 ..., scheduling node n, scheduling node is used to distribute received business task, each
Including under scheduling node multiple working nodes (worker node) includes working node 11, working node such as under scheduling node 1
12 ..., working node 1n is used for processing business task.
It is one distributed for ETCD, consistent key-value storage is mainly used for configuration sharing and service
It was found that there are four central characteristics:
Simple: the API based on HTTP+JSON can be used easily with curl order.
Safety: optional SSL authenticated client mechanism.
It is quick: 1,000 write operations of each example support per second.
It is credible: to adequately achieve distribution using Raft algorithm.
The distributed scheduling system can be the server for having dispatch deal function.Distributed scheduling system will be answered respectively
Registered in ETCD with node, obtain each registration scheduling node, such as register scheduling node 1, registration scheduling node 2 ...,
Register scheduling node n.The current node information of each registration scheduling node is stored under each registration scheduling node.
Show that platform is distributed deployment it should be noted that distributed, it can statelessly and nothing between each node
The horizontal extension of limit.
Task schedule refers to that, based on given time point, given time interval or the given number that executes automatically execute
Task.Task schedule is the important component of operating system, and for real-time operating system, task schedule directly affects
The real-time performance of operating system.Task schedule is related to the dimension of multi-thread concurrent, runing time rules customization and parsing, thread pool
Shield, task status management, task schedule request send and receive, the distribution of specific tasks, task it is specific execute etc. it is many
The work of aspect.
One distributed task dispatching system comprises the following modules: web module, server module, scheduler module,
Worker module, registration center.Wherein:
Web module: for providing the information of task, state, the information displaying of control task etc.；
Server module: being responsible for receiving the information of task execution that web terminal transmits, issue task schedule request to
Scheduler can go to registration center to be registered；
Scheduler module: the scheduling request that the end server is transmitted is received, the fractionation that task is more refined is then
It issues, is registered to registration center, get the worker that can be worked；
Worker module: it is responsible for specific task execution；
Registration center.
In the embodiment of the present application, scheduling node, that is, scheduler module, working node, that is, worker module.In registration
The heart is ETCD.
As shown in Figure 1, being obtained in key assignments storage system ETCD each when distributed scheduling system receives business task
The current node information of scheduling node, while also obtaining the indication information of each scheduling node；
Wherein, current node information refers to that scheduling node may include central processing unit in the working condition at current time
CPU, input/output (Input/Output, IO), computer-internal memory space (MEMORY), task quantity to be allocated etc..
Index refers to pre- interim index to be achieved, specification, standard.Node index refers to each scheduling node expected interior complete
At task quantity allotted and number of run etc..
Optionally, it before receiving business task, needs to register each scheduling node in ETCD, obtains each registration
Scheduling node；The current node information for obtaining each scheduling node records the current node information of each scheduling node
Under each registration scheduling node.
It is also desirable to real-time update be carried out to the current node information under each registration scheduling node, to ensure
The current node information of record is currently, in real time.
The indication information of current node information and each scheduling node based on each scheduling node, described each
Optimal scheduling node is determined in scheduling node.
Calculate the indication information of each scheduling node and the integrated information of current node information；
Target scheduling Node indicated by optimal synthesis information in the integrated information is determined as optimal scheduling node.
The business task is distributed using the optimal scheduling node.
Specifically the business datum of business task is distributed to the working node to the optimal scheduling node, by working node
Manage the business task.
In the application one or more embodiment, when receiving business task, obtained in key assignments storage system ETCD
Take the current node information of each scheduling node；Obtain the indication information of each scheduling node；Based on each scheduling node
The indication information of current node information and each scheduling node determines optimal scheduling node in each scheduling node.
By reference ETCD, the present node index of each scheduling node can be inquired, and after the indication information of comprehensive each scheduling node, it can
To determine the scheduling node of current most suitable distribution business task, so as to avoid some scheduling node failure or task heavy
When continue to receive new task caused by load problem.
Below in conjunction with attached drawing 2- attached drawing 3, it is situated between in detail to scheduling node selection method provided by the embodiments of the present application
It continues.Wherein, the scheduling node selection device in the embodiment of the present application can be distributed scheduling system shown in FIG. 1, and described point
It can be the server for having application schedules processing function that cloth, which dispatches system,.
Fig. 2 is referred to, is a kind of flow diagram of scheduling node selection method provided by the embodiments of the present application.Such as Fig. 2
It is shown, the embodiment of the present application the method may include following steps:
S101 obtains the present node of each scheduling node when receiving business task in key assignments storage system ETCD
Information；
Business task refers to through user's operation on the subscriber terminal or developer on monitoring management server
Operation communication task generated.
It is one distributed for ETCD, consistent key-value storage is mainly used for configuration sharing and service
It was found that there are four central characteristics:
Simple: the API based on HTTP+JSON can be used easily with curl order.
Safety: optional SSL authenticated client mechanism.
It is quick: 1,000 write operations of each example support per second.
It is credible: to adequately achieve distribution using Raft algorithm.
Have the registration information of each scheduling node in ETCD, it can be understood as, the node identification of each scheduling node and with
The corresponding interdependent node information of the node identification is stored in ETCD.
Nodal information may include the CPU of each scheduling node, IO caching, the information such as MEM, DISK, processing task quantity.
Since the task of each scheduling node distribution and distribution progress etc. are not quite similar, and it ought constantly receive new industry
When business task, nodal information real-time change.Therefore, current node information then refers to that task of the scheduling node at current time is distributed
Situation.The current node information is that scheduling node registers scheduling node real-time report into ETCD, and ETCD then believes the node
Breath carries out real-time update.
Wherein, storage form of the current node information of application schedules in ETCD can be as shown in table 1.In scheduling node
Down include scheduling node 1, scheduling node 2 ... multiple scheduling nodes such as scheduling node n, each scheduling node respectively correspond currently
Nodal information.Such as, the corresponding current node information of scheduling node 1 includes CPU1, IO1,1, MEM1 of caching, DISK1, processing task
Quantity 1.
Table 1
In feasible implementation, scheduling node selection device is each in traversal ETCD when receiving business task
The nodal information at the current time that scheduling node is registered, so that the current node information to each scheduling node is compared.
S102 obtains the indication information of each scheduling node；
Index refers to pre- interim index to be achieved, specification, standard.Node indication information refers to each scheduling node in expection
The task quantity allotted of interior completion and number of run etc..
That is, having corresponding index task for each scheduling node included in distributed scheduling system.And
The indication information of each scheduling node is preset for the performance based on each scheduling node, and is fixed.Some scheduling sections
Point performance is good, and corresponding indication information is high, and partial scheduling joint behavior is poor, and corresponding indication information is low.
S103, the indication information of current node information and each scheduling node based on each scheduling node,
Optimal scheduling node is determined in each scheduling node.
The indication information of each scheduling node and the integrated information of current node information are calculated, it will be in the integrated information
Optimal synthesis information indicated by target scheduling Node be determined as optimal (such as treatment effeciency highest) scheduling node, for distributing
The business task.
Wherein, integrated information can be understood as the comprehensive score based on indication information and current node information, count respectively
The comprehensive score for calculating each scheduling node, the highest scheduling node that scores are the optimal scheduling for distributing the business task at current time
Node.
It should be noted that the optimal scheduling node is only the optimal of current time, in subsequent time, or receive down
When one business task, optimal scheduling node may optimal scheduling node thus, it is also possible to be other scheduling nodes.
In the application one or more embodiment, when receiving business task, obtained in key assignments storage system ETCD
Take the current node information of each scheduling node；Obtain the indication information of each scheduling node；Based on each scheduling node
The indication information of current node information and each scheduling node determines optimal scheduling node in each scheduling node.
By reference ETCD, the present node index of each scheduling node can be inquired, and after the indication information of comprehensive each scheduling node, it can
To determine the scheduling node of current most suitable distribution business task, so as to avoid some scheduling node failure or task heavy
When continue to receive new task caused by load problem.
Fig. 3 is referred to, is a kind of flow diagram of scheduling node selection method provided by the embodiments of the present application.This implementation
Example is applied to illustrate in server with scheduling node selection method.The scheduling node selection method may include following step
It is rapid:
S201 registers each scheduling node in ETCD, obtains each registration scheduling node；
For details, reference can be made to S101 by ETCD, and details are not described herein again.
It is understood that the nodal information (such as node identification, joint behavior) of each scheduling node is carried out in ETCD
It registers, and using the node after registration as registration scheduling node.That is, storing each scheduling node in ETCD
Relevant information, node identification and joint behavior including each scheduling node etc..
Optionally, include multiple working nodes under each scheduling node, each working node can in real time or periodically to
The automatic registered task of ETCD, scheduling node will find the task of registration automatically and trigger execution.
S202 obtains the current node information of each scheduling node, by the current node information of each scheduling node
It is recorded under each registration scheduling node；
Nodal information may include the CPU of each scheduling node, IO caching, the information such as MEM, DISK, processing task quantity.When
Front nodal point information is the nodal information at current time.It is to be understood that the nodal information of each scheduling node is corresponding with the moment.It should
Moment can be real time of day, or predefined periodic moments.
In the embodiment of the present application, which is the nodal information that each scheduling node registers the moment to ETCD.
S203 carries out real-time update to the current node information under each registration scheduling node；
Since each scheduling node is in real-time reception and distribution task, after the completion of a task, new appoint can be received again
Business.And mission requirements, task type of each task etc. is different, and therefore, in different moments, the nodal information of each scheduling node
It can change, by acquiring the nodal information of each scheduling node in real time and reporting to ETCD to the current node information registered
It is updated, thus convenient when carrying out task distribution, the nodal information relied on is more acurrate, and then business task can be improved
Allocative efficiency.
S204 obtains the present node of each scheduling node when receiving business task in key assignments storage system ETCD
Information；
For details, reference can be made to S101, and details are not described herein again.
S205 obtains the indication information of each scheduling node；
For details, reference can be made to S102, and details are not described herein again.
S206 calculates the indication information of each scheduling node and the integrated information of current node information；
Integrated information can be understood as the comprehensive score based on indication information and current node information, calculate separately each
The comprehensive score of scheduling node.
Target scheduling Node indicated by optimal synthesis information in the integrated information is determined as optimal scheduling by S207
Node；
The highest scheduling node that scores is the optimal scheduling node for distributing the business task at current time.
The optimal scheduling node is only the optimal of current time, in subsequent time, or when receiving next business task,
Optimal scheduling node may optimal scheduling node thus, it is also possible to be other scheduling nodes.
S208 distributes the business task using the optimal scheduling node.
That is, the business task is distributed corresponding to the optimal working node after selected optimal scheduling node
Scheduling node, and the working node under it is selected by the scheduling node, and send the business datum of business task in ETCD
In the register node of the working node, when the working node monitors in ETCD, belong in the register node of itself that there are business
After data, business datum is received from register node and starts to process the business task.
In the application one or more embodiment, when receiving business task, obtained in key assignments storage system ETCD
Take the current node information of each scheduling node；Obtain the indication information of each scheduling node；Based on each scheduling node
The indication information of current node information and each scheduling node determines optimal scheduling node in each scheduling node.
By reference ETCD, the present node index of each scheduling node can be inquired, and after the indication information of comprehensive each scheduling node, it can
To determine the scheduling node of current most suitable distribution business task, so as to avoid some scheduling node failure or task heavy
When continue to receive new task caused by load problem.
Following is the application Installation practice, can be used for executing the application embodiment of the method.It is real for the application device
Undisclosed details in example is applied, the application embodiment of the method is please referred to.
Fig. 4 is referred to, it illustrates the structures for the scheduling node selection device that one exemplary embodiment of the application provides
Schematic diagram.The scheduling node selection device can by software, hardware or both be implemented in combination with as terminal whole or
A part.The device 1 includes that nodal information obtains module 10, indication information obtains module 20 and scheduling node determining module 30.
Nodal information obtains module 10, for obtaining in key assignments storage system ETCD each when receiving business task
The current node information of scheduling node；
Indication information obtains module 20, for obtaining the indication information of each scheduling node；
Scheduling node determining module 30, for based on each scheduling node current node information and each scheduling
The indication information of node determines optimal scheduling node in each scheduling node.
Optionally, as shown in figure 5, described device further include:
Task allocating module 40, for distributing the business task using the optimal scheduling node.
Optionally, as shown in fig. 6, the scheduling node determining module 30, comprising:
Integrated information computing unit 301, for calculating the indication information and current node information of each scheduling node
Integrated information；
Scheduling node determination unit 302, for by target tune indicated by the optimal synthesis information in the integrated information
Degree node is determined as optimal scheduling node.
Optionally, as shown in figure 5, described device further include:
Node registry module 50 obtains each registration scheduling node for registering each scheduling node in ETCD；
Information logging modle 60, for obtaining the current node information of each scheduling node, by each scheduling node
Current node information be recorded under each registration scheduling node.
Optionally, as shown in figure 5, described device further include:
Information updating module 70, for carrying out real-time update to the current node information under each registration scheduling node.
It should be noted that scheduling node selection device provided by the above embodiment is executing scheduling node selection method
When, only the example of the division of the above functional modules, in practical application, it can according to need and divide above-mentioned function
With being completed by different functional modules, i.e., the internal structure of equipment is divided into different functional modules, to complete above description
All or part of function.In addition, scheduling node selection device provided by the above embodiment and scheduling node selection method are real
It applies example and belongs to same design, embody realization process and be detailed in embodiment of the method, which is not described herein again.
Above-mentioned the embodiment of the present application serial number is for illustration only, does not represent the advantages or disadvantages of the embodiments.
In the application one or more embodiment, when receiving business task, obtained in key assignments storage system ETCD
Take the current node information of each scheduling node；Obtain the indication information of each scheduling node；Based on each scheduling node
The indication information of current node information and each scheduling node determines optimal scheduling node in each scheduling node.
By reference ETCD, the present node index of each scheduling node can be inquired, and after the indication information of comprehensive each scheduling node, it can
To determine the scheduling node of current most suitable distribution business task, so as to avoid some scheduling node failure or task heavy
When continue to receive new task caused by load problem.
The embodiment of the present application also provides a kind of computer storage medium, the computer storage medium can store more
Item instruction, described instruction are suitable for being loaded by processor and being executed the method and step such as above-mentioned Fig. 2-embodiment illustrated in fig. 3, specifically hold
Row process may refer to Fig. 2-embodiment illustrated in fig. 3 and illustrate, herein without repeating.
Fig. 7 is referred to, provides a kind of structural schematic diagram of server for the embodiment of the present application.As shown in fig. 7, the clothes
Business device 1000 may include: at least one processor 1001, at least one network interface 1004, user interface 1003, memory
1005, at least one communication bus 1002.
Wherein, communication bus 1002 is for realizing the connection communication between these components.
Wherein, user interface 1003 may include display screen (Display), camera (Camera), optional user interface
1003 can also include standard wireline interface and wireless interface.
Wherein, network interface 1004 optionally may include standard wireline interface and wireless interface (such as WI-FI interface).
Wherein, processor 1001 may include one or more processing core.Processor 1001 using it is various excuse and
Various pieces in the entire server 1000 of connection, by running or executing the instruction being stored in memory 1005, journey
Sequence, code set or instruction set, and call the data that are stored in memory 1005, the various functions of execute server 1000 and
Handle data.Optionally, processor 1001 can using Digital Signal Processing (Digital Signal Processing,
DSP), field programmable gate array (Field-Programmable Gate Array, FPGA), programmable logic array
At least one of (Programmable Logic Array, PLA) example, in hardware is realized.Processor 1001 can integrating central
Processor (Central Processing Unit, CPU), image processor (Graphics Processing Unit, GPU)
With the combination of one or more of modem etc..Wherein, the main processing operation system of CPU, user interface and apply journey
Sequence etc.；GPU is used to be responsible for the rendering and drafting of content to be shown needed for display screen；Modem is for handling channel radio
Letter.It is understood that above-mentioned modem can not also be integrated into processor 1001, carried out separately through chip piece
It realizes.
Wherein, memory 1005 may include random access memory (Random Access Memory, RAM), also can wrap
Include read-only memory (Read-Only Memory).Optionally, which includes non-transient computer-readable medium
(non-transitory computer-readable storage medium).Memory 1005 can be used for store instruction, journey
Sequence, code, code set or instruction set.Memory 1005 may include storing program area and storage data area, wherein storing program area
Can store the instruction for realizing operating system, the instruction at least one function (such as touch function, sound play function
Energy, image player function etc.), for realizing instruction of above-mentioned each embodiment of the method etc.；Storage data area can store each above
The data etc. being related in a embodiment of the method.Memory 1005 optionally can also be that at least one is located remotely from aforementioned processing
The storage device of device 1001.As shown in fig. 7, as may include operation system in a kind of memory 1005 of computer storage medium
System, network communication module, Subscriber Interface Module SIM and scheduling node select application program.
In server 1000 shown in Fig. 7, user interface 1003 is mainly used for providing the interface of input for user, obtains
The data of user's input；And processor 1001 can be used for calling the scheduling node stored in memory 1005 selection using journey
Sequence, and specifically execute following operation:
When receiving business task, the current node information of each scheduling node is obtained in key assignments storage system ETCD；
Obtain the indication information of each scheduling node；
The indication information of current node information and each scheduling node based on each scheduling node, described each
Optimal scheduling node is determined in scheduling node.
In one embodiment, the processor 1001 is executing the determining optimal scheduling node in each scheduling node
Later, following operation is also executed:
The business task is distributed using the optimal scheduling node.
In one embodiment, the processor 1001 execute the current node information based on each scheduling node with
And the indication information of each scheduling node, when determining optimal scheduling node in each scheduling node, specific execution is following
Operation:
Calculate the indication information of each scheduling node and the integrated information of current node information；
Target scheduling Node indicated by optimal synthesis information in the integrated information is determined as optimal scheduling node.
In one embodiment, the processor 1001 is being executed when receiving business task, is obtained the business and is appointed
Before the task type of business, following operation is also executed:
Each scheduling node is registered in ETCD, obtains each registration scheduling node；
The current node information of each scheduling node is recorded in by the current node information for obtaining each scheduling node
Under each registration scheduling node.
In one embodiment, the processor 1001 also executes following operation:
Real-time update is carried out to the current node information under each registration scheduling node.
In the application one or more embodiment, when receiving business task, obtained in key assignments storage system ETCD
Take the current node information of each scheduling node；Obtain the indication information of each scheduling node；Based on each scheduling node
The indication information of current node information and each scheduling node determines optimal scheduling node in each scheduling node.
By reference ETCD, the present node index of each scheduling node can be inquired, and after the indication information of comprehensive each scheduling node, it can
To determine the scheduling node of current most suitable distribution business task, so as to avoid some scheduling node failure or task heavy
When continue to receive new task caused by load problem.
Those of ordinary skill in the art will appreciate that realizing all or part of the process in above-described embodiment method, being can be with
Relevant hardware is instructed to complete by computer program, the program can be stored in a computer-readable storage medium
In, the program is when being executed, it may include such as the process of the embodiment of above-mentioned each method.Wherein, the storage medium can be magnetic
Dish, CD, read-only memory or random access memory etc..
Above disclosed is only the application preferred embodiment, cannot limit the right model of the application with this certainly
It encloses, therefore according to equivalent variations made by the claim of this application, still belongs to the range that the application is covered.
Claims (10)
1. a kind of scheduling node selection method, which is characterized in that the described method includes:
When receiving business task, the current node information of each scheduling node is obtained in key assignments storage system ETCD；
Obtain the indication information of each scheduling node；
The indication information of current node information and each scheduling node based on each scheduling node, in each scheduling
Optimal scheduling node is determined in node.
2. the method according to claim 1, wherein described determine optimal scheduling section in each scheduling node
After point, further includes:
The business task is distributed using the optimal scheduling node.
3. the method according to claim 1, wherein the current node information based on each scheduling node
And the indication information of each scheduling node, optimal scheduling node is determined in each scheduling node, comprising:
Calculate the indication information of each scheduling node and the integrated information of current node information；
Target scheduling Node indicated by optimal synthesis information in the integrated information is determined as optimal scheduling node.
4. obtaining the business the method according to claim 1, wherein described when receiving business task
Before the task type of task, further includes:
Each scheduling node is registered in ETCD, obtains each registration scheduling node；
The current node information of each scheduling node is recorded in described by the current node information for obtaining each scheduling node
Under each registration scheduling node.
5. according to the method described in claim 4, it is characterized in that, the method also includes:
Real-time update is carried out to the current node information under each registration scheduling node.
6. a kind of scheduling node selection device, which is characterized in that described device includes:
Nodal information obtains module, for when receiving business task, obtaining each scheduling section in key assignments storage system ETCD
The current node information of point；
Indication information obtains module, for obtaining the indication information of each scheduling node；
Scheduling node determining module, for current node information and each scheduling node based on each scheduling node
Indication information determines optimal scheduling node in each scheduling node.
7. device according to claim 6, which is characterized in that described device further include:
Task allocating module, for distributing the business task using the optimal scheduling node.
8. device according to claim 6, which is characterized in that the scheduling node determining module, comprising:
Integrated information computing unit, indication information and the comprehensive of current node information for calculating each scheduling node are believed
Breath；
Scheduling node determination unit, for target scheduling Node indicated by the optimal synthesis information in the integrated information is true
It is set to optimal scheduling node.
9. a kind of computer storage medium, which is characterized in that the computer storage medium is stored with a plurality of instruction, described instruction
Suitable for being loaded by processor and being executed the method and step such as Claims 1 to 5 any one.
10. a kind of server characterized by comprising processor and memory；Wherein, the memory is stored with computer
Program, the computer program are suitable for being loaded by the processor and being executed the method step such as Claims 1 to 5 any one
Suddenly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910452776.XA CN110287022A (en) | 2019-05-28 | 2019-05-28 | A kind of scheduling node selection method, device, storage medium and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910452776.XA CN110287022A (en) | 2019-05-28 | 2019-05-28 | A kind of scheduling node selection method, device, storage medium and server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110287022A true CN110287022A (en) | 2019-09-27 |
Family
ID=68002846
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910452776.XA Pending CN110287022A (en) | 2019-05-28 | 2019-05-28 | A kind of scheduling node selection method, device, storage medium and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110287022A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110764910A (en) * | 2019-10-23 | 2020-02-07 | 中国银行股份有限公司 | Batch job scheduling processing method and device |
| CN110971679A (en) * | 2019-11-21 | 2020-04-07 | 厦门亿联网络技术股份有限公司 | Conference service scheduling method and device |
| CN110968411A (en) * | 2019-12-06 | 2020-04-07 | 北京明略软件系统有限公司 | Timed task scheduling method, timed task scheduling device, server and storage medium |
| CN111459576A (en) * | 2020-03-31 | 2020-07-28 | 北京九章云极科技有限公司 | Data analysis processing system and model operation method |
| CN112162846A (en) * | 2020-11-27 | 2021-01-01 | 腾讯科技（深圳）有限公司 | Transaction processing method, device and computer readable storage medium |
| CN112286629A (en) * | 2020-10-20 | 2021-01-29 | 北京大米科技有限公司 | Data processing method and device, storage medium and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101957780A (en) * | 2010-08-17 | 2011-01-26 | 中国电子科技集团公司第二十八研究所 | Resource state information-based grid task scheduling processor and grid task scheduling processing method |
| CN107733957A (en) * | 2016-08-12 | 2018-02-23 | 北京融聚世界网络科技有限公司 | Distributed Services configure system and version number's distribution method |
| CN108519911A (en) * | 2018-03-23 | 2018-09-11 | 上饶市中科院云计算中心大数据研究院 | The dispatching method and device of resource in a kind of cluster management system based on container |
| CN109508232A (en) * | 2018-11-26 | 2019-03-22 | 北京大米科技有限公司 | A kind of method, apparatus and electronic equipment of Portable Batch System |
-
2019
- 2019-05-28 CN CN201910452776.XA patent/CN110287022A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101957780A (en) * | 2010-08-17 | 2011-01-26 | 中国电子科技集团公司第二十八研究所 | Resource state information-based grid task scheduling processor and grid task scheduling processing method |
| CN107733957A (en) * | 2016-08-12 | 2018-02-23 | 北京融聚世界网络科技有限公司 | Distributed Services configure system and version number's distribution method |
| CN108519911A (en) * | 2018-03-23 | 2018-09-11 | 上饶市中科院云计算中心大数据研究院 | The dispatching method and device of resource in a kind of cluster management system based on container |
| CN109508232A (en) * | 2018-11-26 | 2019-03-22 | 北京大米科技有限公司 | A kind of method, apparatus and electronic equipment of Portable Batch System |
Non-Patent Citations (3)
| Title |
|---|
| 向彬彬: "基于OpenStack的Cloud OS云平台对接Trove组件的研究与实现", 《中国优秀博硕士学位论文全文数据库（硕士）信息科技辑》 * |
| 张子龙: "面向大数据的多租户关键技术研究", 《中国优秀博硕士学位论文全文数据库（硕士）经济与管理科学辑》 * |
| 方玉良: "基于OpenStack的云操作系统巡检方案的设计与实现", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110764910A (en) * | 2019-10-23 | 2020-02-07 | 中国银行股份有限公司 | Batch job scheduling processing method and device |
| CN110971679A (en) * | 2019-11-21 | 2020-04-07 | 厦门亿联网络技术股份有限公司 | Conference service scheduling method and device |
| CN110971679B (en) * | 2019-11-21 | 2023-04-07 | 厦门亿联网络技术股份有限公司 | Conference service scheduling method and device |
| CN110968411A (en) * | 2019-12-06 | 2020-04-07 | 北京明略软件系统有限公司 | Timed task scheduling method, timed task scheduling device, server and storage medium |
| CN111459576A (en) * | 2020-03-31 | 2020-07-28 | 北京九章云极科技有限公司 | Data analysis processing system and model operation method |
| CN111459576B (en) * | 2020-03-31 | 2021-03-12 | 北京九章云极科技有限公司 | Data analysis processing system and model operation method |
| CN112286629A (en) * | 2020-10-20 | 2021-01-29 | 北京大米科技有限公司 | Data processing method and device, storage medium and electronic equipment |
| CN112162846A (en) * | 2020-11-27 | 2021-01-01 | 腾讯科技（深圳）有限公司 | Transaction processing method, device and computer readable storage medium |
| CN112162846B (en) * | 2020-11-27 | 2021-04-09 | 腾讯科技（深圳）有限公司 | Transaction processing method, device and computer readable storage medium |
| WO2022111188A1 (en) * | 2020-11-27 | 2022-06-02 | 腾讯科技（深圳）有限公司 | Transaction processing method, system, apparatus, device, storage medium, and program product |
| JP7549137B2 (en) | 2020-11-27 | 2024-09-10 | ▲騰▼▲訊▼科技（深▲セン▼）有限公司 | Transaction processing method, system, device, equipment, and program |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110287022A (en) | A kind of scheduling node selection method, device, storage medium and server | |
| JP7566000B2 (en) | Leveraging Microservice Containers to Provide Tenant Isolation in a Multi-Tenant API Gateway | |
| US10003500B2 (en) | Systems and methods for resource sharing between two resource allocation systems | |
| US8984519B2 (en) | Scheduler and resource manager for coprocessor-based heterogeneous clusters | |
| CN110287009A (en) | A kind of working node selection method, device, storage medium and server | |
| JP5088234B2 (en) | Message association processing apparatus, method, and program | |
| CN108776934B (en) | Distributed data calculation method and device, computer equipment and readable storage medium | |
| CN113641457B (en) | Container creation method, device, apparatus, medium, and program product | |
| US20200104165A1 (en) | Systems and methods for scheduling tasks | |
| CN108268318A (en) | A kind of method and apparatus of distributed system task distribution | |
| US20190272189A1 (en) | Scheduling framework for tightly coupled jobs | |
| CN111694646A (en) | Resource scheduling method and device, electronic equipment and computer readable storage medium | |
| CN111190712A (en) | Task scheduling method, device, equipment and medium | |
| CN110389843A (en) | A kind of business scheduling method, device, equipment and readable storage medium storing program for executing | |
| US10986172B2 (en) | Configurable connection reset for customized load balancing | |
| CN109634764A (en) | Work-flow control method, apparatus, equipment, storage medium and system | |
| CN110673959A (en) | System, method and apparatus for processing tasks | |
| CN113032125A (en) | Job scheduling method, device, computer system and computer-readable storage medium | |
| CN113723758A (en) | Method and device for managing work tasks, storage medium and electronic equipment | |
| JPWO2007072544A1 (en) | Information processing apparatus, computer, resource allocation method, and resource allocation program | |
| CN111078516A (en) | Distributed performance test method and device and electronic equipment | |
| CN111813541B (en) | Task scheduling method, device, medium and equipment | |
| CN111694670B (en) | Resource allocation method, apparatus, device and computer readable medium | |
| CN112612600A (en) | Resource scheduling method and device based on DCU and computer equipment | |
| WO2013140412A1 (en) | A method and system for distributed computing of jobs |
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: 20190927 |
|
| RJ01 | Rejection of invention patent application after publication |