1. The cost of graceful degradation for omission failures
- Author
-
Prasad Jayanti, Tushar Deepak Chandra, and Sam Toueg
- Subjects
Computer science ,Distributed computing ,Fault tolerance ,Object (computer science) ,Base (topology) ,Upper and lower bounds ,Process crash ,Computer Science Applications ,Theoretical Computer Science ,Signal Processing ,Failure mode and effects analysis ,Information Systems ,Degradation (telecommunications) ,Shared object - Abstract
An implementation of a shared object O is t-tolerant if the object remains correct and wait-free even when up to t base objects (objects used in the implementation of O) fail. The implementation is gracefully degrading if, no matter how many base objects fail, O does not fail more severely than its base objects. For the omission failure mode, we derive a lower bound on the space complexity of a gracefully degrading t-tolerant implementation. This result lets us conclude that, for omission failures, graceful degradation can be achieved only at the cost of increased space complexity.
- Published
- 1999
- Full Text
- View/download PDF