8875

Posts

Jan, 16

Efficient implementation of multiuser precoding algorithms on GPU for MIMO-OFDM systems

In this paper, we focus on the signal precoding stage in multiuser multicarrier systems, which can be often a computationally expensive task. In order to reduce their computational time, the implementation of some of the most employed multiuser precoding algorithms on a general purpose Graphic Processing Unit (GPU) is presented. These devices allow for a […]
Jan, 16

On the Use of Graphic Processing Units for the Efficient Implementation of MIMO Detectors

The use of Graphic Processing Units (GPU) for the efficient implementation of signal processing algorithms for MIMO communication systems is receiving incremental attention recently. This is mainly due to their high capability of parallel processing together with their reasonable cost. In this work, the interest of GPU for the rapid prototyping of MIMO receivers is […]
Jan, 16

Analytic Visibility on the GPU

This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundaries […]
Jan, 15

Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels

We study semantics of GPU kernels – the parallel programs that run on Graphics Processing Units (GPUs). We provide a novel lock-step execution semantics for GPU kernels represented by arbitrary reducible control flow graphs and compare this semantics with a traditional interleaving semantics. We show for terminating kernels that either both semantics compute identical results […]
Jan, 15

Three Dimensional Fast Fourier Transform CUDA Implementation

A 3 dimensional DFT can be expressed as 3 DFTs on a 3 dimensional data along each dimension. Each of these 1 dimensional DFTs can be computed efficiently owing to the properties of the transform. This class of algorithms is known as the Fast Fourier Transform (FFT). We introduce the one dimensional FFT algorithm in […]
Jan, 15

Two Approaches to Particle Simulation: OpenMPI and CUDA

In this project, our goal is to make particle simulation run in parallel using both CUDA and MPI implementations. The scale of parallelism between the are two vastly different, and we wish to compare implementations to gain insight on the strengths and weaknesses between the two different paradigms of parallelization. Particle simulations are of huge […]
Jan, 15

Ray Tracing in Real-Time Games

This thesis describes efficient rendering algorithms based on ray tracing, and the application of these algorithms to real-time games. Compared to rasterizationbased approaches, rendering based on ray tracing allows elegant and correct simulation of important global effects, such as shadows, reflections and refractions. The price for these benefits is performance: ray tracing is compute-intensive. This […]
Jan, 15

Massively parallelizable list-mode reconstruction using a Monte Carlo-based elliptical Gaussian model

PURPOSE: A fully three-dimensional (3D) massively parallelizable list-mode ordered-subsets expectation-maximization (LM-OSEM) reconstruction algorithm has been developed for high-resolution PET cameras. System response probabilities are calculated online from a set of parameters derived from Monte Carlo simulations. The shape of a system response for a given line of response (LOR) has been shown to be asymmetrical […]
Jan, 14

Adaptive Dynamic Load Balancing in Heterogeneous Multiple GPUs-CPUs Distributed Setting: Case Study of B&B Tree Search

The emergence of new hybrid and heterogenous multi-GPU multi-CPU large scale platforms offers new opportunities and pauses new challenges when solving difficult optimization problems. This paper targets irregular tree search algorithms in which workload is unpredictable. We propose an adaptive distributed approach allowing to distribute the load dynamically at runtime while taking into account the […]
Jan, 13

HiDP: A Hierarchical Data Parallel Language

Problem domains are commonly decomposed hierarchically to fully utilize parallel resources in modern microprocessors. Such decompositions can be provided as library routines, written by experienced experts, for general algorithmic patterns. But such APIs tend to be constrained to certain architectures or data sizes. Integrating them with application code is often an unnecessarily daunting task, especially […]
Jan, 13

A master-slave robotic simulator based on GPUDirect

The same as in traditional surgery, surgeons in telerobotic surgery need extensive training to achieve experience and highly accurate instrument manipulation. Traditional training methods like practice in operating room have major drawbacks such as high risk and limited opportunity for which virtual reality (VR) and computer technologies can offer solutions. To accelerate the data transmission […]
Jan, 13

Acceleration of Selective Cationic Antibacterial Peptides computation: A comparison of FPGA and GPU approaches

Prediction of physicochemical properties of peptide sequences can be used for the identification of "Selective Cationic Amphipatic Antibacterial Peptides" (SCAAP), with possible applications in different diseases treatment. The exhaustive computation of physicochemical properties of peptide sequences can lead to reduce the search space of SCAAP, but the combinatorial complexity of these calculations is a high-performance […]

* * *

* * *

HGPU group © 2010-2025 hgpu.org

All rights belong to the respective authors

Contact us: