Sciweavers

186 search results - page 21 / 38
» Transactional Mutex Locks
Sort
View
MICRO
2008
IEEE
109views Hardware» more  MICRO 2008»
15 years 4 months ago
Dependence-aware transactional memory for increased concurrency
—Transactional memory (TM) is a promising paradigm for helping programmers take advantage of emerging multicore platforms. Though they perform well under low contention, hardware...
Hany E. Ramadan, Christopher J. Rossbach, Emmett W...
74
Voted
ICEIS
2009
IEEE
15 years 4 months ago
MIDAS: A Middleware for Information Systems with QoS Concerns
One of the most difficult tasks in the design of information systems is how to control the behaviour of the back-end storage engine, usually a relational database. As the load on t...
Luís Fernando Orleans, Geraldo Zimbrã...
PODS
1990
ACM
150views Database» more  PODS 1990»
15 years 1 months ago
On Being Optimistic about Real-Time Constraints
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
Jayant R. Haritsa, Michael J. Carey, Miron Livny
RTSS
1990
IEEE
15 years 1 months ago
Dynamic Real-Time Optimistic Concurrency Control
In a recent study, we have shown that in real-time database systems that discard late transactions, optimistic concurrency control outperforms locking. Although the optimistic alg...
Jayant R. Haritsa, Michael J. Carey, Miron Livny
ICDE
2004
IEEE
108views Database» more  ICDE 2004»
15 years 11 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...