high performance computing on graphics processing units: hgpu.org

In this paper, we discuss the acceleration of a climate model known as Community Earth System Model (CESM). The use of Graphics Processor Units (GPUs) to accelerate scientific applications that are computationally intensive is well known. This project attempts to extract the performance of GPUs to enable fast execution of CESM to obtain better model […]

We present a simplification algorithm for triangular meshes, implemented on the GPU. The algorithm performs edge collapses driven by a quadric error metric. It uses data parallelism as provided by OpenCL and has no sequential segments in its main iterative structure in order to fully exploit the processing power of the GPU. Our implementation produces […]

Hardware acceleration using FPGAs has shown orders of magnitude reduction in runtime of computationally-intensive applications in comparison to traditional stand-alone computers [1]. This is possible because on an FPGA many computations can be performed at the same time in a truly-parallel fashion. However, parallel computation at a hardware level requires a great deal of expertise, […]

For the past few decades, both the scientific community and the general public have been becoming more aware that the Earth lives in a shooting gallery of small objects. We classify all of these asteroids and comets, known or unknown, that cross Earth’s orbit as near-Earth objects (NEOs). A look at our geologic history tells […]

The Travelling Salesman Problem (TSP) is one of the most studied combinatorial optimization problem which is significant in many practical applications in transportation problems. The TSP problem is NP-hard problem and requires large computation power to be solved by the exact algorithms. In the past few years, fast development of general-purpose Graphics Processing Units (GPUs) […]

We present a generalization of the inertial coupling (IC) [Usabiaga et al. J. Comp. Phys. 2013] which permits the resolution of radiation forces on small particles with arbitrary acoustic contrast factor. The IC method is based on a Eulerian-Lagrangian approach: particles move in continuum space while the fluid equations are solved in a regular mesh […]

This paper presents the development of a two-dimensional (2-D) finite-difference time-domain (FDTD) solver that features reliable calculations and reduced simulation times. The accuracy of computations is guaranteed by specially-designed spatial operators with extended stencils, which are assisted by an optimized version of a high-order leapfrog integrator. Both discretization schemes rely on error-minimization concepts, and a […]

The goal of this work is to explore novel approaches to CUDA accelerated breadth-first search (BFS) algorithm and analyze their application in a state-of-the-art algorithm for graph decomposition into strongly connected components via CUDA capable devices, i.e. GPUs. A previous method [7], as will be shown, does not reasonably work on real-world graphs. Therefore, we […]

In rolling of steel into thin sheets the final step is the cooling of the finished product on the Runout Table. In this thesis, the heat transfer into a water jet impinging on a hot flat steel plate was studied as the key cooling process on the runout table. The temperature of the plate was […]

In this work, we describe our preliminary experiences on the Stampede system in the context of the Uintah Computational Framework. Uintah was developed to provide an environment for solving a broad class of fluid-structure interaction problems on structured adaptive grids. Uintah uses a combination of fluid-flow solvers and particle-based methods, together with a novel asynchronous […]

Random covers for finite groups have been introduced in [5, 9], and [18], and used for constructing public key cryptosystems. The primer [10] introduces a new approach for constructing pseudorandom number generators, called MSTg, based on random covers for large finite groups. In particular, on the class of elementary abelian 2-groups they allow a very […]

We implement, optimize, and validate the linear-scaling Kubo-Greenwood quantum transport simulation on graphics processing units by examining resonant scattering in graphene. We consider two practical representations of the Kubo-Greenwood formula: a Green-Kubo formula based on the velocity auto-correlation and an Einstein formula based on the mean square displacement. The code is fully implemented on graphics […]