high performance computing on graphics processing units: hgpu.org

This thesis is devoted to the development of efficient numerical solvers for fluctuating hydrodynamics, in particular, for flows with immersed particles. In the first part of the thesis we develop numerical solvers able to work in a broad number of flow regimes with a high computational performance. To derive thermodynamically consistent set of equations in […]

The inherent issues of properly deploying finite difference calculations onto GPUs are described and solutions are suggested. A speedup of 60x is achieved over the CPU version. Four visualization methods were implemented using OpenGL and compared in terms of the clarity of their visual result. A combination of hedgehogs and slices was deemed to give […]

In this work we propose an efficient finite volume approximation of two-fluid flows. Our scheme is based on three ingredients. We first construct a conservative scheme that removes the pressure oscillations phenomenon at the interface. The construction relies on a random sampling at the interface [6, 5]. Secondly, we replace the exact Riemann solver by […]

Today, GPUs represent an important hardware development platform for many problems in dynamical systems, where massive parallel computations are needed. Beside that, many numerical studies of chaotic dynamical systems require a computing precision higher than common floating point (FP) formats. One such application is locating invariant sets for chaotic dynamical systems. In particular, we focus […]

Multicore CPUs (Central Processing Units) and GPUs (Graphics Processing Units) are omnipresent in today’s market-leading smartphones and tablets. With CPUs and GPUs getting more complex, maximizing hardware utilization is becoming problematic. The challenges faced in GPGPU (General Purpose computing using GPU) computing on embedded platforms are different from their desktop counterparts due to their memory […]

This thesis presents the results of a study into the use of graphical processing units (GPUs) in the simulation and modelling of gravitational microlensing. Two simulation approaches were investigated: magnification maps and the use of a dynamic engine for directly simulating gravitational microlensing light curves. It was found that the GPUs are able to speed […]

2014-07-05 Accepted papers of ICICT 2014 will be published in the following jounals with ISSN: — Ei indexed Journal: Journal of Computers (JCP, ISSN: 1796-203X) Journal of Software (JSW, ISSN: 1796-217X) –Google Scholar: International Journal of Computer and Communication Engineering (IJCCE, ISSN: 2010-3743) International Journal of Computer Theory and Engineering (IJCTE, ISSN: 1793-8201) Lecture Notes […]

We consider a two-fluid compressible flow. Each fluid obeys a stiffened gas pressure law. The continuous model is well defined without considering mixture regions. However, for numerical applications it is often necessary to consider artificial mixtures, because the two-fluid interface is diffused by the numerical scheme. We show that classic pressure law interpolations lead to […]

A version of the H-LU factorization is introduced, based on the individual computational tasks occurring during the block-wise H-LU factorization. The dependencies between these tasks form a directed acylic graph, which is used for efficient scheduling on parallel systems. The algorithm is especially suited for many-core processors and shows a much improved parallel scaling behavior […]

The emergence of multi-/many-core architectures, accelerators and high-speed networks, along with continued reduction in hardware costs make it possible to design highly capable supercomputers that offer sustained petaflop performance. However, merely using modern compute architectures and high-speed networks is not sufficient to achieve exascale science. Parallel applications typically involve explicit communication between processes to exchange […]

Graphs and hyper-graphs are frequently used to recognize complex and often non-rigid patterns in computer vision, either through graph matching or point-set matching with graphs. Most formulations resort to the minimization of a difficult energy function containing geometric or structural terms, frequently coupled with data attached terms involving appearance information. Traditional methods solve the minimization […]

In this paper, we investigated the effect of adding more small curves to the initial condition which determines the required number of iterations of a fast level set (LS) evolution. As a result, we discovered two new theorems and developed a proof on the worst case of the required number of iterations. Furthermore, we found […]