Preferential Block Recycling in Redirect-on-Write Filesystems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In Redirect-on-Write file systems, managing disk space is inefficient due to frequent data block relocations, making it difficult for support analysis to predict storage locations and optimize disk usage.
Innovation Solution
The implementation of an Adjusted Xtree module (AXTM) that correlates data blocks with inodes, tracks previous and current storage locations, and optimizes storage by reusing previous locations, thereby improving memory management and disk space utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data blocks are frequently relocated to different storage locations in a Redirect-on-Write file system, then data integrity and version control are maintained, but disk space management efficiency deteriorates and storage location predictability is lost
Solution Approach 1:
The patent applies preliminary action by pre-allocating storage blocks and preparing the storage structure before data relocation is needed. The B-tree structure is pre-built with pointers to storage locations, and blocks are pre-marked as available for recycling. This allows the system to maintain data integrity through controlled redirection while improving disk space management efficiency by having ready-to-use storage locations rather than searching for them during relocation operations.
2Ease of operation
If traditional Xtree structures are used to track metadata and storage locations, then data access is enabled, but tracking complexity increases and storage location prediction becomes difficult
Solution Approach 1:
The patent applies local quality by creating specialized components within the metadata tracking system. The B-tree structure is enhanced with specific qualities: each node contains not just pointers but also storage location information and recycling status flags. The root node specifically tracks available blocks for recycling. This localized enhancement maintains data access efficiency while reducing overall tracking complexity by organizing information in a structured, query-optimized manner.
Solution Approach 2:
The patent introduces an intermediary layer between the traditional Xtree and the storage blocks. The B-tree acts as an intermediary that translates logical data access requests into physical storage locations while simultaneously tracking which blocks are available for recycling. This intermediary structure simplifies the tracking complexity by centralizing location management and providing a unified view of storage status without interfering with data access operations.
3Ease of manufacture
If previous storage locations are not reused, then allocation simplicity is maintained, but disk space utilization efficiency deteriorates
Solution Approach 1:
The patent implements discarding and recovering by systematically identifying storage blocks that have been freed (discarded) and making them available for recovery and reuse. When a data block is relocated, its previous storage location is marked as available in the B-tree structure. The system maintains a tracked list of these recovered locations and优先 allocates them for new data, thereby improving disk space utilization efficiency while maintaining allocation simplicity through automated tracking and management.
Data Source
AI summary
Provided are techniques for more efficient data storage on a computing system. An inode table is provided and populated with information relating to current and N previous locations within data storage that a particular data block has been stored. When a particular data block is modified in a redirect on write system, the modified data block is stored, if possible in a previous storage location for that particular data block and the current data location may be saved for use as the location for a subsequent modification.