high performance computing on graphics processing units: hgpu.org

General-purpose computing on graphics processing units (GPGPU) is popular computing technology to utilize in various fields. In the paper, we parallelize cryptographical hash processing of a password cracking tool, John the Ripper, by utilizing CUDA on GPGPU. We also evaluate our work to compare the processing time of hash processing parallelized by GPU with that […]

Analysis of neural signals (such as EEG) has long been a hot topic in neuroscience community due to neural signals’ nonlinear and non-stationary features. Recent advances of experimental methods and neuroscience research have made neural signals constantly massive and analysis of these signals highly compute-intensive. Analysis of neural signals has been routinely performed upon CPU-based […]

Ensemble empirical-mode decomposition (EEMD) is a novel adaptive time-frequency analysis method, which is particularly suitable for extracting useful information from noisy nonlinear or nonstationary data. Unfortunately, since the EEMD is highly compute-intensive, the method does not apply in real-time applications on top of commercial-off-the-shelf computers. Aiming at this problem, a parallelized EEMD method has been […]

The GPUs (Graphics Processing Units) have evolved into extremely powerful and flexible processors, allowing its usage for processing different data. This advantage can be used in game development to optimize the game loop. Most GPGPU works deals only with some steps of the game loop, allowing to the CPU to process most of the game […]

A nonlinear filter bank named as an ∈-filter bank is implemented for real-time processing of video in order to make the skin in human faces look beautified. General-purpose computing on graphics processing units (GPGPU) is utilized for this real-time implementation. GPGPU has quite high computational power, and the facial beautification system using the ∈-filter bank […]

There is currently a strong push in the research community to develop biological scale implementations of neuron based vision models. Systems at this scale are computationally demanding and have generally utilized more accurate neuron models, such as the Izhikevich and Hodgkin- Huxley models, in favor of the integrate and fire model. This paper examines the […]

A GPGPU-based collision detection algorithm is proposed. Firstly, the information of OBB hierarchy tree and triangles of tested objects are mapped into some data textures designed for GPGPU-based calculation, such as triangle vertex textures, bounding box size texture, tree node relationship texture, etc., then these textures are downloaded to GPU to complete the data preparation. […]

Molecular dynamics simulations have become a significant computational approach to study complicated physical phenomena at the atomic level. Nevertheless, accurate simulations are limited in size and timescale by the available computing resources, which make the simulations very time-consuming. This consequentially leads to tremendous computational requirements. Therefore, the need for speeding up this process is crucial. […]

Simulated annealing has became the de facto standard for FPGA placement engines since it provides high quality solutions and is robust under a wide range of objective functions. However, this method will soon become prohibitive due to its sequential nature and since the performance of single-core processor has stagnated. General purpose computing on graphics processing […]

For signal/power integrity analysis of the high density packages and printed circuit boards, the FDTD (Finite-Difference Time-Domain) method has been widely used. In order to apply to large-scale problems, a variety of acceleration techniques are required. This paper describes a GPGPU-FDTD (General Purpose computing on GPU (Graphic Processing Unit)-Finite-Difference Time-Domain) method for massively parallel electromagnetic […]

Recently, GPGPU has been adopted well in the High Performance Computing (HPC) field. The limited global memory bandwidth poses a great challenge to many GPGPU programmers trying to exploit parallelism within the CPU-GPU heterogeneous platform. In this paper, we choose SWIM, a typical memory intensive application from the SPEC OMP 2001 benchmark suite, for case […]

We consider the problem of how to improve memory latency tolerance in massively multithreaded GPGPUs when the thread-level parallelism of an application is not sufficient to hide memory latency. One solution used in conventional CPU systems is prefetching, both in hardware and software. However, we show that straightforwardly applying such mechanisms to GPGPU systems does […]