Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

22

Voted

FTCS
1998

favoriteEmaildiscussreport

61views more FTCS 1998»

How Safe is Probabilistic Checkpointing?

14 years 7 days ago

How Safe is Probabilistic Checkpointing?

Download cal.postech.ac.kr

E. N. Elnozahy

Real-time Traffic

FTCS 1998 |

claim paper

Related Content

» Modular Checkpointing for Atomicity

» Selfrecovery in server programs

» From conditional probability to the logic of doxastic actions

» Probabilistic QoS and soft contracts for transaction based Web services

» Compositional Methods for InformationHiding

» Probabilistic QoS and Soft Contracts for TransactionBased Web Services Orchestrations

» Finding OneOf Probably Nearest Neighbors with Minimum Location Updates

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	FTCS
Authors	E. N. Elnozahy

Comments (0)