A fast mutual exclusion algorithm

Abstract

A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory accesses. It assumes atomic reads and atomic writes to shared registers. © 1987, ACM. All rights reserved.