high performance computing on graphics processing units: hgpu.org

With the increased processing required in the last years, and the search for devices with better performance, started in computing a need to parallelize processing, making it possible to support the performance of software and algorithms requiring high processing pattern. It’s possible to use the processing power of devices like the GPU to run parallel […]

While multi-core architectures allow for high performance gains, the use of a specialized framework is often required to maximize the use of the available hardware. This paper compares the performance of three different frameworks, Cilk, Kaapi and CUDA, in implementing the Jacobi method.

GPU acceleration is a promising approach to speed up query processing of database systems by using low cost graphic processors as coprocessors. Two major trends have emerged in this area: (1) The development of frameworks for scheduling tasks in heterogeneous CPU/GPU platforms, which is mainly in the context of coprocessing for applications and does not […]

Voronoi diagrams are fundamental data structures in computational geometry with several applications on different fields inside and outside computer science. This paper shows a CUDA algorithm to compute Voronoi diagrams on a 2D image where the distance between points cannot be directly computed in the euclidean plane. The proposed method extends an existing Dijkstra-based GPU […]

Today top ranked HPC systems feature several GPUs which present high processing speed at low power budget with various parallel applications. Many scientific applications still claim for even more computing speed than the available today. A general approach to provide more processing speed is to scale the system. However, aspects such as interference, the amount […]

The algorithmic and implementation principles are explored in gainfully exploiting GPU accelerators in conjunction with multicore processors on high-end systems with large numbers of compute nodes, and evaluated in an implementation of a scalable block tridiagonal solver. The accelerator of each compute node is exploited in combination with multicore processors of that node in performing […]

For the fast transient dam break flooding with floating bodies presented through intricate city layouts, the traditional grid-based method based on solving two dimensional (2D) Shallow Water Equations or three dimensional (3D) Reynolds-averaged Navier-Stokes equations have difficulty in modelling the 3D unsteady flow features and the moving objects in the flow, causing inaccuracies. In this […]

For large software systems, refactoring activities can be a challenging task, since for keeping component complexity under control the overall architecture as well as many details of each component have to be considered. Product metrics are therefore often used to quantify several parameters related to the modularity of a software system. This paper devises an […]

Advanced applications of CFD for multiphysics modelling of electrokinetic, capillary, turbulent and rarefied hypersonic flows is discussed in this paper. Due the complexity of the geometry involved and the underlying physics associated with the phenomena to be studied, multiphysics study requires enormous computational resources. The CFD computations are performed within a parallel environment for accelerating […]

The use of coprocessors or accelerators such as graphics processing units (GPUs) has become popular in scientific computing applications due to their low cost, impressive floating-point capabilities, high memory bandwidth, and low electrical power requirements. Hybrid high-performance computers, defined as machines with nodes containing more than one type of floating-point processor (e.g. CPU and GPU), […]

Performance of shared memory processors show negative performance impulses (drawbacks) in certain regions for execution of the basic matrix multiplication algorithm. In this paper we continue with analysis of GPU memory hierarchy and corresponding cache memory organization. We give a theoretical analysis why a negative performance impulse appears for specifics problem sizes. The main reason […]

Stencil computations are an integral part of applications in a number of scientific computing domains, such as image processing and partial differential equations. We describe a domain-specific language for regular stencil computations, that allows specification of the computations in a concise manner. We describe a multi-target compiler for this DSL, that generates optimized code for […]