Sciweavers

65 search results - page 4 / 13
» Designing efficient sorting algorithms for manycore GPUs
Sort
View
MSO
2003
13 years 8 months ago
Simulation based Development of Efficient Hardware for Sort based Algorithms
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...
Niklas Hansson, Jay H. Harris
IPPS
2010
IEEE
13 years 5 months ago
Highly scalable parallel sorting
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
Edgar Solomonik, Laxmikant V. Kalé
SIGMOD
2005
ACM
162views Database» more  SIGMOD 2005»
14 years 7 months ago
Fast and Approximate Stream Mining of Quantiles and Frequencies Using Graphics Processors
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...
Naga K. Govindaraju, Nikunj Raghuvanshi, Dinesh Ma...
DAC
2010
ACM
13 years 7 months ago
Parallel multigrid preconditioning on graphics processing units (GPUs) for robust power grid analysis
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require inco...
Zhuo Feng, Zhiyu Zeng
IEEECIT
2010
IEEE
13 years 5 months ago
XMalloc: A Scalable Lock-free Dynamic Memory Allocator for Many-core Machines
There are two avenues for many-core machines to gain higher performance: increasing the number of processors, and increasing the number of vector units in one SIMD processor. A tru...
Xiaohuang Huang, Christopher I. Rodrigues, Stephen...