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)
S. K. Madria, "Timestamp-Based Approach for the Detection and Resolution of Mutual Conflicts in Distributed Systems," Proceedings of the Eighth International Workshop on Database and Expert Systems Applications, 1997, Institute of Electrical and Electronics Engineers (IEEE), Jan 1997.
The definitive version is available at http://dx.doi.org/10.1109/DEXA.1997.617412
8th International Workshop on Database and Expert Systems Applications, 1997
Keywords and Phrases
Concurrency Control; Database File Replication; Distributed Databases; Distributed Systems; Mutual Conflict Resolution; Network Partitions; Read-Write Conflicts; Real-Time Systems; Reconciliation Steps; Replicated Databases; Timestamp Based Algorithm; Timestamp-Based Approach; Write-Write Conflicts
Article - Conference proceedings
© 1997 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.