Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Implementing recoverable requests using queues
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Clusters for high availability: a primer of HP-UX solutions
Clusters for high availability: a primer of HP-UX solutions
Efficient transparent application recovery in client-server information systems
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Replication management using the state-machine approach
Distributed systems (2nd Ed.)
Distributed systems (2nd Ed.)
Reliable messages and connection establishment
Distributed systems (2nd Ed.)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Reducing the Blocking in Two-Phase Commit Protocol Employing Backup Sites
COOPIS '98 Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems
Supporting nondeterministic execution in fault-tolerant systems
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
CORBA Fault-Tolerance: Why It Does Not Add Up
FTDCS '99 Proceedings of the 7th IEEE Workshop on Future Trends of Distributed Computing Systems
A Pragmatic Implementation of e-Transactions
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
A simple and fast asynchronous consensus protocol based on a weak failure detector
Distributed Computing
e-Transactions: End-to-End Reliability for Three-Tier Architectures
IEEE Transactions on Software Engineering
Reconciling Replication and Transactions for the End-to-End Reliability of CORBA Applications
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
Three-tier replication for FT-CORBA infrastructures
Software—Practice & Experience
Unification of Transactions and Replication in Three-Tier Architectures Based on CORBA
IEEE Transactions on Dependable and Secure Computing
Proceedings of the 2005 ACM symposium on Applied computing
IEEE Transactions on Knowledge and Data Engineering
Fully Distributed Three-Tier Active Software Replication
IEEE Transactions on Parallel and Distributed Systems
Ensuring e-Transaction with Asynchronous and Uncoordinated Application Server Replicas
IEEE Transactions on Parallel and Distributed Systems
Optimistic transactional active replication
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Consistent and scalable cache replication for multi-tier J2EE applications
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Consistent and scalable cache replication for multi-tier J2EE applications
MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
Replication-aware transactions: how to roll a transaction over failures
Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
Ensuring e-transaction through a lightweight protocol for centralized back-end database
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
SCORe: a scalable one-copy serializable partial replication protocol
Proceedings of the 13th International Middleware Conference
A survey on reliability in distributed systems
Journal of Computer and System Sciences
Hi-index | 0.00 |
This paper describes a distributed algorithm that implements the abstraction of e-Transaction: a transaction that executes exactly-once despite failures. Our algorithm is based on an asynchronous replication scheme that generalizes well-known active-replication and primary-backup schemes. We devised the algorithm with a three-tier architecture in mind: the end-user interacts with front-end clients (e.g., browsers) that invoke middle-tier application servers (e.g., web servers) to access back-end databases. The algorithm preserves the three-tier nature of the architecture and introduces a very acceptable overhead with respect to unreliable solutions.