Time-warp: Lightweight Abort Minimization in Transactional Memory

The notion of permissiveness in Transactional Memory (TM) translates to only aborting a transaction when it can-not be accepted in any history that guarantees correctness criterion. This property is neglected by most TMs, which, in order to maximize implementation’s efficiency, resort to aborting transactions under overly conservative conditions. In this paper we seek to identify a sweet spot between permissiveness and efficiency by introducing the Time-Warp Multi-version algorithm (TWM). TWM is based on the key idea of allowing an update transaction that has performed stale reads (i.e., missed the writes of concurrently commit-ted transactions) to be serialized by “committing it in the past”, which we call a time-warp commit. At its core, TWM uses a novel, lightweight validation mechanism with little computational overheads. TWM also guarantees that read-only transactions can never be aborted. Further, TWM guar-antees Virtual World Consistency, a safety property that is deemed as particularly relevant in the context of TM. We demonstrate the practicality of this approach through an ex-tensive experimental study, where we compare TWM with four other TMs, and show an average performance improve-ment of 65 % in high concurrency scenarios