Z Wu et al 1995 Distrib. Syst. Engng. 2 50 doi:10.1088/0967-1846/2/1/005
Z Wu, R J Stroud, K Moody and J Bacon
Show affiliationsThe complexity of potential interactions among concurrent activities and the multitude of failure modes that can occur in distributed systems make it hard to reason about distributed programs. Transactions provide the programmer with a mechanism that simplifies the development of concurrent and distributed programs. In this paper we present the design and implementation of a distributed transaction system that uses atomic data types to provide synchronization and recovery. Generally speaking, implementing user-defined atomic data types is a difficult task. However, unlike existing systems, our system requires programmers to do very little extra work to make an object atomic. Programmers implement atomic data types as if for a sequential and reliable environment and specify the concurrent semantics of object operations separately in a small, but expressive declarative language. Appropriate synchronization and recovery code for atomic data types is generated automatically by the system according to this information.
07.05.Bx Computer systems: hardware, operating systems, computer languages, and utilities
07.05.Kf Data analysis: algorithms and implementation; data management
Issue 1 (March 1995)
Z Wu et al 1995 Distrib. Syst. Engng. 2 50
A Razet and S Picard 1999 Metrologia 36 159
Timothy P Ambrose et al 1994 Smart Mater. Struct. 3 26
Jaime E Santos et al 2005 Phys. Biol. 2 207
Neil Achtman et al 2007 J. Neural Eng. 4 336
A R Denman et al 2004 J. Radiol. Prot. 24 83
Oskar Painter et al 2001 J. Opt. A: Pure Appl. Opt. 3 S161
Maurizio Vannoni and Samuele Straulino 2007 Eur. J. Phys. 28 781
G Gómez et al 2004 Nonlinearity 17 1571
J M Kosterlitz and D J Thouless 1973 J. Phys. C: Solid State Phys. 6 1181