The Performance of an Efficient Distributed Synchronization and Recovery Algorithm

  • Authors:
  • The Journal of Supercomputing staff

  • Affiliations:
  • -

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Concurrency control based on distributed locking introduces delays due to local processing and message communication. With improvements in processor speeds, there is a simultaneous increase in contrast, between these delays. In this study, a new approach has been proposed to reduce delays by enhancing local processing, and reducing the inter-site communication delays. The proposal presents an efficient synchronization algorithm for exchange of precedence in case of a conflict. The technique is efficient in global time-stamp management, and incurs a minimal overall synchronization overhead. A comparative analysis to study the advantages of this approach has shown favourable results. The proposed approach, enhances transaction concurrency and succeeds in lowering the number of inter-site messages.