next up previous
Next: Logical Clocks Up: Figures in the book Previous: Introduction

Model of a Computation

Figure: Notation
\begin{figure}\begin{center}
\begin{tabular}{\vert l \vert l\vert}
\hline
$N$ &...
... on which event $e$ is executed\\
\hline
\end{tabular}\end{center}\end{figure}

Figure: An example of topology of a distributed system
\begin{figure}\centerline{\epsfbox{figs/first-1.1.eps}}\end{figure}

Figure: A simple distributed program with two processes
\begin{figure}\centerline{\epsfbox{figs/first-1.2.eps}}\end{figure}

Figure: An example of a global state and a transition
\begin{figure}\centerline{\epsfbox{figs/first-2.1.eps}}\end{figure}

Figure: A run in the event-based happened before model
\begin{figure}\centerline{\epsfbox{figs/first-3.2.eps}}\end{figure}
Figure: A run in the event-based potential causality model
\begin{figure}\centerline{\epsfbox{figs/pot-causality.eps}}\end{figure}

Figure: A run in the event-based model
\begin{figure}\centerline{\epsfbox{figs/first-3.1.eps}}\end{figure}

Figure: A run in the state-based model
\begin{figure}\centerline{\epsfbox{figs/2run.eps}}\end{figure}

Figure: Posets on states with no valid event based posets
\begin{figure}\centerline{\epsfbox{figs/noninterleaving.eps}}\end{figure}


next up previous
Next: Logical Clocks Up: Figures in the book Previous: Introduction
Vijay K. Garg 2005-02-08