Sciweavers

53 search results - page 7 / 11
» Relational joins on graphics processors
Sort
View
ISPDC
2010
IEEE
13 years 9 months ago
Pretty Good Accuracy in Matrix Multiplication with GPUs
—With systems such as Road Runner, there is a trend in super computing to offload parallel tasks to special purpose co-processors, composed of many relatively simple scalar proc...
Matthew Badin, Lubomir Bic, Michael B. Dillencourt...
EGH
2004
Springer
14 years 2 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan
HPDC
2010
IEEE
13 years 11 months ago
A GPU accelerated storage system
Massively multicore processors, like, for example, Graphics Processing Units (GPUs), provide, at a comparable price, a one order of magnitude higher peak performance than traditio...
Abdullah Gharaibeh, Samer Al-Kiswany, Sathish Gopa...
GCB
2009
Springer
481views Biometrics» more  GCB 2009»
14 years 5 months ago
CUDA-based Multi-core Implementation of MDS-based Bioinformatics Algorithms
: Solving problems in bioinformatics often needs extensive computational power. Current trends in processor architecture, especially massive multi-core processors for graphic cards...
Thilo Fester, Falk Schreiber, Marc Strickert
EGH
2007
Springer
14 years 5 months ago
Practical logarithmic rasterization for low-error shadow maps
Logarithmic shadow maps can deliver the same quality as competing shadow map algorithms with substantially less storage and bandwidth. We show how current GPU architectures can be...
Brandon Lloyd, Naga K. Govindaraju, Steven E. Moln...