Significant performance advantages can be realized by implementing a database system on a cache-coherent shared memory multiprocessor. An efficient implementation of a lock manager is a prerequisite for efficient transaction processing in multiprocessor database systems. To this end, we examine two approaches to the implementation of locking in a cache-coherent shared memory multiprocessor database system. The first approach, shared-memory locking (SML), allows each node (processor) of the multiprocessor to acquire and release locks directly via the use of cache-coherent shared memory. The second approach, message-passing locking (MPL), typically requires messages to be sent to a lock manager, located on a remote node. Our empirical evaluat...
Journal ArticleShared memory programs guarantee the correctness of concurrent accesses to shared dat...
A new scheme for physically accessing tuples by multiple transactions is described for database syst...
AbstractIn this paper, we extend the traditional relationships between locks, i.e., shared and non-s...
The traditional lock manager (LM) seriously limits the transaction throughput of the main memory dat...
Multi-core scalability is one of the most important features for database systems running on today's...
Locking is widely used as a concurrency control mechanism in database systems. As more OLTP database...
Concurrency control is a cornerstone of distributed database engines and storage systems. In pursuit...
Large-scale shared-memory multiprocessors typically have long latencies for remote data accesses. A...
A shared data structure is lock-free if its operations do not require mutual exclusion. If one proce...
Shared disks environment (SDE) refers to a distributed architecture for high performance transaction...
Mutual-exclusion locks are currently the most popular mechanism for interprocess synchronisation, la...
A shared data structure is lock-free if its operations do not require mutual exclusion. If one proce...
The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (max...
A shared data structure is lock-free if its operations do not require mutual exclusion. If one proce...
Concurrency control provides multi-user access to a database system, while ensuring concurrent trans...
Journal ArticleShared memory programs guarantee the correctness of concurrent accesses to shared dat...
A new scheme for physically accessing tuples by multiple transactions is described for database syst...
AbstractIn this paper, we extend the traditional relationships between locks, i.e., shared and non-s...
The traditional lock manager (LM) seriously limits the transaction throughput of the main memory dat...
Multi-core scalability is one of the most important features for database systems running on today's...
Locking is widely used as a concurrency control mechanism in database systems. As more OLTP database...
Concurrency control is a cornerstone of distributed database engines and storage systems. In pursuit...
Large-scale shared-memory multiprocessors typically have long latencies for remote data accesses. A...
A shared data structure is lock-free if its operations do not require mutual exclusion. If one proce...
Shared disks environment (SDE) refers to a distributed architecture for high performance transaction...
Mutual-exclusion locks are currently the most popular mechanism for interprocess synchronisation, la...
A shared data structure is lock-free if its operations do not require mutual exclusion. If one proce...
The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (max...
A shared data structure is lock-free if its operations do not require mutual exclusion. If one proce...
Concurrency control provides multi-user access to a database system, while ensuring concurrent trans...
Journal ArticleShared memory programs guarantee the correctness of concurrent accesses to shared dat...
A new scheme for physically accessing tuples by multiple transactions is described for database syst...
AbstractIn this paper, we extend the traditional relationships between locks, i.e., shared and non-s...