Obstruction-free synchronization: double-ended queues as an example

By Maurice Herlihy, Victor Luchangco, Mark Moir. 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., 2003

559 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Advanced contention management for dynamic software transactional memory (2005, methodology): “We analyze both new and existing policies for this contention management problem, using experimental results from a 16-processor SunFire machine.”
Transactional memory (2010, background): “Finally, obstruction-freedom [39] is the weakest form of forward progress guarantee.”
Transactional Memory, 2nd edition (2010, background): “The third nonblocking progress guarantee is obstruction-freedom [145].”
Concurrent programming without locks (2007, methodology): “Some previous work has used the terms ‘lock-free’ and ‘non-blocking’ interchangeably: we follow Herlihy et al’s recent usage in using lock-freedom to denote a particular kind of non-blocking guarantee [Herlihy et al. 2003].”
Fault-scalable Byzantine fault-tolerant services (2005, background): “ecution in which components act according to specification or crash), queries and updates are obstruction-free [14].”
DepSky: dependable and secure storage in a cloud-of-clouds (2011, methodology): “Finally, this lock protocol is only obstruction-free [Herlihy 2003]: if several process try to become writers at the same time, it is possible that none of them are successful.”
Hybrid transactional memory (2006, background): “[6, 7], this policy decision is made by a separate contention manager.”