Sciweavers

Share
HPCC
2009
Springer

On the Performance of Commit-Time-Locking Based Software Transactional Memory

10 years 3 months ago
On the Performance of Commit-Time-Locking Based Software Transactional Memory
Compared with lock-based synchronization techniques, Software Transactional Memory (STM) can significantly improve the programmability of multithreaded applications. Existing research results have demonstrated through experiments that current STM designs have slower execution speed than the locks. This paper develops a theoretical explanation for the performance difference. In particular, commit-time-locking (CTL) based STMs are analyzed. A queuing theory based statistical model is developed to quantify the performance of lock-based and STM-based schemes. Analytical results obtained from the model are validated by simulations. Our study shows that (1) lockbased synchronization outperforms CTL-based STMs, and (2) when the contention level becomes low, locks and CTLbased STMs exhibit similar performance. Furthermore, we show that the performance of CTL-based STMs is sensitive to the number of threads, transaction issue rate, and the bandwidth of interconnect. Our results are expected t...
Zhengyu He, Bo Hong
Added 25 Jul 2010
Updated 25 Jul 2010
Type Conference
Year 2009
Where HPCC
Authors Zhengyu He, Bo Hong
Comments (0)
books