Title :
Multiple reservations and the Oklahoma update
Author :
Stone, Janice M. ; Stone, Harold S. ; Heidelberger, Philip ; Turek, John
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
A multiple reservation approach that allows atomic updates of multiple shared variables and simplifies concurrent and nonblocking codes for managing shared data structures such as queues and linked lists is presented. The method can be implemented as an extension to any cache protocol that grants write access to at most one processor at a time. Performance improvement, automatic restart, and livelock avoidance are discussed. Some sample programs are examined.<>
Keywords :
codes; data structures; protocols; Oklahoma update; atomic updates; automatic restart; cache protocol; concurrent codes; linked lists; livelock avoidance; multiple reservations; multiple shared variables; nonblocking codes; performance improvement; queues; shared data structures; write access; Access protocols; Computer aided instruction; Computer crashes; Concurrent computing; Data structures; Performance evaluation; Registers; Terminology; Testing; Time sharing computer systems;
Journal_Title :
Parallel & Distributed Technology: Systems & Applications, IEEE
