ANALYTICAL MODELING OF COMMIT-TIME-LOCKING ALGORITHMS FOR SOFTWARE TRANSACTIONAL MEMORIES

摘要

We present an analytical performance modeling approach for concurrency control al-rngorithms in the context of Software Transactional Memories (STMs). Unlike existing ap-rnproaches, we consider a realistic execution pattern where each thread alternates the exe-rncution of transactional and non-transactional code portions. Also, our model captures dy-rnnamics related to the execution of both transactional read/write memory accesses and non-rntransactional operations, even when they occur within transactional contexts. Further, wernrely on a detailed approach explicitly capturing key parameters, such as the execution costrnof transactional and non-transactional operations, as well as the cost of begin, commit andrnabort operations. The proposed modeling methodology is general and extensible, lendingrnitself to be easily specialized to capture the behavior of different STM concurrency controlrnalgorithms. In this work we specialize it to model the performance of Commit-Time-Lockingrnalgorithms, which are currently used by several STM systems.