Split (1)

train · 617k rows

text stringlengths 2 132k	source dict
that H' contains no two operations by the same process (no new high-level operations start after φ finishes, so there is at most one pending operation per process in S that can be linearized after φ). Now observe that q does some non-trivial operation in τ to some base object accessed by p in σ. If not, then p sees the...	{ "page_id": null, "source": 7319, "title": "from dpo" }
stalls in on O i+1. We choose some extension X from F that maximizes the number of processes with simultaneous pending non-trivial operations on O i+1 (we'll call this set of processes S i+1 and let \|S i+1\| be the number k'>0 we've been waiting for), and let E' be the minimum prefix of X such that these pending operati...	{ "page_id": null, "source": 7319, "title": "from dpo" }
the weird condition on Eσ 1...σ i, E'α doesn't have any non-trivial accesses to any object with a non-trivial access in σ 1...σ i. So we only need to squint very closely at σ i+1 to make sure it doesn't get any object in there either. Recall that σ i+1 consists of (a) a sequence of accesses by p to objects O 1...O i (a...	{ "page_id": null, "source": 7319, "title": "from dpo" }
can handle hot spots for many practical objects, and means that in an asynchronous system, we can't solve contention at the object level in the worst case (though we may be able to avoid it in our applications). But there might be a way out for some restricted classes of objects. We saw before that we could escape from...	{ "page_id": null, "source": 7319, "title": "from dpo" }
obstruction-free implementation of anything based on Herlihy's universal construction. (1 journal version of the paper. (( 4. For the purposes of this lemma, "single-writer" means that each segment can be written to by only one process, not that there is only one process that can execute update operations. (( 5. This a...	{ "page_id": null, "source": 7319, "title": "from dpo" }
Title: Repeated Agreement is Cheap! URL Source: Markdown Content: # Repeated Agreement is Cheap! On Weak Accountability and Multishot Byzantine Agreement PIERRE CIVIT, École Polytechnique Fédérale de Lausanne (EPFL), Switzerland MUHAMMAD AYAZ DZULFIKAR, NUS Singapore, Singapore SETH GILBERT, NUS Singapore, Singapore R...	{ "page_id": null, "source": 7319, "title": "from dpo" }
the long-term goal of implementing a state machine replication abstraction of a distributed service that is just as fast and efficient as its centralized version, but with greater robustness and availability. 1 Introduction There is a long history in distributed computing of working to solve one central problem: how do...	{ "page_id": null, "source": 7319, "title": "from dpo" }
Komatovic, and Manuel Vidigueira exhibits an arbitrary failure, the process is said to be faulty; otherwise, the process is said to be correct or honest. The following guarantees must be satisfied: • Termination: All correct processes eventually decide. • Agreement: Correct processes decide on the same value. To avoid ...	{ "page_id": null, "source": 7319, "title": "from dpo" }
of these approaches, however, achieve the goal of “state machine replication”: implementing in a distributed fashion the abstraction of a service that would be just as fast and efficient as its centralized version, but with greater robustness and availability. Multi-shot agreement. In this paper, we show that this long...	{ "page_id": null, "source": 7319, "title": "from dpo" }
Title: URL Source: Markdown Content: Terminating # Reliable Broadcast Validity If the sender is correct and broadcasts a message , then all correct processes eventually deliver Agreement If a correct process delivers a message , then all correct processes eventually deliver Integrity Every correct process delivers at ...	{ "page_id": null, "source": 7319, "title": "from dpo" }
chains, and can safely deliver SF faulty (p, i ) \|faulty (p, i )\| < i p iEarly Stopping: # The Protocol set of processes that failed to send a message to in some round 1: if = sender then value := else value:= ? Process in round 2: send value to all 3: if delivered in round then halt 4: receive round values from all 5:...	{ "page_id": null, "source": 7319, "title": "from dpo" }
k ) := faulty (p, k − 1) ∪ faulty (p, k ) p # Termination If in any round a process receives a value, then it delivers the value in that round If a process has received only “?” for rounds, then it delivers SF in round f +1 f +1 Let be the set of processes that have failed to send a message to in any round 1: if = send...	{ "page_id": null, "source": 7319, "title": "from dpo" }
1, . . . , k p m p k, 1 ≤ k ≤ f +1 k = f +1 \|faulty (p, k )\| < k k = f +1 v v k q p q k p faulty (p, k ) := faulty (p, k − 1) ∪ faulty (p, k ) pValidity If the sender is correct then it sends to all in round 1 By Validity of the underlying send and receive, every correct process will receive by the end of round 1 By th...	{ "page_id": null, "source": 7319, "title": "from dpo" }
distinct, unless and sender Lemma 2: For any , if a process sets value to SF in round , then there exist some and a sequence of distinct processes such that only receives “?” in rounds 1 to , , and in each round , sends SF to and receives SF p0, p 1, . . . , p r p0 pr = p pk−1 pk p0 = p1 = m m qj , q j+1 , . . . , q r ...	{ "page_id": null, "source": 7319, "title": "from dpo" }
and SF, respectively qp mr Let be the set of processes that have failed to send a message to in any round 1: if = sender then value := else value:= ? Process in round 2: send value to all 3: if delivered in round then halt 4: receive round values from all 5: { \| received no value from in round } 6: if received value ≠ ...	{ "page_id": null, "source": 7319, "title": "from dpo" }
value to all 3: if delivered in round then halt 4: receive round values from all 5: { \| received no value from in round } 6: if received value ≠ ? then 7: value := 8: deliver value 9: if = sender then value := ? 10: else if or then 11: value := SF 12: deliver value 13: if then halt k−1 1, . . . , k p m p k, 1 ≤ k ≤ f +...	{ "page_id": null, "source": 7319, "title": "from dpo" }
In round , that correct process sends its value to all Every correct process receives and delivers the value in round By Lemma 1, there exists a sequence of distinct processes Consider processes processes; only faulty one of is correct-- let it be To send v in round must have set its value to v and delivered v in round...	{ "page_id": null, "source": 7319, "title": "from dpo" }
? Process in round 2: send value to all 3: if delivered in round then halt 4: receive round values from all 5: { \| received no value from in round } 6: if received value ≠ ? then 7: value := 8: deliver value 9: if = sender then value := ? 10: else if or then 11: value := SF 12: deliver value 13: if then halt k−1 1, . ....	{ "page_id": null, "source": 7319, "title": "from dpo" }
(p, k − 1) ∪ faulty (p, k ) pA Lower Bound Theorem There is no algorithm that solves the consensus problem in fewer than rounds in the presence of crash failures, if We consider a special case to study the proof technique n ≥ f +2 f +1 f (f = 1) # Views Let α be an execution. The view of process in . , denoted by , is ...	{ "page_id": null, "source": 7319, "title": "from dpo" }
decides the same value in both executions α1 ∼pi α2 pi Lemma If and is correct, then dec( ) = dec( ) α1 ∼pi α2 pi α1 α2 # Similarity Definition Let and be two executions of consensus and let be a correct process in both and . is similar to with respect to , denoted if α1 α2 pi α1 α2 α1 α2 pi α1 ∼pi α2 α1\|pi = α2\|pi Not...	{ "page_id": null, "source": 7319, "title": "from dpo" }
failure, if n ≥ 3 # The Idea By contradiction Consider a one-round execution in which each process proposes 0. What is the decision value? Consider another one-round execution in which each process proposes 1. What is the decision value? Show that there is a chain of similar executions that relate the two executions. S...	{ "page_id": null, "source": 7319, "title": "from dpo" }
≈Indistinguishability p0 pi−1 pi+1 pi pn−1 1 0 0 0 1 αi αi n−1 > ≈ # Indistinguishability p0 pi−1 pi+1 pi pn−1 1 0 0 0 1 αi αi n−1 p0 pi−1 pi+1 pi pn−1 1 1 0 0 1 βi n−1≈ > ≈ # Indistinguishability p0 pi−1 pi+1 pi pn−1 1 0 0 0 1 αi αi n−1 p0 pi−1 pi+1 pi pn−1 1 1 0 0 1 ≈ > ≈ βi n−2 # Indistinguishability p0 pi−1 pi+1 pi...	{ "page_id": null, "source": 7319, "title": "from dpo" }
: pr # AFMA: The Idea A correct process discards all non-valid messages it receives If a message is valid, it “extracts” the value from the message it relays the message, with its own signature appended At round : if it extracted exactly one message, delivers it otherwise, delivers SF p p p f +1 # AFMA: The Protocol In...	{ "page_id": null, "source": 7319, "title": "from dpo" }
process extracts . Let that process be . • has received in round a message • If will send a valid message in round and every correct process will extract it in round • What if ? • Claim : are all faulty – true for – Suppose were correct • signed and relayed message in round • extracted message in round • was supposed t...	{ "page_id": null, "source": 7319, "title": "from dpo" }
Title: lhv9092.PDF URL Source: Published Time: 1997-07-22T06:31:34.000Z Markdown Content: # Unreliable Failure Detectors for Reliable Distributed Systems TUSHAR DEEPAK CHANDRA 1. 11..tf. Thomas J. Warson Research Center, Hawthorne, New York AND SAM TOUEG Cornell University, Ithaca, New York We introduce the concept of...	{ "page_id": null, "source": 7320, "title": "from dpo" }
grants CCR-8901780, CCR-9102231, and CCR-940286, and DARPMNASA Ames Grant NAG-2-593. Authors’ present addresses: Tushar Deepak Chandra, 1.B.M. T.J, WatsonResearchCenter, 30 Saw Mill Road, Hawthorne,NY 10532; Sam Toueg, Department of Computer Science, Upson Hall, Cornell University, Ithaca, NY 148S3. Permission to make ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
et al. 1990], and Atomic Commitment. Given their wide applicability, Consensus and Atomic Broadcast have been extensively studied by both theoretical and experimental researchers for over adecade. In this paper, we focus on solutions to Consensus and Atomic Broadcast in the asynchronous model of distributed computing. ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
computation for fault-tolerant distributed computing. In this paper, we propose an alternative approach to circumvent such impossi-bility results, and to broaden the applicability of the asynchronous model of computation. Since impossibility results for asynchronous systems stem from the inherent difficulty of determin...	{ "page_id": null, "source": 7320, "title": "from dpo" }
the other processes. For example, consider an algorithm that uses a failure detector to solve Atomic Broadcast in an asynchronous system. Suppose all the failure detector modules wrongly (and permanently) suspect that correct process p has crashed. The Atomic Broadcast algorithm must still ensure that p delivers the sa...	{ "page_id": null, "source": 7320, "title": "from dpo" }
words, the Isis failure detector forces the system to conform to its view. To applications such a failure detector makes no mistakes. For a more detailed discussion on this, see Section 9.3. ‘ In this introduction, we say that the failure detector suspects that a process p has crashed if any > local failure detector mo...	{ "page_id": null, "source": 7320, "title": "from dpo" }
which every process that crashes is permanently suspected by some correct process. > Accuracy. There is a time after which some correct process is never suspected by any correct process. Such a failure detector can make an infinite number of mistakes: Each local failure detector module can repeatedly add and then remov...	{ "page_id": null, "source": 7320, "title": "from dpo" }
can focus on solving Consensus since all our results will automatically apply to Atomic Broadcast as well. 5 Solving a problem with the assumption that certain properties hold for sufficiently long has been done previously, see Dwork et al. . Unreliable Faiiure Detectors for Reliable Distributed Systems 229 there is a ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
suspects, and increases the length of its timeout period for q in an attempt to prevent a similar mistake in the future. In an asynchronous system, this scheme does not implement a failure detector with the properties of OW:C an unbounded sequence of premature time-outs may cause every correct process to be repeatedly ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
solving Consensus? > h Indeed, no algorithm can implement such a failure detector in an asynchronous system: as we show in Section 6.2, this implementation could be used to solve Consensus in such a system, contradicting the impossibility result of Fischeret al. . 230 T. D. CHANDRAAND S. TOUEG Chandra et al. answer th...	{ "page_id": null, "source": 7320, "title": "from dpo" }
lie a variety of interme-diate partiah!y synchronous models. In particular, those two papers consider at least 34 different models of partial synchrony and for each model determine whether or not Consensus can be solved. In this paper, we argue that partial synchrony assumptions can be encapsulated in the unreliability...	{ "page_id": null, "source": 7320, "title": "from dpo" }
synchrony is discussed in more detail in Section 9.1. UnreIiabie Failure Detectors for Reliable Distn”buted Systems 231 used to bridge the gap between known impossibility results and the need for practical solutions for fault-tolerant asynchronous systems. The remainder of this paper is organised as follows: In Section...	{ "page_id": null, "source": 7320, "title": "from dpo" }
communi-cation channel. To simplify the presentation of our model, we assume the existence of adiscrete global clock. This is merely a fictional device: the processes do not have access to it. We take the range 3 of the clock’s ticks to be the set of natural numbers. 2.1. FAILURES AND FAILURE PATTERNS. Processes can fa...	{ "page_id": null, "source": 7320, "title": "from dpo" }
information about the failure pattern F that occurs in an execution. Formally, fiiihue detector $3 is a function that maps each failure pattern F to a set of failure detector histories !3 (F). This is the set of ail failure detector histories that could occur in executions with failure pattern F and failure detector 9....	{ "page_id": null, "source": 7320, "title": "from dpo" }
it can make. We now consider such properties. ACCURACY. Consider the following two accuracy properties: Strong Accuracy. No process is suspected before it crashes. Formally, ‘3 satisfies strong accuracy if Since it is difficult (if not impossible) to achieve strong accuraq in many practical systems, we also define: > 1...	{ "page_id": null, "source": 7320, "title": "from dpo" }
1’). Similarly, we specify eventual weak accuracy as follows: > Eventual Weak Accuracy. There is a time after which some correct process is never suspected by any correct process. Formally, 9 satisfies eventual weak accuracy if VF, VH E 9(F), 3t G 3, 3p E correct(F), Vr’ a t, Vq c correct(F) :p @ H(q, /’). We will refe...	{ "page_id": null, "source": 7320, "title": "from dpo" }
state transition, and (4) may send a message to a single process. 12 Since we model asynchronous systems, messages may experi-ence arbitrary (but finite) delays. Furthermore, there is no bound on relative process speeds. A run of algorithm A using a failure detector QJ is a tuple R = (F, Ha, I, S, T) where F is a failu...	{ "page_id": null, "source": 7320, "title": "from dpo" }
by ~, that is, #(p, t) is the value of VPat time t in run R. We denote by 3P process p’s local failure detector module. Thus, the value of !21P at time t in run R = (F, H%, 1, S, T) is HQ(p, t). 2.6. REDUCIBILITY. We now define what it means for an algorithm TQ -Q, to transform a failure detector Q into another failure...	{ "page_id": null, "source": 7320, "title": "from dpo" }
at process p as follows: whenever A requires that p queries its failure detector module, p reads the current value of outputP (which is concurrently maintained by Ta+q, ) instead. This is illustrated in Figure 2. Intuitively, since TQ +9 is able to use !23 to emulate !3’, 9 must provide at least as much information abo...	{ "page_id": null, "source": 7320, "title": "from dpo" }
D. CHANDRA AND S. TOUEG > Every process p exwutes the following Outputp + 0 > cobegin II Task f: repeat forever {p queries its load jailure detector module S3,] Suspectsp 6 3P > send (p, suspectsP) to all > II Task 2: when receive (g, Suspectsq) for some q Outputp4- (Outputp u suspedsq) - {9} {output, emulates 91} coen...	{ "page_id": null, "source": 7320, "title": "from dpo" }
say that a process crashes we mean that it crashes in F. Similarly, when we say that a process is correct, we mean that it is correct in F. We will show that outpu~ satisfies the following properties: PI (Transforming weak completeness into strong completeness). Let p be any process that crashes. If eventually some cor...	{ "page_id": null, "source": 7320, "title": "from dpo" }
there is a time after which every correct process permanently suspects p in > outputR. •1 > LEMMA 3.2. T%+Q, satisfies P2. PROOF. Let p be any process. Suppose there is a time t before which no process suspects p in Ha. No process sends a message of the type (–, suspects) with p E suspects before time t. Thus, no proce...	{ "page_id": null, "source": 7320, "title": "from dpo" }
send m to all (including p) R-deliver(m) occurs as fo]lows: > when receive m for the first time > if sender(m) #pthen send m to afl R-deliver(m) FIG. 4. Reliable Broadcast by message diffusion. Since Q satisfies weak completeness, by Lemma 3.1, 53’ satisfies strong complete-ness. We now show that ~ and $23’ have the sa...	{ "page_id": null, "source": 7320, "title": "from dpo" }
process R-delivers a message m, then all correct processes eventually R-deliver m. Uniform tnte~”ty. For any message m, every process R-delivers m at most once, and only if m was previously R-broadcast by sender(m). In Figure 4, we give a simple Reliable Broadcast algorithm for asynchronous systems. Informally, when a ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
Consensus using each one of the eight classes of failure detectors defined in Figure 1. By Corollary 3.5, we only need to show how to solve Consensus using each one of the four classes of failure detectors that satisfy strong completeness, namely, 9, Y’,09, and OY. In Section 6.1, we present an algorithm that solves Co...	{ "page_id": null, "source": 7320, "title": "from dpo" }
of the pruposed values} > Phase 1: {astmchnmous rounds r~, 1 forrptltorb-l > send (rP, AP, p) to all > wait until ~q : received (rp, Aq, q) or ~ ~ 9P] {que~ the ~ailum detector} nwgsP(rP] t {(rp, Aq,II)I r-+ed (rp, AQ~ q)} > Apt(L, L,...,l) fork+ lton > if Vp[k] =1and 3(rP, Aq, q) E msgsp[rP] with A~[k] # 1 then > Vp[k...	{ "page_id": null, "source": 7320, "title": "from dpo" }
Let R = (F, H9, 1, S, T) be any run of the algorithm in Figure 5 using 9 G Y in which all correct processes propose a value. We have to show that the termination, uniform validity, agreement and uniform integrity properties of Consensus hold. Note that VP[q] is p‘s current estimate of q‘s proposed value. Furthermore, A...	{ "page_id": null, "source": 7320, "title": "from dpo" }
that complete Phase 2. We say VP s Vq if and only if for all k E ~, V,,[k] is either Vq[k] or 1-. LEMMA 6.1.3. In every round r, 1 s r 5 n – 1, all processes p E 111 receive (r, A{., c) from process c, that is, (r, Ac, c) is in msgsP[r]. PROOF. Since p E 111,p completes all n – 1 rounds of Phase 1. At each round r, sin...	{ "page_id": null, "source": 7320, "title": "from dpo" }
A) at most once, it is easy to see that ijq was relayed by all n – 1 processes in II – {c}, including p, before being received by c. Since p sets VP[q] = Uq before relaying Vq, it follows that VP[q] = II,, at the end of Phase 1. Cl LEMMA6.1.5. For all p E IIz, VC = VP al the end of Phase 2. > PROOF. Consider any p c II...	{ "page_id": null, "source": 7320, "title": "from dpo" }
that for all p E IIz, VP[C] = v= at the end of Phase 2. •l THEOREM 6,1.8. The algorithm in Figure 5 solves Consensus using Y’ in asyn-chronous systems. PROOF. From the algorithm in Figure 5, it is clear that no process decides more than once, and this satisfies the uniform integrity requirement of Consen-sus. By Lemma ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
correct, or whether some correct process will never be suspected after time f.) Let ~ denote the maximum number of processes that may crash.ls Consider asynchronous systems with ~ *5 In the literature, t is often used instead of ~, the notation adopted here. In this paper, we reserve t to denote real-time. 16See for e...	{ "page_id": null, "source": 7320, "title": "from dpo" }
select one estimateq such that (q, rp, estimateq, t) E msgap[rp] send (p, rp, estimatep) to atl Phase S: {AH proasses wait for the new estimate proposed by the current coordinator} wait until [received (CP,rp, estimatecP ) from q or CP E 9P]{ Quety the jaihm detector} if [received (CP,rp, estimateCP ) from CP]then {p r...	{ "page_id": null, "source": 7320, "title": "from dpo" }
~ G 09’ in which all correct processes propose a value. We have to show that the termina-tion, uniform validity, agreement and uniform integrity properties of Consensus hold. > LEMMA 6.2.1 (UNIFORM AGREEMENT). No two processes decide diflerent~. > PROOF. If no process ever decides, the lemma is trivially true. If any p...	{ "page_id": null, "source": 7320, "title": "from dpo" }
that (1) p sent a (p, r, ack) message to c in Phase 3 of round r, and (2) (p, k, estimateP, tsP) is in msgsc,[k] in Phase 2 of round k. > ~T ManY con~en~us algorithms in the literature have the property that a value gets locked before processes decide, see, for example, Reischuk and Dwork et al. . Unreliable Failure D...	{ "page_id": null, "source": 7320, "title": "from dpo" }
R-broadcast (q, r~, estimate~, decide) in Phase 4 of round r~. From Figure 6, q must have received r (n + 1)/27 messages of the type (–, rq, ack) in Phase 4 of round rq. By the definition of r, r s rq. From the above claim, estimace~ = estimateC. •! LEMMA 6.2.2 (TERMINATION). Eve~ correct process eventually decides som...	{ "page_id": null, "source": 7320, "title": "from dpo" }
a message of the type / \–, r, ack or (–, r, nack) to c in Phase 3. Since there are at least > (n + 1)/2 correct processes, c cannot block at the wait statement of Phase 4. This shows that all correct processes complete round r—a contradiction that completes the proof of our claim. 246 T. D. CHANDRAAND S. TOUEG Since $...	{ "page_id": null, "source": 7320, "title": "from dpo" }
THEOREM 6.2.3. The algorithm in Figure 6 solves Consensus using 09’ in asynchronous tystems with f THEOREM 6.2.5 [CHANDRAET AL. 1992]. If a faihzre detector 9 can be used to solve Consensus in an asynchronous ~stem, then 9 2 OWO	{ "page_id": null, "source": 7320, "title": "from dpo" }
in that system. By Corollary 6.2.4 and Theorem 6.2.5 we have: COROLLARY6.2.6. OWO is the weakest failure detector for solving Consensus in asynchronous ~stems with f < [n/21. 6.3. A LOWERBOUNDON FAULT-TOLERANCE. In Section 6.1, we showed that failure detectors with pepetual accuracy (i.e., in 9, S2,Y, or W) can be used...	{ "page_id": null, "source": 7320, "title": "from dpo" }
processes. Consider the following two runs of A using $3: > Run RO =(Fo, HO, l., So, TO). All processes propose O. All processes in 110 are correct in FO, while those in 111 crash in FO at the beginning of the run, that is, Vt G 9: FO(t) = 111 (this is possible since f > Tn/2~). Every process in II. permanently suspect...	{ "page_id": null, "source": 7320, "title": "from dpo" }
process in II. suspects every process in ill, and every process in 111 suspects every process in IIo. After time max(ro, t ~), no process suspects any other process. More precisely: > Vt S max(rO, t,): > Vp ErIo:HA(p, t) =rI~ Vp G rI,:z-l~(p, t) =1-1o Vf > max(tO, tl), Vp G II: H~(p, t) = 0. Note that HA E $?b(FA ) as ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
equivalent in asyn-chronous systems with crash failures. This is shown by reducing each to the other.19 In other words, a solution for one automatically yields a solution for the other. Both reductions apply to any asynchronous system (in particular, they do not require the assumption of a failure detector). This equiv...	{ "page_id": null, "source": 7320, "title": "from dpo" }
reduced to Atomic Broadcast as follows [Dolev et al. 1987], To propose a value, a process atomically broadcasts it. To decide a value, a process picks the value of the first message that it atomically delivers.20 By total order of Atomic Broadcast, all correct processes deliver the same first message. Hence, they choos...	{ "page_id": null, "source": 7320, "title": "from dpo" }
Figure 7 consists of three tasks, > Task 1, Task 2, and Task 3, such that: (1) any task that is enabled is eventually executed, and (2) Task i can execute concurrently with Task j’ provided i # j. When a process wishes to A-broadcast a message M, it R-broadcasts m (Task 1). When a process p R-delivers m, it adds m to t...	{ "page_id": null, "source": 7320, "title": "from dpo" }
- ). k then q eventually A -delivers messages in (2) If p A-delivers messages in A _deliverP, A _deliver$ and A _deliver~ = A _deliver~. PROOF. The proof is by simultaneous induction on (1) and (2). Fork = 1, we first show that if p executes propose(l, –), then q eventually executes > propose(l, –). When p executes pro...	{ "page_id": null, "source": 7320, "title": "from dpo" }
not in U~j*l A _deliver~. Since m is in R_deliveredP, by Lemma 7.1.1, m is eventually in R_deliveredq. Thus, there is a time after q A-delivers A _deliver&- ] such that there is a mes-sage in R _delivered~ – A _deliveredq. So q eventually executes Task 3 and > propose(l, –). We now show that if p A-delivers messages in...	{ "page_id": null, "source": 7320, "title": "from dpo" }
processes never A-deliver m, they never insert m in A _delivered. Thus, for every correct process > q, there is a time after which m is permanently in R_deliveredq-A _deiivered~. From Figure 7 and Lemma 7.1.2, there is a kl, such that for all 1> kl, all correct processes execute propose(l, –), and they do so with sets ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
Broadcast algorithm. PROOF. Immediate from Lemmata 7.1.3, 7.1.4, and 7.1.5. •! Since Reliable Broadcast can be implemented in asynchronous systems with crash failures (Section 4), the above theorem shows that Atomic Broadcast is reducible to Consensus in such systems. As we showed earlier, the converse is also true. Th...	{ "page_id": null, "source": 7320, "title": "from dpo" }
and span the four different types of accuracy) are really distinct or whether some pairs are actually equivalent. More generally, how are Q1’,9’, OQ, and 09’ related under the 5 relation? This section answers these questions.22 Clearly, Q > Y’, 0!2? ? 09’, 9’ 5 09, Y’ z 09’, and 9 > 09’. Are these relations “strict”? F...	{ "page_id": null, "source": 7320, "title": "from dpo" }
With TRB there is a distinguished process, the senders, that is supposed to broadcast a single message from a set 4 of possible messages. TRB is similar to Reliable Broadcast, except that it requires that every correct process always deliver a message—even if the sender s is faulty and, say, crashes before broadcasting...	{ "page_id": null, "source": 7320, "title": "from dpo" }
the strongest class of failure detectors that we defined in this paper. Specifically: THEOREM 8.2 (1) (2) TRB can be solved using 9 in asynchronous ~stems with any number of crashes. TR3 cannot be solved using either 9, 09, or 09 in asynchronous systems. This impossibility result holds even under the assumption that at...	{ "page_id": null, "source": 7320, "title": "from dpo" }
message arrives at its destination a fixed and known amount of time after it is sent. In such a system we can use timeouts to implement a “perfect” failure detector—that is, one in which no process is ever wrongly suspected, and every faulty process is eventually sus-pected. Thus, the ability to solve Consensus in a gi...	{ "page_id": null, "source": 7320, "title": "from dpo" }
g C f’f if q $! Outputp and p did not receive “q-is-aJive” during the last AP(9) ticks of p’s clock > Outputp t Outputp u {q} {p times-out on q: it now suspects q has cmshd} > II Tad 3: when receive “q-is-alive” for some q > if q E Outputp {p knows that it prematurel~ timed-out on q} ou~Pu~p - ou~Pu~p - {q} {1. p repen...	{ "page_id": null, "source": 7320, "title": "from dpo" }
, works as follows (see Figure 10). To measure elapsed time, each process p maintains a local clock, say by counting the number of steps that it takes. Each process p periodically sends a “p-is-alive” message to all the processes. If p does not receive a “q-is-alive” message from some process q for AP(q) time units on ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
show that eventual strong accuracy is satisfied. That is, for any correct processes p and q, there is a time after which p will not suspect q. There are two possible cases: (1) Process p times-out on q finitely often (in Task 2). Since q is correct and keeps sending “q-is-alive” messages forever, eventually p receives ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
message losses invalidate the Consensus algorithm in Figure 6. It is easy to modify this algorithm, however, so that it does work in -MS: One can adopt the techniques used in Dwork et al. to mask the loss of messages that are sent before GST. Failure detectors can be viewed as a more abstract and modular way of incorp...	{ "page_id": null, "source": 7320, "title": "from dpo" }
al. , which identified a set of minimal models of partial synchrony in which Consensus is solvable, Chandra et al. exhibit a single minimum failure detector, OWO, that can be used to solve Consensus. The technical device that makes this possible is the notion of reduction between failure detectors. > 9.2. UNRELIABLE F...	{ "page_id": null, "source": 7320, "title": "from dpo" }
detector may be incorrect: they only take this information as an imperfect “hint” about which processes have really crashed. Furthermore, processes are never “discriminated against” if they are falsely suspected to have crashed. > 26me proof in ~ui and Abrs.Arnara is similar to the proof that COnSenW5 Is impossiblein ...	{ "page_id": null, "source": 7320, "title": "from dpo" }
to crash. If the failure detector stops malfunctioning, outstanding messages are eventually delivered. Thus, we can set time-out periods more aggressively than asystem like Isis: in practice, we would set our failure detector time-out periods closer to the average case, while systems like Isis must set time-outs closer...	{ "page_id": null, "source": 7320, "title": "from dpo" }
in Section 6.3. This infinite hierarchy consists of a > m For ~xamplc, the timeout period in the current version of 1S1S is greater than lo seconds 260 T. D. CIMNDRA AND S, TOUEG continuum of repentant failure detectors ordered by the maximum number of mistakes that each one can make. Al, Mistakes and Repentance We now...	{ "page_id": null, "source": 7320, "title": "from dpo" }
mistaken. Qll makes a finite number of mistakes. Formally, !3 is strongly finitely mistaken ifi VR using 9: M(R) is finite. In this case, it is clear that there is a time t after which $3 stops making mistakes (it may, however, continue to give incorrect information). > Weakly finitely mistaken. There is a correct proc...	{ "page_id": null, "source": 7320, "title": "from dpo" }
to require that, given such irrefutable evidence of a mistake, the failure detector module at p takes the corrective action of removing q from 9P. In general, we can require the following property: > Repentance, If a correct process p eventually knows that q @ F(t), then at some time after t, q @ QbP. Formally, 9 is re...	{ "page_id": null, "source": 7320, "title": "from dpo" }
make. As we just noted, such failure detectors cannot be specified solely in terms of the failure pattern actually encountered, and thus they do not fit the formal definition of failure detectors given in Section 2.2. A2. A Hierarchy of Repentant Failure Detectors Consider the failure detectors that satisfy weak comple...	{ "page_id": null, "source": 7320, "title": "from dpo" }
detector in W9 into one in OW. Other conversions are similar or straightforward and are therefore omitted. Note that V and OW are the strongest and weakest failure detector classes in this hierarchy, respectively. From Corol-laries 6.1.9 and 7.1.8, and Observation A2.1, we have: > COROLLARY A2.2. Consensus and Atomic B...	{ "page_id": null, "source": 7320, "title": "from dpo" }
can be solved with OW, the weakest failure detector class in the hierarchy. Thus: > Observation A3. 1. In asynchronous systems with f rn/21, if m > n – f then Consensus cannot be solved using Y%(m). PROOF (SKETCH). Consider an asynchronous system with f a [n/21 and assume m > n – f. We show that there is a failure det...	{ "page_id": null, "source": 7320, "title": "from dpo" }
runs of A using $2: Run RO = (FO, Ho, l., SO, TO). All processes propose O. All processes in 110 are correct in FO, while all the f processes in HI U llcr.$h=~ crash in 264 T. D. CHANDRA AND S. TOUEG > FO at the beginning of the run, that is, Vt G 9: FO(t ) = II ~ U llcr.~h=d. Process > qO G 110 permanently suspects ev...	{ "page_id": null, "source": 7320, "title": "from dpo" }
of Consensus. In R~ all processes in II. propose O and all processes in 111 U IIC,a$hed propose 1. All processes in Ilc,a,A.d crash in F~ at the beginning of the run. All messages from processes in lTOto those in 111 and vice-versa, are delayed until time to + tl. Until time to, (i) 9 behaves as in Ro, and (ii) all the...	{ "page_id": null, "source": 7320, "title": "from dpo" }
(they cannot perceive this real-time shift of ro). Thus, at time to + t~ in run RA, q ~ decides 1 (as it did at time t~ in RI). Since go previously decided O, R~ violates the agreement property of Consensus. (4) From time to + t~ onwards, no more processes crash and every correct process suspects exactly all the proces...	{ "page_id": null, "source": 7320, "title": "from dpo" }
We now turn our attention to solving Consensus using W ~(m ). THEOREM A3.5. In asynchronous ~stems with f ? rn/21, Consensus cannot be solved using W%(m) with m > 0. PROOF. In Theorem A3,2, we described a failure detector ~ that cannot be used to solve Consensus in asynchronous systems with f = rn / 21. It is easy to v...	{ "page_id": null, "source": 7320, "title": "from dpo" }
ACM Symposium on Principles of Distributed Compuring (Montreal, Que.. Canada, Aug. 17-19). ACM, New York, pp. 27-30. 266 T. D. CHANDRA AND S. TOUEG > BERMAN, P.,GARAY, J. A., AND PERRY, K. J. 1989. Towards optimal distributed consensus. In > Proceedings of the 30th Symposium on Foundations of Computer Science (Oct.). I...	{ "page_id": null, "source": 7320, "title": "from dpo" }
Impossibility of group membership in asynchronous systems. Tech. Rep. 95-1533. Computer Science Department, Cornell University, Ithaca, New York. CHANDRA, T. D., ANDLARREA,M. 1994. E-mail correspondence. Showed that OW cannot be used to solve non-blocking atomic commit. > CHANDRA, T. D., AND TOUEG, S. 1990. Time and me...	{ "page_id": null, "source": 7320, "title": "from dpo" }
in unreliable distributed systems (a brief survey). Tech. Rep. 273 (June), Department of Computer WIence, Yale University, New Haven, Corm. FISCHER,M. J., LYNCH,N. A., ANDPATERSON,M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (Apr.), 374–382, Unreliable Failure Detectors for R...	{ "page_id": null, "source": 7320, "title": "from dpo" }
Compur. Res. 4, 163–1 83. > MOSES, Y., DOLEV, D., AND HALPERN, J. Y. 1986. Cheating husbands and other stories: a case study of knowledge, action, and communication. Dishib. Compur. 1, 3, 167-176, > MULLENDER.S. J., ED. 1987. The Amoeba Distributed Operating System. Seiected papers 1984-1987. Centre for Mathematics and...	{ "page_id": null, "source": 7320, "title": "from dpo" }
WENSLEY, J. H., LAMPORT, L., GOLDBERG,J., GREEN, M. W., LEVITT, K. N., MELLIAR-SMITH, P., SHOSTAK, R. E., AND WEINSTOCK, C. B. 1978. SIFT Design and analysis of a fault-tolerant computer for aircraft control. Proc. IEEE 66, 10 (Oct.), 1240–1255.	{ "page_id": null, "source": 7320, "title": "from dpo" }
Title: Investigating the General Feasibility of High-Occupancy/Toll Lanes in Texas URL Source: Markdown Content: > Technical Report Documentation Page > 1. Report No. TX-00/4915-1 2. Government Accession No. 3. Recipient's Catalog No. 4. Title and Subtitle INVESTIGATING THE GENERAL FEASIBILITY OF HIGH-OCCUPANCY/TOLL L...	{ "page_id": null, "source": 7320, "title": "from dpo" }
Service 5285 Port Royal Road Springfield, Virginia 22161 19. Security Classif.(of this report) Unclassified 20. Security Classif.(of this page) Unclassified 21. No. of Pages 102 22. Price Form DOT F 1700.7 (8-72) Reproduction of completed page authorized INVESTIGATING THE GENERAL FEASIBILITY OF HIGH-OCCUPANCY/TOLL LANE...	{ "page_id": null, "source": 7320, "title": "from dpo" }
x List of Tables..................................................................................................................................xi Introduction ..................................................................................................................................... 1 Facility Types...........	{ "page_id": null, "source": 7320, "title": "from dpo" }

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.