CN114518946A

CN114518946A - Method, system, device and medium for dynamically scheduling server resources

Info

Publication number: CN114518946A
Application number: CN202210039263.8A
Authority: CN
Inventors: 杨雪建
Original assignee: Zhejiang Baiying Technology Co Ltd
Current assignee: Zhejiang Baiying Technology Co Ltd
Priority date: 2022-01-13
Filing date: 2022-01-13
Publication date: 2022-05-20

Abstract

The application relates to a method, a system, a device and a medium for dynamically scheduling server resources, wherein the method comprises the following steps: starting a resource scheduling service, and adding a ZNOde child node for monitoring; monitoring the event type of the server node through the ZNOde child node, and carrying out different server resource scheduling operations according to different types of the events. Through the method and the device, the problems that dynamic scheduling cannot be performed, labor cost is high and efficiency is low when server resources are scheduled are solved, maintenance cost is reduced, the cluster is concentrated in concurrent operation of business data, and efficiency is improved.

Description

Method, system, device and medium for dynamically scheduling server resources

Technical Field

The present application relates to the field of computer technologies, and in particular, to a method, a system, an apparatus, and a medium for dynamically scheduling server resources.

Background

At present, computer technology is rapidly developed, in order to support a large amount of business of an enterprise, most of currently adopted servers are deployed in a cluster mode, and at this time, if a new server is added to a cluster server, for concurrent resource allocation, more configuration changes occur, and the difficulty is high.

Moreover, the allocation of resources requires manual intervention of developers, and dynamic loading cannot be realized, which is also a great waste of labor cost and low efficiency.

At present, no effective solution is provided for the problems of incapability of dynamic scheduling, high labor cost and low efficiency when server resources are scheduled in the related art.

Disclosure of Invention

The embodiment of the application provides a method, a system, a device and a medium for dynamically scheduling server resources, so as to solve at least the problems that the server resources cannot be dynamically scheduled, the labor cost is high and the efficiency is low when the server resources are scheduled in the related art.

In a first aspect, an embodiment of the present application provides a method for dynamically scheduling server resources, where the method includes:

starting a resource scheduling service, and adding a ZNOde child node for monitoring;

and monitoring the event type of the server node through the monitoring of the ZNOde child nodes, and carrying out different server resource scheduling operations according to different types of the events.

In some of these embodiments, the initiating the resource scheduling service comprises:

reading configuration information of a zookeeper, creating a CuratorFramework object as a client connected with the zookeeper, and creating a PathChildrenCache cache.

In some embodiments, the monitoring an event type of the server node, and performing different server resource scheduling operations according to different types of the events includes:

when the event type is an added event, analyzing the IP of the machine node registered to the zookeeper, inquiring whether the IP exists in a machine resource table or not according to the IP, if so, calculating the used concurrency number of the server of the current IP, and scheduling resources according to the information condition of the cluster server; if not, directly returning;

when the event type is a deletion event, inquiring server information according to an IP (Internet protocol), judging whether machine information of the server exists, if so, acquiring a corresponding machine object according to the IP, and removing the machine information of the machine object; if not, go back directly.

In some embodiments, performing resource scheduling according to the server cluster information includes:

acquiring machine information of a cluster server, judging whether the machine information of the cluster server is empty, and updating the used concurrency number of the server if the machine information of the cluster server is not empty;

and if the cluster server is empty, creating a machine object and putting the machine object into the cluster server.

In a second aspect, an embodiment of the present application provides a system for dynamically scheduling server resources, where the system includes:

the method comprises the steps that a starting module is created and used for starting resource scheduling service and adding ZNOde child nodes for monitoring;

and the monitoring and scheduling module is used for monitoring the event types of the server nodes through the ZNOde child nodes and carrying out different server resource scheduling operations according to different types of the events.

In some embodiments, the creation starting module is further configured to read zookeeper configuration information, create a CuratorFramework object as a client connected to the zookeeper, and create a PathChildrenCache.

In some embodiments, the monitoring and scheduling module is further configured to, when the event type is an added event, analyze an IP of a machine node registered in a zookeeper, query whether a machine resource table already exists according to the IP, if so, calculate a concurrency number used by a server of a current IP, and perform resource scheduling according to a condition of cluster server information; if the current time does not exist, the current time is directly returned,

In some embodiments, the monitoring and scheduling module is further configured to obtain machine information of a cluster server, determine whether the machine information of the cluster server is empty, if not, update a concurrency number used by the server,

In a third aspect, an embodiment of the present application provides an electronic apparatus, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the processor implements the method for dynamically scheduling server resources according to the first aspect.

In a fourth aspect, the present application provides a storage medium, on which a computer program is stored, where the program, when executed by a processor, implements the method for dynamically scheduling server resources as described in the first aspect above.

Compared with the related technology, the method for dynamically scheduling the server resources provided by the embodiment of the application starts the resource scheduling service and adds the ZNOde child node for monitoring; monitoring the event type of the server node through the ZNOde child node, and carrying out different server resource scheduling operations according to different types of the events.

According to the method and the system, dynamic expansion of the cluster server is realized, the condition of high concurrency of the cluster is met, the problems that dynamic scheduling cannot be carried out, labor cost is high and efficiency is low when server resources are scheduled are solved, maintenance cost is reduced, the cluster is enabled to be concentrated on concurrent operation of business data, and efficiency is improved.

Drawings

The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:

FIG. 1 is a schematic diagram of an application environment of a method for dynamically scheduling server resources according to an embodiment of the present application;

FIG. 2 is a flow chart of a method for dynamic scheduling of server resources according to an embodiment of the present application;

FIG. 3 is a schematic diagram illustrating a dynamic server resource scheduling process according to an embodiment of the present application;

FIG. 4 is a block diagram of a system for dynamic scheduling of server resources according to an embodiment of the present application;

fig. 5 is an internal structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described and illustrated below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments provided in the present application without any inventive step are within the scope of protection of the present application. Moreover, it should be appreciated that in the development of any such actual implementation, as in any engineering or design project, numerous implementation-specific decisions must be made to achieve the developers' specific goals, such as compliance with system-related and business-related constraints, which may vary from one implementation to another.

Reference in the specification to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the specification. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of ordinary skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments without conflict.

Unless defined otherwise, technical or scientific terms referred to herein shall have the ordinary meaning as understood by those of ordinary skill in the art to which this application belongs. The use of the terms "a" and "an" and "the" and similar referents in the context of describing the invention (including a single reference) are to be construed in a non-limiting sense as indicating either the singular or the plural. The present application is directed to the use of the terms "including," "comprising," "having," and any variations thereof, which are intended to cover non-exclusive inclusions; for example, a process, method, system, article, or apparatus that comprises a list of steps or modules (elements) is not limited to the listed steps or elements, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. Reference to "connected," "coupled," and the like in this application is not intended to be limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. Reference herein to "a plurality" means greater than or equal to two. "and/or" describes an association relationship of associated objects, meaning that three relationships may exist, for example, "A and/or B" may mean: a exists alone, A and B exist simultaneously, and B exists alone. Reference herein to the terms "first," "second," "third," and the like, are merely to distinguish similar objects and do not denote a particular ordering for the objects.

The method for dynamically scheduling server resources provided by the present application may be applied to an application environment shown in fig. 1, where fig. 1 is an application environment schematic diagram of the method for dynamically scheduling server resources according to the embodiment of the present application, as shown in fig. 1. The terminal 11 and the server 10 communicate with each other via a network. The server 10 starts a resource scheduling service and adds a ZNOde child node for monitoring; monitoring the event type of the server node through the ZNOde child node, and carrying out different server resource scheduling operations according to different types of the events. The terminal 11 may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices, and the server 10 may be implemented by an independent server or a server cluster formed by a plurality of servers.

Fig. 2 is a flowchart of a method for dynamically scheduling server resources according to an embodiment of the present application, and as shown in fig. 2, the flowchart includes the following steps:

step S201, starting a resource scheduling service memory, and adding a ZNOde child node for monitoring;

fig. 3 is a schematic diagram of a server resource dynamic scheduling process according to an embodiment of the present application, and as shown in fig. 3, preferably, after a resource scheduling service is started, first, zookeeper configuration information is read, a curatorframe object is created as a zookeeper-connected client, and a PathChildrenCache is created;

then, adding ZNOde child nodes for monitoring;

it should be noted that, in this embodiment, the Path Cache is optimally used to monitor the child nodes of the ZNode, however, in this embodiment, other Cache manners may also be used to Cache Node data, for example, the Node Cache and the Tree Cache, which are not specifically limited;

step S202, monitoring event types of server nodes through ZNOde child node monitoring, and carrying out different server resource scheduling operations according to different types of events;

preferably, the embodiment monitors through the added ZNode child node, and is used for monitoring the event type of the server node, judging whether the event type is an addition event or a deletion event, and performing different server resource scheduling operations according to different types of the event;

specifically, as shown in fig. 3, when the type of the monitored event is an add event, that is, the type of the monitored event is CHILD _ ADDED, the event is illustrated as a machine node of an add server. At this time, the IP of the machine node registered in the zookeeper needs to be analyzed, whether the IP already exists in the machine resource table is queried according to the IP, if the IP exists, the concurrency number used by the server of the current IP is calculated, and resource scheduling is performed according to the condition of the cluster server information, which specifically includes: acquiring machine information of a cluster server, judging whether the machine information of the cluster server is empty, and updating the used concurrency number of the server if the machine information of the cluster server is not empty; and if the number of the servers is null, creating a machine object Map, wherein key is IP, value is machine information, putting the machine object into the cluster server, and at the moment, when resource allocation is carried out, allocating the task to the newly added server. Otherwise, if the IP does not exist, it indicates that the resource of the server is not configured in the machine resource table, and the IP can be directly returned;

when the monitored event type is a deletion event, i.e. the monitored event type is CHILD _ REMOVED, the event is indicated as a machine node of the removal server. At this time, server information needs to be queried according to the IP, and whether the machine information of the server exists is judged, if yes, information in the cluster server is queried according to the IP, a corresponding machine object is obtained, the obtained machine information of the corresponding machine object is removed from the cluster server, and when resource allocation is performed next time, an execution task is not allocated to the machine; otherwise, if the machine information of the server does not exist, the machine information is directly returned.

It should be noted that, in this embodiment, when the child node is added, updated, or deleted, the Path Cache may update its state, including the latest child node and the data and state of the child node, and the update of the state of the child node is notified through the pathchildrencachelist.

Through the steps S201 to S202, in this embodiment, data is cached between each node of the cluster through ZooKeeper, so that not only is dynamic expansion of the cluster server achieved, but also the situation of high concurrency of the cluster is met, the problems that dynamic scheduling cannot be performed, labor cost is high, and efficiency is low when server resources are scheduled are solved, maintenance cost is reduced, the cluster is concentrated on concurrent operation of service data, and efficiency is provided.

It should be noted that the steps illustrated in the above-described flow diagrams or in the flow diagrams of the figures may be performed in a computer system, such as a set of computer-executable instructions, and that, although a logical order is illustrated in the flow diagrams, in some cases, the steps illustrated or described may be performed in an order different than here.

The present embodiment further provides a system for dynamically scheduling server resources, where the system is used to implement the foregoing embodiments and preferred embodiments, and details of the system are not described again after the description. As used hereinafter, the terms "module," "unit," "subunit," and the like may implement a combination of software and/or hardware for a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.

Fig. 4 is a block diagram of a system for dynamically scheduling server resources according to an embodiment of the present application, and as shown in fig. 4, the system includes a creation start module 41 and a listening scheduling module 42:

creating a starting module 41 for starting the resource scheduling service and adding a ZNOde child node for monitoring; and the user information acquisition module 42 is used for monitoring the event types of the server nodes through the ZNode sub-nodes and carrying out different server resource scheduling operations according to different types of the events.

Through the system, the data are cached between the nodes of the cluster through the ZooKeeper, so that the dynamic expansion of the cluster server is realized, the condition of high concurrency of the cluster is also met, the problems of incapability of dynamic scheduling, high labor cost and low efficiency in scheduling server resources are solved, the maintenance cost is reduced, the cluster is concentrated in concurrent operation of service data, and the efficiency is improved.

It should be noted that, for specific examples in this embodiment, reference may be made to examples described in the foregoing embodiments and optional implementations, and details of this embodiment are not described herein again.

Note that each of the modules may be a functional module or a program module, and may be implemented by software or hardware. For a module implemented by hardware, the modules may be located in the same processor; or the modules can be respectively positioned in different processors in any combination.

The present embodiment also provides an electronic device comprising a memory having a computer program stored therein and a processor configured to execute the computer program to perform the steps of any of the above method embodiments.

Optionally, the electronic apparatus may further include a transmission device and an input/output device, wherein the transmission device is connected to the processor, and the input/output device is connected to the processor.

In addition, in combination with the method for dynamically scheduling server resources in the foregoing embodiments, the embodiments of the present application may provide a storage medium to implement. The storage medium having stored thereon a computer program; the computer program, when executed by a processor, implements any one of the above-described embodiments of the method for dynamic scheduling of server resources.

In one embodiment, a computer device is provided, which may be a terminal. The computer device includes a processor, a memory, a network interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method for dynamic scheduling of server resources. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.

In an embodiment, fig. 5 is a schematic diagram of an internal structure of an electronic device according to an embodiment of the present application, and as shown in fig. 5, there is provided an electronic device, which may be a server, and an internal structure diagram of which may be as shown in fig. 5. The electronic device comprises a processor, a network interface, an internal memory and a non-volatile memory connected by an internal bus, wherein the non-volatile memory stores an operating system, a computer program and a database. The processor is used for providing calculation and control capability, the network interface is used for communicating with an external terminal through network connection, the internal memory is used for providing an environment for an operating system and the running of a computer program, the computer program is executed by the processor to realize a method for dynamically scheduling server resources, and the database is used for storing data.

It will be appreciated by those skilled in the art that the structure shown in fig. 5 is a block diagram of only a portion of the structure associated with the present application, and does not constitute a limitation on the electronic device to which the present application applies, and that a particular electronic device may include more or fewer components than shown, or combine certain components, or have a different arrangement of components.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

It should be understood by those skilled in the art that various features of the above-described embodiments can be combined in any combination, and for the sake of brevity, all possible combinations of features in the above-described embodiments are not described in detail, but rather, all combinations of features which are not inconsistent with each other should be construed as being within the scope of the present disclosure.

The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

1. A method for dynamically scheduling server resources, the method comprising:

2. The method of claim 1, wherein the initiating the resource scheduling service comprises:

3. The method of claim 1, wherein the monitoring event types of the server nodes, and performing different server resource scheduling operations according to different types of events comprises:

when the event type is a deletion event, inquiring server information according to an IP (Internet protocol), judging whether machine information of the server exists, if so, acquiring a corresponding machine object according to the IP, and removing the machine information of the machine object; if not, then return directly.

4. The method of claim 3, wherein performing resource scheduling according to the server cluster information comprises:

5. A system for dynamic scheduling of server resources, the system comprising:

6. The system of claim 5,

the creation starting module is further used for reading configuration information of the zookeeper, creating a CuratorFramework object as a client connected with the zookeeper, and creating a PathChildrenCache cache.

7. The system of claim 5,

the monitoring and scheduling module is further configured to, when the event type is an added event, analyze an IP of a machine node registered in the zookeeper, query whether the IP already exists in a machine resource table according to the IP, if the IP already exists, calculate a concurrency number used by a server of the current IP, and perform resource scheduling according to a condition of cluster server information; if the current time does not exist, the current time is directly returned,

8. The system of claim 7,

the monitoring and scheduling module is further configured to obtain machine information of the cluster server, determine whether the machine information of the cluster server is empty, update the used concurrency number of the server if the machine information of the cluster server is not empty,

9. An electronic device comprising a memory and a processor, wherein the memory has stored therein a computer program, and the processor is configured to execute the computer program to perform the method for dynamic scheduling of server resources according to any one of claims 1 to 4.

10. A storage medium having a computer program stored thereon, wherein the computer program is configured to perform the method for dynamic scheduling of server resources according to any one of claims 1 to 4 when running.