different node as coordinator): By choosing an optimal coordinator D2PC commits both the coordinator and each participant in minimum possible time, allowing the earliest possible release of locked resources in each transaction participant (tree node). See also Three-phase commit protocol Paxos algorithm Raft algorithm Two Generals' Problem References Data management Transaction processing