SIGN IN
SIGN UP
Promised messages: recovering from inconsistent global states
Full Text:
Pdf
Buy this Article
Authors:
Françoise Baudé
INRIA - CNRS/I3S - UNSA, Sophia Antipolis, France
Denis Caromel
INRIA - CNRS/I3S - UNSA, Sophia Antipolis, France
Christian Delbé
INRIA - CNRS/I3S - UNSA, Sophia Antipolis, France
Ludovic Henrio
INRIA - CNRS/I3S - UNSA, Sophia Antipolis, France
2007 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 153
· Citation Count: 1
Published in:
· Proceeding
PPoPP '07
Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming
Pages 154 - 155
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-602-8
doi>
10.1145/1229428.1229463
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PPoPP '14
Share:
|
Tags:
algorithms
checkpointing
consistency
distributed programming
error handling and recovery
promised messages
reliability
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder