Timestamp-Based Approach for the Detection and Resolution of Mutual Conflicts in Distributed Systems
This document has been relocated to http://scholarsmine.mst.edu/comsci_facwork/281
There were 4 downloads as of 28 Jun 2016.
We present a timestamp based algorithm for the detection of both write-write and read-write conflicts for a single file in distributed systems during network partitions. Our algorithm allows operations to occur in different network partitions simultaneously. When the sites from different partitions merge, the algorithm detects and resolves both read-write and write-write conflicts without taking into account the semantics of the transactions. Once the conflicts have been detected some reconciliation steps for the resolution of conflicts have also been proposed. Our algorithm will be useful in real-time systems where timeliness of operations is more important than response time (delayed commit)