30 search results - page 3 / 6 » Dependence-aware transactional memory for increased concurre... |
PPOPP
2009
ACM
13 years 11 months ago
2009
ACM
Boosted transactions offer an attractive method that enables programmers to create larger transactions that scale well and offer deadlock-free guarantees. However, as boosted tran...
PPOPP
2009
ACM
14 years 7 months ago
2009
ACM
Dependence-aware transactional memory (DATM) is a recently proposed model for increasing concurrency of memory transactions without complicating their interface. DATM manages depe...
RTSS
1994
IEEE
13 years 10 months ago
1994
IEEE
Various concurrency control algorithms di er in the time when con icts are detected, and in the way they are resolved. In that respect, the Pessimistic and Optimistic Concurrency ...
HOTOS
2007
IEEE
13 years 10 months ago
2007
IEEE
Optimistic synchronization allows concurrent execution of critical sections while performing dynamic conflict detection and recovery. Optimistic synchronization will increase perf...
IPPS
2009
IEEE
14 years 1 months ago
2009
IEEE
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....