Treffer: Transactors : A programming model for maintaining globally consistent distributed state in unreliable environments

Title:
Transactors : A programming model for maintaining globally consistent distributed state in unreliable environments
Source:
Proceedings of the 2005 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2005)ACM SIGPLAN notices. 40(1):195-208
Publisher Information:
Broadway, NY: ACM, 2005.
Publication Year:
2005
Physical Description:
print, 23 ref
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
IBM T.J. Watson Research Center, United States
Department of Computer Science, Rensselaer Polytechnic Institute, United States
ISSN:
1523-2867
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16525608
Database:
PASCAL Archive

Weitere Informationen

We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into systems that reliably maintain globally consistent distributed state. The transactor model incorporates certain elements of traditional transaction processing, but allows these elements to be composed in different ways without the need for central coordination, thus facilitating the study of distributed fault-tolerance from a semantic point of view. We formalize our approach via the r-calculus, an extended lambdacalculus based on the actor model, and illustrate its usage through a number of examples. The r-calculus incorporates constructs which distributed processes can use to create globally-consistent checkpoints. We provide an operational semantics for the r-calculus, and formalize the following safety and liveness properties: first, we show that globally-consistent checkpoints have equivalent execution traces without any node failures or application-level failures, and second, we show that it is possible to reach globally-consistent checkpoints provided that there is some bounded failure-free interval during which checkpointing can occur.