Abstract: Many different schemes have been developed and used in distributed database systems to coordinate the execution of subtransactions of a global transaction. On this paper I present an algorithm for the distributed two-phase commit protocol to give a chance to some transactions to complete when they are ready to abort. First I count the number of transactions who have decided to abort. If this count is less than 35 percent of the total participants, then for only these transactions I suggest to prepare again for a completion. In this way, we can ensure that a 30 percent of transactions who had decided to abort, can complete their execution.
Keywords: two-phase commit protocol, transactions, transaction files, distributed database.
Title: AN ALGORITHM FOR THE DISTRIBUTED TWO-PHASE COMMIT PROTOCOL
Author: Christos Papanastasiou
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
