Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A Message-Based Approach to Discrete-Event Simulation
IEEE Transactions on Software Engineering
An integrated approach to the design and performance evaluation of distributed systems
ISCI '90 Proceedings of the first international conference on systems integration on Systems integration '90
Practical uses of synchronized clocks in distributed systems
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Lazy release consistency for software distributed shared memory
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
ACM Transactions on Database Systems (TODS)
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Replication and consistency: being lazy helps sometimes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Concurrency control in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Deferred Updates and Data Placement in Distributed Databases
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The GlobData Fault-Tolerant Replicated Distributed Object Database
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Exploiting Atomic Broadcast in Replicated Databases (Extended Abstract)
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Database Replication: If You Must be Lazy, be Consistent
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Database Replication Techniques: A Three Parameter Classification
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Enhancing the Availability of Networked Database Services by Replication and Consistency Maintenance
DEXA '03 Proceedings of the 14th International Workshop on Database and Expert Systems Applications
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Shared memory applications are principal to solve a big number of problems in distributed systems. From high performance applications, where the different computational units use this technique to simplify its designs (and often improve the performance) to database applications, where a replicated database can also be considered as a flavor of shared memory for the different involved nodes. Any of these applications use replication as the basis for the implementation of shared memory, and they frequently share common characteristics in respect to access locality to particular portions of the global state. Replication is also a technique commonly used in distributed systems in order to provide fault tolerance. Many techniques have been designed to perform the necessary consistency management for the different views on a replicated memory system. Some of these techniques try to take advantadge of the access locality, by propagating the changes performed by any node in a lazy style (i.e. as late as possible). Nevertheless, lazy update protocols have proven to have an undesirable behavior due to their high abortion rate in scenarios with high degree of access conflicts. In this paper, we present the problem of the abortion rate in such protocols from a statistical point of view, in order to provide an expression capable to predict the probability for an object to be out of date during the execution of a transaction in a contextual environment. It is also suggested a pseudo-optimistic technique that makes use of this expression to reduce the abortion rate caused by accesses to out of date objects. The proposal is validated by means of an empirical study of the behavior of the expression, including measurements of a real implementation. Finally, we discuss the application of these results to improve lazy update protocols, providing a technique to determine the theoretical boundaries of the improvement.