Posts
Jul, 1
Fault Tree Analysis Speed-up with GPU Parallel Computing
The reliability analysis of critical systems can be performed using fault tree analysis. One of the common approaches used for fault tree analysis is Monte Carlo simulation. The purpose of this paper is therefore to show an algorithm to speed up Monte Carlo simulation for analyzing fault tree with parallel computing in GPU. To this […]
Jul, 1
CUDA-accelerated Hierarchical K-means
In 2011, more than 350 billion photos are generated in a single year. Thus, it is indispensable to use statistic tools for managing data, such as clustering. K-Means is one of the most used clustering methods because it is easy to implement. However, when the number of clusters grows larger, the speed of K-Means become […]
Jun, 30
A Scheduling Framework for a Heterogeneous Parallel Architecture
Scheduling on heterogeneous parallel and distributed computing environment has been studied for decades. Based on different assumptions, researchers have proposed several algorithms and heuristics aiming to improve the performance of parallel applications. Most of these works focus on clusters of CPUs or grid-based environments where heterogeneity is created by processors and networks of varying speeds. […]
Jun, 30
High-performance blob-based iterative three-dimensional reconstruction in electron tomography using multi-GPUs
BACKGROUND: Three-dimensional (3D) reconstruction in electron tomography (ET) has emerged as a leading technique to elucidate the molecular structures of complex biological specimens. Blob-based iterative methods are advantageous reconstruction methods for 3D reconstruction in ET, but demand huge computational costs. Multiple graphic processing units (multi-GPUs) offer an affordable platform to meet these demands. However, a […]
Jun, 30
Accelerating large-scale protein structure alignments with graphics processing units
BACKGROUND: Large-scale protein structure alignment, an indispensable tool to structural bioinformatics, poses a tremendous challenge on computational resources. To ensure structure alignment accuracy and efficiency, efforts have been made to parallelize traditional alignment algorithms in grid environments. However, these solutions are costly and of limited accessibility. Others trade alignment quality for speedup by using high-level […]
Jun, 30
Performance of GPU for Pricing Financial Derivatives: Convertible Bonds
Financial derivatives are financial instruments whose payoff is linked to some fundamental financial assets or indices. They are essential tools for speculation and risk-management. This paper focuses on the pricing of a common type of derivatives: convertible bonds (CBs), which incorporate the features of both bonds and stocks. Chambers and Lu propose a popular two-factor […]
Jun, 30
Point Based Color Bleeding with CUDA and Caching
The main goal of this project was to explore the possibility of applying CUDA to the Point Based Color Bleeding global illumination algorithm. This project tackled the creation of surfels, the storage of surfels in an octree, representation of an octree in CUDA, and the transversal of an octree in CUDA. Future work will include […]
Jun, 29
Adaptive Sequential Posterior Simulators for Massively Parallel Computing Environments
Massively parallel desktop computing capabilities now well within the reach of individual academics modify the environment for posterior simulation in fundamental and potentially quite advantageous ways. But to fully exploit these benefits algorithms that conform to parallel computing environments are needed. Sequential Monte Carlo comes very close to this ideal whereas other approaches like Markov […]
Jun, 29
A Parallel Image Segmentation Algorithm on GPUs
Image segmentation is a computationally expensive task that continuously presents performance challenges due to the increasing volume of available high resolution remote sensing images. Nowadays, Graphics Processing Units (GPUs) are emerging as an attractive computing platform for general purpose computations due to their extremely high floating-point processing performance and their comparatively low cost. In the […]
Jun, 29
Shallow Water Simulation on GPUs for Sparse Domains
Efficient stencil operations are essential in explicit schemes for evolutionary PDEs. In particular, for conservation and balance laws, the solution will in many cases have non-constant values only in a portion of the grid. We present novel methods that through simple observation of the stencil and the distribution of conserved quantities, reduce both the memory […]
Jun, 29
An Optimized Large-Scale Hybrid DGEMM Design for CPUs and ATI GPUs
In heterogeneous systems that include CPUs and GPUs, the data transfers between these components play a critical role in determining the performance of applications. Software pipelining is a common approach to mitigate the overheads of those transfers. In this paper we investigate advanced software-pipelining optimizations for the double-precision general matrix multiplication (DGEMM) algorithm running on […]
Jun, 29
GPUs as an Opportunity for Offloading Garbage Collection
GPUs have become part of most commodity systems. Nonetheless, they are often underutilized when not executing graphics-intensive or special-purpose numerical computations, which are rare in consumer workloads. Emerging architectures, such as integrated CPU/GPU combinations, may create an opportunity to utilize these otherwise unused cycles for offloading traditional systems tasks. Garbage collection appears to be a […]