Title :
Using transactions in distributed applications
Author :
Weihl, William E.
Author_Institution :
Lab. for Comput. Sci., MIT, Cambridge, MA, USA
fDate :
Feb. 26 1990-March 2 1990
Abstract :
An extended example is presented to illustrate the use of atomic transactions in implementing distributed programs. It is shown that transactions can be used to control concurrency and recover from failures, making it relatively easy to write programs that access and modify distributed and even replicated data. Type-specific concurrency control techniques, which use the specifications of the data types in a system to enhance concurrency while still preserving the modular structure of the system are described. Examples that provide several illustrations of the utility of transactions in distributed applications are given. The serializability and recoverability properties of transactions simplify reasoning about programs by allowing the programmer to think of each transaction as occurring indivisibly: interleavings of the steps of concurrent transactions can be ignored, as can partial executions of transactions.<>
Keywords :
concurrency control; distributed processing; transaction processing; atomic transactions; concurrency; data types; distributed programs; failure recovery; recoverability; serializability; Aggregates; Computer languages; Concurrency control; Concurrent computing; Contracts; Fault tolerant systems; Organizing; Protection; Radio access networks; Writing;
Conference_Titel :
Compcon Spring '90. Intellectual Leverage. Digest of Papers. Thirty-Fifth IEEE Computer Society International Conference.
Conference_Location :
San Francisco, CA, USA
Print_ISBN :
0-8186-2028-5
DOI :
10.1109/CMPCON.1990.63700
