Database Applications of the FETCH-AND-ADD Instruction

Authors:
Harold S. Stone
Affiliations:
IBM T. J. Watson Research Center, Yorktown Heights, NY 10598./ Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003.
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 5
Cited 0

System level concurrency control for distributed database systems

ACM Transactions on Database Systems (TODS)
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors

ACM Transactions on Programming Languages and Systems (TOPLAS)
Coordinating parallel processors: a partial unification

ACM SIGARCH Computer Architecture News
The NYU Ultracomputer Designing an MIMD Shared Memory Parallel Computer

IEEE Transactions on Computers
Networks and Algorithms for Very-Large-Scale Parallel Computation

Computer

Quantified Score

Hi-index	14.98

Visualization

Abstract

The FETCH-AND-ADD instruction provides for synchronization of multiple processes in a parallel manner. This paper explores the use of FETCH-AND-ADD in the context of database systems. We show how to enqueue locks, detect lock conflicts, and release locks without resorting to critical program sections that require mutual exclusion during execution. The scheme is compatible with a variant of lock management proposed by Rosenkrantz and Stearns. A second approach to parallel lock management is based on a reservation scheme by Milenkovic. This methodology uses FETCH-AND-ADD implementation of a priority queue. An implementation of such a queue originally reported by Gottlieb and Kruskal is used for this purpose, although the storage requirements for queue management may be unacceptably large in specific cases. Both approaches described in the paper suggest that FETCH-AND-ADD is potentially effective for eliminating serial bottlenecks caused by lock conflicts in multiprocessor systems.