Y. Afek, M. Merritt, and G. Taubenfeld. Benign failures models for shared memory. In Proceedings of the 7th International Workshop on Distributed Algorithms, pages 69--83. Springer Verlag, September 1993. In: LNCS 725.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....model which is both fault tolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronisation protocols is presented in [DW93, PT94] Another approach for combining processor and memory failures is put forward by Afek et al. AGMT92, AMT93] and Jayanti et al. JCT92] They analyse whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may fail by giving responses which are incorrect, or by responding with a special error value, or even by not ....

Afek, Y., Merritt, M., and Taubenfeld, G. Benign failure models for shared memory. In 7th Int. Workshop on Distributed Algorithms (Lausanne, Switzerland, 1993), A. Schiper (Ed.), Lect. Not. Comp. Sci. 725, Springer-Verlag, pp. 69-83. 23

....for the same model which is both faulttolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronisation protocols is presented in [8, 19] Another approach for combining processor and memory failures is put forward by Afek et al. [2, 3] and Jayanti et al. 14] They analyse whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may fail by giving responses which are incorrect, or by responding with a special error value, or even by not ....

Y. Afek, M. Merritt, and G. Taubenfeld, Benign failure models for shared memory, in 7th Int. Workshop on Distributed Algorithms, A. Schiper, ed., Lect. Not. Comp. Sci. 725, Lausanne, Switzerland, Sept. 27--29 1993, Springer-Verlag, pp. 69--83. 23

....model which is both fault tolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronisation protocols is presented in [DW93, PT94] Another approach for combining processor and memory failures is put forward by Afek et al. AGMT92, AMT93] and Jayanti et al. JCT92] They analyse whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may fail by giving responses which are incorrect, or by responding with a special error value, or even by not ....

Afek, Y., Merritt, M., and Taubenfeld, G. Benign failure models for shared memory. In 7th Int. Workshop on Distributed Algorithms (Lausanne, Switzerland, 1993), A. Schiper (Ed.), Lect. Not. Comp. Sci. 725, Springer-Verlag, pp. 69-83.

....model which is both fault tolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronisation protocols is presented in [DW93, PT94] Another approach to combining processor and memory failures is put forward by Afek et al. AGMT92, AMT93] and Jayanti et al. JCT92] They analyse whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may fail by giving responses which are incorrect, or by responding with a special error value, or even by not ....

Afek, Y., Merritt, M., and Taubenfeld, G. Benign failure models for shared memory. In 7th Int. Workshop on Distributed Algorithms (Lausanne, Switzerland, 1993), A. Schiper (Ed.), Lect. Not. Comp. Sci. 725, Springer-Verlag, pp. 69--83.

....same model which is both fault tolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronization protocols is presented in [DW93, PT94] Another approach to combining processor and memory failures is put forward by Afek et al. AGMT92, AMT93] and Jayanti et al. JCT92] They analyze whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may fail by giving responses which are incorrect, or by responding with a special error value, or even by not ....

Afek, Y., Merritt, M., and Taubenfeld, G. Benign failure models for shared memory. In 7th WDAG (Lausanne, Switzerland, 1993), LNCS 725, Springer Verlag, pp. 69--83.

....wire to which tokens are routed. Tokens arriving at output wire i of a counting network of width n are assigned values i, i n, i 2n, 3. Fault Models Several authors have investigated failure models for shared memory systems, and proposed fault tolerant constructions for shared objects [1][2] 11] 16] In our model, the following errors can occur dynamically in the counting network data structure: 1. Bit Flip Fault: A balancer s state is spuriously altered from up to down, or vice versa. 2. Bit Access Fault: A balancer s state, whether up or down, can no longer be accessed. For ....

Y. Afek, M. Merritt and G. Taubenfeld, "Benign Failure Models for Shared-Memory", Lecture Notes in Computer Science, Vol. 725, pp. 69-83, 1993.

....same model which is both fault tolerant and self stabilizing. A combination of self stabilization and wait freedom in the construction of clock synchronization protocols is presented in [DW93, PT94] Another approach to combining processor and memory failures is put forward by Afek et al. AGMT92, AMT93] and Jayanti et al. JCT92] They analyse whether shared objects do or do not have wait free (self) implementations from other objects of which at most t are assumed to fail. Objects may fail by giving responses which are incorrect, or by responding with a special error value, or even by not ....

Yehuda Afek, Michael Merritt, and Gadi Taubenfeld. Benign failure models for shared memory. In Andr'e Schiper, editor, 7th Int. Workshop on Distributed Algorithms, Lect. Not. Comp. Sci. 725, pages 69--83, Lausanne, Switzerland, September 27--29 1993. Springer-Verlag.

.... that gracefully degrade (or exhibit only crash faults when too many primitives crash) Following on this work, three of us have defined a benign fault model intermediate in power between the omission and crash fault models, and shown that it supports universal, gracefully degrading constructions [AMT93] 8. ACKNOWLEDGEMENT The authors benefited substantially from the efforts of outstanding referees. They caught several errors and omissions, and the presentation is much improved, in clarity and style, from our original draft. From afek research.att.com Tue Jul 25 18:35:17 1995 Return Path: ....

Y. Afek, M. Merritt, and G. Taubenfeld. Benign failure models for shared memory. In Proc. 7th Int. Workshop on Distributed Algorithms: Lecture Notes in Computer Science, 725, pages 69--83. Springer Verlag, September 1993.

No context found.

Y. Afek, M. Merritt, and G. Taubenfeld. Benign failures models for shared memory. In Proceedings of the 7th International Workshop on Distributed Algorithms, pages 69--83. Springer Verlag, September 1993. In: LNCS 725.

No context found.

Y. Afek, M. Merritt, and G. Taubenfeld. Benign failures models for shared memory. In Proceedings of the 7th International Workshop on Distributed Algorithms, pages 69--83. Springer Verlag, September 1993. In: LNCS 725.

No context found.

Y. Afek, M. Merritt, and G. Taubenfeld. Benign failures models for shared memory. In Proceedings of the 7th International Workshop on Distributed Algorithms, pages 69-83. Springer Verlag, September 1993. In: LNCS 725.

No context found.

Y. Afek, M. Merritt, and G. Taubenfeld. Benign failures models for shared memory. In Proceedings of the 7th International Workshop on Distributed Algorithms, pages 69--83. Springer Verlag, September 1993. In: LNCS 725.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC