Atomic renaming and moving of data files while permitting lock-free look-ups

• US 20070198520A1
• Filed: 04/22/2007
• Published: 08/23/2007
• Est. Priority Date: 03/30/2004
• Status: Active Grant

• Current Assignee: Dipankar Sarma, Maneesh Soni, Paul Mckenney
• Original Assignee: Dipankar Sarma, Maneesh Soni, Paul Mckenney
• Inventors: Soni, Maneesh, Sarma, Dipankar, McKenney, Paul
• Granted Patent: US 7,987,166 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/10 File systems; File servers

Abstract

Atomic renaming and moving of data files, while permitting lock-free look-ups to the data files, is disclosed. A temporary record may be created within a hash chain encompassing a record for a data file and corresponding to a location of the data file within a computer file system. The temporary record is linked within the hash chain so that the temporary record points to the same records to which the record for the data file points. The record for the data file is renamed with a new name, and/or moved to a new location within the computer file system, and the temporary record is removed from the hash chain. Before the temporary record is removed, look-ups of the data file resolve to the temporary record, the temporary record causing the look-ups to wait until the record for the data file has been renamed and/or moved and the temporary record removed.

Claims

1. A computer-implemented method comprising:

renaming a data file of a computer system while permitting lock-free look-ups to the data file by utilizing a temporary record to which look-ups to the data file resolve while the data file is being renamed.

2. The method of claim 1, wherein renaming the data file comprises atomically renaming the data file.

3. The method of claim 2, wherein atomically renaming the data file of the computer file system while permitting lock-free look-ups to the data file comprises atomically renaming the data file of the computer file system such that once a look-up of an old name of the data file necessarily fails, any subsequent look-up of a new name of the data file necessarily succeeds, and such that once a look-up of the new name of the data file necessarily succeeds, any subsequent look-up of the old name of the data file necessarily fails.

4. The method of claim 1, further comprising looking up the data file in a lock-free manner while the data file is being atomically renamed.

5. The method of claim 4, wherein looking up the data file in the look-free manner comprises, while traversing records of a containing construct of a record for the data file to locate the record for the data file:

where a number of the records of the containing construct traversed so far exceeds a predetermined maximum number of records, reverting to a locking process to look up the data file;

where a currently traversed record of the containing construct has already been traversed, returning failure of the look-up of the data file;

where a currently traversed record of the containing construct does not match the data file, continuing traversal of the records of the containing construct;

where a currently traversed record of the containing construct matches the data file and is a temporary record for the data file, waiting until the temporary record has been removed and restarting look-up of the data file; and

,

where a currently traversed record of the containing construct matches the data file and is the record for the data file, returning the record such that look-up of the data file has succeeded.

6. The method of claim 5, wherein the containing construct of the record for the data file is one of a hash chain and a sub-directory.

7. A computer-implemented method comprising:

atomically moving a data file from one location to another location within a computer file system while permitting lock-free look-ups to the data file by utilizing a temporary record to which look-ups to the data file resolve while the data file is being moved.

8. The method of claim 7, wherein atomically moving the data file from one location to another location within the computer file system comprises:

creating a temporary record within a hash chain encompassing a record for the data file and corresponding to an old location of the data file within the computer file system;

linking the temporary record within the hash chain so that the temporary record points to a before record to which the record for the data file points and to an after record to which the record for the data file points;

moving the record for the data file to another hash chain corresponding to a new location of the data file within the computer file system; and

,

removing the temporary record from the hash chain,

wherein while the temporary record exists within the hash chain, look-ups of the data file resolve to the temporary record, such that the temporary record causes the look-ups to wait until the record for the data file has been moved to the other hash chain and the temporary record removed.

9. The method of claim 7, further comprising, while traversing records of a containing construct of a record for the data file to locate the record for the data file:

where a number of the records of the containing construct traversed so far exceeds a predetermined maximum number of records, reverting to a locking process to look up the data file;

where a currently traversed record of the containing construct has already been traversed, returning failure of the look-up of the data file;

where a currently traversed record of the containing construct does not match the data file, continuing traversal of the records of the containing construct;

where a currently traversed record of the containing construct matches the data file and is a temporary record for the data file, waiting until the temporary record has been removed and restarting look-up of the data file; and

,

where a currently traversed record of the containing construct matches the data file and is the record for the data file, returning the record such that look-up of the data file has succeeded.

10. A computer-implemented method comprising:

creating a temporary record within a hash chain encompassing a record for a data file and corresponding to a location of the data file within a computer file system;

linking the temporary record within the hash chain so that the temporary record points to a before record to which the record for the data file points and to an after record to which the record for the data file points;

renaming the record for the data file with a new name; and

,

removing the temporary record from the hash chain,

wherein while the temporary record exists within the hash chain, look-ups of the data file resolve to the temporary record, such that the temporary record causes the look-ups to wait until the record for the data file has been renamed and the temporary record has been removed.

11. The method of claim 10, further comprising, prior to removing the temporary record from the hash chain, moving the record for the data file to another hash chain corresponding to a new location of the data file within the computer file system, wherein while the temporary record exists within the hash chain, look-ups of the data file resolve to the temporary record, such that the temporary record causes the look-ups to wait until the record for the data file has been renamed and moved to the other hash chain and the temporary record has been removed.

12. The method of claim 10, further comprising looking-up the data file in a lock-free manner, by traversing records of the hash chain encompassing the record for the data file to locate the record for the data file, and where a currently traversed record of the hash chain matches the data file and is a temporary record for the data file, waiting until the temporary record has been removed and then restarting look-up of the data file

13. A computer-implemented method comprising:

creating a temporary record within a hash chain encompassing a record for a data file and corresponding to a location of the data file within a computer file system;

linking the temporary record within the hash chain so that the temporary record points to a before record to which the record for the data file points and to an after record to which the record for the data file points;

moving the record for the data file to another hash chain corresponding to a new location of the data file within the computer file system; and

,

removing the temporary record from the hash chain,

wherein while the temporary record exists within the hash chain, look-ups of the data file resolve to the temporary record, such that the temporary record causes the look-ups to wait until the record for the data file has been moved and the temporary record removed.

14. The method of claim 13, further comprising, prior to moving the record for the data file to the other hash chain, renaming the record for the data file with a new name, wherein while the temporary record exists within the hash chain, look-ups of the data file resolve to the temporary record, such that the temporary record causes the look-ups to wait until the record for the data file has been renamed and moved to the other hash chain and the temporary record removed.

15. The method of claim 13, further comprising looking-up the data file in a lock-free manner, by traversing records of the hash chain encompassing the record for the data file to locate the record for the data file, and where a currently traversed record of the hash chain matches the data file and is a temporary record for the data file, waiting until the temporary record has been removed and then restarting look-up of the data file.

16. A computer-implemented system comprising:

a file system in which a plurality of files are stored; and

,

means for at least one of atomically renaming and atomically moving from one location to another one of the files within the file system, while permitting lock-free file look-ups.

17. The system of claim 16, wherein the system comprises a plurality of computing nodes over which the file system is implemented.

18. The system of claim 16, wherein the system comprises a single computing node within which the file system is implemented.

19. An article of manufacture comprising:

a computer-readable medium; and

,

means in the medium for atomically renaming and atomically moving from one location to another within a file system a data file, while permitting lock-free file look-ups.

20. An article of manufacture comprising:

a computer-readable medium; and

,

means in the medium for atomically renaming within a file system a data file, while permitting lock-free file look-ups.

21. An article of manufacture comprising:

a computer-readable medium; and

,

means in the medium for atomically moving from one location to another within a file system a data file, while permitting lock-free file look-ups.