9997 search results - page 1755 / 2000 » The case for crowd computing |
163
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Data prefetching has been widely used in the past as a technique for hiding memory access latencies. However, data prefetching in multi-threaded applications running on chip multi...
184
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
174
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...
158
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
160
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Transactional memories are typically speculative and rely on contention managers to cure conflicts. This paper explores a complementary approach that prevents conflicts by schedul...