Hierarchical State Change Detection via Bit Masked Words
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Inefficient data synchronization in hierarchical systems, particularly in virtualized cloud environments, due to complex and time-consuming synchronization methods that delay state change detection and data exchange.
Innovation Solution
Implementing a method that uses system-level bit masked words to represent hierarchical system status, performing logical exclusive OR operations to identify cascaded state changes, and querying entities only when changes are detected, thereby reducing traversal time and data exchange.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If tree traversal and top-down traversal algorithms are used for synchronization, then complete state change detection is achieved, but synchronization delay increases and efficiency decreases
Solution Approach 1:
The patent inverts the traditional top-down traversal approach by implementing bottom-up state change detection. Child nodes notify parent nodes of state changes, and changes propagate upward through the hierarchy. This inversion eliminates the need to traverse the entire tree from the root, significantly reducing synchronization delay while maintaining complete state change detection accuracy.
Solution Approach 2:
The patent segments the hierarchical system into independent nodes that autonomously detect and report their own state changes. Each node maintains its own state information and independently identifies changes, then notifies relevant parent nodes. This segmentation eliminates the need for centralized traversal and enables parallel state change detection across all nodes, reducing overall synchronization time.
2Reliability
If comprehensive data synchronization is performed across all nodes, then complete state information is maintained, but data exchange volume and processing time increase
Solution Approach 1:
The patent extracts and transmits only the essential state change information from each node to its parent nodes, rather than synchronizing complete data sets. Each node identifies specific state changes (e.g., attribute modifications, additions, deletions) and transmits only these changes upward through the hierarchy. This extraction approach maintains data synchronization completeness while dramatically reducing data exchange volume and processing time.
Solution Approach 2:
The patent implements partial synchronization by performing state change detection and notification only where changes actually occur, rather than synchronizing all nodes uniformly. Nodes that experience state changes actively notify their parents, while nodes without changes remain dormant. This partial action approach maintains reliability for changed data while improving overall productivity by avoiding unnecessary synchronization operations.
3Measurement precision
If matching logic is used to identify changes at various levels, then state changes are detected, but the synchronization process becomes complex and time-consuming
Solution Approach 1:
The patent implements self-service state change detection where each node autonomously monitors its own state and independently identifies changes without requiring external matching logic. Nodes compare their current state against previous states, detect changes, and automatically generate notifications. This self-service approach eliminates complex centralized matching algorithms while maintaining accurate change identification at each hierarchical level.
Solution Approach 2:
The patent performs preliminary state comparison at each node before notification, where nodes pre-identify their own state changes by comparing current and previous states. This preliminary action at the source eliminates the need for complex post-collection matching logic at parent nodes. Changes are identified and prepared for transmission before reaching higher levels, simplifying the overall synchronization algorithm while maintaining detection accuracy.
Data Source
AI summary
Methods, systems and computer readable media for efficient state change support for hierarchical data models in a virtualized system are described. In some implementations, the method can include determining a system status including a system-level bit masked word having a plurality of bits, each bit corresponding to a status of a different hierarchical level of the system, and receiving a change notification. The method can also include querying an entity at a lower hierarchy level if a cascaded state change is identified for that entity. The method can further include continuing to query one or more entities in successively lower hierarchy levels so long as a cascaded state change is identified for a corresponding entity in a lower hierarchy level. The method can also include determining the current status for one or more entities having a changed status. Identifying a cascaded state change can include performing a logical exclusive OR operation on a previous status bit masked word and a current status bit masked word of an entity.