An Optimization to the Two-Phase Commitment Protocol
Dan Duchamp · 1989
The basic two-phase distributed commitment protocol as described in [3, pp. 381-382] can be optimized so that a subordinate update site drops its locks more promptly and makes one fewer log force per transaction. The optimization applies as well to the variations of two-phase commitment (i.e., hierarchical, presumed commit. and presumed abort) described in the same paper.