A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
An improved lower bound for the time complexity of mutual exclusion
2001
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing - PODC '01
We establish a lower bound of Ω(log N/ log log N ) remote memory references for N -process mutual exclusion algorithms based on reads, writes, or comparison primitives such as test-and-set and compare-and-swap. Our bound improves an earlier lower bound of Ω(log log N/ log log log N ) established by Cypher. Our lower bound is of importance for two reasons. First, it almost matches the Θ(log N ) time complexity of the best known algorithms based on reads, writes, or comparison primitives. Second,
doi:10.1145/383962.383996
dblp:conf/podc/AndersonK01
fatcat:azsdbavmjfcyxkyk7vxgpwzqwu