Sciweavers

30 search results - page 1 / 6
» Leveraging Lock Contention to Improve OLTP Application Perfo...
Sort
View
ICDE
2004
IEEE
108views Database» more  ICDE 2004»
14 years 6 months ago
Priority Mechanisms for OLTP and Transactional Web Applications
Transactional workloads are a hallmark of modern OLTP and Web applications, ranging from electronic commerce and banking to online shopping. Often, the database at the core of the...
David T. McWherter, Bianca Schroeder, Anastassia A...
PPOPP
2010
ACM
13 years 3 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
HPCA
2003
IEEE
14 years 5 months ago
Hierarchical Backoff Locks for Nonuniform Communication Architectures
This paper identifies node affinity as an important property for scalable general-purpose locks. Nonuniform communication architectures (NUCAs), for example CCNUMAs built from a f...
Zoran Radovic, Erik Hagersten
SIGMOD
2010
ACM
221views Database» more  SIGMOD 2010»
13 years 9 months ago
Low overhead concurrency control for partitioned main memory databases
Database partitioning is a technique for improving the performance of distributed OLTP databases, since “single partition” transactions that access data on one partition do no...
Evan P. C. Jones, Daniel J. Abadi, Samuel Madden
HPCC
2009
Springer
13 years 9 months ago
On the Performance of Commit-Time-Locking Based Software Transactional Memory
Compared with lock-based synchronization techniques, Software Transactional Memory (STM) can significantly improve the programmability of multithreaded applications. Existing res...
Zhengyu He, Bo Hong