RDMA Switch Bitmaps for Distributed Database Page Consensus
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed databases face challenges in maintaining continuous availability and efficient load balancing due to inefficiencies in page consensus protocols, which lead to increased resource usage and latency.
Innovation Solution
The implementation of a remote direct memory access (RDMA) switch manages page validity and status, facilitating faster page negotiation by using bitmaps to record validation states and update lock statuses dynamically, thereby optimizing page access coordination across distributed systems.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional page consensus protocols are used in distributed databases, then data consistency is maintained, but resource consumption and latency increase
Solution Approach 1:
The patent extracts the validation state tracking function from the distributed database nodes and relocates it to a dedicated bitmap data structure managed by the RDMA network layer. This separation allows validation state management to be handled independently and efficiently, reducing the computational burden on database nodes while maintaining data consistency.
Solution Approach 2:
The patent introduces an intermediary bitmap data structure that acts as a mediator between multiple distributed database nodes and the validation state information. This bitmap serves as a shared communication medium that allows nodes to efficiently determine page validity without direct peer-to-peer negotiation, reducing resource consumption.
2Reliability
If traditional page consensus protocols are used in distributed databases, then data consistency is maintained, but latency increases
Solution Approach 1:
The patent implements preliminary action by pre-establishing the bitmap data structure and pre-negotiating validation states at the network layer before actual database operations occur. The RDMA switch maintains the bitmap in advance, allowing database nodes to quickly determine page validity without undergoing time-consuming consensus protocols during data access operations.
Solution Approach 2:
The patent replaces the mechanical page negotiation process between distributed database nodes with an automated bitmap validation mechanism. Instead of nodes repeatedly exchanging messages to determine page validity, the system substitutes this with direct bitmap state checks, dramatically reducing communication latency while maintaining consistency.
3Ease of operation
If validation states are tracked using traditional methods, then page access coordination is achieved, but processing power requirements increase
Solution Approach 1:
The patent creates a simplified copy of the validation state information in the form of a bitmap data structure. Instead of maintaining complex validation state representations at each database node, the system uses a compact bitmap copy that can be efficiently queried and updated, reducing processing power requirements while maintaining coordination capabilities.
Solution Approach 2:
The patent changes the parameter representation of validation states from complex distributed data structures to simple bitmap integer values. This parameter transformation allows validation state information to be stored, transmitted, and processed more efficiently, reducing the processing power needed for page access coordination.
Data Source
AI summary
Systems and methods for high availability distributed data storage are provided. In embodiments, a method includes: receiving, by a remote direct memory access (RDMA) switch operatively coupled to a computing device, a request to access a page of a database; determining, by the RDMA switch, a validation state of the page; determining, by the RDMA switch, a status of the page; updating, by the RDMA switch, the status of the page based on the validation state and the request; and reporting, by the RDMA switch, the validation state.