high performance computing on graphics processing units: hgpu.org

Discovering subtle alterations of pairs of images taken from the same scene at different time intervals is called minute change detection problem. To achieve this goal, we have developed a framework that captures and highlights minute changes in digital images that are otherwise hidden to the human eye. Moreover, unnoticeable differences from image pairs that […]

Depth-of-field blur effects are well-known depth cues in human vision. Computer graphics pipelines added DOF effects early to enhance imagery realism, but real-time VR applications haven’t yet introduced visual blur effects. The authors describe new techniques to improve blur rendering and report experimental results from a prototype video game implementation.

The video coding standard H.264 supports video compression with a higher coding efficiency than previous standards. However, this comes at the expense of an increased encoding complexity, in particular for motion estimation which becomes a very time consuming task even for today’s central processing units (CPU). On the other hand, modern graphics hardware includes a […]

This paper presents a new tool paths generation method for CNC machining based on GPU-CPU fusion calculation. CUDA, a general purpose parallel computing architecture, was provided by NVidia to resolve problems of mass data parallel computing. The new tool paths generation algorithm based on isoparametric method was redesigned to use CUDA. The final comparison experiment […]

Simulators are still the primary tools for development and performance evaluation of applications running on massively parallel architectures. However, current virtual platforms are not able to tackle the complexity issues introduced by 1000-core future scenarios. We present a fast and accurate simulation framework targeting extremely large parallel systems by specifically taking advantage of the inherent […]

As one of the most popular accelerators, Graphics Processing Unit (GPU) has demonstrated high computing power in several application fields. On the other hand, GPU also produces high power consumption and has been one of the most largest power consumers in desktop and supercomputer systems. However, software power optimization method targeted for GPU has not […]

This paper deals with depth maps extraction from multi-view video. Contrary to standard stereo matching-based approaches, depth maps are computed here using optical flow estimations between consecutive views. We compare our approach with the one proposed in the Depth Estimation Reference Software (DERS) for normalization purposes in the ISO-MPEG 3DV group. Experiments conducted on sequences […]

In the following paper we present techniques for data-parallel execution of the cellular potts model (CPM) on graphics processing units (GPUs). We have developed data-structures and algorithms that are optimized to use available hardware resources on the GPU. To the best of our knowledge, this is the first attempt at using data-parallel techniques for simulating […]

Demand for 3D visualization is increasing in mobile devices as users have come to expect more realistic immersive experiences. However, limited networking and computing resources on mobile devices remain challenges. A solution is to have a proxy-based framework that offloads the burden of rendering computation from mobile devices to more powerful servers. We present the […]

Motif is overrepresented pattern in biological sequence and motif finding is an important problem in bioinformatics. Due to high computational complexity of motif finding, more and more computational capabilities are required as the rapid growth of available biological data, such as gene transcription data. Among many motif finding algorithms, Gibbs sampling is an effective method […]

In this paper, several methods of optimizing parallel implementation of 2D FDTD algorithm are presented. Some practical problems occurring in real simulations are taken into consideration. Moreover, the presented methods are supported with appropriate tests and practical examples.

The Gauss-Seidel method is very efficient for solving problems such as tightly-coupled constraints with possible redundancies. However, the underlying algorithm is inherently sequential. Previous works have exploited sparsity in the system matrix to extract parallelism. In this paper, we propose to study several parallelization schemes for fully-coupled systems, unable to be parallelized by existing methods, […]