This paper presents two-phase ordering (2PO), a new asynchronous transaction coordination algorithm that does not rely on a central coordinator. Each client constructs a view of the global execution graph and deterministically schedules its own transactions globally. We formally prove the correctness of 2PO and that the resulting schedules are conflict-serializable (CSR). In our measurements, 2PO exhibits high commit rates (above 97 % under high contention) while scaling linearly with the number of nodes.
