▁applied . ▁Alg orithms ▁for ▁solving ▁the ▁atomic ▁commit ▁protocol ▁include ▁the ▁two - phase ▁commit ▁protocol ▁and ▁the ▁three - phase ▁commit ▁protocol . ▁▁ ▁Cons ensus ▁Cons ensus ▁algorithms ▁try ▁to ▁solve ▁the ▁problem ▁of ▁a ▁number ▁of ▁processes ▁agree ing ▁on ▁a ▁common ▁decision . ▁More ▁precisely , ▁a ▁Cons ensus ▁protocol ▁must ▁satisfy ▁the ▁four ▁formal ▁properties ▁below . ▁▁ ▁Term ination : ▁every ▁correct ▁process ▁dec ides ▁some ▁value . ▁ ▁Valid ity : ▁if ▁all ▁processes ▁propose ▁the ▁same ▁value ▁, ▁then ▁every ▁correct ▁process ▁dec ides ▁. ▁ ▁Integr ity : ▁every ▁correct ▁process ▁dec ides ▁at ▁most ▁one ▁value , ▁and ▁if ▁it ▁dec ides ▁some ▁value ▁, ▁then ▁ ▁must ▁have ▁been ▁proposed ▁by ▁some ▁process . ▁ ▁Ag re ement : ▁if ▁a ▁correct ▁process ▁dec ides ▁, ▁then ▁every ▁correct ▁process ▁dec ides ▁. ▁ ▁A ▁typical ▁algorithm ▁for ▁solving ▁cons ensus ▁is ▁the ▁p ax os ▁algorithm . ▁▁ ▁Dist ributed ▁search ▁▁ ▁Le ader ▁election ▁ ▁Le ader ▁election ▁is ▁the ▁process ▁of ▁design ating ▁a ▁single ▁process ▁as ▁the ▁organ izer ▁of ▁some ▁task ▁distributed ▁among ▁several ▁computers ▁( nodes ). ▁Before ▁the ▁task ▁is ▁begun , ▁all ▁network ▁nodes ▁are ▁una ware ▁which ▁node ▁will ▁serve ▁as ▁the ▁" le ader ," ▁or ▁coordin ator , ▁of ▁the ▁task . ▁After ▁a ▁leader ▁election ▁algorithm ▁has ▁been ▁run , ▁however , ▁each ▁node ▁throughout ▁the ▁network ▁recogn izes ▁a ▁particular , ▁unique ▁node ▁as ▁the ▁task ▁leader .