Fast and efficient multi-threaded algorithm for deleting an arbitrarily wide and deep directory tree using limited system resources
Abstract:
Example implementations described herein include systems and methods for processing the deletion of a directory that can include one or more subdirectories. In a system including a server having a hardware-side and a software-side that manages one or more storage systems or storage devices, a client may request the deletion of a directory, whereupon the processing of the directory occurs in a work queue and subtree queue for processing subdirectories.
Information query
Patent Agency Ranking
0/0