Open AccessReducing false conflicts in signature‐based eager hardware transactional memory
Author(s) -
Kang Jinku,
Jung Jaeil,
Lee Inhwan
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.3375
Subject(s) - transactional memory , computer science , multi core processor , benchmark (surveying) , signature (topology) , speedup , database transaction , transactional leadership , parallel computing , multiprocessing , set (abstract data type) , transaction processing , operating system , database , programming language , psychology , social psychology , geometry , mathematics , geodesy , geography
The use of a conflict‐address buffer (CAB) for reducing false conflicts in signature‐based eager hardware transactional memory (HTM) is proposed. On the basis of the observation that most conflicts occur when accessing a very small set of addresses, the CAB captures those addresses that generate a conflict at runtime and performs more precise conflict detection for the captured addresses. Using the CAB can reduce false conflicts and the associated unnecessary transaction aborts and, consequently, improve the performance of the multicore processors that implement the signature‐based eager HTM. When running the Stanford transactional applications for multiprocessing (STAMP) benchmark on a 16‐core processor that implements the LogTM‐SE, the speedup (decrease in execution time) achieved with a 4‐entry CAB is 9.4% on average.