Posts
May, 6
Simulation of Biological Tissue using Mass-Spring-Damper Models
The goal of this project was to evaluate the viability of a mass-spring-damper based model for modeling of biological tissue. A method for automatically generating such a model from data taken from 3D medical imaging equipment including both the generation of point masses and an algorithm for generating the spring-damper links between these points is […]
May, 6
Fast Implementation of Scale Invariant Feature Transform Based on CUDA
Scale-invariant feature transform (SIFT) was an algorithm in computer vision to detect and describe local features in images. Due to its excellent performance, SIFT was widely used in many applications, but the implementation of SIFT was complicated and time-consuming. To solve this problem, this paper presented a novel acceleration algorithm for SIFT implementation based on […]
May, 6
Fast computation of MadGraph amplitudes on graphics processing unit (GPU)
Continuing our previous studies on QED and QCD processes, we use the graphics processing unit (GPU) for fast calculations of helicity amplitudes for general Standard Model (SM) processes. Additional HEGET codes to handle all SM interactions are introduced, as well assthe program MG2CUDA that converts arbitrary MadGraph generated HELAS amplitudess(FORTRAN) into HEGET codes in CUDA. […]
May, 4
Real-time Stochastic Optimization of Complex Energy Systems on High Performance Computers
We present a scalable approach that computes in operationally-compatible time the energy dispatch under uncertainty for complex energy systems of realistic size. Complex energy systems, such as the US power grid, are affected by increased uncertainty of its target power sources, due for example to increasing penetration of wind power coupled with the physical impossibility […]
May, 4
Exploration of Multifrontal Method with GPU in Power Flow Computation
Solving sparse linear equations is the key part of power system analysis. The Newton-Raphson and its variations require repeated solution of sparse linear equations; therefore improvement in efficiency of solving sparse linear equations will accelerate the overall power system analysis. This work integrates multifrontal method and graphic processing unit (GPU) linear algebra library to solve […]
May, 4
GPUWattch: Enabling Energy Optimizations in GPGPUs
General-purpose GPUs (GPGPUs) are becoming prevalent in mainstream computing, and performance per watt has emerged as a more crucial evaluation metric than peak performance. As such, GPU architects require robust tools that will enable them to quickly explore new ways to optimize GPGPUs for energy efficiency. We propose a new GPGPU power model that is […]
May, 4
Implementations of the FFT algorithm on GPU
The fast Fourier transform (FFT) plays an important role in digital signal processing (DSP) applications, and its implementation involves a large number of computations. Many DSP designers have been working on implementations of the FFT algorithms on different devices, such as central processing unit (CPU), Field programmable gate array (FPGA), and graphical processing unit (GPU), […]
May, 4
High-Order Schemes for the Shallow Water Equations on GPUs
In this thesis, well-balanced, central-upwind high-resolution methods of high order are developed for the two-dimensional shallow water equations, on the graphics processing unit (GPU). The methods are based on a fifth-order Weighted Essentially Non-Oscillating (WENO) reconstruction technique and a fourth-order Gaussian quadrature for the one-sided interface fluxes. Two schemes are implemented, one with bilinear interpolation […]
May, 3
Algorithms for representation of 3D regions in radiotherapy planning software
This thesis reviews the fast marching method as a technique for computing the distance transform on GPU in the context of a radiotherapy planning software. The method has some interesting characteristics that, given the right circumstances, allow the distance transform to be computed for fewer voxels than commonly used alternatives. This can result in beneficial […]
May, 3
Optimizing Similarity Computations for Ontology Matching – Experiences from GOMMA
An efficient computation of ontology mappings requires optimized algorithms and significant computing resources especially for large life science ontologies. We describe how we optimized n-gram matching for computing the similarity of concept names and synonyms in our match system GOMMA. Furthermore, we outline how to enable a highly parallel string matching on Graphical Processing Units […]
May, 3
Data-rich astronomy: mining synoptic sky surveys
In the last decade a new generation of telescopes and sensors has allowed the production of a very large amount of data and astronomy has become, a data-rich science; this transition is often labeled as: "data revolution" and "data tsunami". The first locution puts emphasis on the expectations of the astronomers while the second stresses, […]
May, 3
Impact of Warp Formation on GPU Performance
As computing power of GPU increases dramatically, the GPU is widely used for general-purpose parallel applications as well as graphics applications. Especially, programmers using the GPU can easily create multiple threads with the help of APIs provided by GPU vendors. In GPU architecture, threads are grouped into a warp to run on the SIMD pipeline, […]