high performance computing on graphics processing units: hgpu.org

We use OpenMP directives to target hardware accelerators (GPUs) on Summit, a newly deployed supercomputer at the Oak Ridge Leadership Computing Facility (OLCF), demonstrating simplified access to GPU devices for users of our astrophysics code GenASiS and useful speedup on a sample fluid dynamics problem. At a lower level, we use the capabilities of Fortran […]

The main goal in many fields in empirical sciences is to discover causal relationships among a set of variables from observational data. PC algorithm is one of the promising solutions to learn the underlying causal structure by performing a number of conditional independence tests. In this paper, we propose a novel GPU-based parallel algorithm, called […]

The ever-increasing computational demand from workload mix of concurrent applications characterizes modern embedded systems. In response to such a trend, many-core accelerators are becoming more popular in high-end embedded systems. However, embedded systems usually have many constraints compared to general purpose computers. Various constraints such as low computing powers, lack of operating system and restriction […]

Stereo matching is one of the first steps in the process of calculating 3D information from two 2D images. To triangulate a 3D point from two corresponding 2D features, the displacement in pixels, or the so-called disparity, must be estimated. From the estimated per-pixel disparity, using a projective camera model, 3D data for large portions […]

Nuclear fusion is a phenomenon in which the nucleuses of hydrogen crash between them, causing helium atoms. The resulting nucleus is heavier than the hydrogen nucleuses, but is lighter than the addition of the masses of the nucleuses involved in the process. This phenomenon releases huge amounts of energy. The research group i2a2 develops the […]

Achieving high performance on stencil computations poses a number of challenges on modern architectures. The optimization strategy varies significantly across architectures, types of stencils, and types of applications. The standard approach to adapting stencil computations to different architectures, used by both compilers and application programmers, is through the use of iteration space tiling, whereby the […]

With high computation power and memory bandwidth, graphics processing units (GPUs) lend themselves to accelerate data-intensive analytics, especially when such applications fit the single instruction multiple data (SIMD) model. However, graph algorithms such as breadth-first search and k-core, often fail to take full advantage of GPUs, due to irregularity in memory access and control flow. […]

  The objective of the 3rd TAPEMS International Workshop on Theoretical Approaches to Performance Evaluation, Modeling and Simulation is to bring together researchers and practitioners from academia and industry to discuss current advances and trends in both theoretical and experimental approaches to the performance evaluation, modeling and analysis of parallel applications and algorithms on multicore […]

OpenACC was launched in 2010 as a portable programming model for heterogeneous accelerators. Although various implementations already exist, no extensible, open-source, production-quality compiler support is available to the community. This deficiency poses a serious risk for HPC application developers targeting GPUs and other accelerators, and it limits experimentation and progress for the OpenACC specification. To […]

Tsunami generated by a submarine earthquake sometimes causes serious damage in a coastal area. To reduce negative effects of tsunami, effective evacuation and disaster prevention are getting interested. We can contribute to that by forecasting arrival time and height of tsunami with computer simulations. However, tsunami simulations always require massive data processing. The shallow water […]

Smith-waterman algorithm (SW) is a popular dynamic programming algorithm widely used in Bioinformatics for local biological sequence alignment. Due to the O(n2) high time and space complexity of SW and growing size of biological data, it is crucial to accelerate SW for high performance. In view of the GPU high efficiency in science computation, many […]

schnaps is a finite element solver designed to simulate various physical phenomena. It is designed to run on hybrid computers made of several CPUs and GPUs. In order to address the hybrid architectures we rely on the StarPU runtime. StarPU allows to optimize in an incremental way a sequential algorithm in order to migrate to […]