The serializability of concurrent database updates
Journal of the ACM (JACM)
Guardians and Actions: Linguistic Support for Robust, Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Recovery semantics for a DB/DC system
ACM '73 Proceedings of the ACM annual conference
Specification and implementation of resilient, atomic data types
Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems
Programming with abstract data types
Proceedings of the ACM SIGPLAN symposium on Very high level languages
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
Locking protocols: general lock classes and deadlock freedom
Locking protocols: general lock classes and deadlock freedom
Synchronizing shared abstract types
ACM Transactions on Computer Systems (TOCS)
Implementation of resilient, atomic data types
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Optimistic concurrency control for abstract data types
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Optimistic concurrency control for abstract data types
ACM SIGOPS Operating Systems Review
Predicting performance of concurrency control designs
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A weighted voting algorithm for replicated directories
Journal of the ACM (JACM)
Extending Multiversion Time-Stamping Protocols to Exploit Type Information
IEEE Transactions on Computers
Concurrent search structure algorithms
ACM Transactions on Database Systems (TODS)
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrency and availability as dual properties of replicated atomic data
Journal of the ACM (JACM)
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
Distributed version management for read-only actions (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Concurrency control mechanisms and the serializability of concurrent tree algorithms
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Efficient Execution of Read-Only Transactions in Replicated Multiversion Databases
IEEE Transactions on Knowledge and Data Engineering
Asynchronous Backup and Initialization of a Database Server for Replicated Database Systems
The Journal of Supercomputing
Transactional boosting: a methodology for highly-concurrent transactional objects
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Two phase locking-based algorithm with partial abort for firm deadline real-time database systems
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
| Hi-index | 0.00 |
Maintaining the consistency of long-lived, on-line data is a difficult task, particularly in a distributed system. A variety of researchers have suggested atomicity as a fundamental organizational concept for such systems. In this paper we present a formal treatment of atomicity. Our treatment is novel in three respects: First, we treat serializability and recoverability together, facilitating the precise analysis of online implementations. Second, we explore how to analyze user specified semantic information to achieve greater concurrency. Third, we focus on local properties of components of a system, thus supporting modular design. We present three local properties, verify that they ensure atomicity, and show that they are optimal. Previously published protocols are suboptimal. We show that these differences are the result of fundamental limitations in the model used to analyze those protocols; these limitations are not shared by our model.