## Are Wait-Free Algorithms Fast? (1991)

### Cached

### Download Links

- [theory.lcs.mit.edu]
- [www.math.tau.ac.il]
- DBLP

### Other Repositories/Bibliography

Citations: | 41 - 12 self |

### BibTeX

@MISC{Attiya91arewait-free,

author = {Hagit Attiya and Nancy Lynch and Nir Shavit},

title = {Are Wait-Free Algorithms Fast?},

year = {1991}

}

### OpenURL

### Abstract

The time complexity of wait-free algorithms in "normal" executions, where no failures occur and processes operate at approximately the same speed, is considered. A lower bound of log n on the time complexity of any wait-free algorithm that achieves approximate agreement among n processes is proved. In contrast, there exists a non-wait-free algorithm that solves this problem in constant time. This implies an (log n) time separation between the wait-free and non-wait-free computation models. On the positive side, we present an O(log n) time wait-free approximate agreement algorithm; the complexity of this algorithm is within a small constant of the lower bound.