Hierarchical Partitioning for Storage Area Network Management Agents
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional storage area networks face inefficiencies in processing large data sets of management information, leading to cumbersome updates and additional fetches of common database elements, as they often process updates independently rather than grouping related manageable entities together.
Innovation Solution
The implementation of hierarchical or tree-based partitioning, which identifies relations between manageable entities and groups updates accordingly, allowing for a single retrieval and caching of common database elements, thereby minimizing multiple fetches and optimizing update processing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional storage area networks process management information updates independently without grouping, then each update can be processed individually, but multiple fetches of common database elements are required, reducing processing efficiency
Solution Approach 1:
The patent merges multiple related manageable entities into a single partition based on hierarchical relationships. By combining entities that share common database elements into one partition, the system retrieves and caches common elements once, then applies multiple updates within the same partition without requiring additional fetches, thereby improving processing efficiency and reducing time loss.
Solution Approach 2:
The patent segments the set of manageable entities into multiple partitions based on hierarchical relationships and common database elements. This segmentation strategy groups related entities together, ensuring that updates within each partition can be processed efficiently with minimal database fetches, while maintaining the ability to process partitions independently.
2Productivity
If hierarchical partitioning is implemented to group related manageable entities, then update processing efficiency is improved by minimizing database fetches, but the complexity of identifying and grouping entities increases
Solution Approach 1:
The patent performs preliminary action by pre-identifying hierarchical relationships between manageable entities and pre-grouping them into partitions based on common database elements. This preliminary organization is established before update processing begins, allowing the system to efficiently process updates without requiring complex real-time analysis of entity relationships during the update operation.
Data Source
AI summary
A SAN management agent performs hierarchical based partitioning. Partitions expressed as a hierarchy of related manageable entities allow partitioning based on the relations in the hierarchy. Related manageable entities often trigger updates to database elements common to both of the related manageable entities. The related manageable entities often take the form of a hierarchy (tree) indicative of these relations. Grouping the updates affecting related manageable entities together in the same partition allows the database elements affected by the related updates to occur from a single retrieval of the common database element. By partitioning updates of related manageable entities together, the common database elements are more likely to be paged or cached in memory at the time the update processing updates the common database element. Accordingly, tree-based partitioning identifies relations between manageable entities, and designates related manageable entities by traversing the relations.