WO2019134402A1 - 设备操作方法、集群系统、电子设备及可读存储介质 - Google Patents

设备操作方法、集群系统、电子设备及可读存储介质 Download PDF

Info

Publication number
WO2019134402A1
WO2019134402A1 PCT/CN2018/106743 CN2018106743W WO2019134402A1 WO 2019134402 A1 WO2019134402 A1 WO 2019134402A1 CN 2018106743 W CN2018106743 W CN 2018106743W WO 2019134402 A1 WO2019134402 A1 WO 2019134402A1
Authority
WO
WIPO (PCT)
Prior art keywords
data operation
distributed lock
node
operation request
cluster
Prior art date
Application number
PCT/CN2018/106743
Other languages
English (en)
French (fr)
Inventor
罗钧
贾涛
Original Assignee
北京金山云网络技术有限公司
北京金山云科技有限公司
北京金迅瑞博网络技术有限公司
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 北京金山云网络技术有限公司, 北京金山云科技有限公司, 北京金迅瑞博网络技术有限公司 filed Critical 北京金山云网络技术有限公司
Priority to RU2020125088A priority Critical patent/RU2749339C1/ru
Priority to SG11202006444UA priority patent/SG11202006444UA/en
Priority to US16/959,728 priority patent/US11416313B2/en
Publication of WO2019134402A1 publication Critical patent/WO2019134402A1/zh

Links

Images

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/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
    • 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/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
    • G06F9/524—Deadlock detection or avoidance
    • 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/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
    • G06F9/526—Mutual exclusion algorithms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0806—Configuration setting for initial configuration or provisioning, e.g. plug-and-play
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/40—Support for services or applications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1097—Protocols 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]

Definitions

  • the present application relates to the field of cluster system technologies, and in particular, to a device operation method, a cluster system, an electronic device, and a readable storage medium.
  • the present application provides a device operation method, a cluster system, an electronic device, and a readable storage medium, which can implement sequential processing of requests.
  • a device operation method is applied to a cluster system, where the cluster system includes a first cluster and a second cluster, the first cluster includes a plurality of first nodes, and the second cluster includes a plurality of second nodes, and the device operates Methods include:
  • At least two first nodes in the first cluster respectively obtain at least two data operation requests for the target communication device
  • the at least two first nodes compete for a first distributed lock preset for the target communication device
  • the second node in the second cluster competes with the second distributed lock preset for the target communication device
  • the second node competing for the second distributed lock obtains a data operation request from the stored data operation request according to the stored time information of the stored data operation request, and performs a data operation on the target communication device.
  • the data operation request includes the identification information of the target communication device
  • the step of the at least two first nodes competing for the first distributed lock preset by the target communication device includes: :
  • the at least two first nodes determine a first distributed lock corresponding to the target communication device according to the identification information of the target communication device, and compete for the first distributed lock.
  • the method further includes:
  • the first node that the competition gets the first distributed lock releases the first distributed lock, so that other first nodes that obtain the data operation request start to compete for the first distributed lock.
  • the step of obtaining, by the second node of the second distributed lock, the obtaining, by the second node of the second distributed lock, a data operation request from the stored data operation request according to the stored time information of the stored data operation request comprises:
  • the second node that obtains the second distributed lock obtains the data operation request with the earliest storage time from the stored data operation request.
  • the method further includes:
  • the method further includes:
  • the target communication device is a switch
  • the data operation request is a configuration request for configuring the switch.
  • the step of competing the first node that obtains the first distributed lock to store the corresponding data operation request includes:
  • the data operation request is stored in a manner of increasing the ID
  • the step of obtaining the data operation request from the stored data operation request by the second node of the second distributed lock according to the stored storage time information of the stored data operation request includes:
  • the data operation request with the smallest ID is obtained from the stored data operation request.
  • the application further provides a cluster system, including a first cluster and a second cluster, the first cluster includes a plurality of first nodes, and the second cluster includes a plurality of second nodes, wherein:
  • At least two first nodes in the first cluster respectively obtain at least two data operation requests for the target communication device
  • the at least two first nodes compete for a first distributed lock preset for the target communication device
  • the second node in the second cluster competes with the second distributed lock preset for the target communication device
  • the second node competing for the second distributed lock obtains a data operation request from the stored data operation request according to the stored time information of the stored data operation request, and performs a data operation on the target communication device.
  • the data operation request includes identification information of the target communication device, and the at least two first nodes are configured to:
  • the first node of the contention obtaining the first distributed lock is configured to release the first distributed lock after the obtained data operation request is stored, so that other data operation requests are obtained.
  • the first node begins to compete for the first distributed lock.
  • the second node of the competition that obtains the second distributed lock is configured to:
  • the data operation request with the earliest storage time is obtained from the stored data operation request.
  • the second node that competes to obtain the second distributed lock is configured to release the second distributed lock and perform operations from the stored data after performing data operations on the target device.
  • the request deletes the data operation request obtained by the second node of the second distributed lock.
  • the first node that obtains the first distributed lock is configured to store the corresponding data operation request
  • the first node is further configured to generate notification information, and send the notification information to the first
  • the second cluster is configured to notify the second node in the second cluster to perform data operations on the target communication device.
  • the communication device is a switch
  • the data operation request is a configuration request for configuring the target switch.
  • the first node that competes to obtain the first distributed lock is configured to:
  • the data operation request is stored in a manner of increasing the ID
  • the second node of the competition obtaining the second distributed lock is configured to:
  • the data operation request with the smallest ID is obtained from the stored data operation request.
  • the embodiment of the present application further provides a readable storage medium, where the readable storage medium stores a first instruction, and when the first instruction is run on a computer, the computer executes the first operation method of the foregoing device. a method step performed by a node, and/or a second instruction stored in the readable storage medium, the computer executing a second node in the device operation method as described above when the second instruction is run on a computer Method steps performed.
  • An embodiment of the present application further provides an electronic device, where the electronic device includes a memory and a processor, wherein the memory is configured to store first executable program code, and the processor is configured to read the stored in the memory The first executable program code to perform the method steps performed by the first node in the aforementioned device operation method, and/or the memory to store the second executable program code, the processor for reading the memory The stored second executable program code is to perform the method steps performed by the second node of the aforementioned device operation method.
  • the embodiment of the present application provides a device operation method, a cluster system, an electronic device, and a readable storage medium.
  • the data operation of the communication device is implemented by the cooperation of the first cluster and the second cluster in the cluster system.
  • the first node in the first cluster can implement sequential storage of data operation requests by competing for the first distributed lock.
  • the second node in the second cluster can obtain the order of the stored data operation requests through the competition of the second distributed lock, and complete the data operation on the target communication device.
  • the sequence processing of the data operation request can be ensured, and the throughput of the first cluster can be improved, and the first cluster and the second cluster can be scaled horizontally, thereby improving system availability and processing capability.
  • FIG. 1 is a schematic structural diagram of a cluster system according to an embodiment of the present application.
  • FIG. 2 is a sequence diagram of a method for operating a device according to an embodiment of the present disclosure.
  • FIG. 3 is a sequence diagram of another method for operating a device according to an embodiment of the present disclosure.
  • FIG. 4 is a timing diagram of still another method for operating a device according to an embodiment of the present application.
  • FIG. 5 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
  • Icon 10-cluster system; 100-first cluster; 101-first node; 200-second cluster; 201-second node; 300-communication device; 400-storage space; 500-electronic device; ; 502 - memory.
  • Some embodiments of the present application provide a device operation method, as shown in FIG. 1 , applied to a cluster system 10 , where the cluster system 10 includes a first cluster 100 and a plurality of second nodes 201 composed of a plurality of first nodes 101 .
  • a second cluster 200 is formed, which is in communication with at least one communication device 300.
  • the device operation method includes the following steps:
  • step S101 at least two first nodes 101 in the first cluster 100 respectively obtain at least two data operation requests for the target communication device 300.
  • the cluster system 10 in the embodiment of the present application may include multiple servers, for example, may be applied to multiple servers in a Software Defined Network (SDN). Of course, the cluster system 10 may also be applied to other systems.
  • the cluster system 10 can include a first cluster 100 and a second cluster 200, and each cluster can include multiple nodes.
  • the first cluster 100 may include multiple Controller nodes (control nodes)
  • the second cluster 200 may include multiple Switch-Service nodes (asynchronous processing nodes), the first cluster 100 and the second cluster 200.
  • the communication device 300 in the embodiment of the present application may be a switch or other device, and the number of communication devices 300 may vary depending on different architectures of different systems.
  • the data operation request may be different according to the different or actual operation requirements of the communication device 300.
  • the data operation request may be a configuration request for configuring the switch.
  • the data operation request may be a request generated by the cluster system 10 and generated by the client. After the cluster system 10 processes the data operation request, the communication device 300 performs corresponding operations.
  • the operations of some of the communication devices 300 need to operate in strict accordance with the sequence of data operation requests.
  • the configuration needs to be performed in the order of configuration requests. If the switch is not configured in sequence, the final configuration result is not expected by the user.
  • the configuration request is queued and processed in order to avoid the disorder of the sequence.
  • the configuration request can be sent to the switch in the form of an extensible markup language xml file. The request is time consuming, and the configuration request is in the queued processing state. If a large number of configuration requests are high in a short period of time, such processing will greatly reduce the processing power and concurrent performance of the system.
  • the clustering system 10 in the embodiment of the present application can receive a data operation request through the configuration interface, and different first nodes 101 in the first cluster 100 can receive different data operation requests, and the data operation requests can be for the same communication.
  • the same communication device 300 corresponding to these different data operation requests is referred to as a target communication device.
  • the data operation request received by the different first node 101 may be a different configuration request for the same switch, and the switch is the target communication device.
  • Step S102 the at least two first nodes 101 that obtain at least two data operation requests compete for the first distributed lock preset for the target communication device.
  • the communication device 300 serves as the target communication device, and the at least two first nodes 101 that respectively receive the data operation request may The first distributed lock preset by the target communication device competes.
  • Distributed locks are a mechanism for controlling the simultaneous access of shared resources between distributed systems. In distributed systems, it is often necessary to coordinate the actions of different nodes. If different systems or a different node of the same system share a resource or a group of resources, access to these resources often requires mutual exclusion to prevent mutual interference to ensure that the shared resources accessed by different nodes are consistent.
  • the distributed lock mechanism allows only systems or nodes that have distributed locks to access or process shared resources.
  • the distributed locks can be configured for the resources that need to be shared, and the distributed locks are managed by the distributed lock manager.
  • the mechanism for different systems or nodes to compete for distributed locks can be: different systems or nodes need to be When the shared resource is accessed, the distributed lock manager first submits a request for accessing the shared resource, and the distributed lock manager processes the request of multiple systems or nodes, and selects a system or a system from multiple systems or nodes. The node is the winner of the distributed lock of the shared resource that needs to be accessed. The system or node that obtains the distributed lock can access the shared resources. During the access, other systems or nodes that do not have the distributed lock have no access to the shared resources.
  • the distributed lock mechanism is utilized, and the multiple first nodes 101 may compete with the first distributed lock, and the multiple first nodes 101 may apply for the first to the distributed lock manager.
  • the distributed lock manager determines, according to the application of the plurality of first nodes 101, the first node 101 that obtains the first distributed lock uniquely, and the first node 101 that obtains the first distributed lock has a pair
  • the storage space 400 has the authority to operate, and the other first node 101 that does not obtain the first distributed lock does not have the authority to operate the storage space 400.
  • the data operation request in the embodiment of the present application may include the identifier information of the target communication device, for example, the data operation request may include an IP address of the target communication device, a pre-configured device identifier, and the like.
  • the first node 101 may determine a corresponding first distributed lock according to the identification information of the target communication device. Different communication devices 300 have different first distributed locks, and the first distributed lock corresponding to the target communication device can implement mutually exclusive operations of different first nodes 101, ensuring that only one first node 101 can be at the same time.
  • the data operation request obtained by the node is processed.
  • the two first nodes 101 in the first cluster 100 respectively receive a configuration request for a switch with an IP address of 10.0.0.3, and the switch with an IP address of 10.0.0.3 serves as a target communication device.
  • the cluster system 10 preconfigures the first distributed lock for the switch with the IP address of 10.0.0.3, and the two first nodes 101 can compete for the first distributed lock.
  • step S103 the first node 101 competing to obtain the first distributed lock stores the obtained data operation request.
  • the first node 101 that competes to obtain the first distributed lock may store the obtained data operation request in the storage space 400.
  • the data operation request may be a pre-configured database, cache, or message.
  • a queue or the like is stored in the storage space 400.
  • the data operation request may be stored in the database in an ID increment manner.
  • the natural number is used in the order of storage to identify the ID of the data operation request.
  • the ID of the data operation request stored in the n+1th is the ID of the nth data operation request plus one. In this way, the ID can represent the storage time sequence of the data operation request.
  • the data operation is performed on the target communication device. Specifically, the second node 201 obtains the data operation request with the smallest ID from the stored data operation request, that is, the data operation request with the earliest storage time is processed.
  • a data operation request corresponding to the target communication device may be stored in a database, and a data operation request corresponding to the different target communication devices may be stored, and the stored data operation request is distinguished by different identification information of different target communication devices.
  • the data operation request for the same target communication device can be stored in the same message queue through a preset algorithm to ensure that the data operation request is stored in time order. Stored sequentially.
  • the embodiment of the present application does not limit the specific storage format of the data operation request, but needs to ensure that the storage of the data operation request is stored in chronological order, thereby ensuring the sequential storage of the data operation request and ensuring the accuracy of subsequent data operations. order.
  • step S104 the second node 201 in the second cluster 200 competes for the second distributed lock preset by the target communication device.
  • the second node 201 in the second cluster begins to compete for the second distributed lock.
  • the first cluster 100 may notify the second cluster 200 to perform the subsequent steps.
  • the first cluster 100 may notify the second cluster 200 by sending an RPC (Remote Procedure Call Protocol) message to the second cluster 200.
  • the first node 101 in the first cluster 100 that has completed the data operation request storage may notify all nodes in the second cluster by sending an RPC message.
  • the notification message may include identification information of the target communication device, and the second node 201 in the second cluster 200 may compete for the second distributed lock corresponding to the target communication device.
  • the second distributed lock is also preset for the target communication device, and the second distributed lock also has a mutually exclusive characteristic.
  • Step S105 the second node 201 competing for the second distributed lock obtains a data operation request from the stored data operation request according to the stored time information of the stored data operation.
  • Step S106 the second node 201 competing to obtain the second distributed lock performs data operation on the target communication device.
  • the second node 20 competing for the second distributed lock performs a data operation on the target communication device based on the obtained data operation request.
  • the second cluster 200 may include a plurality of second nodes 201, and the second nodes 201 of the plurality of second nodes 201 that compete for the second distributed lock may process the data operation request.
  • the processing may be: obtaining a data operation request with the earliest storage time corresponding to the target communication device from the storage space 400 in which the data operation request is stored in advance, and operating the operation information included in the request according to the data storage time of the storage time to the target
  • the communication device performs data operations.
  • the plurality of first nodes 101 complete the sequential storage of the data operation requests by the competition for the first distributed lock, and the storage time information of the data operation requests includes the storage time when the data operation requests are sequentially stored.
  • the second node 201 in the second cluster 200 obtains the data operation request in the order of the storage of the data operation request by the contention of the second distributed lock, thereby implementing the order of the data operation request and ensuring the data operation.
  • the correct order For example, the first node 101 stores the configuration requests for the switch with the IP address of 10.0.0.3 in chronological order by competing for the first distributed lock.
  • the plurality of second nodes 201 in the second cluster 200 compete for the second distributed lock such that only one second node 201 can process the stored configuration request at the same time, and the competition is second distributed.
  • the second node 201 of the lock can obtain the configuration request with the earliest storage time, and configures the switch with the IP address of 10.0.0.3 according to the configuration request.
  • the sequential processing of the configuration request is implemented, and the sequential configuration of the switches is completed.
  • a distributed lock mechanism is set in the processing of the first cluster 100 and the second cluster 200, and after the first distributed lock is obtained by the first node 101 in the first cluster 100,
  • the data operation request is first stored in the storage space 400 to ensure the sequential processing of the data operation request.
  • the data operation request received by the second node 201 in the second cluster 200 for the target communication device may be multiple, and the multiple second nodes 201 directly directly request the data operation corresponding to the node that obtains the second distributed lock.
  • the operation is that the order of the data operation requests is still not guaranteed, and the data operation requests are stored in the chronological order through the storage space 400, and the second node 201 competing to obtain the second distributed locks is then stored from the stored data according to the chronological order.
  • the data operation request with the earliest storage time is obtained, and the FIFO (First Input First Output) of the stored data operation request is guaranteed, thereby realizing the sequential processing of the data operation request.
  • the first node 101 competing to obtain the first distributed lock stores the corresponding data operation request.
  • the competition of the first distributed lock may also continue. As shown in FIG. 3, the method may include the following steps.
  • Step S201 - step S203 is the same as step S101 - step S103, and details are not described herein again.
  • Step S204 the first node 101 competing to obtain the first distributed lock releases the first distributed lock, so that the other first node 101 that obtains the data operation request starts to compete for the first distributed lock.
  • Steps S205 to S207 are the same as steps S104 to S106, and are not described herein again.
  • the first node 101 in the first cluster 100 implements sequential storage of data operation requests by competing for the first distributed lock. After the first node 101 competing for the first distributed lock completes the storage of the data operation request, the first distributed lock may be released, so that the other first node 101 that obtains the data operation request continues to perform the first distributed lock. Competition to continue the storage of other data manipulation requests.
  • the processing of the data operation request by the first cluster 100 and the processing of the data operation request by the second cluster 200 may be performed simultaneously, so that the processing speed of the cluster system 10 can be improved.
  • the second node 201 competing to obtain the second distributed lock competes with the target communication device.
  • the competition of the second distributed lock can also be continued.
  • the method may include the following steps.
  • Steps S301 to S306 are the same as steps S101 to S106, and are not described herein again.
  • Step S307 the second node 201 competing to obtain the second distributed lock releases the second distributed lock.
  • Step S308 deleting a data operation request corresponding to the second node 201 that competes to obtain the second distributed lock from the stored data operation request.
  • a second node 201 that obtains the second distributed lock can release the obtained second distributed lock after completing the processing of the data operation request, and can process the data operation request that has been processed from the storage space. Removed from 400.
  • the second node 201 in the second cluster 200 can continue to compete for the second distributed lock, as well as other data manipulation requests. Through the timely release of the second distributed lock, it can be ensured that the processing of the data operation request is not interrupted. At the same time, the data operation request that has been completed is deleted from the storage space, and the subsequent other second node 201 can be prevented from regaining the data operation request that has been processed, and the operation for the target communication device is not repeated.
  • the first distributed lock may have a lease, and the first node that competes to obtain the first distributed lock stores the obtained data operation request.
  • the step includes: storing, in the lease of the first distributed lock, a data operation request; if the storage is not completed within the lease of the first distributed lock, releasing the first distribution after the lease of the first distributed lock expires Lock.
  • the second distributed lock has a lease
  • the second node competing for the second distributed lock accesses the target communication device after obtaining the data operation request.
  • the specific configuration steps include: configuring the data operation request in the lease of the second distributed lock; if the configuration is not completed within the lease of the second distributed lock, releasing after the lease of the second distributed lock expires The second distributed lock.
  • the lease durations of the first distributed lock and the second distributed lock may be the same or different, and the first distributed lock and the second distributed lock may be prevented.
  • a deadlock the system cannot be processed due to possible failures, and the data operation request is effectively processed.
  • the embodiment of the present application provides a device operation method, and the data operation of the communication device 300 is implemented by the cooperation of the first cluster 100 and the second cluster 200 in the cluster system 10.
  • the first node 101 in the first cluster 100 can implement sequential storage of data operation requests by competing for the first distributed lock.
  • the second node 201 in the second cluster 200 can achieve the sequential acquisition of the stored data operation request and complete the data operation on the target communication device by competing for the second distributed lock.
  • Sequential processing The sequential processing of the data operation request can be ensured.
  • the throughput of the first cluster 100 can be improved, and both the first cluster 100 and the second cluster 200 can be scaled horizontally, thereby improving system availability and processing capability.
  • the embodiment of the present application further provides a cluster system 10, including a first cluster 100 and a second cluster 200.
  • the first cluster 100 includes a plurality of first nodes 101
  • the second cluster 200 includes a plurality of second nodes 201.
  • At least two first nodes 101 in the first cluster 100 respectively obtain at least two data operation requests for one of the at least one communication device 300;
  • the first node 101 that obtains at least two data operation requests competes with the first distributed lock preset for the target communication device; the first node 101 that competes to obtain the first distributed lock stores the corresponding data operation request.
  • step S101, step S102, and step S103 refer to the description of step S101, step S102, and step S103 in the foregoing method embodiment.
  • the second node 201 in the second cluster 200 competes for the second distributed lock preset for the target communication device; the second node 201 competing to obtain the second distributed lock according to the stored time information of the stored data operation request A data operation request is obtained in the stored data operation request, and data operations are performed on the target communication device.
  • step S104, step S105, and step S106 in the foregoing method embodiment.
  • the data operation request includes the identification information of the target communication device, and the at least two first nodes 101 that obtain the data operation request are configured to:
  • the first node 101 competing to obtain the first distributed lock is configured to release the first distributed lock after the obtained data operation request is stored, so that the other first node that obtains the data operation request 101 begins to compete for the first distributed lock.
  • the second node 201 competing for the second distributed lock is configured to obtain the data operation request that is the earliest stored time from the stored data operation request.
  • the second node 201 competing for the second distributed lock is configured to release the second distributed lock after performing data operations on the target communication device and remove the contention from the stored data operation request.
  • a data operation request obtained by the second node 201 of the second distributed lock is configured to release the second distributed lock after performing data operations on the target communication device and remove the contention from the stored data operation request.
  • the first node 101 competing to obtain the first distributed lock is configured to generate notification information after storing the corresponding data operation request, and send the notification information to the second cluster 200 to notify the The second node 201 in the second cluster 200 performs data operations on the target communication device.
  • the communication device 300 can be a switch, and the data operation request is a configuration request to configure the switch.
  • the first node 101 that competes to obtain the first distributed lock is configured to store the data operation request according to the ID increment. For details, refer to the description of step S103.
  • the second node 201 that obtains the second distributed lock can be configured to obtain the data operation request with the smallest ID from the stored data operation request. For details, refer to the description of step S105.
  • the embodiment of the present application further provides a readable storage medium, where the readable storage medium stores instructions, when the instruction is run on a computer, causing the computer to be the first node 101 and/or the second node.
  • the node 201 performs the above-described device operation method.
  • the embodiment of the present application further provides a readable storage medium.
  • the readable storage medium stores at least one of a first instruction and a second instruction.
  • the computer executes the foregoing device.
  • the embodiment of the present application further provides an electronic device, where the electronic device includes a memory and a processor, wherein the memory stores at least one of the first executable program code and the second executable program code, and the processor reads the memory Storing the first executable program code to perform the method steps performed by the first node in the foregoing device operation method, the processor reading the second executable program code stored in the memory to execute the second node executed in the foregoing device operation method Method steps.
  • FIG. 5 is a schematic diagram of an electronic device 500 according to an embodiment of the present application.
  • the electronic device 500 can be the first node 101 or the second node 201 in the cluster system 10 described above.
  • the electronic device 500 may include a processor 501 and a memory 502.
  • the memory 502 may be used to store executable program code
  • the processor 501 is configured to read executable program code stored in the memory 502.
  • the electronic device 500 can be caused to perform the above-described device operation method as the first node 101 and/or the second node 201.
  • the functionality of electronic device 500 if implemented in the form of a software functional module and sold or used as a standalone product, may be stored in a computer readable storage medium.
  • the technical solution of the present application which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including A number of instructions are used to cause processor 501 in electronic device 500 to perform all or part of the steps of the various embodiments of the present application.
  • the foregoing storage medium may include: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. medium.
  • the embodiment of the present application provides a device operation method, a cluster system, an electronic device, and a readable storage medium.
  • the cooperation between the first cluster and the second cluster in the cluster system implements data operations on the communication device.
  • the first node in the first cluster can implement sequential storage of data operation requests by competing for the first distributed lock.
  • the second node in the second cluster can obtain the order of the stored data operation requests through the competition of the second distributed lock, and complete the data operation on the target communication device.
  • the order of a large number of data operation requests can still be realized by the mutually exclusive characteristics of the first distributed lock and the second distributed lock. deal with.
  • the sequence processing of the data operation request can be ensured, and the throughput of the first cluster can be improved, and the first cluster and the second cluster can be scaled horizontally, thereby improving system availability and processing capability.
  • each block of the flowchart or block diagram can represent a module, a program segment, or a portion of code, and a module, a program segment, or a portion of code includes one or more executables for implementing the specified logical functions. instruction.
  • each block of the block diagrams and/or flowcharts, and combinations of blocks in the block diagrams and/or flowcharts can be implemented in a dedicated hardware-based system that performs the specified function or function. Or it can be implemented by a combination of dedicated hardware and computer instructions.
  • each functional module in each embodiment of the present application may be integrated to form a separate part, or each module may exist separately, or two or more modules may be integrated to form a separate part.
  • the device operation method, the cluster system, the electronic device and the readable storage medium of the adaptive mode selection provided by the present application can not only ensure the sequential processing of the data operation request, but also improve the throughput of the first cluster, and the first cluster Both the second cluster and the second cluster can scale out to improve system availability and processing power.

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

本申请提供了一种设备操作方法、集群系统、电子设备及可读存储介质，涉及集群技术领域。通过第一集群和第二集群的配合实现对通信设备的顺序的数据操作。第一集群中的第一节点通过对第一分布式锁的竞争，实现数据操作请求的顺序存储。第二集群中的第二节点通过对第二分布式锁的竞争，实现对已存储的数据操作请求的顺序获得，完成对目标通信设备的数据操作。通过两个分布式锁的机制，在集群系统出现接收到大量数据操作请求的高并发情况，通过第一分布式锁和第二分布式锁的互斥特性，实现大量数据操作请求的顺序处理。可以保证数据操作请求的顺序处理，可以提高第一集群的吞吐量，第一集群和第二集群都可横向扩展，提高系统的可用性和处理能力。

Description

设备操作方法、集群系统、电子设备及可读存储介质
本申请要求于2018年01月05日提交中国专利局的申请号为201810012150.2名称为“设备操作方法、集群系统、电子设备及可读取存储介质”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及集群系统技术领域，具体而言，涉及一种设备操作方法、集群系统、电子设备及可读存储介质。
背景技术
在分布式系统或其他系统中，会出现需要对高并发的请求进行处理的情况，此时，需要对请求进行顺序的下发和处理。在出现高并发的情况下，由于请求的并发数量大，会使请求处理出现错乱。
发明内容
有鉴于此，本申请提供了一种设备操作方法、集群系统、电子设备及可读存储介质，能够实现对请求的顺序处理。
本申请提供的技术方案如下：
一种设备操作方法，应用于集群系统，该集群系统包括第一集群和第二集群，所述第一集群包括多个第一节点，所述第二集群包括多个第二节点，该设备操作方法包括：
所述第一集群中的至少两个第一节点分别获得针对目标通信设备的至少两个数据操作请求；
所述至少两个第一节点对为所述目标通信设备预设的第一分布式锁进行竞争；
竞争得到所述第一分布式锁的第一节点将获得的数据操作请求进行存储；
所述第二集群中的第二节点对为所述目标通信设备预设的第二分布式锁进行竞争；
竞争得到所述第二分布式锁的第二节点根据已存储的数据操作请求的存储时间信息从所述已存储的数据操作请求中获得一条数据操作请求，对所述目标通信设备进行数据操作。
在一实施方式中，所述数据操作请求中包括所述目标通信设备的标识信息，所述至少两个第一节点对为所述目标通信设备预设的第一分布式锁进行竞争的步骤包括：
所述至少两个第一节点根据所述目标通信设备的标识信息确定所述目标通信设备对应的第一分布式锁，并对该第一分布式锁进行竞争。
在一实施方式中，竞争得到所述第一分布式锁的第一节点将对应的数据操作请求进行存储的步骤之后，该方法还包括：
所述竞争得到所述第一分布式锁的第一节点释放所述第一分布式锁，以使其他获得数据操作请求的第一节点开始竞争该第一分布式锁。
在一实施方式中，所述竞争得到所述第二分布式锁的第二节点根据已存储的数据操作请求的存储时间信息从已存储的数据操作请求中获得一条数据操作请求的步骤包括：
所述竞争得到所述第二分布式锁的第二节点从已存储的数据操作请求中获得存储时刻最早的数据操作请求。
在一实施方式中，竞争得到所述第二分布式锁的第二节点对所述目标通信设备进行竞争的步骤之后，该方法还包括：
所述竞争得到所述第二分布式锁的第二节点释放所述第二分布式锁，并从已存储的数据操作请求中删除所述竞争得到所述第二分布式锁的第二节点获得的数据操作请求。
在一实施方式中，竞争得到所述第一分布式锁的第一节点将对应的数据操作请求进行存储的步骤之后，该方法还包括：
竞争得到所述第一分布式锁的第一节点生成通知信息，并发送所述通知信息至所述第二集群，以通知所述第二集群中的第二节点对所述目标通信设备进行数据操作。
在一实施方式中，所述目标通信设备为交换机，所述数据操作请求是对所述交换机进行配置的配置请求。
在一实施方式中，将竞争得到所述第一分布式锁的第一节点将对应的数据操作请求进行存储的步骤包括：
按照ID自增的方式存储所述数据操作请求；
所述竞争得到所述第二分布式锁的第二节点根据已存储的数据操作请求的存储时间信息从已存储的数据操作请求中获得一条数据操作请求的步骤包括：
从已存储的数据操作请求中获得ID最小的数据操作请求。
本申请还提供了一种集群系统，包括第一集群和第二集群，第一集群包括多个第一节点，第二集群包括多个第二节点，其中：
所述第一集群中的至少两个第一节点分别获得针对目标通信设备的至少两个数据操作请求；
所述至少两个第一节点对为所述目标通信设备预设的第一分布式锁进行竞争；
竞争得到所述第一分布式锁的第一节点将获得的数据操作请求进行存储；
所述第二集群中的第二节点对为所述目标通信设备预设的第二分布式锁进行竞争；
竞争得到所述第二分布式锁的第二节点根据已存储的数据操作请求的存储时间信息从所述已存储的数据操作请求中获得一条数据操作请求，对所述目标通信设备进行数据操作。
在一实施方式中，所述数据操作请求中包括所述目标通信设备的标识信息，所述至少两个第一节点配置成：
根据所述目标通信设备的标识信息确定所述目标通信设备对应的第一分布式锁，并对该第一分布式锁进行竞争。
在一实施方式中，所述竞争得到所述第一分布式锁的第一节点配置成在将获得的数据操作请求进行存储之后，释放所述第一分布式锁，以使其他获得数据操作请求的第一节点开始竞争该第一分布式锁。
在一实施方式中，所述竞争得到所述第二分布式锁的第二节点配置成：
从已存储的数据操作请求中获得存储时刻最早的数据操作请求。
在一实施方式中，所述竞争得到所述第二分布式锁的第二节点配置成在对所述目标设备进行数据操作后，释放所述第二分布式锁，并从已存储的数据操作请求中删除所述竞争得到所述第二分布式锁的第二节点获得的数据操作请求。
在一实施方式中，所述竞争得到所述第一分布式锁的第一节点配置成将对应的数据操作请求进行存储之后，还用于生成通知信息，并发送所述通知信息至所述第二集群，以通知所述第二集群中的第二节点对所述目标通信设备进行数据操作。
在一实施方式中，所述通信设备为交换机，所述数据操作请求是对所述目标交换机进行配置的配置请求。
在一实施方式中，竞争得到所述第一分布式锁的第一节点配置成：
按照ID自增的方式存储所述数据操作请求；
所述竞争得到所述第二分布式锁的第二节点配置成：
从已存储的数据操作请求中获得ID最小的数据操作请求。
本申请实施例还提供了一种可读存储介质，所述可读存储介质内存储有第一指令，当所述第一指令在计算机上运行时，所述计算机执行前述设备操作方法中第一节点所执行的方法步骤，和/或，所述可读存储介质内存储有第二指令，当所述第二指令在计算机上运行时，所述计算机执行如前述设备操作方法中第二节点所执行的方法步骤。
本申请实施例还提供了一种电子设备，所述电子设备包括存储器和处理器，其中，所述存储器用于存储第一可执行程序代码，所述处理器用于读取所述存储器中存储的第一可执行程序代码以执行前述设备操作方法中第一节点所执行的方法步骤，和/或，所述存储器用于存储第二可执行程序代码，所述处理器用于读取所述存储器中存储的第二可执行程序代码以执行前述设备操作方法中第二节点所执行的方法步骤。
本申请实施例提供了一种设备操作方法、集群系统、电子设备及可读存储介质，通过集群系统中的第一集群和第二集群的配合实现对通信设备的数据操作。第一集群中的第一节点通过对第一分布式锁的竞争，可以实现数据操作请求的顺序存储。第二集群中的第二节点通过对第二分布式锁的竞争，可以实现对已存储的数据操作请求的顺序获得，并完成对目标通信设备的数据操作。通过两个分布式锁的机制，在集群系统出现接收到大量数据操作请求的高并发情况，仍然可以通过第一分布式锁和第二分布式锁的互斥特性，实现大量数据操作请求的顺序处理。既可以保证数据操作请求的顺序处理，同时，可以提高第一集群的吞吐量，并且第一集群和第二集群都可以横向扩展，提高系统的可用性和处理能力。
为使本申请的上述目的、特征和优点能更明显易懂，下文特举较佳实施例，并配合所附附图，作详细说明如下。
附图说明
为了更清楚地说明本申请实施例的技术方案，下面将对实施例中所需要使用的附图作简单地介绍，应当理解，以下附图仅示出了本申请的某些实施例，因此不应被看作是对范围的限定，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他相关的附图。
图1为本申请实施例提供的一种集群系统的组成示意图。
图2为本申请实施例提供的一种设备操作方法的时序图。
图3为本申请实施例提供的另一种设备操作方法的时序图。
图4为本申请实施例提供的又一种设备操作方法的时序图。
图5为本申请实施例提供的一种电子设备的结构示意图。
图标：10-集群系统；100-第一集群；101-第一节点；200-第二集群；201-第二节点；300-通信设备；400-存储空间；500-电子设备；501-处理器；502-存储器。
具体实施方式
下面将结合本申请实施例中附图，对本申请实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本申请一部分实施例，而不是全部的实施例。通常在此处附图中描述和示出的本申请实施例的组件可以以各种不同的配置来布置和设计。因此，以下对在附图中提供的本申请的实施例的详细描述并非旨在限制要求保护的本申请的范围，而是仅仅表示本申请的选定实施例。基于本申请的实施例，本领域技术人员在没有做出创造性劳动的前提下所获得的所有其他实施例，都属于本申请保护的范围。
应注意到：相似的标号和字母在下面的附图中表示类似项，因此，一旦某一项在一个附图中被定义，则在随后的附图中不需要对其进行进一步定义和解释。同时，在本申请的描述中，术语“第一”、“第二”等仅用于区分描述，而不能理解为指示或暗示相对重要性。
本申请的一些实施例提供了一种设备操作方法，如图1所示，应用于集群系统10，该集群系统10包括多个第一节点101组成的第一集群100和多个第二节点201组成的第二集群200，该集群系统10与至少一个通信设备300通信连接。如图2所示，该设备操作方法包括以下步骤：
步骤S101，第一集群100中的至少两个第一节点101分别获得针对目标通信设备300的至少两个数据操作请求。
本申请实施例中的集群系统10可以包括多台服务器，例如可以是应用于软件定义网络(Software Defined Network，SDN)中的多台服务器，当然，该集群系统10也可以是应用于其他系统中的多台设备组成的集群。该集群系统10中可以包括第一集群100和第二集群200，每个集群中可以包括多个节点。在一种具体实施方式中，第一集群100可以包括多个Controller节点(控制节点)，第二集群200可以包括多个Switch-Service节点(异步处理节点)，第一集群100和第二集群200之间可以相互通信。本申请实 施例中的通信设备300可以是交换机或其他设备，通信设备300的数量可以因不同系统的不同架构而不同。数据操作请求可以根据通信设备300的不同或实际操作的需要而不同，在一种具体实施方式中，数据操作请求可以是对交换机进行配置的配置请求。数据操作请求可以是集群系统10接收到的由客户端生成的请求，集群系统10对这些数据操作请求进行处理后，对通信设备300进行相应的操作。
在对通信设备300进行操作的过程中，在同时出现大量的数据操作请求的高并发状态时，某些通信设备300的操作需要严格按照数据操作请求的先后顺序进行操作。例如，在通过集群系统10对交换机进行配置的过程中，需要按照配置请求的先后顺序进行配置，如果没有按照先后顺序对交换机进行配置，就会出现最终的配置结果不是用户预期的情况。在集群系统10接收到配置请求后，为了避免顺序错乱而对配置请求进行排队依次处理，常规的，例如，可采用可扩展标记语言xml文件的形式对配置请求向交换机顺序下发，由于发送配置请求比较耗时，使配置请求处于排队处理状态，如果短时间内出现大量配置请求的高并发情况，这样的处理方式就会大大降低系统的处理能力和并发性能。
而本申请实施例中的集群系统10可以通过配置接口接收到数据操作请求，第一集群100中不同的第一节点101可以接收到不同的数据操作请求，这些数据操作请求可以是针对同一台通信设备300的，本申请实施例中，将这些不同数据操作请求对应的同一台通信设备300称为目标通信设备。如前所述，不同第一节点101接收到的数据操作请求可以是针对同一台交换机的不同的配置请求，该交换机即为目标通信设备。
步骤S102，获得至少两个数据操作请求的该至少两个第一节点101对为目标通信设备预设的第一分布式锁进行竞争。
在第一集群100接收到至少两个针对同一台通信设备300的数据操作请求时，该通信设备300作为目标通信设备，分别接收到数据操作请求的至少两个第一节点101就可以对为该目标通信设备预设的第一分布式锁进行竞争。
分布式锁，是控制分布式系统之间同步访问共享资源的一种机制。在分布式系统中，常常需要协调不同节点的动作。如果不同的系统或是同一个系统的不同节点之间共享了一个或一组资源，那么访问这些资源的时候，往往需要互斥来防止彼此干扰以保证不同节点访问到的共享资源是一致 的。分布式锁的机制使得只有得到了分布式锁的系统或节点才能对共享资源进行访问或处理。可以为需要共享的资源配置对应的分布式锁，由分布式锁管理器对分布式锁进行管理，不同的系统或节点对分布式锁进行竞争的机制可以为：不同的系统或节点在需要对共享资源进行访问时，先向分布式锁管理器提交需要访问共享资源的请求，分布式锁管理器再对多个系统或节点的请求进行处理，从多个系统或节点中选择一个系统或一个节点作为需要访问的共享资源的分布式锁的获得者。得到该分布式锁的系统或节点就可以对共享资源进行访问，在访问期间，其他没有得到分布式锁的系统或节点是没有权限对共享资源进行访问的。
可以理解的是，本申请实施例中利用了该分布式锁机制，多个第一节点101对第一分布式锁进行竞争可以是，多个第一节点101向分布式锁管理器申请第一分布式锁，分布式锁管理器根据多个第一节点101的申请确定唯一获得该第一分布式锁的第一节点101，获得了该第一分布式锁的第一节点101就具有了对存储空间400进行操作的权限，其他没有获得第一分布式锁的第一节点101就不具备对存储空间400进行操作的权限。
详细的，本申请实施例中的数据操作请求中可以包含目标通信设备的标识信息，例如数据操作请求中可以包含目标通信设备的IP地址、预先配置的设备标识等。第一节点101可以根据目标通信设备的标识信息确定对应的第一分布式锁。不同的通信设备300对应有不同的第一分布式锁，与目标通信设备对应的第一分布式锁可以实现不同第一节点101的互斥操作，保证在同一时间内只有一个第一节点101可以对该节点获得的数据操作请求进行处理。例如，第一集群100中的两个第一节点101分别接收到了针对IP地址为10.0.0.3的交换机的配置请求，IP地址为10.0.0.3的交换机作为目标通信设备。集群系统10预先为IP地址为10.0.0.3的交换机配置第一分布式锁，两个第一节点101就可以对该第一分布式锁进行竞争。
步骤S103，竞争得到第一分布式锁的第一节点101将获得的数据操作请求进行存储。
竞争得到第一分布式锁的第一节点101在对数据操作请求进行处理时，由于第一分布式锁的互斥特性，其他没有竞争得到第一分布式锁的第一节点101不能对各自的数据操作请求进行处理。
在本申请实施例中，竞争得到第一分布式锁的第一节点101可以将获得的数据操作请求在存储空间400中进行存储，具体地，数据操作请求可 以以预先配置的数据库、缓存、消息队列等方式存储在存储空间400中。在使用数据库对数据操作请求进行存储时，数据操作请求可以采用ID自增的方式存储到数据库中。可选地，在进行数据操作请求的存储时，按照存储的顺序使用自然数来标识数据操作请求的ID。例如，第n+1条存储的数据操作请求的ID为第n条数据操作请求的ID加1。这样，ID就可以代表数据操作请求的存储时间顺序，ID越小，存储时间越早，以便后续竞争得到第二分布式锁的第二节点201根据数据操作请求的存储时间顺序获取数据操作请求，对目标通信设备进行数据操作，具体的，第二节点201从已存储的数据操作请求中获得ID最小的数据操作请求，即存储时间最早的数据操作请求进行处理。
在一个数据库中可以存储一个目标通信设备对应的数据操作请求，也可以存储不同目标通信设备对应的数据操作请求，通过不同目标通信设备不同的标识信息对存储的数据操作请求进行区分。
此外，在使用消息队列对数据操作请求进行存储时，可以通过预设的算法将针对同一台目标通信设备的数据操作请求存储在同一个消息队列中，保证数据操作请求的存储是按照时间的先后顺序进行存储的。本申请实施例并不限定数据操作请求的具体存储格式，但需要保证数据操作请求的存储是按照时间先后顺序进行存储的，以此来保证数据操作请求的顺序存储，保证后续数据操作时的准确顺序。
步骤S104，第二集群200中的第二节点201对目标通信设备预设的第二分布式锁进行竞争。
在第一集群100中的第一节点101完成数据操作请求的存储后，第二集群中的第二节点201开始竞争第二分布式锁。
第一集群100中的第一节点101通过对第一分布式锁的竞争，完成数据操作请求的存储后，第一集群100可以通知第二集群200进行后续步骤。例如，第一集群100可以通过向第二集群200发送RPC(Remote Procedure Call Protocol，远程过程调用协议)消息的形式通知第二集群200。第一集群100中的已经完成数据操作请求存储的第一节点101可以通过发送RPC消息的形式通知第二集群中的所有节点。通知消息中可以包含目标通信设备的标识信息，第二集群200中的第二节点201就可以进行与目标通信设备对应的第二分布式锁的竞争。第二分布式锁也是针对目标通信设备预先设置的，第二分布式锁同样具有互斥特性，在竞争得到第二分布式锁的第 二节点201对数据操作请求进行处理时，其他没有竞争得到第二分布式锁的第二节点201不能对数据操作请求进行处理。
步骤S105，竞争得到第二分布式锁的第二节点201根据已存储的数据操作的存储时间信息从已存储的数据操作请求中获得一条数据操作请求。
步骤S106，竞争得到第二分布式锁的第二节点201对目标通信设备进行数据操作。
竞争得到第二分布式锁的第二节点20基于获得的数据操作请求，对目标通信设备进行数据操作。
第二集群200可以包括多个第二节点201，多个第二节点201中竞争得到第二分布式锁的第二节点201可以对数据操作请求进行处理。处理的过程可以是从预先存储数据操作请求的存储空间400中，获得与目标通信设备对应的存储时间最早的一条数据操作请求，并根据该存储时间最早的数据操作请求包含的操作信息，对目标通信设备进行数据操作。如前，多个第一节点101通过对第一分布式锁的竞争完成了数据操作请求的顺序存储，数据操作请求的存储时间信息包括数据操作请求在进行顺序存储时的存储时间。第二集群200中的第二节点201通过对第二分布式锁的竞争，以实现对数据操作请求按照数据操作请求的存储的先后顺序取出，从而实现数据操作请求的顺序下发，保证数据操作的正确顺序。例如，第一节点101通过对第一分布式锁的竞争，将针对IP地址为10.0.0.3的交换机的配置请求按照时间顺序进行了存储。第二集群200中的多个第二节点201通过对第二分布式锁的竞争，使得在同一时间只有一个第二节点201可以对已存储的配置请求进行处理，并且，竞争得到第二分布式锁的第二节点201可以获得存储时间最早的配置请求，并根据该条配置请求对IP地址为10.0.0.3的交换机进行配置。通过第一集群100和第二集群200的配合，实现对配置请求的顺序处理，完成对交换机的顺序配置。
本申请实施例中，在第一集群100和第二集群200的处理中都设置了分布式锁的机制，并通过第一集群100中的第一节点101在竞争得到第一分布式锁后，先通过存储空间400对数据操作请求进行存储，才能保证数据操作请求的顺序处理。第二集群200中的第二节点201接收到的针对目标通信设备的数据操作请求可能是多个，多个第二节点201如果直接对竞争得到第二分布式锁的节点对应的数据操作请求直接进行操作，是仍然不能保证数据操作请求的先后顺序，需要通过存储空间400对数据操作请求 按照时间顺序进行存储，竞争得到第二分布式锁的第二节点201再根据时间顺序从已存储的数据操作请求中，获得存储时间最早的数据操作请求，保证已存储的数据操作请求的FIFO(First Input First Output，先进先出)，从而实现数据操作请求的顺序处理。
在另一种具体实施方式中，在一个数据操作请求完成了存储之后，为了继续进行其他数据操作请求的存储，在竞争得到第一分布式锁的第一节点101将对应的数据操作请求进行存储的步骤之后，还可以继续进行第一分布式锁的竞争，如图3所示，该方法可以包括以下步骤。
步骤S201-步骤S203与步骤S101-步骤S103相同，这里不再赘述。
步骤S204，竞争得到第一分布式锁的第一节点101释放第一分布式锁，以使其他获得数据操作请求的第一节点101开始竞争该第一分布式锁。
步骤S205-步骤S207与步骤S104-步骤S106相同，这里不再赘述。
第一集群100中的第一节点101通过对第一分布式锁的竞争，实现数据操作请求的顺序存储。在一个竞争得到第一分布式锁的第一节点101完成数据操作请求的存储后，就可以将第一分布式锁释放，使其他获得数据操作请求的第一节点101继续进行第一分布式锁的竞争，以继续进行其他数据操作请求的存储。第一集群100对数据操作请求的处理和第二集群200对数据操作请求的处理可以是同时进行的，从而可以提高集群系统10的处理速度。
在另一种具体实施方式中，为了在完成一次对通信设备300的数据操作后，继续进行其他数据操作请求的处理，在竞争得到第二分布式锁的第二节点201对目标通信设备进行竞争的步骤之后，还可以继续进行第二分布式锁的竞争。具体的，如图4所示，该方法可以包括以下步骤。
步骤S301-步骤S306与步骤S101-步骤S106相同，这里不再赘述。
步骤S307，竞争得到第二分布式锁的第二节点201释放第二分布式锁。
步骤S308，从已存储的数据操作请求中删除竞争得到第二分布式锁的第二节点201对应的数据操作请求。
可以理解的是，一个得到第二分布式锁的第二节点201在完成数据操作请求的处理后，可以释放已经得到的第二分布式锁，并可以将已经处理完成的数据操作请求从存储空间400中删除。第二集群200中的第二节点201就可以继续进行第二分布式锁的竞争，以及其他数据操作请求的处理。通过第二分布式锁的及时释放，可以保证数据操作请求的处理进程不会中 断。同时，将已经完成的数据操作请求从存储空间中删除，可以避免后续的其他第二节点201重新获得已经完成处理的数据操作请求，保证针对目标通信设备的操作不会出现重复。
为了防止第一分布式锁出现死锁的情况，在一种具体实施方式中，第一分布式锁可以具有租约，竞争得到第一分布式锁的第一节点将获得的数据操作请求进行存储的步骤包括：在第一分布式锁的租约内，将数据操作请求进行存储；如果在第一分布式锁的租约内没有完成存储，在第一分布式锁的租约到期后释放该第一分布式锁。
为了防止第二分布式锁出现死锁的情况，在一种具体实施方式中，第二分布式锁具有租约，竞争得到第二分布式锁的第二节点在获得数据操作请求后对目标通信设备进行配置，具体配置步骤包括：在第二分布式锁的租约内进行数据操作请求的配置；如果在第二分布式锁的租约内没有完成配置，在第二分布式锁的租约到期后释放该第二分布式锁。
通过为第一分布式锁和第二分布式锁分别配置租约，第一分布式锁和第二分布式锁的租约时长可以相同也可以不同，可以防止第一分布式锁和第二分布式锁出现死锁的情况，避免系统由于可能出现的故障导致的不能继续处理的情况，同时有效保证数据操作请求的顺利处理。
本申请实施例提供了一种设备操作方法，通过集群系统10中的第一集群100和第二集群200的配合实现对通信设备300的数据操作。第一集群100中的第一节点101通过对第一分布式锁的竞争，可以实现数据操作请求的顺序存储。第二集群200中的第二节点201通过对第二分布式锁的竞争，可以实现对已存储的数据操作请求的顺序获得，并完成对目标通信设备的数据操作。通过两个分布式锁的机制，在集群系统10出现接收到大量数据操作请求的高并发情况，仍然可以通过第一分布式锁和第二分布式锁的互斥特性，实现大量数据操作请求的顺序处理。既可以保证数据操作请求的顺序处理，同时，可以提高第一集群100的吞吐量，并且第一集群100和第二集群200都可以横向扩展，提高系统的可用性和处理能力。
在一些实施例中，再如图1所示，本申请实施例还提供了一种集群系统10，包括第一集群100和第二集群200，第一集群100包括多个第一节点101，第二集群200包括多个第二节点201。
第一集群100中的至少两个第一节点101分别获得针对至少一个通信设备300其中一个目标通信设备的至少两个数据操作请求；
获得至少两个数据操作请求的第一节点101对为目标通信设备预设的第一分布式锁进行竞争；竞争得到第一分布式锁的第一节点101将对应的数据操作请求进行存储。详细的，可参见上述方法实施例中步骤S101、步骤S102和步骤S103的描述。
第二集群200中的第二节点201对为目标通信设备预设的第二分布式锁进行竞争；竞争得到第二分布式锁的第二节点201根据已存储的数据操作请求的存储时间信息从已存储的数据操作请求中获得一条数据操作请求，对目标通信设备进行数据操作。详细的，可参见上述方法实施例中步骤S104、步骤S105和步骤S106的描述。
在一种实施方式中，数据操作请求中包括目标通信设备的标识信息，获得数据操作请求的至少两个第一节点101配置成：
根据目标通信设备的标识信息确定目标通信设备对应的第一分布式锁，并对该第一分布式锁进行竞争。
在一种实施方式中，竞争得到第一分布式锁的第一节点101配置成在将获得的数据操作请求进行存储之后，释放第一分布式锁，以使其他获得数据操作请求的第一节点101开始竞争该第一分布式锁。详细的，可参见上述方法实施例中步骤S204的描述。
在一种实施方式中，竞争得到第二分布式锁的第二节点201配置成从已存储的数据操作请求中获得存储时刻最早的数据操作请求。
在一种实施方式中，竞争得到第二分布式锁的第二节点201配置成在对目标通信设备进行数据操作之后，释放第二分布式锁，并从已存储的数据操作请求中删除竞争得到第二分布式锁的第二节点201获得的数据操作请求。详细的，可参见上述方法实施例中步骤S307和步骤S308的描述。
在一种实施方式中，竞争得到第一分布式锁的第一节点101配置成在将对应的数据操作请求进行存储之后，还生成通知信息，并发送通知信息至第二集群200，以通知第二集群200中的第二节点201对目标通信设备进行数据操作。
在一种实施方式中，通信设备300可以为交换机，数据操作请求是对交换机进行配置的配置请求。
在一种实施方式中，竞争得到第一分布式锁的第一节点101配置成：按照ID自增的方式存储数据操作请求，详细的，可参见步骤S103的描述。
相应的，竞争得到第二分布式锁的第二节点201可配置成：从已存储 的数据操作请求中获得ID最小的数据操作请求，详细的，可参见步骤S105的描述。
本申请实施例还提供了一种可读存储介质，所述可读存储介质内存储有指令，当所述指令在计算机上运行时，使得所述计算机作为上述第一节点101和\或第二节点201执行上述设备操作方法。
本申请实施例还提供了一种可读存储介质，可读存储介质内存储有第一指令和第二指令中的至少一者，当第一指令在计算机上运行时，所述计算机执行前述设备操作方法中第一节点101所执行的方法步骤，当第二指令在计算机上运行时，所述计算机执行前述设备操作方法中第二节点201所执行的方法步骤。
本申请实施例还提供了一种电子设备，所述电子设备包括存储器和处理器，其中存储器存储第一可执行程序代码和第二可执行程序代码中的至少一者，处理器读取存储器中存储的第一可执行程序代码以执行前述设备操作方法中第一节点所执行的方法步骤，处理器读取存储器中存储的第二可执行程序代码以执行前述设备操作方法中第二节点所执行的方法步骤。
请参照图5，是本申请一种实施例提供的电子设备500的一种示意图。该电子设备500可以为上述集群系统10中的第一节点101或第二节点201。在本申请实施例中，电子设备500可以包括处理器501及存储器502，存储器502可用于存储可执行程序代码，处理器501用于读取存储器502中存储的可执行程序代码，可执行程序代码被处理器501执行时，使得该电子设备500可以作为第一节点101和\或第二节点201执行上述设备操作方法。
电子设备500的功能如果以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得电子设备500中的处理器501执行本申请各个实施例方法的全部或部分步骤。而前述的存储介质可以包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
本申请实施例提供了一种设备操作方法、集群系统、电子设备及可读 存储介质，集群系统中的第一集群和第二集群的配合实现对通信设备的数据操作。第一集群中的第一节点通过对第一分布式锁的竞争，可以实现数据操作请求的顺序存储。第二集群中的第二节点通过对第二分布式锁的竞争，可以实现对已存储的数据操作请求的顺序获得，并完成对目标通信设备的数据操作。通过两个分布式锁的机制，在集群系统出现接收到大量数据操作请求的高并发情况，仍然可以通过第一分布式锁和第二分布式锁的互斥特性，实现大量数据操作请求的顺序处理。既可以保证数据操作请求的顺序处理，同时，可以提高第一集群的吞吐量，并且第一集群和第二集群都可以横向扩展，提高系统的可用性和处理能力。
在本申请所提供的几个实施例中，应该理解到，所揭露的装置和方法，也可以通过其它的方式实现。以上所描述的装置实施例仅仅是示意性的，例如，附图中的流程图和框图显示了根据本申请的多个实施例的装置、方法和计算机程序产品的可能实现的体系架构、功能和操作。在这点上，流程图或框图中的每个方框可以代表一个模块、程序段或代码的一部分，模块、程序段或代码的一部分包含一个或多个用于实现规定的逻辑功能的可执行指令。也应当注意，在有些作为替换的实现方式中，方框中所标注的功能也可以以不同于附图中所标注的顺序发生。例如，两个连续的方框实际上可以基本并行地执行，它们有时也可以按相反的顺序执行，这依所涉及的功能而定。也要注意的是，框图和/或流程图中的每个方框、以及框图和/或流程图中的方框的组合，可以用执行规定的功能或动作的专用的基于硬件的系统来实现，或者可以用专用硬件与计算机指令的组合来实现。
另外，在本申请各个实施例中的各功能模块可以集成在一起形成一个独立的部分，也可以是各个模块单独存在，也可以两个或两个以上模块集成形成一个独立的部分。
以上仅为本申请的优选实施例而已，并不用于限制本申请，对于本领域的技术人员来说，本申请可以有各种更改和变化。凡在本申请的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本申请的保护范围之内。应注意到：相似的标号和字母在下面的附图中表示类似项，因此，一旦某一项在一个附图中被定义，则在随后的附图中不需要对其进行进一步定义和解释。
以上，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易 想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以权利要求的保护范围为准。
工业实用性
本申请提供的一种自适应模式选择的设备操作方法、集群系统、电子设备及可读存储介质，不仅可以保证数据操作请求的顺序处理，还可以提高第一集群的吞吐量，并且第一集群和第二集群都可以横向扩展，提高系统的可用性和处理能力。

Claims (18)

  1. 一种设备操作方法，应用于集群系统，该集群系统包括第一集群和第二集群，所述第一集群包括多个第一节点，所述第二集群包括多个第二节点，所述方法包括：
    所述第一集群中的至少两个第一节点分别获得针对目标通信设备的至少两个数据操作请求；
    所述至少两个第一节点对为所述目标通信设备预设的第一分布式锁进行竞争；
    竞争得到所述第一分布式锁的第一节点将获得的数据操作请求进行存储；
    所述第二集群中的第二节点对为所述目标通信设备预设的第二分布式锁进行竞争；
    竞争得到所述第二分布式锁的第二节点根据已存储的数据操作请求的存储时间信息从所述已存储的数据操作请求中获得一条数据操作请求，对所述目标通信设备进行数据操作。
  2. 根据权利要求1所述的设备操作方法，其特征在于，
    所述数据操作请求中包括所述目标通信设备的标识信息；
    所述至少两个第一节点对为所述目标通信设备预设的第一分布式锁进行竞争的步骤包括：
    所述至少两个第一节点根据所述目标通信设备的标识信息确定所述目标通信设备对应的第一分布式锁，并对该第一分布式锁进行竞争。
  3. 根据权利要求1-2中任一项所述的设备操作方法，其中，所述竞争得到所述第一分布式锁的第一节点将对应的数据操作请求进行存储的步骤之后，该方法还包括：
    所述竞争得到所述第一分布式锁的第一节点释放所述第一分布式锁，以使其他获得数据操作请求的第一节点开始竞争该第一分布式锁。
  4. 根据权利要求1-3中任一项所述的设备操作方法，其中，所述竞争得到所述第二分布式锁的第二节点根据已存储的数据操作请求的存储时间信息从已存储的数据操作请求中获得一条数据操作请求的步骤包括：
    所述竞争得到所述第二分布式锁的第二节点从已存储的数据操作请求中获得存储时刻最早的数据操作请求。
  5. 根据权利要求1至4中任一项所述的设备操作方法，其中，所述竞 争得到所述第二分布式锁的第二节点对所述目标通信设备进行数据操作的步骤之后，所述方法还包括：
    所述竞争得到所述第二分布式锁的第二节点释放所述第二分布式锁，并从已存储的数据操作请求中删除所述竞争得到所述第二分布式锁的第二节点获得的数据操作请求。
  6. 根据权利要求1至5中任一项所述的设备操作方法，其中，竞争得到所述第一分布式锁的第一节点将对应的数据操作请求进行存储的步骤之后，该方法还包括：
    竞争得到所述第一分布式锁的第一节点生成通知信息，并发送所述通知信息至所述第二集群，以通知所述第二集群中的第二节点对所述目标通信设备进行数据操作。
  7. 根据权利要求1至6任意一项所述的设备操作方法，其中，所述目标通信设备为交换机，所述数据操作请求是对所述交换机进行配置的配置请求。
  8. 根据权利要求1至7中任一项所述的设备操作方法，其中，所述竞争得到所述第一分布式锁的第一节点将对应的数据操作请求进行存储的步骤包括：
    按照ID自增的方式存储所述数据操作请求；
    所述竞争得到所述第二分布式锁的第二节点根据已存储的数据操作请求的存储时间信息从已存储的数据操作请求中获得一条数据操作请求的步骤包括：
    从已存储的数据操作请求中获得ID最小的数据操作请求。
  9. 一种集群系统，包括第一集群和第二集群，所述第一集群包括多个第一节点，所述第二集群包括多个第二节点，其中：
    所述第一集群中的至少两个第一节点分别获得针对目标通信设备的至少两个数据操作请求；
    所述至少两个第一节点对为所述目标通信设备预设的第一分布式锁进行竞争；
    竞争得到所述第一分布式锁的第一节点将获得的数据操作请求进行存储；
    所述第二集群中的第二节点对为所述目标通信设备预设的第二分布式锁进行竞争；
    竞争得到所述第二分布式锁的第二节点根据已存储的数据操作请求的存储时间信息从所述已存储的数据操作请求中获得一条数据操作请求，对所述目标通信设备进行数据操作。
  10. 根据权利要求9所述的集群系统，其中，所述数据操作请求中包括所述目标通信设备的标识信息；
    所述至少两个第一节点配置成：
    根据所述目标通信设备的标识信息确定所述目标通信设备对应的第一分布式锁，并对该第一分布式锁进行竞争。
  11. 根据权利要求9-10中任一项所述的集群系统，其中，
    所述竞争得到所述第一分布式锁的第一节点配置成在将获得的数据操作请求进行存储之后，释放所述第一分布式锁，以使其他获得数据操作请求的第一节点开始竞争该第一分布式锁。
  12. 根据权利要求9-11中任一项所述的集群系统，其中，所述竞争得到所述第二分布式锁的第二节点配置成：
    从已存储的数据操作请求中获得存储时刻最早的数据操作请求。
  13. 根据权利要求9-12中任一项所述的集群系统，其中，所述竞争得到所述第二分布式锁的第二节点配置成在对所述目标通信设备进行数据操作后，释放所述第二分布式锁，并从已存储的数据操作请求中删除所述竞争得到所述第二分布式锁的第二节点获得的数据操作请求。
  14. 根据权利要求9-13中任一项所述的集群系统，其中，所述竞争得到所述第一分布式锁的第一节点配置成在将对应的数据操作请求进行存储之后，还生成通知信息，并发送所述通知信息至所述第二集群，以通知所述第二集群中的第二节点对所述目标通信设备进行数据操作。
  15. 根据权利要求9至14任意一项所述的集群系统，其中，所述目标通信设备为交换机，所述数据操作请求是对所述交换机进行配置的配置请求。
  16. 根据权利要求9-15中任一项所述的集群系统，其中，所述竞争得到所述第一分布式锁的第一节点配置成：
    按照ID自增的方式存储所述数据操作请求；
    所述竞争得到所述第二分布式锁的第二节点配置成：
    从已存储的数据操作请求中获得ID最小的数据操作请求。
  17. 一种可读存储介质，所述可读存储介质内存储有第一指令，当所述 第一指令在计算机上运行时，所述计算机执行如权利要求1-8任一项所述方法中所述第一节点所执行的方法步骤，和/或，所述可读存储介质内存储有第二指令，当所述第二指令在计算机上运行时，所述计算机执行如权利要求1-8任一项所述方法中所述第二节点所执行的方法步骤。
  18. 一种电子设备，所述电子设备包括存储器和处理器，其中：
    所述存储器用于存储第一可执行程序代码，所述处理器用于读取所述存储器中存储的第一可执行程序代码以执行权利要求1-8任一项所述方法中所述第一节点所执行的方法步骤，和/或，所述存储器用于存储第二可执行程序代码，所述处理器用于读取所述存储器中存储的第二可执行程序代码以执行权利要求1-8任一项所述方法中所述第二节点所执行的方法步骤。
PCT/CN2018/106743 2018-01-05 2018-09-20 设备操作方法、集群系统、电子设备及可读存储介质 WO2019134402A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
RU2020125088A RU2749339C1 (ru) 2018-01-05 2018-09-20 Способ управления оборудованием, кластерная система, электронное устройство и читаемый носитель данных
SG11202006444UA SG11202006444UA (en) 2018-01-05 2018-09-20 Equipment control method, cluster system, electronic device and readable storage medium
US16/959,728 US11416313B2 (en) 2018-01-05 2018-09-20 Equipment control method, cluster system , electronic device and readable storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810012150.2 2018-01-05
CN201810012150.2A CN110008031B (zh) 2018-01-05 2018-01-05 设备操作方法、集群系统、电子设备及可读取存储介质

Publications (1)

Publication Number Publication Date
WO2019134402A1 true WO2019134402A1 (zh) 2019-07-11

Family

ID=67143556

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/106743 WO2019134402A1 (zh) 2018-01-05 2018-09-20 设备操作方法、集群系统、电子设备及可读存储介质

Country Status (5)

Country Link
US (1) US11416313B2 (zh)
CN (1) CN110008031B (zh)
RU (1) RU2749339C1 (zh)
SG (1) SG11202006444UA (zh)
WO (1) WO2019134402A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11416313B2 (en) * 2018-01-05 2022-08-16 Beijing Kingsoft Cloud Network Technology Co., Ltd. Equipment control method, cluster system , electronic device and readable storage medium

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4009186A1 (en) * 2018-10-18 2022-06-08 Shanghai Cambricon Information Technology Co., Ltd Network-on-chip data processing method and device
US10938897B2 (en) * 2019-01-31 2021-03-02 EMC IP Holding Company LLC Extended group service changes
CN111639309B (zh) * 2020-05-26 2021-08-24 腾讯科技（深圳）有限公司 一种数据处理方法、装置、节点设备及存储介质
CN112511611B (zh) * 2020-11-19 2021-08-10 腾讯科技（深圳）有限公司 节点集群的通信方法、装置、系统及电子设备
CN113407716B (zh) * 2021-05-14 2022-08-19 桂林电子科技大学 一种基于众包的人类行为文本数据集的构造以及处理方法
CN114257606B (zh) * 2021-12-13 2024-03-29 阿里巴巴（中国）有限公司 数据处理方法、文件管理系统、存储介质及程序产品

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104092767A (zh) * 2014-07-21 2014-10-08 北京邮电大学 一种增加消息队列模型的发布/订阅系统及其工作方法
US20150350318A1 (en) * 2014-05-29 2015-12-03 Fusion-Io, Inc. Synchronizing storage state information
CN106354565A (zh) * 2016-09-21 2017-01-25 努比亚技术有限公司 一种分布式锁客户端及控制方法
CN107111596A (zh) * 2015-12-14 2017-08-29 华为技术有限公司 一种集群中锁管理的方法、锁服务器及客户端

Family Cites Families (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5933824A (en) * 1996-12-23 1999-08-03 Lsi Logic Corporation Methods and apparatus for locking files within a clustered storage environment
US7398323B1 (en) * 2001-09-19 2008-07-08 Juniper Networks, Inc. Configuring a network router
US7640317B2 (en) * 2004-06-10 2009-12-29 Cisco Technology, Inc. Configuration commit database approach and session locking approach in a two-stage network device configuration process
US7403945B2 (en) * 2004-11-01 2008-07-22 Sybase, Inc. Distributed database system providing data and space management methodology
US20060242104A1 (en) 2005-04-21 2006-10-26 Microsoft Corporation Systems and methods for manipulating data in a data storage system
US7890555B2 (en) 2007-07-10 2011-02-15 International Business Machines Corporation File system mounting in a clustered file system
CN102904833B (zh) * 2011-07-27 2015-07-08 中国科学院声学研究所 一种自适应的p2p流媒体数据片选择方法及节点
US8930596B2 (en) * 2012-11-30 2015-01-06 International Business Machines Corporation Concurrent array-based queue
US9710510B2 (en) * 2013-03-11 2017-07-18 Mongodb, Inc. System and method for minimizing lock contention
CN104063355B (zh) * 2013-03-21 2017-11-03 腾讯科技（北京）有限公司 对服务器集群进行配置的方法及配置中心服务器
CN103336789A (zh) 2013-06-06 2013-10-02 华为技术有限公司 一种数据库系统的锁操作方法及设备
EP2869199A3 (en) * 2013-11-04 2016-06-29 Gridstore Inc. Distributed reservation systems and methods
CN103731485A (zh) * 2013-12-26 2014-04-16 华为技术有限公司 一种网络设备、集群存储系统及分布式锁管理方法
WO2016018262A1 (en) * 2014-07-29 2016-02-04 Hewlett-Packard Development Company, L.P. Storage transactions
US10397053B2 (en) * 2014-08-14 2019-08-27 Netapp Inc. Methods for managing storage virtual machine configuration changes in a distributed storage system and devices thereof
CN104461705B (zh) * 2014-11-17 2019-02-19 华为技术有限公司 一种业务访问的方法及存储控制器、集群存储系统
CN105072160A (zh) 2015-07-17 2015-11-18 联动优势科技有限公司 一种流水号生成方法、装置及服务器
CN105760519B (zh) * 2016-02-26 2020-08-28 北京鲸鲨软件科技有限公司 一种集群文件系统及其文件锁分配方法
US11625461B2 (en) * 2016-04-12 2023-04-11 Sensoriant, Inc. Method and system for safeguarding stored data
CN106909599A (zh) * 2016-07-04 2017-06-30 阿里巴巴集团控股有限公司 一种集群系统、消息处理方法及装置
CN106210038B (zh) * 2016-07-06 2019-01-29 网易（杭州）网络有限公司 数据操作请求的处理方法及系统
CN107092521B (zh) * 2016-12-30 2020-11-10 北京星选科技有限公司 一种分布式任务调度方法、装置及系统
CN107204861B (zh) * 2017-07-27 2021-04-09 郑州云海信息技术有限公司 一种服务器集群事件处理方法
CN110008031B (zh) * 2018-01-05 2022-04-15 北京金山云网络技术有限公司 设备操作方法、集群系统、电子设备及可读取存储介质
US10705956B1 (en) * 2018-05-02 2020-07-07 Amazon Technologies, Inc. Sequenced extension operations on a data store
US11372827B2 (en) * 2020-05-06 2022-06-28 Amazon Technologies, Inc. Record-by-record live migration using a lock store

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150350318A1 (en) * 2014-05-29 2015-12-03 Fusion-Io, Inc. Synchronizing storage state information
CN104092767A (zh) * 2014-07-21 2014-10-08 北京邮电大学 一种增加消息队列模型的发布/订阅系统及其工作方法
CN107111596A (zh) * 2015-12-14 2017-08-29 华为技术有限公司 一种集群中锁管理的方法、锁服务器及客户端
CN106354565A (zh) * 2016-09-21 2017-01-25 努比亚技术有限公司 一种分布式锁客户端及控制方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11416313B2 (en) * 2018-01-05 2022-08-16 Beijing Kingsoft Cloud Network Technology Co., Ltd. Equipment control method, cluster system , electronic device and readable storage medium

Also Published As

Publication number Publication date
RU2749339C1 (ru) 2021-06-08
CN110008031A (zh) 2019-07-12
CN110008031B (zh) 2022-04-15
US11416313B2 (en) 2022-08-16
SG11202006444UA (en) 2020-08-28
US20200364095A1 (en) 2020-11-19

Similar Documents

Publication Publication Date Title
WO2019134402A1 (zh) 设备操作方法、集群系统、电子设备及可读存储介质
CN109582466B (zh) 一种定时任务执行方法、分布式服务器集群及电子设备
WO2020024405A1 (zh) 基于分布式协调的测试方法、装置、服务器及存储介质
CN110383764B (zh) 无服务器系统中使用历史数据处理事件的系统和方法
EP3396568B1 (en) Systems and methods for adaptive data replication
WO2018149263A1 (zh) 一种网络业务实例化的方法及装置
CN104932941B (zh) 一种分布式消息处理系统及其中的设备和方法
US10126980B2 (en) Managing data operations in a quorum-based data replication system
US11294934B2 (en) Command processing method and server
CN111258723B (zh) 分布式系统的事务处理方法、装置、系统、介质及设备
CN109918187B (zh) 任务调度方法、装置、设备和存储介质
US9342369B2 (en) System and method for increasing throughput of a PaaS system
WO2019219005A1 (zh) 一种数据处理系统及方法
CN111274214A (zh) 一种文件锁处理方法、装置及电子设备和存储介质
CN111163140A (zh) 资源获取和分配的方法、装置和计算机可读存储介质
US10740159B2 (en) Synchronization object prioritization systems and methods
US9342291B1 (en) Distributed update service
CN107370797B (zh) 一种基于HBase的强有序队列操作的方法和装置
US11176013B2 (en) Method to efficiently and reliably process ordered user account events in a cluster
JP6034368B2 (ja) 認証情報処理
CN111897646A (zh) 异步分布式锁实现方法及其装置、存储介质以及电子设备
CN111200651A (zh) 定时调用微服务的方法、系统、设备和介质
WO2020259326A1 (zh) 一种信号传输方法及装置
CN114692185A (zh) 数据处理方法及装置
CN113986505A (zh) 一种任务调度方法、系统及存储介质和终端设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18898540

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 16.10.2020)

122 Ep: pct application non-entry in european phase

Ref document number: 18898540

Country of ref document: EP

Kind code of ref document: A1