Fast and Fair Mutual Exclusion for Shared Memory Systems

Authors:
Affiliations:
Venue:
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Year:
1999

Citing 0
Cited 4

The Architectural and Operating System Implications on the Performance of Synchronization on ccNUMA Multiprocessors

International Journal of Parallel Programming
Local-spin Mutual Exclusion Using Fetch-and-\phi Primitives

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Shared-memory mutual exclusion: major research trends since 1986

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented. The first one uses both compare&swap and fetch&store the second uses only fetch&store. Fetch&store are more commonly available than compare&swap. It is impossible to obtain better algorithms if "time" is measured by counting remote memory references. We were able to maintain the same level of performance with or without the support of compare&swap. However, fairness is degraded from 1-bounded bypass to lockout freedom without the support.