VLSI Implementation of a Distributed Algorithm for Fault-Tolerant Clock Generation

Algorithm 3

Byzantine-tolerant tick generation suitable for bounded tick numbers.

1: variables

2: 𝑘: integer  :=0

3: end variables

4: initially send TICK(0) to all [once]

5: if received TICK(ℓ) from at least 𝑓+1 rem. processes with ℓ≥𝑘 then //Relay Rule

6: send TICK(𝑘),…,  TICK(ℓ) to all [once]

  𝐾∶=ℓ

7: end  if

8: if received TICK(𝑘) from at least 2𝑓+1 remote processes then //Increment Rule

9: send TICK(𝑘+1) to all [once]

  𝐾∶=𝑘+1

10: end  if