405 search results - page 11 / 81 » A Parallel Priority Data Structure with Applications |
CCGRID
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper is concerned with the efficient execution of multiple query workloads on a cluster of SMPs. We target applications that access and manipulate large scientific dataset...
165
click to vote
PPOPP
2011
ACM
14 years 5 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
102
click to vote
PODC
2004
ACM
15 years 8 months ago
2004
ACM
Many lock-free data structures in the literature exploit techniques that are possible only because state-of-the-art 64-bit processors are still running 32-bit operating systems an...
155
click to vote
IEEEPACT
2009
IEEE
15 years 23 days ago
2009
IEEE
As the gap between processor and memory continues to grow, memory performance becomes a key performance bottleneck for many applications. Compilers therefore increasingly seek to m...
130
click to vote
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...