17957688. OPTIMIZING THE OPERATION OF A MICROSERVICE CLUSTER simplified abstract (HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP)
Contents
- 1 OPTIMIZING THE OPERATION OF A MICROSERVICE CLUSTER
- 1.1 Organization Name
- 1.2 Inventor(s)
- 1.3 OPTIMIZING THE OPERATION OF A MICROSERVICE CLUSTER - A simplified explanation of the abstract
- 1.4 Simplified Explanation
- 1.5 Potential Applications
- 1.6 Problems Solved
- 1.7 Benefits
- 1.8 Potential Commercial Applications
- 1.9 Possible Prior Art
- 1.10 Original Abstract Submitted
OPTIMIZING THE OPERATION OF A MICROSERVICE CLUSTER
Organization Name
HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Inventor(s)
Debloke Maitra of Tomball TX (US)
Derek Perronne of Houston TX (US)
OPTIMIZING THE OPERATION OF A MICROSERVICE CLUSTER - A simplified explanation of the abstract
This abstract first appeared for US patent application 17957688 titled 'OPTIMIZING THE OPERATION OF A MICROSERVICE CLUSTER
Simplified Explanation
The patent application describes a method for optimizing the operation of microservice clusters by ensuring data consistency across multiple nodes.
- Calculating a distinct hash per row in a database instance to create a hash list.
- Publishing the hash list to multiple nodes in the microservice cluster.
- Comparing the hash list published by one node to the hash list of another node to identify missing rows of data.
- Updating the database instance of the second node to include any missing rows of data.
Potential Applications
This technology could be applied in distributed systems, cloud computing, and data synchronization processes.
Problems Solved
Ensures data consistency across multiple nodes in a microservice cluster, reducing the risk of data discrepancies and errors.
Benefits
Improved performance and reliability of microservice clusters, streamlined data synchronization processes, and enhanced scalability.
Potential Commercial Applications
Data management software, cloud service providers, and companies utilizing microservice architectures could benefit from this technology.
Possible Prior Art
Previous methods for data synchronization in distributed systems and database replication technologies may exist.
Unanswered Questions
How does this method handle conflicts in data synchronization?
The patent application does not specify how conflicts in data synchronization are resolved if they occur.
What is the impact of this method on system performance?
The patent application does not provide information on the potential impact of this method on the performance of microservice clusters.
Original Abstract Submitted
Example implementations relate to optimizing operation of microservice clusters comprising multiple nodes, each executing a common self-sufficient microservice instance. The method includes, at a first node having a database instance comprising a plurality of rows and a plurality of columns, calculating a distinct hash per row to create a hash list, each hash identifying data contained in the respective row; publishing a distinct hash and/or the hash list to one or more of the plurality of nodes, each node having respective database instances and respective hash lists; at a second node, comparing the distinct hash and/the hash list published by the first node to the hash list of the second node to identify any missing rows of data; and, in response to identifying, based on the comparison, a missing row(s) in the second node's database instance, updating the second node's database instance to include the missing row(s) of data.
