On the analytical modeling of concurrency control algorithms for Software Transactional Memories: The case of Commit-Time-Locking

We present an analytical performance modeling approach for concurrency control algorithms in the context of Software Transactional Memories (STMs). We consider a realistic execution pattern where each thread alternates the execution of transactional and non-transactional code portions. Our model captures dynamics related to the execution of both (i) transactional read/write memory accesses and (ii) non-transactional operations, even when they occur within transactional contexts. We rely on a detailed approach explicitly capturing key parameters, such as the execution cost of transactional and non-transactional operations, as well as the cost of begin, commit and abort operations. The proposed modeling methodology is general and extensible, lending itself to be easily specialized to capture the behavior of different STM concurrency control algorithms. In this work we specialize it to model the performance of Commit-Time-Locking algorithms, which are currently used by several STM systems. The presented analytical model has been validated against simulation results based on workload profiles derived by tracing applications proper of the STAMP benchmark suite, running on top of the TL2 transactional memory layer.

► We present a performance modeling approach for Software Transactional Memories.
► The proposed approach can cope with differentiated concurrency control algorithms.
► We provide an instantiation tailored to the Commit-Time-Locking algorithm.
► Via an evaluation study the model is shown to be very accurate with diverse workloads.