Inode Enumeration via Physical Address Sorting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing file systems face inefficiencies in inode enumeration due to directory traversal methods that do not reflect the physical location of inodes on disk, leading to increased access time and fragmentation, especially in large and clustered file systems.
Innovation Solution
A system and method for efficient inode enumeration involve determining the physical address range for each inode, creating a list of these ranges, and sorting them by physical addresses to optimize disk access.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If directory traversal is used for file enumeration, then all files can be located and identified, but access time increases and enumeration speed decreases due to non-contiguous physical locations
Solution Approach 1:
The patent creates an inode map before enumeration that pre-records the physical locations of all inodes on the storage medium. This preliminary action allows the enumeration process to follow an optimized path based on pre-known physical locations, avoiding the time penalty of random access that would occur during actual enumeration.
Solution Approach 2:
The patent changes the parameter of inode access order from directory traversal order to physical location order. By sorting and processing inodes according to their physical addresses on the storage medium rather than their directory hierarchy, the system achieves sequential access patterns that dramatically improve enumeration speed and reduce access time.
2Ease of operation
If directory traversal is used for file enumeration, then files can be located, but disk fragmentation increases due to non-contiguous access patterns
Solution Approach 1:
The inode map is created in advance to record the physical locations of all inodes. This preliminary mapping allows the system to plan an access sequence that minimizes fragmentation, rather than accessing inodes in the random order dictated by directory traversal.
Solution Approach 2:
The patent changes the access pattern parameter from directory-based logical order to storage-based physical order. This transformation enables sequential access to contiguous or near-contiguous inode locations on disk, eliminating the random access pattern that causes fragmentation while preserving the ability to locate any file.
3Productivity
If sequential inode enumeration is used in clustered file systems, then all inodes can be enumerated, but access efficiency decreases because consecutive objects may be on separate storage devices
Solution Approach 1:
The patent changes the enumeration parameter from sequential inode number order to physical storage location order. By sorting inodes according to their actual physical addresses on the storage medium, the system ensures that consecutive accesses occur on the same storage device when possible, dramatically improving access efficiency in clustered file systems while maintaining complete enumeration capability.
Data Source
AI summary
A system and method for efficient inode enumeration is disclosed. The system and method for enumerating inodes, comprises locating one or more inode files associated with the file system. For each of the one or more inode files, determining a physical address range for each inode within the inode file. The system and method further comprises creating a list of the physical address range for each of the inodes within the one or more inode files. The system and method comprises sorting the list based on physical addresses of the inodes.