TY - JOUR

T1 - Optimal Time-Space Tradeoff for Shared Memory Leader Election

AU - Afek, Yehuda

AU - Stupp, Gideon

PY - 1997/10

Y1 - 1997/10

N2 - Though it is common practice to treat synchronization primitives for multiprocessors as abstract data types, they are in reality machine instructions on registers. A crucial theoretical question with practical implications is the relationship between the size of the register and its computational power. We wish to study this question and choose as a first target the popular compare & swap operation (which is the basis for many modern multiprocessor architectures). Our main results are: 1. We show that leader election among n processes can be solved using a compare & swap register that can hold ≈ log n/log log n values and n read/write registers of size 2 log n bits. That is, n = (k -1)! where k is the number of values in the compare & swap register, so the compare & swap register has only O(log log n) bits. 2. We prove a tight tradeoff between the space and time necessary to solve leader election with a compare & swap register. Specifically, we show that any algorithm for leader election among n processes with a k value compare & swap register, where k ≥ log n/log log n, must have a run that accesses the compare & swap register Θ(logk n) times. We conjecture that for k < log n/log log n there is no solution. The results of this paper suggest that a complexity hierarchy for multiprocessor synchronization operations should be based on the space complexity of synchronization registers and their type.

AB - Though it is common practice to treat synchronization primitives for multiprocessors as abstract data types, they are in reality machine instructions on registers. A crucial theoretical question with practical implications is the relationship between the size of the register and its computational power. We wish to study this question and choose as a first target the popular compare & swap operation (which is the basis for many modern multiprocessor architectures). Our main results are: 1. We show that leader election among n processes can be solved using a compare & swap register that can hold ≈ log n/log log n values and n read/write registers of size 2 log n bits. That is, n = (k -1)! where k is the number of values in the compare & swap register, so the compare & swap register has only O(log log n) bits. 2. We prove a tight tradeoff between the space and time necessary to solve leader election with a compare & swap register. Specifically, we show that any algorithm for leader election among n processes with a k value compare & swap register, where k ≥ log n/log log n, must have a run that accesses the compare & swap register Θ(logk n) times. We conjecture that for k < log n/log log n there is no solution. The results of this paper suggest that a complexity hierarchy for multiprocessor synchronization operations should be based on the space complexity of synchronization registers and their type.

UR - http://www.scopus.com/inward/record.url?scp=0141552999&partnerID=8YFLogxK

U2 - 10.1006/jagm.1996.0852

DO - 10.1006/jagm.1996.0852

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0141552999

VL - 25

SP - 95

EP - 117

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 1

ER -