95 search results - page 12 / 19 » Constructive, Deterministic Implementation of Shared Memory ... |
169
click to vote
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
115
click to vote
SDM
2012
SIAM
12 years 12 months ago
2012
SIAM
Kernel summations are a ubiquitous key computational bottleneck in many data analysis methods. In this paper, we attempt to marry, for the first time, the best relevant technique...
IWOMP
2007
Springer
15 years 3 months ago
2007
Springer
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
74
Voted
IPPS
2000
IEEE
15 years 1 months ago
2000
IEEE
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...