Fail-awareness: an approach to construct fail-safe applications

@inproceedings{citeulike:2546176, abstract = {We present a framework for building fail-safe hard real-time applications on top of an asynchronous distributed system subject to communication partitions, i.e. using processors and communication facilities whose real-time delays cannot be guaranteed. The basic assumption behind our approach is that each processor has a local hardware clock that proceeds within a linear envelope of real-time. This allows to compute an upper bound on the actual delays incurred by a particular processing sequence or message transmission. Services and applications can use these computed bounds to detect when they cannot guarantee all their properties because of excessive delays. This allows an application to detect when to switch to a fail-safe mode}, author = {Fetter, C. and Cristian, F. }, booktitle = {Fault-Tolerant Computing, 1997. FTCS-27. Digest of Papers., Twenty-Seventh Annual International Symposium on}, citeulike-article-id = {2546176}, doi = {http://dx.doi.org/10.1109/FTCS.1997.614101}, journal = {Fault-Tolerant Computing, 1997. FTCS-27. Digest of Papers., Twenty-Seventh Annual International Symposium on}, keywords = {1997, fail-awareness}, pages = {282--291}, posted-at = {2008-03-17 14:16:51}, priority = {0}, title = {Fail-awareness: an approach to construct fail-safe applications}, url = {http://dx.doi.org/10.1109/FTCS.1997.614101}, year = {1997} }

TY - CONF ID - citeulike:2546176 L3 - citeulike-article-id:2546176 TI - Fail-awareness: an approach to construct fail-safe applications T2 - Fault-Tolerant Computing, 1997. FTCS-27. Digest of Papers., Twenty-Seventh Annual International Symposium on JF - Fault-Tolerant Computing, 1997. FTCS-27. Digest of Papers., Twenty-Seventh Annual International Symposium on SP - 282 EP - 291 N2 - We present a framework for building fail-safe hard real-time applications on top of an asynchronous distributed system subject to communication partitions, i.e. using processors and communication facilities whose real-time delays cannot be guaranteed. The basic assumption behind our approach is that each processor has a local hardware clock that proceeds within a linear envelope of real-time. This allows to compute an upper bound on the actual delays incurred by a particular processing sequence or message transmission. Services and applications can use these computed bounds to detect when they cannot guarantee all their properties because of excessive delays. This allows an application to detect when to switch to a fail-safe mode KW - 1997 KW - fail-awareness AU - Fetter, C AU - Cristian, F PY - 1997/// UR - http://dx.doi.org/10.1109/FTCS.1997.614101 ER -