Yih-Kuen Tsay and Rajive L. Bagrodia, "An algorithm with optimal failure locality for the dining philosophers problem," in 8th International Workshop on Distributed Algorithms, WDAG '94, Gerard Tel and Paul M. B. Vitanyi, Eds. 1994, vol. 857 of LNCS, pp. 296--310, Springer. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Local Tolerance to Unbounded Byzantine Faults - Nesterenko, Arora (2002) (Correct)
....that is fault containing with respect to a bounded number of Byzantine faults and is self stabilizing with respect to the combination of transient and bounded Byzantine faults. The problem of dining philosophers is known to have a few solutions that deal with unbounded number of process crashes [5, 17, 18]. Previously [16] the authors extend such a solution so as to be self stabilizing with respect to transient faults. Yet, the stabilization is not strict. Organization of the paper. In Section 2 we describe the execution model to be considered. In Section 3 we de ne fault containment and ....
....to the faulty process is greater than 1 satis es its speci cation. Hence this program is T F.0 containing with locality radius of 1. Unbounded faults. By lifting the restriction on the extent of the fault we arrive at a program class with stronger containment properties. A few solutions [5, 17, 18] to dining philosophers do not place a bound on the number of crash faults they allow. In each case it is proven that every 6 process whose distance to any crashed process is greater than 2 behaves correctly. That is such solutions are CF . containing with locality radius of 2. An unbounded ....
Y.K. Tsay and R.L. Bagrodia. An algorithm with optimal failure locality for the dining philosophers problem. In G.Tel and P.M.B. Vitanyi, editors, Distributed Algorithms, 8th International Workshop, WDAG '94, volume 857 of Lecture Notes in Computer Science, pages 296-310, Terschelling, The Netherlands, 29 September{1 October 1994. Springer.
Dining Philosophers with Crash Locality 1 - Scott Pike The (2004) (Correct)
No context found.
Yih-Kuen Tsay and Rajive L. Bagrodia, "An algorithm with optimal failure locality for the dining philosophers problem," in 8th International Workshop on Distributed Algorithms, WDAG '94, Gerard Tel and Paul M. B. Vitanyi, Eds. 1994, vol. 857 of LNCS, pp. 296--310, Springer.
Dining Philosophers that Tolerate Malicious Crashes - Mikhail Nesterenko Department (2002) (1 citation) (Correct)
No context found.
Y.K. Tsay and R.L. Bagrodia. An algorithm with optimal failure locality for the dining philosophers problem. In G.Tel and P.M.B. Vitanyi, editors, Distributed Algorithms, 8th International Workshop, WDAG '94, volume 857 of Lecture Notes in Computer Science, pages 296-310, Terschelling, The Netherlands, 29 September{1 October 1994. Springer.
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