Sciweavers

405 search results - page 11 / 81
» A Parallel Priority Data Structure with Applications
Sort
View
CCGRID
2002
IEEE
15 years 4 months ago
Multiple Query Optimization for Data Analysis Applications on Clusters of SMPs
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...
Henrique Andrade, Tahsin M. Kurç, Alan Suss...
131
Voted
PPOPP
2011
ACM
14 years 2 months ago
Compact data structure and scalable algorithms for the sparse grid technique
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...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
PODC
2004
ACM
15 years 5 months ago
Bringing practical lock-free synchronization to 64-bit applications
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...
Simon Doherty, Maurice Herlihy, Victor Luchangco, ...
IEEEPACT
2009
IEEE
14 years 9 months ago
Region Based Structure Layout Optimization by Selective Data Copying
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...
Sandya S. Mannarswamy, Ramaswamy Govindarajan, Ris...
PPOPP
2009
ACM
16 years 6 days ago
How much parallelism is there in irregular applications?
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...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...