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
The Escrow transactional method
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A theoretical foundation of multi-level concurrency control
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A theory of reliability in database systems
Journal of the ACM (JACM)
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Locking Primitives in a Database System
Journal of the ACM (JACM)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
The Recovery Manager of the System R Database Manager
ACM Computing Surveys (CSUR)
Guardians and Actions: Linguistic Support for Robust, Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Architectural Issues of Transaction Management in Multi-Layered Systems
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Distributed Systems - Architecture and Implementation, An Advanced Course
A concurrency control theory for nested transactions (Preliminary Report)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING
NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
SPECIFICATION AND IMPLEMENTATION OF ATOMIC DATA TYPES
INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS
INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS
Abstraction in Concurrency Control and Recovery Management
Abstraction in Concurrency Control and Recovery Management
Remote procedure call
An architecture for reliable decentralized systems
An architecture for reliable decentralized systems
Transactions on typed objects
Local atomicity properties: modular concurrency control for abstract data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
The impact of recovery on concurrency control
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACTA: a framework for specifying and reasoning about transaction structure and behavior
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
Bounded ignorance in replicated systems
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extracting concurrency from objects: a methodology
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
COCS '91 Proceedings of the conference on Organizational computing systems
Semantics-based concurrency control: beyond commutativity
ACM Transactions on Database Systems (TODS)
On correctness of non-serializable executions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Strict histories in object-based database systems
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards a unified theory of concurrency control and recovery
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Consistency and orderability: semantics-based correctness criteria for databases
ACM Transactions on Database Systems (TODS)
Synthesis of extended transaction models using ACTA
ACM Transactions on Database Systems (TODS)
Isolation of transaction aborts in object-oriented database systems
CIKM '94 Proceedings of the third international conference on Information and knowledge management
On computing serial dependency relations
Journal of Computer and System Sciences
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
Object orientation in multidatabase systems
ACM Computing Surveys (CSUR)
Commutativity analysis: a new analysis framework for parallelizing compilers
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
A new conflict relation for concurrency control and recovery in object-based databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Applying formal methods to semantic-based decomposition of transactions
ACM Transactions on Database Systems (TODS)
Specification and Management of Interdependent Data in OperationalSystems and Data Warehouses
Distributed and Parallel Databases
Application Specific Transaction Management in MultidatabaseSystems
Distributed and Parallel Databases
A uniform approach to global concurrency control and recovery in multidatabase environment
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Serialization of concurrent operations in a distributed collaborative environment
GROUP '97 Proceedings of the international ACM SIGGROUP conference on Supporting group work: the integration challenge
Commutativity analysis: a new analysis technique for parallelizing compilers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting Histories: Recovering from Malicious Transactions
Distributed and Parallel Databases - Security of data and transaction processing
Copies convergence in a distributed real-time collaborative environment
CSCW '00 Proceedings of the 2000 ACM conference on Computer supported cooperative work
Revisiting Transaction Management in Multidatabase Systems
Distributed and Parallel Databases
Atomicity and isolation for transactional processes
ACM Transactions on Database Systems (TODS)
Design and evaluation of a conit-based continuous consistency model for replicated services
ACM Transactions on Computer Systems (TOCS)
A Transaction Model to Improve Data Availability in Mobile Computing
Distributed and Parallel Databases
On the consistency problem in mobile distributed computing
Proceedings of the second ACM international workshop on Principles of mobile computing
XMLTM: efficient transaction management for XML documents
Proceedings of the eleventh international conference on Information and knowledge management
Multi-level transaction management for complex objects: implementation, performance, parallelism
The VLDB Journal — The International Journal on Very Large Data Bases
Chronological scheduling of transactions with temporal dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental Recovery in Main Memory Database Systems
IEEE Transactions on Knowledge and Data Engineering
Object-Based Semantic Real-Time Concurrency Control with Bounded Imprecision
IEEE Transactions on Knowledge and Data Engineering
A Formal Approach to Recovery by Compensating Transactions
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A Performance Evaluation of Multi-Level Transaction Management
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Proclamation-Based Model for Cooperating Transactions
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Recovering from Main-Memory Lapses
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Using Formal Methods to Reason about Semantics-Based Decompositions of Transactions
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The Double Life of the Transaction Abstraction: Fundamental Principle and Evolving System Concept
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
History Merging as a Mechanism for Concurrency Control in Cooperative Environments
RIDE '96 Proceedings of the 6th International Workshop on Research Issues in Data Engineering (RIDE '96) Interoperability of Nontraditional Database Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
CAGISTrans: Providing Adaptable Transactional Support for Cooperative Work – an Extended Treatment
Information Technology and Management
Automating commutativity analysis at the design level
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Real-time update of access control policies
Data & Knowledge Engineering
Optimistic parallelism requires abstractions
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
A New Operational Transformation Framework for Real-Time Group Editors
IEEE Transactions on Parallel and Distributed Systems
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Replicated abstract data types: Building blocks for collaborative applications
Journal of Parallel and Distributed Computing
Verification of semantic commutativity conditions and inverse operations on linked data structures
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Exploiting the commutativity lattice
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Time bounds for shared objects in partially synchronous systems
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Transactional storage for geo-replicated systems
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Testing atomicity of composed concurrent operations
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Internally deterministic parallel algorithms can be fast
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Admissible record-oriented evaluation plans for declarative updates
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
Making geo-replicated systems fast as possible, consistent when necessary
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Logic and lattices for distributed programming
Proceedings of the Third ACM Symposium on Cloud Computing
Concurrent libraries with foresight
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Reducing contention through priority updates
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
The scalable commutativity rule: designing scalable software for multicore processors
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Proceedings of the 4th annual Symposium on Cloud Computing
| Hi-index | 14.99 |
Two novel concurrency algorithms for abstract data types are presented that ensure serializability of transactions. It is proved that both algorithms ensure a local atomicity property called dynamic atomicity. The algorithms are quite general, permitting operations to be both partial and nondeterministic. The results returned by operations can be used in determining conflicts, thus allowing higher levels of concurrency than otherwise possible. The descriptions and proofs encompass recovery as well as concurrency control. The two algorithms use different recovery methods: one uses intentions lists, and the other uses undo logs. It is shown that conflict relations that work with one recovery method do not necessarily work with the other. A general correctness condition that must be satisfied by the combination of a recovery method and a conflict relation is identified.