Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention

08/05/2021

∙

by   Dan Alistarh, et al.

∙

0

∙

share

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.