Implement Distributed system algorithms
Leader Election (id)
In: Processor's id
Out: LEADER if processor has largest id
NOT_LEADER if otherwise
mssg <-
status <- NOT_KNOWN
loop {
if mssg != null then send mssg to right neighbour
if msg = then return status
mssg <- null
// wait for messages
if message m received then {
if m = then {
case {
i > id : status <- NOT_LEADER
mssg <- m
id > i : mssg <- null
i = id : status <- LEADER
mssg <-
}
}
else if m = then mssg <- m
}
}