high performance computing on graphics processing units: hgpu.org

As a powerful and flexible processor, the Graphic Processing Unit (GPU) can offer a great faculty in solving many high-performance computing applications. Sweep3D, which simulates a single group time-independent discrete ordinates (Sn) neutron transport deterministically on 3D Cartesian geometry space, represents the key part of a real ASCI application. The wavefront process for parallel computation […]

High redshift measurements of the baryonic acoustic oscillation scale (BAO) from large Ly-alpha forest surveys represent the next frontier of dark energy studies. As part of this effort, efficient simulations of the BAO signature from the Ly-alpha forest will be required. We construct a model for producing fast, large volume simulations of the Ly-alpha forest […]

We present a mathematical framework for constructing and analyzing parallel algorithms for lattice Kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in spatially distributed, non-equilibrium physiochemical processes with complex chemistry and transport micro-mechanisms. The algorithms can be tailored to specific hierarchical parallel architectures such […]

A novel framework for acceleration of particle filtering approaches to 3D model-based, markerless visual tracking in monocular video is described. Specifically, we present a methodology for partitioning and mapping the computationally expensive weight-update stage of a particle filter to a graphics processing unit (GPU) to achieve particle- and pixel-level parallelism. Nvidia CUDA and Direct3D are […]

Fast instance generation is a key requirement in atlas-based registration and other problems that need a large number of atlas instances. This paper describes a new method to represent and construct intensity atlases. Both geometry and intensity information are represented using B-spline deformation lattices; intensities are approximated using the multi-level B-spline approximation algorithm during model […]

The numerical method presented by Arakawa in 1966[3] implements a finite difference scheme of the Jacobian for the solution of the equation of motion for two-dimensional incompressible flows, which diminishes nonlinear computational instability and permits long-term numerical integrations. This paper presents an efficient implementation of Arakawa’s formula using vectorized Streaming SIMD Extension (SSE) and Advanced […]

With view to satisfying the requirement of real-time under the circumstance of resource-constraints, specific and practical architecture for high-dimensional data streams are proposed, meanwhile, based on CUDA (Compute Unified Device Architecture), canonical correlation analysis between two multiple dimensions data streams using data cube pattern and dimensionality-reduction technique is carried out in this framework. The theoretical […]

Spectrum-based rendering uses spectral distributions instead of just three RGB colors for representation of light sources and surface properties in rendering equation. Since, spectrum has a value at every visible wavelength, the spectrum-based rendering gives much accurate color computation compared to RGB-based rendering and it give us opportunity to simulate wavelength dependent phenomena and effects […]

A new strategy is proposed for implementing computationally intensive high-throughput decoders based on the long length irregular LDPC codes adopted in the DVB-S2 standard. It is supported on manycore graphics processing unit (GPU) architectures, for performing parallel multi-threaded decoding of multiple codewords with reduced accesses to global memory. This novel approach is flexible and scalable, […]

In an increasing number of applications triangle meshes represent a flexible and efficient alternative to traditional NURBS-based surface representations. Especially in engineering applications it is crucial to guarantee that a prescribed approximation tolerance to a given reference geometry is respected for any combination of geometric algorithms that are applied when processing a triangle mesh. We […]

Compound selection procedures based on molecular similarity and diversity are widely used in drug discovery. Current algorithms are often time consuming when applied to very large compound sets. This paper describes the acceleration of two selection algorithms (the leader and the spread algorithms) on graphical processing units (GPUs). We first parallelized the molecular similarity calculation […]

The use of mechanical trading systems allows managing a huge amount of data related to the factors affecting investment performance (macroeconomic variables, company information, industrial indicators, market variables, etc.) while avoiding the psychological reactions of traders when they invest in financial markets. When trading is executed in an intra-daily frequency instead a daily frequency, mechanical […]