high performance computing on graphics processing units: hgpu.org

We propose a new GPU method for synthesizing subdivision meshes with exact adaptive geometry in real time. Our GPU kernel builds upon precomputed tables of basis functions for subdivision surfaces and is therefore supporting all subdivision schemes, either interpolating or approximating, for triangle or quad meshes. We designed our kernel so that it can be […]

Real-time stereo vision is attractive in many applications like robot navigation and 3-D scene reconstruction. Data parallel platforms, e.g., graphics processing unit (GPU), are often used for real-time stereo, because most stereo algorithms involve a large portion of data parallel computations. In this paper, we propose a stereo system on GPU which pushes the Pareto-efficiency […]

It is studied about parallel algorithm of lattice Boltzmann method. The data’s arrangement, commutation and computational progress are redesigned in a marriage of message passing interface and general purpose graphic processing Units. On the single-GPU, novel techniques appearing in shader model 3.0 such as frame buffer object (FBO), multiple-channels-rendering and, rendering-to-textures are used to improve […]

Reflections, refractions, and caustics are very important for rendering global illumination images. Although many methods can be applied to generate these effects, the rendering performance is not satisfactory for interactive applications. In this paper, complex ray-object intersections are simplified so that the intersections can be computed on a GPU, and an iterative computing scheme based […]

This paper proposes a triangular solve algorithm with variable block size for graphics processing unit (GPU). By using diagonal blocks inversion with recursion, this algorithm works with tunable block size to achieve the best performance. Various methods are shown on how to make use of existing profiling tools to successfully measure and analyze performance of […]

N-body algorithms are applicable to a number of common problems in computational physics including gravitation, electrostatics, and fluid dynamics. Fast algorithms (those with better than O(N^2) performance) exist, but have not been successfully implemented on GPU hardware for practical problems. In the present work, we introduce not only best-in-class performance for a multipole-accelerated treecode method, […]

The vortex core shed from rotorcraft blades maintains coherency-and thus dynamic relevance-many blade turns after its creation. This presents a challenge to traditional Eulerian computational methods, as fine grids are required to suppress numerical diffusion which would weaken the vortex cores after a small number of revolutions. Vortex methods have been used in the past […]

Vortex particle methods, when combined with multipole-accelerated boundary element methods (BEM), become a complete tool for direct numerical simulation (DNS) of internal or external vortex-dominated flows. In previous work, we presented a method to accelerate the vorticity-velocity inversion at the heart of vortex particle methods by performing a multipole treecode N-body method on parallel graphics […]

We explore the use of generalized t priors on regression coefficients to help understand the nature of association signal within "hit regions" of genome-wide association studies. The particular generalized t distribution we adopt is a Student distribution on the absolute value of its argument. For low degrees of freedom we show that the generalized t […]

Special session of 9th International Conference on Computational Methods in Systems Biology (CMSB 2011)  Computational methods in biology enable the systematic study of the complex interactions that characterize biological systems. Mathematical modelling is a necessary tool to unambiguously represent the information about the behaviour of the considered system and to enable sophisticated predictive analysis. One […]

The 10th International Symposium on Parallel and Distributed Computing (ISPDC 2011) will take place between July 6th and 8th, 2011, in Cluj-Napoca, Romania. This year’s edition is organized by the Computer Science Department of the Technical University of Cluj-Napoca. It will feature keynote presentations and oral paper presentations, as well as several special sessions and […]

We present a simple yet robust signed distance field (SDF) generator based on recent GPU architectures. In our approach, the squared Euclidean distance is calculated for each triangle face in parallel, and then an optimized stream reduction process is used to find the shortest distance. During this process, the stream reduction operation acts like a […]