Summary: Algorithm 5 Reflector for linear lattice agreement.
Procedure reflector(view V, entrance i)
1. write(R i , V);
2. if (R 1\Gammai = ;) then exit := down i
4. V := V S
5. exit := up i
6. return(hV; exiti);
Although this algorithm is neither fast no adaptive,
we present it here because it is a simple modification
of Algorithm 2; this shows an interesting connection
between renaming and lattice agreement.
The algorithm uses the same network of reflectors
as Algorithm 2 (shown in Figure 4). In the modi
fied algorithm, reflectors have an additional function:
They not only direct the processes' movements, but
also help them to collect views. It is guaranteed that
the views of processes leaving the network satisfy the
properties of lattice agreement.