next up previous
Next: Failure Detectors Up: Figures in the book Previous: Consensus Under Asynchrony

Consensus Under Synchrony

Figure: Algorithm at $P_i$ for consensus under crash failures
\fbox{\begin{minipage}{\textwidth}\sf
\begin{tabbing}
x\=xxxx\=xxxx\=xxxx\=xxxx\...
...$ \\
\> {\bf endfor}; \\
\\
\> $y:=min(V)$; \\
\end{tabbing}\end{minipage}}

Figure: Early stopping algorithm for crash failures
\fbox{\begin{minipage}{\textwidth}\sf
\begin{tabbing}
x\=xxxx\=xxxx\=xxxx\=xxxx\...
... decided'' to all\\
\> $y:=min(V)$;\\
\> halt;\\
\end{tabbing}\end{minipage}}

Figure: An algorithm for Byzantine General Agreement at $P_i$
\fbox{\begin{minipage}{\textwidth}\sf
\begin{tabbing}
x\=xxxx\=xxxx\=xxxx\=xxxx\...
...;\\
\\
\> {\bf endfor};\\
\\
\> $y := V[i]$;\\
\end{tabbing}\end{minipage}}



Vijay K. Garg 2005-02-08