high performance computing on graphics processing units: hgpu.org

Processing vast numbers of data streams is a common problem in modern computer systems and is known as the "online big data problem." Adding hard real-time constraints to the processing makes the scheduling problem a very challenging task that this paper aims to address. In such an environment, each data stream is manipulated by a […]

We present a new split-type algorithm for the minimization of a p-harmonic energy with added data fidelity term. The half-quadratic splitting reduces the original problem to two straightforward problems, that can be minimized efficiently. The minimizers to the two sub-problems can typically be computed pointwise and are easily implemented on massively parallel processors. Furthermore the […]

Fast parallel processing capability of general purpose Graphic Processing Units (GPU) can be exploited to accelerate the precoding calculation needed in spatially multiplexed wireless communication systems. In this paper, a GPU-based implementation of the well-known multiuser TomlinsonHarashima precoding (THP) scheme combined with a latticereduction (LR) stage is presented. The proposed approach allows the LR stage […]

This paper presents the Load Balancing for OpenCL (lbcl) library, devoted to automatically solve load balancing issues on both multi-platform and heterogeneous environments. Using this library, a single kernel can be executed on a set of heterogeneous devices, giving each device an amount of work proportional to its computing power. A wrapper has been developed […]

GPUs and other accelerators are available on many different devices, while GPGPU has been massively adopted by the HPC research community. Although a plethora of libraries and applications providing GPU support are available, the need of implementing new algorithms from scratch, or adapting sequential programs to accelerators, will always exist. Writing CUDA or OpenCL codes, […]

We present a parallel implementation for Graphics Processing Units (GPUs) of a model based on cellular automata (CA) to simulate laser dynamics. A cellular automaton is an inherent parallel type of algorithm that is very suitable to simulate complex systems formed by many individual components which give rise to emergent behaviours. We exploit the parallel […]

In this paper a two-phase filter for removing "salt and pepper" noise is proposed. In the first phase, an adaptive median filter is used to identify the set of the noisy pixels; in the second phase, these pixels are restored according to a regularization method, which contains a data-fidelity term reflecting the impulse noise characteristics. […]

The use of the Graphical Processing Unit (GPU) as a general purpose processor is becoming popular. This thesis describes how GPU Computing can be used and can be beneficial in High Energy Physics (HEP) online computation or real time data analysis. This thesis explains that HEP computing is embarrassingly parallel problem therefore by using GPU […]

BACKGROUND: Metagenomics method directly sequences and analyses genome information from microbial communities. There are usually more than hundreds of genomes from different microbial species in the same community, and the main computational tasks for metagenomic data analyses include taxonomical and functional component examination of all genomes in the microbial community. Metagenomic data analysis is both […]

The objective of the present work is to discuss the development of a 3D Unstructured-Overset grid Computational Fluid Dynamics (CFD) solver on General Purpose Graphics Processing Units (GPGPUs). As an extension of our previous work on 2D/3D overset grid computations for compressible/incompressible flows on static grids[1][2], the current paper focuses on moving overset grids with […]

For the solution of large systems of linear equations, iterative solvers with preconditioners are typically employed. However, the design of preconditioners for the black-box case, in which no additional information about the underlying problem is known, is very difficult. The most commonly employed method of incomplete LU factorizations is a serial algorithm and thus not […]

Space-time finite element method provides a robust and accurate alternative to the traditional FEM based on semi-discrete schemes due to its extended capability in establishing approximations in both space and time. The extended capability, however, requires the simultaneous discretization of spatial and temporal domains. This subsequently results in a system of equations that is considerably […]