A FAST AND EFFICIENT MULTI-THREADED ALGORITHM FOR DELETING AN ARBITRARILY WIDE AND DEEP DIRECTORY TREE USING LIMITED SYSTEM RESOURCES

A FAST AND EFFICIENT MULTI-THREADED ALGORITHM FOR DELETING AN ARBITRARILY WIDE AND DEEP DIRECTORY TREE USING LIMITED SYSTEM RESOURCES

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: NGO Hoc Dinh, PICKEN Daniel
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.