A Novel Approach for Maintaining Consistency in Distributed File System

Maintaining the consistency in a distributed file system has always been an important issue. In recent time, many researchers have addressed the issue. The existing solutions primarily use variations of read-write lock on the file for updating operations, or make explicit assumptions on the appearance of the particular mode of files. In this paper a novel mechanism has been proposed that neither uses a lock nor uses any such explicit assumption. The proposed solution uses Write Preference Heap Tree to ensure lock-free file consistency. This Write Preference Heap Tree instantly updates multiple copies of data spread over a distributed system. We have established the efficiency of the new approach in case of interactive system where many read and write requests are simultaneously processed.