Migrating transactions

Presents a concept that permits long activities to be broken into several steps using short transactions. The scheme maintains the consistency of the data and the correct termination of the transaction-set is guaranteed. Invariant data or program structures can be passed to subsequent decision point...

Full description

Saved in:
Bibliographic Details
Published inWorkshop on the Future Trends of Distributed Computing Systems in the 1990s: Proceedings pp. 512 - 520
Main Authors Klein, J., Reuter, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1988
Subjects
Computer science
Control systems
Distributed databases
Information systems
Local area networks
Manufacturing
System performance
System recovery
Transaction databases
Workstations
Online AccessGet full text
ISBN9780818608971
0818608978
DOI10.1109/FTDCS.1988.26735

Cover

More Information
Summary:Presents a concept that permits long activities to be broken into several steps using short transactions. The scheme maintains the consistency of the data and the correct termination of the transaction-set is guaranteed. Invariant data or program structures can be passed to subsequent decision points, permitting an application designer to specify those assumptions needed to produce the actions that make up the activity. The control of the activity is not fixed on a certain node making the execution of the activity independent of nodes.< >
ISBN:9780818608971
0818608978
DOI:10.1109/FTDCS.1988.26735