On-line file system correction within a clustered processing system
July 31, 2016. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesIntersystem data base sharing journal merge method Distributed file access structure lock System for file and record locking between nodes in a distributed data processing environment maintaining one copy of each file lock File server system having high-speed write execution Method for controlling access to a shared file and apparatus therefor Method for minimizing lock processing while ensuring consistency among pages common to local processor caches and a shared external store Method and apparatus for controlling access by a plurality of processors to a shared resource Method and apparatus for distributed locking of shared data, employing a central coupling facility High performance file system Semaphore mechanism for a data processing system InventorsAssigneeApplicationNo. 690704 filed on 07/31/1996US Classes:707/202, Recoverability714/5Of memory or peripheral subsystemExaminersPrimary: Kulik, Paul V.Attorney, Agent or FirmInternational ClassG06F 017/00AbstractA method for identifying and repairing file system damage following the failure of a processing node within a clustered UNIX file system including a plurality of processing nodes, an interconnection network connecting the processing nodes, and a data storage device connected via a shared interconnect with each one of the plurality of processing nodes. The method includes the step of maintaining a journal for each processing node, each journal containing a bit map identifying inodes to which its associated processing node has acquired and retains an exclusive right. Each bit map journal is updated whenever its associated processing node acquires an exclusive right to an inode. Following a failure of a processing node, a non-failed processing node is designated to audit the inodes associated with the failed node. Auditing is accomplished by reading the bit map journal associated with the failed processing node and obtaining the exclusive right to every inode found within the journal. The inodes within the bit map journal, referred to as suspect inodes, are then compared with a global bit map which identifies each and every unit of space within the file system that is assignable. A suspect node is identified as having a transient state when the unit of space assigned to the suspect inode is also found to be assignable. The assignment of a unit of file system space to any suspect inode identified as having a transient state is thereafter discarded.Other References
| |
