A survey of distributed deadlock detection algorithms
ACM SIGMOD Record
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Modeling long-running activities as nested sagas
Data Engineering
Database transaction models for advanced applications
On timeout for global deadlock detection in decentralized database systems
Information Processing Letters
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Long-Lived Transaction Processing Systems with Rollbacks and Aborts
IEEE Transactions on Knowledge and Data Engineering
Coordinating Business Transactions on the Web
IEEE Internet Computing
Concurrency control issues in grid databases
Future Generation Computer Systems - Special section: Data mining in grid computing environments
The transaction concept: virtues and limitations (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
An environment for flexible advanced compensations of Web service transactions
ACM Transactions on the Web (TWEB)
Cost based web services transaction management
International Journal of Web and Grid Services
High Performance Parallel Database Processing and Grid Databases
High Performance Parallel Database Processing and Grid Databases
International Journal of Web and Grid Services
A protocol for reliably, flexibly, and efficiently making agreement among peers
International Journal of Web and Grid Services
Real-time transaction processing for autonomic Grid applications
Engineering Applications of Artificial Intelligence
A framework to coordinate web services in composition scenarios
International Journal of Web and Grid Services
Using temporal policies for managing changing meta-data of Web Services
International Journal of Web and Grid Services
Hi-index | 0.00 |
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.