high performance computing on graphics processing units: hgpu.org

The turbulent transport of a passive scalar is an important and challenging problem in many applications in fluid mechanics. It involves different range of scales in the fluid and in the scalar and requires important computational resources. In this work we show how hybrid numerical methods, combining Eulerian and Lagrangian schemes, are natural tools to […]

In 2010, a special time-domain beamforming algorithm was presented at the Berlin Beamforming Conference [3]. This algorithm is primarily designed for the sound source localization on moving objects with known velocity (e.g. freight trains). By determining the object trajectory, the acoustic map’s quality can be improved with respect to the Doppler effect. The bottleneck of […]

In the video sequence human faces have unlimited orientations and positions so face detection and clustering is very important. In this paper, I have proposed a method to cluster human faces from the video sequence based on Spatio Temporal method.The proposed method is based on three main stages. First I have used a face detector […]

GPU’s are massively multicore architectures managing several thousands of concurrent threads. This concurrence, maintained through several schedulers, is necessary to keep high performance but negatively impact predictability. In this work, we first propose measures of predictability as well as CUDA tests to estimate this measure regarding warp and block scheduler for architectures from G80 to […]

Joint programming of QT and CUDA is a urgent problem on Linux, a Linux-based QT-CUDA parallel architecture has been built creatively. As an example, an fast parallel rendering algorithm for seismic and GPR imaging is proposed and implemented based on the Linux QT-CUDA parallel architecture. It is proved that the parallel rendering algorithm is about […]

Beamforming algorithms make high demands on the computer hardware and the computation time is an important factor for the assessment of this method. This paper describes techniques for optimizing the implementation of beamforming algorithms in regard to calculation time. The main focus is on using the Graphic Processing Unit for accelerating beamforming. After a brief […]

In this paper, we proposed a new low overhead collaborative technique of output quality monitoring for approximate computing on GPUs. In this technique, the CPU is responsible for performing quality monitoring while the GPU executes approximate kernels. For two image processing applications, we showed that this technique outperforms previous quality monitoring techniques.

This paper describes a performance model for read alignment problem, one of the most computationally intensive tasks in bioinformatics. We adapted Burrows Wheeler transform based index to be used with GPUs to reduce overall memory footprint. A mathematical model of computation and communication costs was developed to find optimal memory partitioning for index and queries. […]

Sorting is a common problem in computer science. There are lot of well-known sorting algorithms created for sequential execution on a single processor. Recently, hardware platforms enable to create wide parallel algorithms. We have standard processors consist of multiple cores and hardware accelerators like GPU. The graphic cards with their parallel architecture give new possibility […]

All papers for the ICCTS 2014 will be published in the IJCEE (ISSN: 1793-8163) as one volume, and will be indexed by Ulrich’s Periodicals Directory, Google Scholar, EBSCO, Engineering & Technology Digital Library, Crossref, ProQuest, DOAJ and EI (INSPEC, IET) and Electronic Journals Library. 2014-04-05 Algorithms Artificial Intelligence Automated Software Engineering Bio-informatics Biomedical Engineering Compilers […]

From Mobile to High-Performance Computing (HPC) systems, performance and energy efficiency are becoming always more challenging requirements. In this regard, heterogeneous systems, made by a general-purpose processor and one or more hardware accelerators, are emerging as affordable solutions. However, the effective exploitation of such platforms requires specific programming languages, like for instance OpenCL, and suitable […]

Quantum computing proposes quantum algorithms exponentially faster than their classical analogues when executed by a quantum computer. As quantum computers are currently unavailable for general use, one approach for analyzing the behavior and results of such algorithms is the simulation using classical computers. As this simulation is inefficient due to the exponential growth of the […]