An Analytic Model of Optimistic Software Transactional Memory

被引:2
作者
Heindl, Armin [1 ]
Pokam, Gilles [2 ]
Adl-Tabatabai, Ali-Reza [2 ]
机构
[1] Univ Erlangen Nurnberg, Dept Comp Sci, Erlangen, Germany
[2] Intel Corp, Microprocessor Technol Lab, Santa Clara, CA 95054 USA
来源
ISPASS 2009: IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE | 2009年
关键词
PERFORMANCE;
D O I
10.1109/ISPASS.2009.4919647
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
An analytic model is proposed to assess the performance of optimistic Software Transactional Memory (STM) systems with in-place memory updates for write operations. Based on an absorbing discrete-time Markov chain, closed-form analytic expressions are developed, which are quickly solved iteratively to determine key parameters of the STM system. The model covers complex implementation details such as read/write locking, data consistency checks and conflict management. It provides fundamental insight into the system behavior, when we vary input parameters like number and size of concurrent transactions or the number of the data objects. Numerical results are validated by comparison with a discrete-event simulation.
引用
收藏
页码:153 / +
页数:2
相关论文
共 25 条
[1]   Unbounded transactional memory [J].
Ananian, CS ;
Asanovic, K ;
Kuszmaul, BC ;
Leiserson, CE ;
Lie, S .
11TH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS, 2005, :316-327
[2]  
[Anonymous], 1976, Denumerable Markov Chains
[3]  
DAMRON P, 2006, P 12 INT C ARCH SUPP, P336
[4]  
Gray Jim, 1993, T PROCESSING CONCEPT
[5]  
Hamm L.L., 2004, PRELIMINARY ION EXCH, P1, DOI [10.2172/827202, DOI 10.2172/827202]
[6]  
HEINDL A, 2009, J COMPUER N IN PRESS
[7]  
HEINDL A, 2009, P 2 INT C SIM TOOLS
[8]  
Herlihy M., 2003, Proceedings of the twenty-second annual symposium on Principles of distributed computing, P92
[9]  
HERLIHY M., 1993, P 20 ANN INT S COMPU, P289, DOI DOI 10.1145/165123.165164.URL
[10]   ON OPTIMISTIC METHODS FOR CONCURRENCY-CONTROL [J].
KUNG, HT ;
ROBINSON, JT .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1981, 6 (02) :213-226