713 search results - page 2 / 143 » Hybrid transactional memory |
PPOPP
2006
ACM
14 years 1 months ago
2006
ACM
HIPC
2009
Springer
13 years 5 months ago
2009
Springer
As the size of available datasets in various domains is growing rapidly, there is an increasing need for scaling data mining implementations. Coupled with the current trends in co...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
r of Abstraction (invited lecture) . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Barbara Liskov Fast Asynchronous Consensus with Optimal Resilience. . . . . . . . . . . ....
ICPP
2008
IEEE
14 years 1 months ago
2008
IEEE
—We address the recently recognized privatization problem in software transactional memory (STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristic...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...