TY - JOUR
T1 - Reduced hardware norec
T2 - A safe and scalable hybrid transactional memory
AU - Matveev, Alexander
AU - Shavit, Nir
N1 - Publisher Copyright:
Copyright © 2015 ACM.
PY - 2015/4
Y1 - 2015/4
N2 - Because of hardware TM limitations, software fallbacks are the only way to make TM algorithms guarantee progress. Nevertheless, all known software fallbacks to date, from simple locks to sophisticated versions of the NOrec Hybrid TM algorithm, have either limited scalability or weakened semantics. We propose a novel reduced-hardware (RH) version of the NOrec HyTM algorithm. Instead of an all-software slow path, in our RH NOrec the slow-path is a "mix" of hardware and software: one short hardware transaction executes a maximal amount of initial reads in the hardware, and the second executes all of the writes. This novel combination of the RH approach and the NOrec algorithm delivers the first Hybrid TM that scales while fully preserving the hardware's original semantics of opacity and privatization. Our GCC implementation of RH NOrec is promising in that it shows improved performance relative to all prior methods, at the concurrency levels we could test today.
AB - Because of hardware TM limitations, software fallbacks are the only way to make TM algorithms guarantee progress. Nevertheless, all known software fallbacks to date, from simple locks to sophisticated versions of the NOrec Hybrid TM algorithm, have either limited scalability or weakened semantics. We propose a novel reduced-hardware (RH) version of the NOrec HyTM algorithm. Instead of an all-software slow path, in our RH NOrec the slow-path is a "mix" of hardware and software: one short hardware transaction executes a maximal amount of initial reads in the hardware, and the second executes all of the writes. This novel combination of the RH approach and the NOrec algorithm delivers the first Hybrid TM that scales while fully preserving the hardware's original semantics of opacity and privatization. Our GCC implementation of RH NOrec is promising in that it shows improved performance relative to all prior methods, at the concurrency levels we could test today.
KW - Transactional memory
UR - https://www.scopus.com/pages/publications/84951153198
U2 - 10.1145/2775054.2694393
DO - 10.1145/2775054.2694393
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84951153198
SN - 1523-2867
VL - 50
SP - 59
EP - 71
JO - ACM SIGPLAN Notices
JF - ACM SIGPLAN Notices
IS - 4
ER -