Distributed Directory Deletion for Low-Latency SSD Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional file system kernels require top-down traversal and bottom-up deletion of directory trees, which is inefficient for solid-state media and incurs significant communication overhead, especially in solid-state drives.
Innovation Solution
A method of distributed file deletion that operates on directories in a storage system by adding them to a set, identifying subdirectories, and deleting them in a distributed manner without concerning order, using iterative search and destroy processes for parallel deletion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional top-down traversal and bottom-up deletion is used, then deletion correctness is ensured, but deletion efficiency and speed deteriorate due to sequential processing and communication overhead
Solution Approach 1:
The patent segments the directory tree deletion task into independent sub-tasks that can be executed in parallel. Instead of processing the entire tree sequentially from top to bottom, the system divides the tree into multiple sub-trees or batches of directories that can be deleted concurrently, thereby improving deletion efficiency and reducing overall latency.
Solution Approach 2:
The patent performs preliminary actions by first identifying and marking all directories and files for deletion before actually executing the deletion. The system traverses the directory tree once to build a complete list of items to be deleted, then proceeds with parallel deletion of all marked items. This preliminary identification phase enables subsequent parallel processing without risking data integrity.
2Ease of operation
If manual specification of entire directory tree is required, then deletion precision is improved, but ease of operation deteriorates due to complex user input requirements
Solution Approach 1:
The patent implements self-service by enabling the file system to automatically identify and delete entire directory trees without requiring users to manually specify each directory or file. When a user initiates a deletion operation on a parent directory, the system automatically traverses the directory structure, identifies all subdirectories and files, and deletes them all in one operation. This eliminates the need for users to provide detailed information about the complete directory tree while maintaining precise deletion control.
Data Source
AI summary
A method of distributed file deletion, performed by a storage system, is provided. The method includes receiving, at the storage system, a request to delete a directory and contents of the directory and adding the directory to a first set, listed in a memory in the storage system. The method includes operating on the first set, by examining each directory in the first set to identify subdirectories, adding each identified subdirectory to the first set as a directory, and adding each examined directory to a second set listed in the memory. The method includes deleting in a distributed manner across the storage system without concern for order, contents of directories, and the directories listed in the second set.