Issue No. 12 - December (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.9728
Two novel concurrency algorithms for abstract data types are presented that ensure serializability of transactions. It is proved that both algorithms ensure a local atomicity property called dynamic atomicity. The algorithms are quite general, permitting operations to be both partial and nondeterministic. The results returned by operations can be used in determining conflicts, thus allowing hig
commutativity; concurrency algorithms; abstract data types; serializability; local atomicity property; dynamic atomicity; partial; nondeterministic; recovery methods; intentions lists; undo logs; concurrency control; parallel processing.
W. Weihl, "Commutativity-Based Concurrency Control for Abstract Data Types," in IEEE Transactions on Computers, vol. 37, no. , pp. 1488-1505, 1988.