Sciweavers

48 search results - page 3 / 10
» Key Range Locking Strategies for Improved Concurrency
Sort
View
CPHYSICS
2010
135views more  CPHYSICS 2010»
13 years 8 months ago
An events based algorithm for distributing concurrent tasks on multi-core architectures
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
David W. Holmes, John R. Williams, Peter Tilke
PDCN
2004
13 years 10 months ago
Speculative prefetching of optional locks in distributed systems
We present a family of methods for speeding up distributed locks by exploiting the uneven distribution of both temporal and spatial locality of access behaviour of many applicatio...
Thomas Schöbel-Theuer
IPPS
2009
IEEE
14 years 3 months ago
Taking the heat off transactions: Dynamic selection of pessimistic concurrency control
In this paper we investigate feedback-directed dynamic selection between different implementations of atomic blocks. We initially execute atomic blocks using STM with optimistic c...
Nehir Sönmez, Tim Harris, Adrián Crist...
CAV
2007
Springer
166views Hardware» more  CAV 2007»
14 years 2 months ago
Fast and Accurate Static Data-Race Detection for Concurrent Programs
We present new techniques for fast, accurate and scalable static data race detection in concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify th...
Vineet Kahlon, Yu Yang, Sriram Sankaranarayanan, A...
VLDB
2002
ACM
99views Database» more  VLDB 2002»
13 years 8 months ago
An Efficient Method for Performing Record Deletions and Updates Using Index Scans
We present a method for efficiently performing deletions and updates of records when the records to be deleted or updated are chosen by a range scan on an index. The traditional m...
C. Mohan