36 search results - page 1 / 8 » Composite Abortable Locks |
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
The need to allow threads to abort an attempt to acquire a lock (sometimes called a timeout) is an interesting new requirement driven by state-of-the-art database applications wit...
RTDB
1996
13 years 6 months ago
1996
We show that previous algorithmic and scheduling work concerning the use of lock-free objects in hard real-timesystems can be extended to support real-time transactions on memory-...
JSA
2006
13 years 4 months ago
2006
Data-shipping systems that allow inter-transaction caching raise the need of a transactional cache consistency maintenance (CCM) protocol because each client is able to cache a po...
VLDB
1998
ACM
13 years 9 months ago
1998
ACM
We present a new client cache consistency algorithm for client caching database management systems. The algorithm, called Asynchronous Avoidance-based Cache Consistency (AACC), pr...
PPOPP
2006
ACM
13 years 10 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...