high performance computing on graphics processing units: hgpu.org

Ray tracing is a computer graphics rendering technique. Different from the traditional rasterization algorithm, the ray tracing algorithm simulate the realvision process. Being able to deliver highly realistic graphics effects, it has been considered as the fundamental graphics rendering mechanism for high-end applications and is also likely to be adopted as the work-horse of future […]

This paper reports on our experiences of using commodity GPUs to speed-up the execution of fine-grained concurrent simulations. Starting with an existing process-oriented ‘boids’ simulation, we explore a variety of techniques aimed at improving performance, gradually refactoring the original code. Successive improvements lead to a 10-fold improvement in performance, which we believe can still be […]

We present a parallel/GPU implementation of our open-source reactive molecular dynamics code, PG-PuReMD (Parallel GPU-Purdue Reactive Molecular Dynamics). Using a variety of innovative algorithms and optimizations, PGPuReMD achieves over 350x speedup compared to a single CPU implementation on a cluster of 36 state of the art GPUs. This is a significant development, since it enables […]

The Diagrammatic Determinantal Quantum Monte Carlo (DDQMC) algorithm [11, s. III] is used to solve quantum impurity models such as the Anderson model [13]. The topic of this dissertation is the efficient porting of an existing implementation of DDQMC to CUDA in order to use GPUs as accelerators. The main characteristics of quantum impurity models […]

For a given simulation, the most expensive subroutine in the astrophysics code, MOCCA (MOnte Carlo Cluster SimulAtor), has been ported to run as a kernel on a GPU (Graphics Processing Unit). The code was accelerated using the CUDA programming model, which was performed with PGI CUDA Fortran. The GPU code was run with varying problem […]

Monte Carlo simulations of the Ising model play an important role in the field of computational statistical physics, and they have revealed many properties of the model over the past few decades. However, the effect of frustration due to random disorder, in particular the possible spin glass phase, remains a crucial but poorly understood problem. […]

We describe a numerical study of the potential energy landscape for the two-dimensional XY model (with no disorder), considering up to 100 spins and CPU and GPU implementations of local optimization, focusing on minima and saddles of index one (transition states). We examine both periodic and anti-periodic boundary conditions, and show that the number of […]

We have seen more and more interest in taking advantage of GPUs to accelerate simulations. However, the RNGs driving these simulations tend to be existing CPU generators that have been converted for use on GPUs. The result is a generator that does not efficiently utilise the resources and constraints of that architecture. Consequently, the performance […]

Computer modelling has been used for a number of years already to aid financial institutions in making business decisions. One such decision that financial firms are often faced with involves setting fair prices for financial options. Since the process of option pricing can be computationally expensive, methods of optimising it are sought after. One popular […]

The k-nearest neighbours (k-NN) search is one of the most critical nonparametric methods used in data retrieval and similarity tasks. Over recent years fast k-NN processing for large amount of high-dimensional data is increasingly demanded. Locality-sensitive hashing is a viable solution for computing fast approximate nearest neighbours (ANN) with reasonable accuracy. This chapter presents a […]

Graphical Processing Units (GPUs) have become popular recently due their highly parallel shared-memory architectures. The computational challenge posed by NP-Hard problems makes them potential targets to GPU-based computations, especially when solved by exact exponential-time algorithms. Using the classical NP-hard Vertex Cover problem as a case study, we provide a framework for GPU-based solutions by exploiting […]

The increasing incorporation of Graphics Processing Units (GPUs) as accelerators has been one of the forefront High Performance Computing (HPC) trends and provides unprecedented performance; however, the prevalent adoption of the Single-Program Multiple-Data (SPMD) programming model brings with it challenges of resource underutilization. In other words, under SPMD, every CPU needs GPU capability available to […]