6105 search results - page 381 / 1221 » A Parallel Algorithm for Bound-Smoothing |
243
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
193
click to vote
PPOPP
2009
ACM
16 years 7 months ago
2009
ACM
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
157
click to vote
ICPPW
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previ...
168
click to vote
PODS
2008
ACM
16 years 7 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
199
click to vote
MSO
2003
15 years 8 months ago
2003
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...