CN111343258A - Peer node management method, device, storage medium and electronic equipment - Google Patents

Peer node management method, device, storage medium and electronic equipment Download PDF

Info

Publication number
CN111343258A
CN111343258A CN202010096829.1A CN202010096829A CN111343258A CN 111343258 A CN111343258 A CN 111343258A CN 202010096829 A CN202010096829 A CN 202010096829A CN 111343258 A CN111343258 A CN 111343258A
Authority
CN
China
Prior art keywords
target
node
tenant
peer
event
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
CN202010096829.1A
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.)
China Construction Bank Corp
Original Assignee
China Construction Bank Corp
CCB Finetech 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 China Construction Bank Corp, CCB Finetech Co Ltd filed Critical China Construction Bank Corp
Priority to CN202010096829.1A priority Critical patent/CN111343258A/en
Publication of CN111343258A publication Critical patent/CN111343258A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1061Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1065Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] 
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1095Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1097Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer And Data Communications (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the application discloses a peer node management method, a peer node management device, a storage medium and electronic equipment. The method comprises the following steps: if the state change event of the target tenant is detected through the target node, determining peer nodes except the target node through a distributed cache of the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node; issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event; and according to the state change event, the management peer node executes change operation of the tenant state on the running target tenant instance. By operating the technical scheme provided by the application, the purpose of synchronous operation of tenants on different nodes of the same group of servers can be realized.

Description

Peer node management method, device, storage medium and electronic equipment
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to a peer node management method, a peer node management device, a storage medium and electronic equipment.
Background
With the rapid development of network technology, the amount of data to be processed is larger and larger, and in order to improve the load capacity, application services are usually deployed on a set of servers.
In a multi-tenant system, the same tenant is distributed on a group of servers under normal conditions, and accessing and managing the tenant in a load balancing manner can only manage the tenant on a single node, and cannot realize synchronous operation on the tenant on different nodes of a group of servers.
Disclosure of Invention
The embodiment of the application provides a method and a device for managing peer nodes, a storage medium and electronic equipment, so as to achieve the purpose of performing synchronous operation on tenants on different nodes of the same group of servers.
In a first aspect, an embodiment of the present application provides a method for managing a peer node, where the method includes:
if the state change event of the target tenant is detected through the target node, determining peer nodes except the target node through a distributed cache of the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node;
issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event;
and according to the state change event, the management peer node executes change operation of the tenant state on the running target tenant instance.
In a second aspect, an embodiment of the present application provides an apparatus for managing a peer node, where the apparatus includes:
the peer node determining module is used for determining peer nodes except the target node through the distributed cache of the target node if the state change event of the target tenant is detected through the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node;
the flag bit issuing module is used for issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event;
and the change operation execution module is used for managing the peer-to-peer node to execute the change operation of the tenant state on the running target tenant instance according to the state change event.
In a third aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement a method for managing a peer node according to an embodiment of the present application.
In a fourth aspect, an embodiment of the present application provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable by the processor, where the processor executes the computer program to implement the peer node management method according to the embodiment of the present application.
According to the technical scheme provided by the embodiment of the application, if the state change event of the target tenant is detected through the target node, the peer nodes except the target node are determined through the distributed cache of the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node; issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event; and according to the state change event, the management peer node executes change operation of the tenant state on the running target tenant instance. By adopting the technical scheme provided by the application, the purpose of synchronous operation of tenants on different nodes of the same group of servers can be realized.
Drawings
Fig. 1 is a flowchart of a peer node management method according to an embodiment of the present application;
fig. 2 is a schematic diagram of a server deployment architecture according to an embodiment of the present invention;
fig. 3 is a flowchart of a change operation of a tenant status according to an embodiment of the present invention;
fig. 4 is a flowchart of a peer node management method according to a second embodiment of the present application;
fig. 5 is a schematic structural diagram of a management apparatus of a peer node according to a third embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device according to a fifth embodiment of the present application.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not limiting of the application. It should be further noted that, for the convenience of description, only some of the structures related to the present application are shown in the drawings, not all of the structures.
Before discussing exemplary embodiments in more detail, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart may describe the steps as a sequential process, many of the steps can be performed in parallel, concurrently or simultaneously. In addition, the order of the steps may be rearranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figure. The processes may correspond to methods, functions, procedures, subroutines, and the like.
Example one
Fig. 1 is a flowchart of a method for managing a peer node according to an embodiment of the present application, where the present embodiment is suitable for a case where a tenant state change operation is performed on a running target tenant instance, and the method may be executed by a peer node management apparatus according to an embodiment of the present application, where the apparatus may be implemented by software and/or hardware, and may be integrated in an electronic device such as an intelligent terminal.
As shown in fig. 1, the method for managing a peer node includes:
s110, if a state change event of a target tenant is detected through a target node, determining peer nodes except the target node through a distributed cache of the target node; the peer node is a preset service node which synchronously runs the target tenant instance with the target node.
The target node is any node in all the service nodes, and may be determined in a random or designated manner, which is not limited in this embodiment. For example, node 1 is responsible for managing all other nodes, and if node 1 goes offline, node 2 is responsible for managing other nodes.
The characteristic of improving the instruction and data reading speed of the cache is widely applied in the field of distributed computing along with the expansion of a local computer system to a distributed system, namely the cache is called as a distributed cache, and in the embodiment, the distributed cache can be caches distributed at different nodes; and the target tenant instance is the service content actually run by the target tenant. The target node can determine the rest nodes at the same level with the target node through the distributed cache.
Fig. 2 is a schematic diagram of a server deployment architecture according to an embodiment of the present invention.
As shown in fig. 2, the load balancing server is a server for performing load distribution. And the obtained service requests are distributed to the servers of the tenant instances which are actually operated in a balanced manner through the load balancing server, so that the response speed of the whole system is ensured.
The application server is a server for actually running the tenant instance and is generally divided into a plurality of nodes.
The file sharing server is used for sharing the configuration files in different application server nodes.
And S120, issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event.
The state change event is an event that the running state of the target tenant changes; when a state change event occurs, a preset flag bit is issued in the target node for marking the specific change event.
In this embodiment, optionally, the state change event of the target tenant includes: a stop event of the target tenant and a restart event of the target tenant.
When a service abnormality occurs or a certain node is abnormally down, all nodes may need to be stopped or restarted, and the state change event is a stop event of a target tenant or a restart event of the target tenant.
And S130, according to the state change event, managing the peer-to-peer node to execute the change operation of the tenant state on the running target tenant instance.
When a state change event occurs, the peer node of the target node is obtained through the identity mark of the target tenant, and the target node and the peer node respectively read the information in the cache server according to the preset flag bit, so that all the nodes execute the same operation, and the change operation of the tenant state is executed.
Fig. 3 is a flowchart of a change operation of a tenant status according to an embodiment of the present invention.
The change operation instruction of the tenant state is sent to any single node through the load balancing server, as shown in fig. 3, after receiving the instruction, the node 1 generates a preset flag bit and forwards the preset flag bit to all peer nodes in the same group of servers, and all the nodes execute the task, so that the tenant change operation is realized.
According to the technical scheme provided by the embodiment of the application, if the state change event of the target tenant is detected through the target node, the peer nodes except the target node are determined through the distributed cache of the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node; issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event; and according to the state change event, the management peer node executes change operation of the tenant state on the running target tenant instance. By adopting the technical scheme provided by the application, the purpose of synchronous operation of tenants on different nodes of the same group of servers can be realized.
Example two
Fig. 4 is a flowchart of a peer node management method according to a second embodiment of the present invention. The technical scheme is supplementary explained aiming at the processing process after the starting event of the target tenant is detected. Compared with the scheme, the scheme is specifically optimized, and the method further comprises the following steps:
and if the starting event of the target tenant is detected, providing a configuration file to all peer nodes of the target tenant in the specified directory through the file sharing server so that all the peer nodes execute the starting operation of the target tenant instance.
Specifically, the flow chart of the management method of the peer node is shown in fig. 4:
s410, if the starting event of the target tenant is detected, providing a configuration file to all peer nodes of the target tenant in the appointed directory through the file sharing server, so that all the peer nodes execute the starting operation of the target tenant instance.
The file sharing server may be a Network Attached Storage (NAS), which literally means a device connected to a Network and having a data Storage function, and is also referred to as a "Network Storage". It is a dedicated data storage server. The data center is used for completely separating the storage equipment from the server and managing the data in a centralized manner, so that the bandwidth is released, the performance is improved, the total cost of ownership is reduced, and the investment is protected.
If the designated directory of the shared server contains all the nodes executing the start event, the execution nodes can be determined according to the designated directory when the start event of the target tenant is detected.
Wherein the configuration file may be stored in the file sharing server in advance by mapping the configuration file directory to the sharing server-specified directory. When a starting event occurs, determining a node for executing the starting event; and providing the configuration files for all peer nodes of the target tenant in the appointed directory through the file sharing server so that all the nodes can obtain the same configuration files, and therefore the starting operation of the whole target tenant instance is executed.
According to the technical scheme provided by the embodiment of the application, if the starting event of the target tenant is detected, the configuration file is provided for all peer nodes of the target tenant in the appointed directory through the file sharing server, so that all the peer nodes execute the starting operation of the target tenant instance. And realizing the synchronization of the configuration files of all nodes in the target tenant so as to execute the starting operation of the target tenant instance.
On the basis of the above technical solutions, optionally, the method further includes:
if the configuration file change event of the target tenant is detected, executing the change operation of the configuration file through the file sharing server, and generating the restart event of the target tenant of all peer nodes;
and according to the restarting event of the target tenant, restarting the states of the target tenants of all the peer nodes.
When the configuration file is modified, the configuration file is modified in the file sharing server, a restart event of a target tenant of all the peer nodes is generated, and the configuration of all the nodes is updated through restart. The advantage of this arrangement is that the effect of synchronously modifying the configuration files of all nodes when any configuration file is modified is achieved.
On the basis of the above technical solutions, optionally, all the peer nodes are nodes adopting a hazelcast node cluster ad hoc network.
The method comprises the steps that nodes of a Hazelcast node cluster ad hoc network are adopted, so that a node executing state change issues a state change event of a target tenant to a file sharing server of the node, and other peer nodes update the state of the target tenant according to a flag bit in the file sharing server. The hazelcast is a memory-based data grid open source project, provides elastically extensible distributed memory computing, can be embedded into existing projects or applications, and provides a distributed data structure and distributed computing tools. Distributed applications may use hazelcast for distributed caching, synchronization, etc. The method has the advantages that the Hazelcast node cluster ad hoc network is adopted, when nodes corresponding to newly added tenants are added, only the identity marks of the newly added nodes are required to be added into the configuration files of the Hazelcast cluster, the original nodes do not need to be restarted or the configuration is not required to be changed, and rapid transverse expansion can be achieved.
EXAMPLE III
Fig. 5 is a schematic structural diagram of a management apparatus for a peer node according to a third embodiment of the present application. As shown in fig. 5, the management apparatus of the peer node includes:
a peer node determining module 510, configured to determine, if a state change event of a target tenant is detected by a target node, a peer node other than the target node through a distributed cache of the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node;
a flag bit issuing module 520, configured to issue a preset flag bit to the distributed cache of the target node according to the identity of the target tenant and the state change event;
and a change operation execution module 530, configured to execute, by the management peer node, a change operation of the tenant state on the running target tenant instance according to the state change event.
According to the technical scheme provided by the embodiment of the application, if the state change event of the target tenant is detected through the target node, the peer nodes except the target node are determined through the distributed cache of the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node; issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event; and according to the state change event, the management peer node executes change operation of the tenant state on the running target tenant instance. By adopting the technical scheme provided by the application, the purpose of synchronous operation of tenants on different nodes of the same group of servers can be realized.
On the basis of the foregoing technical solutions, optionally, the state change event of the target tenant includes: a stop event of the target tenant and a restart event of the target tenant.
On the basis of the above technical solutions, optionally, the apparatus further includes:
and the starting operation executing module is used for providing a configuration file to all peer nodes of the target tenant in the specified directory through the file sharing server if the starting event of the target tenant is detected, so that all the peer nodes execute the starting operation of the target tenant example.
On the basis of the above technical solutions, optionally, the apparatus further includes:
the system comprises a restart event generation module, a configuration file sharing server and a restart event generation module, wherein the restart event generation module executes the change operation of a configuration file through the file sharing server and generates the restart events of target tenants of all peer nodes if the change event of the configuration file of the target tenants is detected;
and the restarting operation executing module is used for restarting the states of the target tenants of all the peer nodes according to the restarting event of the target tenants.
On the basis of the above technical solutions, optionally, all the peer nodes are nodes adopting a hazelcast node cluster ad hoc network.
The product can operate the method provided by any embodiment of the application, and has the corresponding functional modules and beneficial effects of the operation method.
Example four
Embodiments of the present application also provide a storage medium containing computer executable instructions, which when executed by a computer processor, operate a method for peer node management, the method comprising:
if the state change event of the target tenant is detected through the target node, determining peer nodes except the target node through a distributed cache of the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node;
issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event;
and according to the state change event, the management peer node executes change operation of the tenant state on the running target tenant instance.
Storage medium-any of various types of memory devices or storage devices. The term "storage medium" is intended to include: mounting media such as CD-ROM, floppy disk, or tape devices; computer system memory or random access memory such as DRAM, DDR RAM, SRAM, EDO RAM, Lanbas (Rambus) RAM, etc.; non-volatile memory such as flash memory, magnetic media (e.g., hard disk or optical storage); registers or other similar types of memory elements, etc. The storage medium may also include other types of memory or combinations thereof. In addition, the storage medium may be located in the computer system in which the program is executed, or may be located in a different second computer system connected to the computer system through a network (such as the internet). The second computer system may provide the program instructions to the computer for execution. The term "storage medium" may include two or more storage media that may reside in different locations, such as in different computer systems that are connected by a network. The storage medium may store program instructions (e.g., embodied as a computer program) that are executable by one or more processors.
Of course, the storage medium containing computer executable instructions provided in this embodiment of the present application is not limited to the management operation of the peer node described above, and may also execute related operations in the management method of the peer node provided in any embodiment of the present application.
EXAMPLE five
An embodiment of the present application provides an electronic device, where a management apparatus of a peer node provided in the embodiment of the present application may be integrated in the electronic device. Fig. 6 is a schematic structural diagram of an electronic device according to a fifth embodiment of the present application. As shown in fig. 6, the present embodiment provides an electronic device 600, which includes: one or more processors 620; the storage device 610 is configured to store one or more programs, and when the one or more programs are executed by the one or more processors 620, the one or more processors 620 are enabled to implement the method for managing a peer node according to the embodiment of the present application, the method includes:
if the state change event of the target tenant is detected through the target node, determining peer nodes except the target node through a distributed cache of the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node;
issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event;
and according to the state change event, the management peer node executes change operation of the tenant state on the running target tenant instance.
The electronic device 600 shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 6, the electronic device 600 includes a processor 620, a storage device 610, an input device 630, and an output device 640; the number of the processors 620 in the electronic device may be one or more, and one processor 620 is taken as an example in fig. 6; the processor 620, the storage device 610, the input device 630, and the output device 640 in the electronic apparatus may be connected by a bus or other means, and fig. 6 illustrates an example in which the processor, the storage device 610, the input device 630, and the output device 640 are connected by the bus 640.
The storage device 610 is a computer readable storage medium, and can be used to store software programs, computer executable programs, and module units, such as program instructions corresponding to the management method of the peer node in the embodiment of the present application.
The storage device 610 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal, and the like. In addition, the storage 610 may include high speed random access memory and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some examples, the storage 610 may further include memory located remotely from the processor 620, which may be connected via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input means 630 may be used to receive input numbers, character information, or voice information, and to generate key signal inputs related to user settings and function control of the electronic device. The output device 640 may include a display screen, speakers, etc.
The electronic device provided by the embodiment of the application can achieve the purpose of synchronous operation of tenants on different nodes of the same group of servers.
The management apparatus, the storage medium, and the electronic device of the peer node provided in the foregoing embodiments may be used to execute the method for managing the peer node provided in any embodiment of the present application, and have corresponding functional modules and beneficial effects for executing the method. For details of the peer node management method provided in any embodiments of the present application, reference may be made to the technical details not described in detail in the above embodiments.
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present application and the technical principles employed. It will be understood by those skilled in the art that the present application is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the application. Therefore, although the present application has been described in more detail with reference to the above embodiments, the present application is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present application, and the scope of the present application is determined by the scope of the appended claims.

Claims (10)

1. A method for managing peer nodes, comprising:
if the state change event of the target tenant is detected through the target node, determining peer nodes except the target node through a distributed cache of the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node;
issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event;
and according to the state change event, the management peer node executes change operation of the tenant state on the running target tenant instance.
2. The method of claim 1, wherein the state change event of the target tenant comprises: a stop event of the target tenant and a restart event of the target tenant.
3. The method of claim 1, further comprising:
and if the starting event of the target tenant is detected, providing a configuration file to all peer nodes of the target tenant in the specified directory through the file sharing server so that all the peer nodes execute the starting operation of the target tenant instance.
4. The method of claim 3, further comprising:
if the configuration file change event of the target tenant is detected, executing the change operation of the configuration file through the file sharing server, and generating the restart event of the target tenant of all peer nodes;
and according to the restarting event of the target tenant, restarting the states of the target tenants of all the peer nodes.
5. The method according to any of claims 1-4, wherein all peer nodes are nodes using a Hazelcast node cluster ad hoc network.
6. An apparatus for managing a peer node, comprising:
the peer node determining module is used for determining peer nodes except the target node through the distributed cache of the target node if the state change event of the target tenant is detected through the target node; the peer node is a preset service node which synchronously runs a target tenant instance with a target node;
the flag bit issuing module is used for issuing a preset flag bit to the distributed cache of the target node according to the identity mark of the target tenant and the state change event;
and the change operation execution module is used for managing the peer-to-peer node to execute the change operation of the tenant state on the running target tenant instance according to the state change event.
7. The apparatus of claim 6, further comprising:
and the starting operation executing module is used for providing a configuration file to all peer nodes of the target tenant in the specified directory through the file sharing server if the starting event of the target tenant is detected, so that all the peer nodes execute the starting operation of the target tenant example.
8. The apparatus of claim 7, further comprising:
the system comprises a restart event generation module, a configuration file sharing server and a restart event generation module, wherein the restart event generation module executes the change operation of a configuration file through the file sharing server and generates the restart events of target tenants of all peer nodes if the change event of the configuration file of the target tenants is detected;
and the restarting operation executing module is used for restarting the states of the target tenants of all the peer nodes according to the restarting event of the target tenants.
9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out a method of managing a peer node according to any one of claims 1 to 5.
10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of managing a peer node according to any of claims 1-5 when executing the computer program.
CN202010096829.1A 2020-02-17 2020-02-17 Peer node management method, device, storage medium and electronic equipment Pending CN111343258A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010096829.1A CN111343258A (en) 2020-02-17 2020-02-17 Peer node management method, device, storage medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010096829.1A CN111343258A (en) 2020-02-17 2020-02-17 Peer node management method, device, storage medium and electronic equipment

Publications (1)

Publication Number Publication Date
CN111343258A true CN111343258A (en) 2020-06-26

Family

ID=71181580

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010096829.1A Pending CN111343258A (en) 2020-02-17 2020-02-17 Peer node management method, device, storage medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN111343258A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114257505A (en) * 2021-12-20 2022-03-29 建信金融科技有限责任公司 Server node configuration method, device, equipment and storage medium

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103425536A (en) * 2013-08-26 2013-12-04 中国科学院软件研究所 Test resource management method oriented towards distributed system performance tests
US20140089259A1 (en) * 2011-06-01 2014-03-27 Huawei Technologies Co., Ltd. Operation method and apparatus for data storage system
US20150169497A1 (en) * 2013-12-12 2015-06-18 International Business Machines Corporation Efficient Distributed Cache Consistency
CN104750544A (en) * 2013-12-30 2015-07-01 中国银联股份有限公司 Process management system and process management method applied to distributed system
CN105009513A (en) * 2013-12-03 2015-10-28 华为技术有限公司 Method for updating node device in distributed system, node device and distributed system
CN106547859A (en) * 2016-10-21 2017-03-29 杭州朗和科技有限公司 A kind of storage method and device of the data file under multi-tenant data storage system
CN110532074A (en) * 2019-08-08 2019-12-03 北明云智(武汉)网软有限公司 A kind of method for scheduling task and system of multi-tenant Mode S aaS service cluster environment

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140089259A1 (en) * 2011-06-01 2014-03-27 Huawei Technologies Co., Ltd. Operation method and apparatus for data storage system
CN103425536A (en) * 2013-08-26 2013-12-04 中国科学院软件研究所 Test resource management method oriented towards distributed system performance tests
CN105009513A (en) * 2013-12-03 2015-10-28 华为技术有限公司 Method for updating node device in distributed system, node device and distributed system
US20150169497A1 (en) * 2013-12-12 2015-06-18 International Business Machines Corporation Efficient Distributed Cache Consistency
CN104750544A (en) * 2013-12-30 2015-07-01 中国银联股份有限公司 Process management system and process management method applied to distributed system
CN106547859A (en) * 2016-10-21 2017-03-29 杭州朗和科技有限公司 A kind of storage method and device of the data file under multi-tenant data storage system
CN110532074A (en) * 2019-08-08 2019-12-03 北明云智(武汉)网软有限公司 A kind of method for scheduling task and system of multi-tenant Mode S aaS service cluster environment

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114257505A (en) * 2021-12-20 2022-03-29 建信金融科技有限责任公司 Server node configuration method, device, equipment and storage medium
CN114257505B (en) * 2021-12-20 2023-06-30 建信金融科技有限责任公司 Server node configuration method, device, equipment and storage medium

Similar Documents

Publication Publication Date Title
CN111078147B (en) Processing method, device and equipment for cache data and storage medium
US8301600B1 (en) Failover recovery in a distributed data store
US10152500B2 (en) Read mostly instances
US10503905B1 (en) Data lineage management
US10127077B2 (en) Event distribution pattern for use with a distributed data grid
US10831612B2 (en) Primary node-standby node data transmission method, control node, and database system
EP2988220B1 (en) Computer system, computer-system management method, and program
CN113396407A (en) System and method for augmenting database applications using blockchain techniques
US10275347B2 (en) System, method and computer program product for managing caches
US20120278344A1 (en) Proximity grids for an in-memory data grid
JP5686034B2 (en) Cluster system, synchronization control method, server device, and synchronization control program
US10826812B2 (en) Multiple quorum witness
US20210409346A1 (en) Metadata driven static determination of controller availability
US20140082275A1 (en) Server, host and method for reading base image through storage area network
CN110633046A (en) Storage method and device of distributed system, storage equipment and storage medium
CN113168371A (en) Write-write collision detection for multi-master shared storage databases
CN113746641B (en) ODX protocol processing method based on distributed storage
CN109165078B (en) Virtual distributed server and access method thereof
CN117321581A (en) Techniques for deterministic distributed caching of accelerated SQL queries
CN114500257A (en) Network configuration distribution method, device, control node and storage medium
CN111343258A (en) Peer node management method, device, storage medium and electronic equipment
US10127270B1 (en) Transaction processing using a key-value store
CN111031126B (en) Cluster cache sharing method, system, equipment and storage medium
US20210255868A1 (en) Scaling Performance Across a Large Number of Customer Nodes
US9537941B2 (en) Method and system for verifying quality of server

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
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20220919

Address after: 25 Financial Street, Xicheng District, Beijing 100033

Applicant after: CHINA CONSTRUCTION BANK Corp.

Address before: 25 Financial Street, Xicheng District, Beijing 100033

Applicant before: CHINA CONSTRUCTION BANK Corp.

Applicant before: Jianxin Financial Science and Technology Co.,Ltd.

RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200626