Sciweavers

63 search results - page 1 / 13
» Accelerating Large Graph Algorithms on the GPU Using CUDA
Sort
View
HIPC
2007
Springer
13 years 10 months ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Pawan Harish, P. J. Narayanan
BMCBI
2008
211views more  BMCBI 2008»
13 years 4 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
INTENSIVE
2009
IEEE
13 years 11 months ago
Accelerating K-Means on the Graphics Processor via CUDA
In this paper an optimized k-means implementation on the graphics processing unit (GPU) is presented. NVIDIA’s Compute Unified Device Architecture (CUDA), available from the G8...
Mario Zechner, Michael Granitzer
IPPS
2009
IEEE
13 years 11 months ago
Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using CUDA
Computing large multiple protein sequence alignments using progressive alignment tools such as ClustalW requires several hours on state-of-the-art workstations. ClustalW uses a th...
Yongchao Liu, Bertil Schmidt, Douglas L. Maskell
EGH
2009
Springer
13 years 2 months ago
Fast minimum spanning tree for large graphs on the GPU
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
Vibhav Vineet, Pawan Harish, Suryakant Patidar, P....