Posts
Mar, 2
Efficient Detection of Sunspots with GPU Acceleration Through CUDA
Tracking sunspots is not an easy task given that multiple sources of data are acquired using a variety of different instruments. With the sources of data and contributors to this repositories quickly growing, it is increasingly important to have an efficient solution to analyze the photographs to record trends and possibly make predictions. CUDA (Compute […]
Mar, 2
Full Covariance Gaussian Mixture Models Evaluation on GPU
Gaussian mixture models (GMMs) are often used in various data processing and classification tasks to model a continuous probability density in a multi-dimensional space. In cases, where the dimension of the feature space is relatively high (e.g. in the automatic speech recognition (ASR)), GMM with a higher number of Gaussians with diagonal covariances (DC) instead […]
Mar, 2
On Performance of GPU and DSP Architectures for Computationally Intensive Applications
This thesis focuses on the implementations of a support vector machine (SVM) algorithm on digital signal processor (DSP), graphics processor unit (GPU), and a common Intel i7 core architecture. The purpose of this work is to identify which of the three is most suitable for SVM implementation. The performance is measured by looking at the […]
Mar, 2
Large-scale ferrofluid simulations on graphics processing units
We present an approach to molecular-dynamics simulations of ferrofluids on graphics processing units (GPUs). Our numerical scheme is based on a GPU-oriented modification of the Barnes-Hut (BH) algorithm designed to increase the parallelism of computations. For an ensemble consisting of a million ferromagnetic particles, the performance of the proposed algorithm on a Tesla M2050 GPU […]
Mar, 2
Acceleration of Coarse Grain Molecular Dynamics on GPU Architectures
Coarse grain (CG) molecular models have been proposed to simulate complex systems with lower computational overheads and longer timescales with respect to atomistic level models. However, their acceleration on parallel architectures such as graphic processing units (GPUs) presents original challenges that must be carefully evaluated. The objective of this work is to characterize the impact […]
Mar, 2
On continuous maximum flow image segmentation algorithm
In recent years, with the advance of computing equipment and image acquisition techniques, the sizes, dimensions and content of acquired images have increased considerably. Unfortunately as time passes there is a steadily increasing gap between the classical and parallel programming paradigms and their actual performance on modern computer hardware. In this thesis we consider in […]
Mar, 2
Parallel Peeling Algorithms
The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k are removed until there are no vertices of degree less than k left. The remaining hypergraph is known as the k-core. In this paper, we analyze parallel peeling processes, where […]
Mar, 2
Matrix-free GPU implementation of a preconditioned conjugate gradient solver for anisotropic elliptic PDEs
Many problems in geophysical and atmospheric modelling require the fast solution of elliptic partial differential equations (PDEs) in "flat" three dimensional geometries. In particular, an anisotropic elliptic PDE for the pressure correction has to be solved at every time step in the dynamical core of many numerical weather prediction models, and equations of a very […]
Feb, 28
Automatic Mapping of Stream Programs on Multicore Architectures
Stream languages explicitly describe fork-join and pipeline parallelism, offering a powerful programming model for general multicore systems. This parallelism description can be exploited on hybrid architectures, eg. composed of Graphics Processing Units (GPUs) and general purpose multicore processors. In this paper, we present a novel approach to optimize stream programs for hybrid architectures composed of […]
Feb, 28
GEARS: A General and Efficient Algorithm for Rendering Shadows
We present a soft shadow rendering algorithm that is general, efficient, and accurate. The algorithm supports fully dynamic scenes, with moving and deforming blockers and receivers, and with changing area light source parameters. The algorithm computes for each output image pixel a tight but conservative approximation of the set of triangles that block the light […]
Feb, 28
Acceleration of the MMFF94 routines within OpenBabel using Eigen and OpenCL
Over the last few decades, computer modelling and computer simulation have become an invaluable tool for computational chemists interested in advancing their research and experiment in a more efficient, cost effective way with new molecules. As computer capabilities increase the demand for more accurate models and faster simulations has also grown. Some of these models […]
Feb, 28
A Fast and Efficient SIFT Detector Using the Mobile GPU
Emerging mobile applications, such as augmented reality, demand robust feature detection at high frame rates. We present an implementation of the popular Scale-Invariant Feature Transform (SIFT) feature detection algorithm that incorporates the powerful graphics processing unit (GPU) in mobile devices. Where the usual GPU methods are inefficient on mobile hardware, we propose a heterogeneous dataflow […]