Synchronizing shared abstract types
Peter Schwarz, Alfred Z. Spector · ACM Transactions on Computer Systems · 1984
The synchronization issues that arise when transaction facilities are extended for use with shared abstract data types are discussed.A formalism for specifying the concurrency properties of such types is developed, based on dependency relations that are defined in terms of an abstract type's operations.The formalism requires that the specification of an abstract type state whether or not cycles involving these relations should be allowed to form.Directories and two types of queues are specified using the technique, and the degree to which concurrency is restricted by type-specific properties is exemplified.How the specifications of types interact to determine the behavior of transactions is also discussed.A locking technique is described that permits implementations to make use of type-specific information to approach the limits of concurrency.
Cited by 246 works. doi:10.1145/989.1188 Open-access PDF
Authors
References
- The Art of Computer Programming
- The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
- The notions of consistency and predicate locks in a database system
- Monitors
- HYDRA
- Concurrency Control in Distributed Database Systems
- Abstraction mechanisms in CLU
- Granularity of locks and degrees of consistency in a shared data base
- Probability and Statistics for Engineers.
- Reference Manual for the ADA Programming Language