LogTM: Log-based transactional memory

被引:167
作者
Moore, Kevin E. [1 ]
Bobba, Jayararn [1 ]
Moravan, Michelle J. [1 ]
Hill, Mark D. [1 ]
Wood, David A. [1 ]
机构
[1] Univ Wisconsin, Dept Comp Sci, Madison, WI 53706 USA
来源
TWELFTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS | 2006年
基金
美国国家科学基金会;
关键词
D O I
10.1109/HPCA.2006.1598134
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Transactional memory (TM) simplifies parallel programming by guaranteeing that transactions appear to execute atomically and in isolation. Implementing these properties includes providing data version management for the simultaneous storage of both new (visible if the transaction commits) and old (retained if the transaction aborts) values. Most (hardware) TM systems leave old values "in place" (the target memory address) and buffer new values elsewhere until commit. This makes aborts fast, but penalizes (the much more frequent) commits. In this paper we present a new implementation of transactional memory, Log-based Transactional Memory (LogTM), that makes commits fast by storing old values to a per-thread log in cacheable virtual memory and storing new values in place. LogTM makes two additional contributions. First, LogTM extends a MOESI directory protocol to enable both fast conflict detection on evicted blocks and fast commit (using lazy cleanup). Second, LogTM handles aborts in (library) software with little performance penalty. Evaluations running micro- and SPLASH-2 benchmarks on a 32-way multiprocessor support our decision to optimize for commit by showing that only 1-2% of transactions abort.
引用
收藏
页码:258 / +
页数:3
相关论文
共 33 条
  • [1] A dynamic multithreading processor
    Akkary, H
    Driscoll, MA
    [J]. 31ST ANNUAL ACM/IEEE INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE, PROCEEDINGS, 1998, : 226 - 236
  • [2] [Anonymous], 1993, P S COMP ARCH ISCA
  • [3] BLUNDELL C, 2005, WORKSH DUPL DEC DEB
  • [4] CAMERON S, 1995, P INT S COMP ARCH, P24
  • [5] CHANG A, 1988, ACM T COMPUTER SYS, V6
  • [6] Culler DavidE., 1999, PARALLEL COMPUTER AR
  • [7] NOTIONS OF CONSISTENCY AND PREDICATE LOCKS IN A DATABASE SYSTEM
    ESWARAN, KP
    GRAY, JN
    LORIE, RA
    TRAIGER, IL
    [J]. COMMUNICATIONS OF THE ACM, 1976, 19 (11) : 624 - 633
  • [8] Speculative versioning cache
    Gopal, S
    Vijaykumar, TN
    Smith, JE
    Sohi, GS
    [J]. 1998 FOURTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS, 1998, : 195 - 205
  • [9] GRAY J, 1975, MODELING DATA BASE M
  • [10] HAMMOND L, 2004, P 31 ANN INTL S COMP