## A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects (1998)

Venue: | In Symposium on Principles of Distributed Computing |

Citations: | 22 - 1 self |

### BibTeX

@INPROCEEDINGS{Jayanti98atime,

author = {Prasad Jayanti},

title = {A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects},

booktitle = {In Symposium on Principles of Distributed Computing},

year = {1998},

pages = {201--210}

}

### OpenURL

### Abstract

Many recent wait-free implementations are based on a sharedmemory that supports a pair of synchronization operations, known as LL and SC. In this paper, we establish an intrinsic performance limitation of these operations: even the simple wakeup problem [16], which requires some process to detect that all n processes are up, cannot be solved unless some process performs#for n) shared-memory operations. Using this basic result, we derive a#230 n) lower bound on the worst-case shared-access time complexity of n-process implementations of several types of objects, including fetch&increment, fetch&multiply, fetch&and, queue, and stack. (The worst-case shared-access time complexity of an implementation is the number of shared-memory operations that a process performs, in the worst-case, in order to complete a single operation on the implementation.) Our lower bound is strong in several ways: it holds even if (1) shared-memory has an infinite number of words, each of unbounded size, (2) sh...