This paper gives tight logarithmic lower bounds on the solo step complexity of leader election in an asynchronous shared-memory model with single-writer multi-reader (SWMR) registers, for both deterministic and randomized obstruction-free algorithms. The approach extends to lower bounds for deterministic and randomized obstruction-free algorithms using multi-writer registers under bounded write concurrency, showing a trade-off between the solo step complexity of a leader election algorithm, and its worst-case write contention.

翻译：本文对领导人选举的单步复杂程度给出了严格的下限对论。 以单一作家多读器(SWMR)登记册(SWMR)为单一作家多读器(SWMR)登记册的单步复杂程度,对于确定性的和随机的无阻碍算法来说,这一方法包括使用受约束的写作货币的多作家登记册的确定性和随机的无阻碍算法的下限,这表明了领导选举算法的单步复杂程度与其最坏的写作争论之间的权衡。