Understanding transactional memory performance

• Published in: 2010 IEEE International Symposium on Performance Analysis of Systems and Software pp. 97 - 108
• Main Authors: Porter, Donald E, Witchel, Emmett
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.03.2010
• Subjects: Data structures; Kernel; Linux; Memory architecture; Pathology; Performance analysis; Predictive models; Program processors; Programming profession
• ISBN: 1424460239; 9781424460236
• DOI: 10.1109/ISPASS.2010.5452061

Transactional memory promises to generalize transactional programming to mainstream languages and data structures. The purported benefit of transactions is that they are easier to program correctly than fine-grained locking and perform just as well. This performance claim is not always borne out because an application may violate a common-case assumption of the TM designer or because of external system effects. This paper carefully studies a range of factors that can adversely influence transactional memory performance. In order to help programmers assess the suitability of their code for transactional memory, this paper introduces a formal model of transactional memory as well as a tool, called Syncchar. Syncchar can predict the speedup of a conversion from locks to transactions within 25 % for the STAMP benchmarks. We also use the Syncchar tool to diagnose and eliminate a starvation pathology in the TxLinux kernel, improving the performance of the Modified Andrew Benchmark by 55% over Linux. The paper also presents the first detailed study of how the performance of user-level transactional programs (from the STAMP benchmarks) are influenced by factors outside of the transactional memory system. The study includes data about the interaction of transactional programs with the architecture, memory allocator, and compiler. Because many factors influence the performance of transactional programs, getting good performance from transactions is more difficult than commonly appreciated.