Transaction-Safe File System Directory Structure
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Complex file systems are vulnerable to corruption during operations due to power disruptions or interruptions, as they may not complete transactions safely, leading to data loss or system instability.
Innovation Solution
Implementing a transaction-safe file system by using a dummy cluster in the file allocation table as the initial entry, allowing subsequent clusters to be modified in a transaction-safe mode, with changes tracked in a second file allocation table, and synchronizing both tables to ensure data integrity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a FAT is used to link various clusters of data together into a file that is comprised of several such clusters, then the file system can organize and manage files efficiently, but the file system becomes vulnerable to corruption if a power disruption or other interruption occurs during operations
Solution Approach 1:
The patent applies preliminary action by creating a duplicate FAT structure before performing file operations. This duplicate structure serves as a prepared backup that can be activated if the operation fails, preventing corruption. The duplicate FAT is initialized and ready in advance, so that if power disruption occurs during file operations, the system can switch to the duplicate structure and maintain data integrity.
Solution Approach 2:
The patent changes the state parameter of the FAT structure by introducing a duplicate copy with different initialization states. The original FAT and duplicate FAT can be switched between states (active/backup) depending on operation success. This parameter change allows the system to transition from a single-point-of-failure structure to a redundant structure that can withstand interruptions.
2Adaptability or versatility
If file system operations are made complex to handle various file management tasks, then the file system can perform more sophisticated operations, but the vulnerability to corruption increases due to more steps that can be interrupted
Solution Approach 1:
The patent segments the FAT structure into multiple independent parts: the original FAT and the duplicate FAT. Each segment can be independently modified during operations. This segmentation allows complex file operations to be performed on one segment while the other remains intact as a backup, reducing the risk that a single point of failure will corrupt the entire file system.
Solution Approach 2:
The duplicate FAT acts as an intermediary structure between the file system operations and the actual data storage. It mediates the risk of corruption by providing a buffer zone where operations can be performed safely. If operations fail, the intermediary duplicate structure prevents direct corruption of the primary file system data.
3Reliability
If a dummy cluster is used as the initial entry in directory definition, then transaction-safe modifications can be performed by tracking changes in a second FAT, but the file system structure becomes more complex
Solution Approach 1:
The patent uses copying by creating a duplicate FAT structure that mirrors the original. This copy allows transaction-safe modifications to be performed by tracking changes in the second FAT while maintaining the original as a reference. The copying approach enables reliable transaction processing without requiring fundamentally new complex structures, just a replicated version of the existing FAT.
Data Source
AI summary
Directories in a file system are defined with a dummy cluster in a file allocation table as the initial entry. Subsequent clusters in a directory's definition may define any data for the directory that can be changed in a transaction-safe mode. A directory may be modified in a transaction-safe mode by modifying any of the subsequent clusters while tracking changes in a second file allocation table. When the changes have been made to the directory, a pointer to the second file allocation table may be switched to indicate that the second file allocation table is now last known good. The first file allocation table may then be synchronized with the second.


