Distributed file access structure lock

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

3642468, 3642815, 36493143, 36494062, 3649571, 3649642, 3649647, 3649665, 3649692, 3649747, 364DIG2, G06F 1516, G06F 1314

Patent

active

051758520

ABSTRACT:
A distributed file management system (DFS) with a plurality of nodes and a plurality of files is disclosed. The DFS uses the UNIX operating system tree structure employing inodes (data structures containing the administrative information of each file) to manage the local files and surrogate inodes (s.sub.-- inode) to manage access to files existing on another node. In addition, the DFS uses a file access structure lock (fas.sub.-- lock) to manage multiple requests to a single file. The primary reason for the addition of the fas.sub.-- lock for each file is to avoid the problem of deadlocks. The inodes and s.sub.-- inodes use the fas.sub.-- lock to synchronize their accesses to a file and avoid a deadlock situation where both s.sub.-- inode and inode await the use of a file that is locked by the other.

REFERENCES:
patent: 4104718 (1978-08-01), Poublan et al.
patent: 4224664 (1980-09-01), Trinchieri
patent: 4414624 (1983-11-01), Summer, Jr. et al.
patent: 4527237 (1985-07-01), Frieder et al.
patent: 4819159 (1989-04-01), Shipley et al.
Rifkin et al., "RFS Architectual Overview", pp. 1-12.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Distributed file access structure lock does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Distributed file access structure lock, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed file access structure lock will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1894025

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.