352 search results - page 33 / 71 » Good Programming in Transactional Memory |
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
ASPLOS
2006
ACM
14 years 1 months ago
2006
ACM
Concurrency bugs are among the most difficult to test and diagnose of all software bugs. The multicore technology trend worsens this problem. Most previous concurrency bug detect...
POPL
2009
ACM
14 years 2 months ago
2009
ACM
Haskell has a rich set of synchronization primitives for implemented-state concurrency abstractions, ranging from the very high level (Software Transactional Memory) to the very l...
ASPLOS
2008
ACM
13 years 9 months ago
2008
ACM
Support for optimistic parallelism such as thread-level speculation (TLS) and transactional memory (TM) has been proposed to ease the task of parallelizing software to exploit the...
ASPLOS
2011
ACM
12 years 11 months ago
2011
ACM
nt, user-defined objects present an attractive abstraction for working with non-volatile program state. However, the slow speed of persistent storage (i.e., disk) has restricted ...