A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
The current generation of time-based transactional memories (TMs) has the advantage of being simple and efficient, and providing strong linearizability semantics. Linearizability matches well the goal of TM to simplify the design and implementation of concurrent applications. However, long transactions can have a much lower likelihood of committing than smaller transactions because of the strict ordering constraints imposed by linearizability. In this paper, we investigate the use of weakerdoi:10.1145/1281100.1281162 dblp:conf/podc/RiegelFSF07 fatcat:kvht3lf7xfbcrheru2mybf3muu