DOIAbstract
AbstractA new formal model is presented for studying concurrency and resiliency properties for nested transactions. The model is used to state and prove correctness of a well-known locking algorithm
AbstractA new formal model is presented for studying concurrency and resiliency properties for nested transactions. The model is used to state and prove correctness of a well-known locking algorithm
With the boom in the development of multi-core machines and the development of multi-threaded appli...
AbstractWe offer a reference model for nested transactions at the level of memory accesses, and sket...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractWe present a new model for describing and reasoning about transaction-processing algorithms....
We present a new model for describing and reasoning about transaction-processing algorithms. The mod...
We present a concurrency control algorithm for an open and safe nested transaction model. We use pre...
AbstractThis paper defines the notion of hybrid atomicity for nested transaction systems, and presen...
In this paper, we present a study on the concurrency control and recovery algorithms in nested trans...
AbstractWe propose a formal model of concurrency control in object bases. An object base is like a d...
Abstract. This paper defines the notion of hybrid atomicityfor nested trans-action systems, and pres...
We propose a formal model of concurrency control in object bases. An object base is like a database ...
Transactional memory systems (TM) offer an alternative to standard lock-based programming. However, ...
AbstractIn this paper we study the serializability and the concurrent access to a database by making...
In the pdst few years there has been consrc’er&le research on concurrency control, tncludmg both...
AbstractDatabases and other transaction-processing systems use concurrency control and recovery algo...
With the boom in the development of multi-core machines and the development of multi-threaded appli...
AbstractWe offer a reference model for nested transactions at the level of memory accesses, and sket...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractWe present a new model for describing and reasoning about transaction-processing algorithms....
We present a new model for describing and reasoning about transaction-processing algorithms. The mod...
We present a concurrency control algorithm for an open and safe nested transaction model. We use pre...
AbstractThis paper defines the notion of hybrid atomicity for nested transaction systems, and presen...
In this paper, we present a study on the concurrency control and recovery algorithms in nested trans...
AbstractWe propose a formal model of concurrency control in object bases. An object base is like a d...
Abstract. This paper defines the notion of hybrid atomicityfor nested trans-action systems, and pres...
We propose a formal model of concurrency control in object bases. An object base is like a database ...
Transactional memory systems (TM) offer an alternative to standard lock-based programming. However, ...
AbstractIn this paper we study the serializability and the concurrent access to a database by making...
In the pdst few years there has been consrc’er&le research on concurrency control, tncludmg both...
AbstractDatabases and other transaction-processing systems use concurrency control and recovery algo...
With the boom in the development of multi-core machines and the development of multi-threaded appli...
AbstractWe offer a reference model for nested transactions at the level of memory accesses, and sket...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Add to ORKG