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

a technology of data files and locks, applied in the field ofatomic renaming and moving data files, can solve problems such as method failure of look-up, and achieve the effect of avoiding the overhead required by using locks

Inactive Publication Date: 2005-10-06
IBM CORP
View PDF20 Cites 24 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Where a currently traversed record of the containing construct has already been traversed, the method returns failure of the look-up.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Atomic renaming and moving of data files while permitting lock-free look-ups
  • Atomic renaming and moving of data files while permitting lock-free look-ups
  • Atomic renaming and moving of data files while permitting lock-free look-ups

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

and Conclusion

[0049] The preceding description of varying embodiments of the invention is sufficient to enable those of ordinary skill within the art to make and use the invention. In this section of the detailed description, various implementation details are provided for specific embodiments of the invention, however. Such implementation details may be desired to be used by those of ordinary skill within the art when practicing a specific and / or alternative embodiment of the invention.

[0050] In the embodiments of the invention that have been described, it has been presumed that the name of a record is atomically changeable. In some situations, however, this may not be the case. Therefore, the actual renaming of the record may be accomplished as follows. The record is removed from the hash chain in question after the temporary record therefore is inserted. A grace period is waited for to be elapsed, to guarantee that no processes are currently looking up or otherwise referring to ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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.

Description

FIELD OF THE INVENTION [0001] This invention relates generally to atomically renaming and moving data files within computer file systems, and more particularly to such atomic renaming and moving of data files while permitting lock-free look-ups to the data files. BACKGROUND OF THE INVENTION [0002] Multiple-processor, multiple-threaded, and other types of multi-tasking computer systems allow more than one process to be executed at the same time. Such computer systems have certain performance benefits and advantages. Running more than one process at the same time is generally quicker than running one process until it is finished, and then running a second process until it is finished, and so on. Modern applications for computer systems indeed often require that more than one process be executed at the same time, either on the same processor, or on multiple processors. [0003] However, multi-tasking computer systems can introduce processing complexities that are not present when only on...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(United States)
IPC IPC(8): G06F7/00G06F17/30
CPCG06F16/10
Inventor MCKENNEY, PAUL E.SARMA, DIPANKARSONI, MANEESH
Owner IBM CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap