Abstract
In web service environments, long transactions need to lock resources - often database services - for a long time during their long execution duration. This would bring down the performance of transaction processing systems. The transaction compensation is a feasible solution through allowing sub-transactions to independently commit, however, it is not able to speed up the transaction processing. This paper proposes a novel pipeline-based transaction processing (PLbTP) model for Serial Long Transactions (SLTs), which parallelises the transaction processing to reduce the transaction execution duration. Furthermore, we design a time-stamp-based deadlock prevention mechanism for the control of multiple concurrent transactions. The simulation results demonstrate that our approach can significantly improve performance of SLTs without the aid of compensating transactions.
Original language | English |
---|---|
Pages (from-to) | 190-207 |
Number of pages | 18 |
Journal | International Journal of Web and Grid Services |
Volume | 7 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 May 2011 |
Externally published | Yes |
Keywords
- Compensating transaction
- Concurrency control
- Long transaction
- Pipeline
ASJC Scopus subject areas
- Software
- Computer Networks and Communications