7590

Posts

Apr, 28

High-Performance Code Generation for Stencil Computations on GPU Architectures

Stencil computations arise in many scientific computing domains, and often represent time-critical portions of applications. There is significant interest in offloading these computations to high-performance devices such as GPU accelerators, but these architectures offer challenges for developers and compilers alike. Stencil computations in particular require careful attention to off-chip memory access and the balancing of […]
Apr, 28

The AGILE library for image reconstruction in biomedical sciences using graphics card hardware acceleration

Fast image reconstruction is a critical requirement for an imaging modality to be adopted in the field of clinical and pre-clinical sciences. While programs become faster due to more powerful hardware, at the same time data size increases and the need for advanced—and often computational more demanding—reconstruction algorithms arises. A cheap way to achieve a […]
Apr, 28

Characterizing and Improving the Use of Demand-Fetched Caches in GPUs

Initially introduced as special-purpose accelerators for games and graphics code, graphics processing units (GPUs) have emerged as widely-used high-performance parallel computing platforms. GPUs traditionally provided only softwaremanaged local memories (or scratchpads) instead of demandfetched caches. Increasingly, however, GPUs are being used in broader application domains where memory access patterns are both harder to analyze and […]
Apr, 27

Analytical Study of Various High Performance Computing Paradigms

Now-a-days various computing paradigms are present in IT industry. Cloud, Grid, Cluster and General Purpose-Graphical Processing Unit (GP-GPU) computing are High Performance Computing (HPC) technologies and are growing very quickly. These are undoubtedly today’s most enticing technology areas due to the various benefits offered by them such as virtualization, high performance and less managerial overhead […]
Apr, 27

Real-time particle simulation of fluids

Physically plausible simulation of fluids in real-time is mostly achieved using approximations of the NavierStokes equations. Recent methods simulate fluids by exploiting the capabilities of modern graphics processing units. This article describes a method called Smoothed Particle Hydrodynamics (SPH), which is a numerical approximation of the Navier-Stokes equations. The real-time simulation allows for interactivity which […]
Apr, 27

Hybrid CPU/GPU KD-Tree Construction for Versatile Ray Tracing

We propose an hybrid CPU-GPU ray-tracing implementation based on an optimal Kd-Tree as acceleration structure. The construction and traversal of this KD-tree takes benefit from both the CPU and the GPU to achieve high-performance ray-tracing on mainstream hardware. Our approach, flexible enough to use only a single computing unit (CPU or GPU), is able to […]
Apr, 27

The Case for Higher Computational Density in the Memory-Bound FDTD Method within Multicore Environments

It is argued here that more accurate though more compute-intensive alternate algorithms to certain computational methods which are deemed too inefficient and wasteful when implemented within serial codes can be more efficient and cost-effective when implemented in parallel codes designed to run on today’s multicore and many-core environments. This argument is most germane to methods […]
Apr, 27

Matrix Multiplication with CUDA – A basic introduction to the CUDA programming model

We use the example of Matrix Multiplication to introduce the basics of GPU computing in the CUDA environment. It is assumed that the student is familiar with C programming, but no other background is assumed. The goal of this module is to show the student how to offload parallel computations to the graphics card, when […]
Apr, 25

High-performance sparse matrix-vector multiplication on GPUs for structured grid computations

In this paper, we address efficient sparse matrix-vector multiplication for matrices arising from structured grid problems with high degrees of freedom at each grid node. Sparse matrix-vector multiplication is a critical step in the iterative solution of sparse linear systems of equations arising in the solution of partial differential equations using uniform grids for discretization. […]
Apr, 25

Radio Astronomy Beam Forming on Many-Core Architectures

Traditional radio telescopes use large steel dishes to observe radio sources. The largest radio telescope in the world, LOFAR, uses tens of thousands of fixed, omnidirectional antennas instead, a novel design that promises ground-breaking research in astronomy. Where traditional telescopes use custom-built hardware, LOFAR uses software to do signal processing in real time. This leads […]
Apr, 25

An Efficient Work-Distribution Strategy for Gridding Radio-Telescope Data on GPUs

This paper presents a novel work-distribution strategy for GPUs, that efficiently convolves radio-telescope data onto a grid, one of the most time-consuming processing steps to create a sky image. Unlike existing work-distribution strategies, this strategy keeps the number of device-memory accesses low, without incurring the overhead from sorting or searching within telescope data. Performance measurements […]
Apr, 25

Lynx: A Dynamic Instrumentation System for Data-Parallel Applications on GPGPU Architectures

As parallel execution platforms continue to proliferate, there is a growing need for real-time introspection tools to provide insight into platform behavior for performance debugging, correctness checks, and to drive effective resource management schemes. To address this need, we present the Lynx dynamic instrumentation system. Lynx provides the capability to write instrumentation routines that are […]

* * *

* * *

HGPU group © 2010-2024 hgpu.org

All rights belong to the respective authors

Contact us: