Fast and Fair Randomized Wait-Free Locks
Fast and Fair Randomized Wait-Free Locks
复制标题
快速公平的随机无等待锁
DOI:
10.1145/3519270.3538448
复制
发表时间:
2022
期刊:
影响因子:
--
通讯作者:
Blelloch, Guy E.
中科院分区:
文献类型:
--
作者:
Ben-David, Naama;Blelloch, Guy E.
We present a randomized approach for wait-free locks with strong bounds on time and fairness in a context in which any process can be arbitrarily delayed. Our approach supports a tryLock operation that is given a set of locks, and code to run when all the locks are acquired. A tryLock operation, or attempt, may fail if there is contention on the locks, in which case the code is not run. Given an upper bound k known to the algorithm on the point contention of any lock, and an upper bound L on the number of locks in a try- Lock's set, a tryLock will succeed in acquiring its locks and running the code with probability at least 1/(kL). It is thus fair. Furthermore, if the maximum step complexity for the code in any lock is T , the attempt will take O(k2L2T ) steps, regardless of whether it succeeds or fails. The attempts are independent, thus if the tryLock is repeatedly retried on failure, it will succeed in O(k3L3T ) expected steps, and with high probability in not much more.
登录
查看更多内容
DOI:
10.1145/3503221.3508433
发表时间:
2022
期刊:
Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
影响因子:
--
作者:
Ben-David, Naama;Blelloch, Guy E.;Wei, Yuanhao
通讯作者:
Wei, Yuanhao
DOI:
--
发表时间:
1994
期刊:
SIAM journal on computing (Print)
影响因子:
--
作者:
B. Chor;A. Israeli;Ming Li
通讯作者:
Ming Li
DOI:
10.1145/3453483.3454060
发表时间:
2021
期刊:
ACM/SIGPLAN Internaltional Conference on Programming Language Design and Implementation (PLDI
影响因子:
--
作者:
Anderson, Daniel;Blelloch, Guy E.;Wei, Yuanhao
通讯作者:
Wei, Yuanhao
影响因子:
0.6
作者:
R. Bayer;M. Schkolnick
通讯作者:
R. Bayer;M. Schkolnick
DOI:
10.1145/135419.135468
发表时间:
1992
期刊:
J. ACM
影响因子:
--
作者:
E. Kushilevitz;M. Rabin
通讯作者:
M. Rabin