Affiliation:
1. Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen, P.O.Box 407, 9700 AK, Groningen, The Netherlands
Abstract
Abstract
Given a mutual exclusion algorithm
MXd
for
d
≥
2
threads, a mutual exclusion algorithm for
N
>
d
threads can be built in a tree of degree
d
with
N
leaves, with the critical section at the root of the tree. This tournament solution seems obviously correct and efficient. The present note proves the correctness, and formalizes the efficiency in terms of concurrent complexity by means of Bounded Unity. If the tree is balanced, the throughput is logarithmic in
N
. If moreover
MXd
satisfies FCFS (first-come first-served), the worst case individual delay of the tournament algorithm is of order
N
. This is optimal.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science,Software
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献