Cost of graceful degradation for omission failures

Information Processing Letters

Volumn 71, Issue 3, 1999, Pages 167-172

  Jayanti, Prasad ^a   Chandra, Tushar Deepak ^b   Toueg, Sam ^c  

^a DARTMOUTH COLLEGE   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

SPACE COMPLEXITY;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0033609573     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00101-5     Document Type: Article

References (7)

1. [1] Y. Afek, D. Greenberg, M. Merritt, G. Taubenfeld, Computing with faulty shared objects, J. ACM 42 (6) (1995) 1231-1274.
2. [2] Y. Afek, M. Merritt, G. Taubenfeld, Benign failure models for shared memory, in: Proc. 7th Workshop on Distributed Algorithms, Lausanne, Switzerland, September 1993, Lecture Notes in Computer Sci. 725, Springer, Berlin, 1993.
3. [3] M.P. Herlihy, Wait-free synchronization, ACM Trans. Programming Languages Syst. 13 (1) (1991) 124-149.
4. [4] M.P. Herlihy, J.M. Wing, Linearizability: A correctness condition for concurrent objects, ACM Trans. Programming Languages Syst. 12 (3) (1990) 463-492.
5. [5] P. Jayanti, T.D. Chandra, S. Toueg, Fault-tolerant wait-free shared objects, J. ACM 45 (3) (1998) 451-500.
6. [6] L. Lamport, Concurrent reading and writting, Comm. ACM 20 (11) (1977) 806-811.
7. [7] F. Stomp, G. Taubenfeld, Constructing a reliable test&set bit, in: Proc. 15th Annual Symposium on Principles of Distributed Computing, May 1996, pp. 177-177.