Inode Entry Backup in Storage Tail Regions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for maintaining data retention in filesystems face challenges when the central inode list is lost, leading to data loss and storage capacity issues due to the need for redundant copies that consume significant space.
Innovation Solution
A distributed backup of the central inode list is created by storing a copy of each inode entry in the unused tail region of the last block of storage space, allowing for data recovery without using additional storage space, and reducing metadata to minimize storage footprint.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a redundant copy of the central inode list is maintained, then data retention is improved, but storage capacity is significantly reduced
Solution Approach 1:
The patent segments the inode list backup into individual inode copies distributed across multiple file blocks throughout the storage system. Instead of maintaining one complete redundant inode list, the system creates distributed copies of individual inodes within the tail regions of various data blocks, allowing reconstruction of the inode list from scattered locations.
Solution Approach 2:
The patent embeds inode copies within the unused tail regions of existing data blocks. By nesting the backup information inside the structure of regular data blocks rather than creating separate backup structures, the system achieves redundancy without consuming additional storage capacity.
2Reliability
If storage space is allocated for inode list redundancy, then data recoverability is improved, but usable storage space is consumed
Solution Approach 1:
The patent recovers and reuses the unused tail regions of data blocks for storing inode copies. By discarding the conventional approach of leaving this space wasted and instead utilizing it for backup purposes, the system transforms previously useless space into valuable redundancy storage without reducing usable capacity.
3Adaptability or versatility
If the central inode list is lost, then data accessibility is improved (no single point of failure), but data retrieval becomes impossible
Solution Approach 1:
The patent prepares for potential inode list loss by pre-distributing copies of individual inodes throughout the storage system in unused tail regions. This beforehand cushioning ensures that if the central inode list is lost, the system already has scattered backup information available to reconstruct file location data without requiring additional recovery operations.
Data Source
AI summary
A computer-implemented method, according to one embodiment, includes: receiving a write request which includes data, and allocating an inode entry in a central inode list, such that the inode entry corresponds to the data received. The data is allocated to a block of storage space in memory. Moreover, one or more instructions to write the data to the block of storage space are sent. A determination is also made as to whether the data fills a threshold amount of a last block of storage space. In response to determining that the data does not fill the threshold amount of the last block of storage space, one or more instructions to create an identifier at an end of the data are sent. Furthermore, one or more instructions to store a copy of the inode entry after the identifier in the last block of storage space are sent.