high performance computing on graphics processing units: hgpu.org

This paper aims at understanding the effect of parallelizing incomplete Cholesky (IC) factorization on the overall performance of the incomplete Cholesky conjugate gradient (ICCG) solver method, optimized on multi-core and GPU based Systems. Parallel IC preconditioners, which are based on graph reordering and arbitrary levels of allowed fill-in, are tested on structured and unstructured matrices […]

The use of Graphics Processing Units (GPUs) in general purpose computing has been shown to incur significant performance benefits, for applications ranging from scientific computing to database sorting and search. In this paper we try to evaluate the execution of integer arithmetic operation on CPU and GPU processors. We evaluate the execution from both performance […]

GPUs (Graphics Processing Units) have become one of the main co-processors that contributed to desktops towards high performance computing. Together with multi-core CPUs, a powerful heterogeneous execution platform is built for massive calculations. To improve application performance and explore this heterogeneity, a distribution of workload in a balanced way over the PUs (Processing Units) plays […]

We describe a novel framework for calculating dense, accurate elevation maps from stereo, in which the height of each point in the scene is estimated relative to the ground plane. The key to our framework’s ability to estimate elevation accurately is an MRF formulation of stereo that directly represents elevation at each pixel instead of […]

In this paper we propose CUDA-based implementations of two 3D point sets registration algorithms: Soft assign and EM-ICP. Both algorithms are known for being time demanding, even on modern multi-core CPUs. Our GPUbased implementations vastly outperform CPU ones. For instance, our CUDA EM-ICP aligns 5000 points in less than 7 seconds on a GeForce 8800GT, […]

In this work we propose a real time 2D parallel feature-based for image morphing and warping algorithm fully implemented in GPU (Graphics Processing Units). We applied the proposed algorithm to animate the appearance of a 3D character’s face by morphing its texture map. We compared the performance of the proposed algorithm with the sequential version […]

The problem addressed in this paper consists in triangulating the van der Waals surface without computing the geometric intersections of its atoms. Recall that the van der Waals surface is useful in computational molecular biology and biochemistry to, for example, determine the volume occupied by a molecule, as well as other important geometric properties. Assuming […]

Several problems in the signal processing field require generating suitable representations of data. One possible form of representation is given by independent component analysis (ICA). The computation of these representations can be quite expensive, especially if large datasizes are used. Over the last few years graphics processing units (GPUs) have emerged as inexpensive general-purpose computation […]

Due to ongoing improvements in the performance and programmability of commercially available Graphics Processor Units (GPUs), substantial increases in the execution speed of EM propagation analysis through ray tracing is now attainable. This paper presents recent results where RF ray tracing has been applied to analyze signal propagation over complex urban 3D scene models. The […]

We present an efficient algorithm for building an adaptive bounding volume hierarchy (BVH) in linear time on commodity graphics hardware using CUDA. BVHs are widely used as an acceleration data structure to quickly ray trace animated polygonal scenes. We accelerate the construction process with auxiliary grids that help us build high quality BVHs with SAH […]

The work presents a method for the high speed calculation of crude depth maps. Performance and applicability are illustrated for view interpolation based on two input video streams, but the algorithm is perfectly amenable to multicamera environments. First a fast plane sweep algorithm generates the crude depth map. Speed results from hardware accelerated transformations and […]

Repeat regions in DNA play very important roles in many vital biological functions. Repeats finding is always deemed as one of the most fundamental problems in genome sequencing and analysis, and exact repeats finding is the first step for many other repeats finding problems. This paper depicts the design and implementation issues of a fast […]