Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench
Ajay Singh, Sathya Peri, G Monika, Anila Kumari

TL;DR
This paper compares the performance of various Software Transactional Memory (STM) concurrency control protocols, specifically BTO, SGT, and MVTO, using Synchrobench to evaluate their efficiency in multi-threaded environments.
Contribution
It implements and evaluates three STM protocols within a unified library, providing a comprehensive performance comparison against existing linked-list modules.
Findings
BTO and MVTO outperform other protocols in CPU time for high thread counts.
BTO and MVTO have similar performance levels.
Both outperform SGT by 9% to 36%.
Abstract
Writing concurrent programs for shared memory multiprocessor systems is a nightmare. This hinders users to exploit the full potential of multiprocessors. STM (Software Transactional Memory) is a promising concurrent programming paradigm which addresses woes of programming for multiprocessor systems. In this paper, we implement BTO (Basic Timestamp Ordering), SGT (Serialization Graph Testing) and MVTO(Multi-Version Time-Stamp Ordering) concurrency control protocols and build an STM(Software Transactional Memory) library to evaluate the performance of these protocols. The deferred write approach is followed to implement the STM. A SET data structure is implemented using the transactions of our STM library. And this transactional SET is used as a test application to evaluate the STM. The performance of the protocols is rigorously compared against the linked-list module of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
