Input Acceptance of Time-Warping Transactional Memory

typically abort many transactions that could be safely committed. The extent to which a TM allows such spurious aborts is captured by the theory of Input Acceptance. Recently, the Time-Warping Multi-version (TWM) algorithm was proposed to minimize spu-rious aborts without hampering practical performance. In this work we seek to theoretically assess the input acceptance of TWM and compare it with other TMs. I