A time complexity lower bound for adaptive mutual exclusion

A Time Complexity Bound for Adaptive Mutual Exclusion

We consider the time complexity of adaptive mutual exclusion algorithms, where \time" is measured by counting the number of remote memory references required per critical-section access. We establish a lower bound that precludes a deterministic algorithm with O(log k) time complexity (in fact, any deterministic o(k) algorithm), where k is \point contention." In contrast, we show that expected O...

A Tight Bound on Time Complexity of Mutual Exclusion

In distributed shared memory multiprocessors, remote memory accesses generate processor-tomemory traffic which may result in a bottleneck. It is therefore important to design algorithms that minimize the number of remote memory accesses. We establish a lower bound of 3 on remote access time complexity for mutual exclusion algorithms in a model where processes communicate by means of a general r...

A Time Complexity Bound for Adaptive

Time Complexity Bounds for Shared-memory Mutual Exclusion

YONG-JIK KIM: Time Complexity Bounds for Shared-memory Mutual Exclusion. (Under the direction of James H. Anderson.) Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by concurrent processes. The problem of designing such an algorithm is widely regarded as one of the “classic” problems in concurrent programming. Recent work on scalable shared-memory mutual...

An Improved Lower Bound for the Time Complexity of Mutual Ex lusion