high performance computing on graphics processing units: hgpu.org

Submission Deadline: 2015-03-01 Publication: Submitted papers can be selected and published into one of the following Journals: *International Journal of Computer and Communication Engineering (IJCCE) （ISSN:2010-3743) Abstracting/ Indexing: EI (INSPEC, IET), Google Scholar, Engineering & Technology Digital Library, ProQuest, and Crossref, Electronic Journals Library *International Journal of Modeling and Optimization (IJMO) Abstracting/ Indexing: Engineering & […]

For embarrassingly parallel algorithms, a Graphics Processing Unit (GPU) outperforms a traditional CPU on price-per-flop and price-per-watt by at least one order of magnitude. This had led to the mapping of signal and image processing algorithms, and consequently their applications, to run entirely on GPUs. This paper presents CUFFTSHIFT, a ready-to-use GPU-accelerated library, that implements […]

In recent years, processing and exploration of time series has experienced a noticeable interest. Growing volumes of data and needs of efficient processing pushed the research in new directions, including hardware based solutions. Graphics Processing Units (GPU) have significantly more applications than just rendering images. They are also used in general purpose computing to solve […]

In this work, we present an extension of Gaussian process (GP) models with sophisticated parallelization and GPU acceleration. The parallelization scheme arises naturally from the modular computational structure w.r.t. datapoints in the sparse Gaussian process formulation. Additionally, the computational bottleneck is implemented with GPU acceleration for further speed up. Combining both techniques allows applying Gaussian […]

To monitor bad information spreading in microblog system, large-scale data from microblog must be processed in real time. This needs high cost-effective parallel schemes. A parallel processing method on GPUs was put forward to monitor massive microblog. The proposed scheme can fully exploit the GPU feature to schedule massive threads for data-intensive tasks. The detailed […]

Although integral histogram enables histogram computation of a sub-area within constant time, construction of the integral histogram requires O(nm) steps for n x m sized image. Such construction time can be reduced using parallel prefix sum algorithm. Mark Harris proposed an efficient parallel prefix sum and implemented it using CUDA GPGPU. Mark Harris’ algorithm has […]

In this article, we introduce CURRENNT, an open-source parallel implementation of deep recurrent neural networks (RNNs) supporting graphics processing units (GPUs) through NVIDIA’s Computed Unified Device Architecture (CUDA). CURRENNT supports uni- and bidirectional RNNs with Long Short-Term Memory (LSTM) memory cells which overcome the vanishing gradient problem. To our knowledge, CURRENNT is the first publicly […]

An emerging trend in processor architecture seems to indicate the doubling of the number of cores per chip every two years with same or decreased clock speed. Of particular interest to this thesis is the class of many-core processors, which are becoming more attractive due to their high performance, low cost, and low power consumption. […]

Finding chordless cycles is an important theoretical problem in the Graph Theory area. It also can be applied to practical problems such as discover which predators compete for the same food in ecological networks. Motivated by the problem of theoretical interest and also by its significant practical importance, we present in this paper a parallel […]

Shading reduces the power output of a photovoltaic (PV) system. The design engineering of PV systems requires modeling and evaluating shading losses. Some PV systems are affected by complex shading scenes whose resulting PV energy losses are very difficult to evaluate with current modeling tools. Several specialized PV design and simulation software include the possibility […]

The Kernel Polynomial Method (KPM) is a well-established scheme in quantum physics and quantum chemistry to determine the eigenvalue density and spectral properties of large sparse matrices. In this work we demonstrate the high optimization potential and feasibility of peta-scale heterogeneous CPU-GPU implementations of the KPM. At the node level we show that it is […]

Sorting and scanning are two fundamental primitives for constructing highly parallel algorithms. A number of libraries now provide implementations of these primitives for GPUs, but there is relatively little information about the performance of these implementations. We benchmark seven libraries for 32-bit integer scan and sort, and sorting 32-bit values by 32-bit integer keys.We show […]