74 search results - page 1 / 15 » Lock-Free Transactions for Real-Time Systems |
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-...
FLOPS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
RTSS
1995
IEEE
13 years 8 months ago
1995
IEEE
WDAG
2010
Springer
13 years 2 months ago
2010
Springer
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
ISCA
1993
IEEE
13 years 9 months ago
1993
IEEE
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...