Please use this identifier to cite or link to this item:
|Title:||Mutual exclusion with O(log 2 log n) amortized work|
|Citation:||Bender, M.A., Gilbert, S. (2011). Mutual exclusion with O(log 2 log n) amortized work. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS : 728-737. ScholarBank@NUS Repository.|
|Abstract:||This paper presents a new algorithm for mutual exclusion in which each passage through the critical section costs amortized O(log 2 log n) RMRs with high probability. The algorithm operates in a standard asynchronous, local spinning, shared memory model with an oblivious adversary. It guarantees that every process enters the critical section with high probability. The algorithm achieves its efficient performance by exploiting a connection between mutual exclusion and approximate counting. © 2011 IEEE.|
|Source Title:||Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 11, 2018
WEB OF SCIENCETM
checked on May 15, 2018
checked on Jul 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.