The article discusses how distributed database systems handle committing transactions. It explores the challenge of ensuring all processes agree on whether to commit or abort a transaction. The study focuses on non-blocking atomic commit protocols, which allow correct processes to reach a decision even in the presence of failures. The main goal is to understand how fast a distributed transaction can commit, considering factors like agreement, validity, and termination properties.