Partitioned Directory Link Count Synchronization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems require traversal of the entire partitioned directory by each user to maintain the link count below a maximum limit, which is time-consuming and burdens computer resources, and serializing user accesses to prevent exceeding the limit increases wait times.
Innovation Solution
A primary computer traverses the partitioned directory once to obtain the initial link count, stores it, and communicates it to other computers in the cluster, allowing each computer to track and update the link count in real-time using delta values, enabling simultaneous modifications while ensuring the link count remains below the maximum limit without full directory traversal.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traversal of the entire partitioned directory is performed by each user to maintain link count below maximum limit, then the link count can be accurately maintained, but it is time-consuming and burdens computer resources
Solution Approach 1:
The system performs a preliminary full directory traversal only once to establish the initial link count and allocate links to users. This preliminary action eliminates the need for repeated traversals, as users subsequently track their own link creations/deletions locally without needing to re-traverse the directory.
Solution Approach 2:
The system segments the link count tracking responsibility by allocating specific link quotas to individual users. Each user is given a portion of the total available links and independently tracks their own usage, eliminating the need for centralized directory traversal by each user while maintaining overall link count accuracy.
2Reliability
If traversal of the entire partitioned directory is performed by each user to maintain link count below maximum limit, then the link count can be accurately maintained, but it burdens computer resources
Solution Approach 1:
The system performs a preliminary full directory traversal only once to establish the initial link count and allocate links to users. This preliminary action eliminates the need for repeated traversals, significantly reducing computer resource consumption while maintaining link count accuracy through subsequent local tracking by users.
Solution Approach 2:
The system segments the link count tracking responsibility by allocating specific link quotas to individual users. Each user independently tracks their own link usage locally, eliminating the need for resource-intensive centralized directory traversals while maintaining overall system accuracy.
3Reliability
If user accesses are serialized to ensure link count remains below maximum limit, then the link count can be controlled, but wait time for each user increases
Solution Approach 1:
The system performs preliminary link allocation by dividing the total available links among users before they begin operations. This preliminary distribution enables users to simultaneously create and delete subdirectories within their allocated quotas without needing serialized access, eliminating wait times while maintaining link count control.
Solution Approach 2:
The system segments the total link pool into individual user quotas, allowing each user to independently manage their own links within allocated limits. This segmentation enables parallel user operations without serialization, as each user operates within their own namespace and quota, eliminating inter-user waiting while maintaining overall link count below the maximum limit.
Data Source
AI summary
A method of updating a link count in a partitioned directory shared by a plurality of computers within a cluster. The partitioned directory is traversed once by a first computer to obtain a link count. The link count is stored in the first computer and broadcast to a cluster of computers. A total number of allocated links is less than a maximum limit on link count minus the link count. A respective number of links is allocated to each computer within the cluster. Delta values of each computer are updated in real-time as subdirectories are created/erased. A delta value associated with each of the plurality of computers is received. A delta value represents a net number of links created or removed by each computer. The link count is updated based on the previous link count and further based on each of the delta values and further based a delta value associated with the first computer. The updated link count is stored by the first computer and broadcast to the plurality of computers.