16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008) (2008)
Feb. 13, 2008 to Feb. 15, 2008
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDP.2008.63
The difficulty of multithreaded programming remains a major obstacle for programmers to fully exploit multicore chips. Transactional memory has been proposed as an abstraction capable of ameliorating the challenges of traditional lock-based parallel programming. Hardware transactional memory (HTM) systems implement the necessary mechanisms to provide transactional semantics efficiently. In order to keep hardware simple, current HTM designs apply fixed policies that aim at optimizing the most expected application behaviour, and many of these proposals explicitly assume that commits will be clearly more frequent than aborts in future transactional workloads. This paper shows that some applications developed under the TM programming model are by nature prone to experience many conflicts. As a result, aborted transactions can get to be common and may seriously hurt performance. Our characterization, performed with truly transactional benchmarks on the LogTM system, shows that certain programs composed by large transactions suffer indeed very high abort rates. Thus, if TM is to unburden developers from the programmability-performance trade-off, HTM systems must obtain good performance levels in the presence of frequent aborts, requiring more flexible policies of data versioning as well as more sophisticated recovery schemes
Transactional Memory, hardware, conflict, abort
J. M. Carrasco, M. E. S?nchez and J. R. Gil, "Characterization of Conflicts in Log-Based Transactional Memory (LogTM)," 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)(PDP), vol. 00, no. , pp. 30-37, 2008.