402 search results - page 54 / 81 » Understanding transactional memory performance |
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...
100
click to vote
ASPLOS
2008
ACM
14 years 11 months ago
2008
ACM
The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. Addressing this challenge requires adva...
PDP
2005
IEEE
15 years 3 months ago
2005
IEEE
Within the field of databases that are deployed in distributed environments there is a need to guarantee consistency among replicas and availability among nodes despite of networ...
RTSS
1994
IEEE
15 years 1 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 ...