Concurrent File Moving with Path Comparison to Prevent Tree Loops

The patent segments the global lock mechanism into fine-grained path-based locks. Instead of using a single global lock for all renaming operations, the system divides the lock space into multiple segments corresponding to different directory paths. Each renaming operation acquires locks only for the specific paths involved, allowing concurrent operations on different paths while preventing loops through coordinated lock acquisition. This segmentation resolves the contradiction by maintaining reliability through path-specific locking while improving productivity through concurrent execution of non-conflicting operations.

The patent applies local quality by making lock acquisition behavior path-specific rather than uniform across the entire file system. Each renaming operation acquires locks locally for its source and destination paths, and the system tracks path relationships (ancestor-descendant, sibling, etc.) to determine concurrency safety. This local approach allows different parts of the file system to operate concurrently while maintaining loop prevention where needed, thus improving overall productivity without sacrificing reliability.

The patent implements dynamic lock acquisition and release based on the specific path relationships of each renaming operation. The system dynamically determines which locks to acquire by analyzing the source and destination paths, their ancestors, and siblings. Operations that don't create loops can proceed concurrently with dynamic coordination, while potentially problematic operations are serialized. This dynamic approach maximizes productivity by allowing concurrent operations when safe, while maintaining reliability through adaptive loop prevention.

The patent uses feedback mechanisms to monitor path relationships and detect potential loop conditions during concurrent operations. The system tracks the state of directory paths and uses this feedback to make real-time decisions about operation ordering and lock acquisition. When a potential loop is detected through path analysis, the system adjusts the execution order or acquires additional locks to prevent the loop, thus maintaining reliability while allowing high concurrency in safe scenarios.