Advancing Multi-writer Snapshots Algorithm

Maintaining consistency among multiple threads that access and modify shared data structures [1] is paramount in concurrent programming. Multi-writer snapshot algorithms capture consistent snapshots of shared data and enable reliable program operation. The Amram-Atiya-Touitou (AAT) algorithm [2] is a widely accepted technique for capturing consistent snapshots. However, relying on global snapshot locks limits [2] performance, especially in high contention scenarios. This study addresses the performance limitations of the original His AAT algorithm by introducing improvements that significantly increase its performance and efficiency. Proposed changes include fine-grained locking [3], lazy snapshot creation, and early lock release. Through these optimizations, the reformed AAT algorithm effectively addresses the performance bottlenecks of the original algorithm, leading to significant improvements in throughput and scalability. Benchmark results show that the reformed AAT algorithm outperforms the original AAT algorithm significantly, especially in highly competitive scenarios.