Multiple Reservations and the Oklahoma Update

Abstract

A multiple reservation approach allows atomic updates of multiple shared variables, and simplifies concurrent and nonblocking codes for managing shared data structures such as queues and linked lists. This method can be implemented as an extension to any cache protocol that grants write access to at most one processor at a time. © 1993 IEEE