Distributed algorithm

Atomic commit

• two-phase commit protocol

  Coordinator Cohort
  QUERY TO COMMIT
  ——————————–>
  VOTE YES/NO prepare*/abort*
  <——————————-
  commit*/abort* COMMIT/ROLLBACK
  ——————————–>
  ACKNOWLEDGMENT commit*/abort*
  <——————————–
  end
  An * next to the record type means that the record is forced to stable storage.

• three-phase commit protocol.
  
  看的不是很懂。。。

Consensus
paxos algorithm.
视频资源
Distributed search
Leader election
Leader election is the process of designating a single process as the organizer of some task distributed among several computers (nodes). Before the task is begun, all network nodes are unaware which node will serve as the “leader,” or coordinator, of the task. After a leader election algorithm has been run, however, each node throughout the network recognizes a particular, unique node as the task leader.
Mutual exclusion
Non-blocking data structures
Reliable Broadcast
Reliable broadcast is a communication primitive in distributed systems. A reliable broadcast is defined by the following properties:
Validity - if a correct process sends a message, then some correct process will eventually deliver that message
Agreement - if a correct process delivers a message, then all correct processes eventually deliver that message
Integrity - every correct process delivers the same message at most once and only if that message has been sent by a process
A reliable broadcast can have sequential, causal or total ordering.
Replication
Resource allocation
Spanning tree generation
Symmetry breaking, e.g. vertex coloring