Virtual Differential Storage Based K - Rollback Concurrency Control Algorithm in Distributed Shared Memory Systems

52 Abstract— Most of the algorithms that exist today for concurrency control over distributed shared memory, either fail to provide a scalable model or involve a large communication overhead for establishing consensus over the state of the shared variables. After a thorough study of some of the efficient algorithms this field, this paper introduces a functional view of a holistic approach, which exploits the best features of all others. It provides a virtual differential storage, which allows fast replication and compact storage, along with a strong subversion control over rollbacks in time, which provides better fault tolerance. It also talks of an intelligent logging mechanism, where the read/write records are used actively by the central controller to provide exclusion over Above all, the algorithm is best implemented in LISP or Scheme due to its functional nature. This make the implementation computationally very fast. A trade off, however, exists between the implementation complexity and the quality of the final product.