topic 1 :
Atomic processes
Mutual exclusion
distributed consensus
distributed shared memory fakete
automata based model systems to model distributed systems
atomic memory for static networks
rambo algorithm
rambo algorithm 4 steps
implementing reconfiguration in rambo
implementing consensus dls paxos
impossibility results
cremers hibbard 76 proof (impossibility of mutual exclusion)
burns lynch 93 theorem (mututal exlcusion for n shared processes require 2n shared vairables)
consensus impossibility results
distributed consensus
lower bound in synchronous systems
lower bound proof f =1
flp impossibility proof