This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
M. Herlihy, Department of Computer Science, Carnegie-Mellon University
Atomic transactions are a widely accepted approach to implementing and reasoning about fault-tolerant distributed programs. This paper shows how multiversion time-stamping protocols for atomicity can be extended to induce fewer delays and restarts by exploiting semantic information about objects such as queues, directories, or counters. This technique relies on static preanalysis of conflicts between operations, and incurs no additioiwal runtime overhead. This technique is deadlock-free, and it is applicable to objects of arbitrary type.
Index Terms:
serializability, Abstract data types, atomicity, concurrency control, fault tolerance, multiple versions
Citation:
M. Herlihy, "Extending Multiversion Time-Stamping Protocols to Exploit Type Information," IEEE Transactions on Computers, vol. 36, no. 4, pp. 443-448, April 1987, doi:10.1109/TC.1987.1676926
Usage of this product signifies your acceptance of the Terms of Use.