This preview shows page 1. Sign up to view the full content.
Unformatted text preview: under 1. single crash fault, reliable channels, under an asynchronous system model, 2. single crash fault, reliable channels, under synchronous system model, and 3. single crash fault, and undetectable message loss, under the synchronous model (Hint: Consider a reduction from the leader election problem to the consensus problem.) 3. (30 points) Consider Dijkstra’s stabilizing token ring problem. Recall that there were two actions. At process 0, we had: 0 .x = N.x-→ .x := 0 .x + 1 At all other processes j = 1 ..N , we had: j.x 6 = ( j-1) .x-→ j.x := ( j-1) .x Assume that x is an integer (unbounded). Provide a variant function and prove stabi-lization. 1...
View Full Document
This document was uploaded on 05/02/2010.
- Spring '09