5640 search results - page 350 / 1128 » Parallelizing the Data Cube |
161
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performa...
198
click to vote
IOPADS
1997
15 years 8 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
211
click to vote
IJHPCA
2008
15 years 6 months ago
2008
We present a de novo hierarchical simulation framework for first-principles based predictive simulations of materials and their validation on high-end parallel supercomputers and ...
154
click to vote
JCC
2007
15 years 6 months ago
2007
: We investigate the parallel scaling of the GROMACS molecular dynamics code on Ethernet Beowulf clusters and what prerequisites are necessary for decent scaling even on such clust...
207
click to vote
TPDS
2010
15 years 5 months ago
2010
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...