7886

Posts

Jun, 26

GreenGPU: A Holistic Approach to Energy Efficiency in GPU-CPU Heterogeneous Architectures

In recent years, GPU-CPU heterogeneous architectures have been increasingly adopted in high performance computing, because of their capabilities of providing high computational throughput. However, the energy consumption is a major concern due to the large scale of such kind of systems. There are a few existing efforts that try to lower the energy consumption of […]
Jun, 26

Multi-GPU Island-Based Genetic Algorithm for Solving the Knapsack Problem

This paper introduces a novel implementation of the genetic algorithm exploiting a multi-GPU cluster. The proposed implementation employs an island-based genetic algorithm where every GPU evolves a single island. The individuals are processed by CUDA warps, which enables the solution of large knapsack instances and eliminates undesirable thread divergence. The MPI interface is used to […]
Jun, 26

Compiling a high-level language for GPUs: (via language support for architectures and compilers)

Languages such as OpenCL and CUDA offer a standard interface for general-purpose programming of GPUs. However, with these languages, programmers must explicitly manage numerous low-level details involving communication and synchronization. This burden makes programming GPUs difficult and error-prone, rendering these powerful devices inaccessible to most programmers. We desire a higher-level programming model that makes GPUs […]
Jun, 26

GPU-based Cloud Computing for Comparing the Structure of Protein Binding Sites

In this paper, we present a novel approach for using a GPU-based Cloud computing infrastructure to efficiently perform a structural comparison of protein binding sites. The original CPU-based Java version of a recent graph-based algorithm called SEGA has been rewritten in OpenCL to run on NVIDIA GPUs in parallel on a set of Amazon EC2 […]
Jun, 26

Evaluation of likelihood functions on CPU and GPU devices

We describe parallel implementations of an algorithm used to evaluate the likelihood function used in data analysis. The implementations run, respectively, on CPU and GPU, and both devices cooperatively (hybrid). CPU and GPU implementations are based on OpenMP and OpenCL, respectively. The hybrid implementation allows the application to run also on multi-GPU systems (not necessarily […]
Jun, 25

A Parallel Algorithm Development Model for the GPU Architecture

Parallel computing has been in use for decades, and throughout many researchers have sought to define a model for algorithm design for such a platform. Valiant developed a model for parallel computing, which was later extended to later include multi-core processors, but it still may not be best suited for the unique GPU architecture. With […]
Jun, 25

Improving GPU Simulations of Spiking Neural P Systems

In this work we present further extensions and improvements of a Spiking Neural P system (for short, SNP systems) simulator on graphics processing units (for short, GPUs). Using previous results on representing SNP system computations using linear algebra, we analyze and implement a computation simulation algorithm on the GPU. A two-level parallelism is introduced for […]
Jun, 25

GPU Implementation of the Branch and Bound method for knapsack problems

In this paper, we propose an efficient implementation of the branch and bound method for knapsack problems on a CPU-GPU system via CUDA. Branch and bound computations can be carried out either on the CPU or on a GPU according to the size of the branch and bound list. A better management of GPUs memories, […]
Jun, 25

Approximate Principal Direction Trees

We introduce a new spatial data structure for high dimensional data called the emph{approximate principal direction tree} (APD tree) that adapts to the intrinsic dimension of the data. Our algorithm ensures vector-quantization accuracy similar to that of computationally-expensive PCA trees with similar time-complexity to that of lower-accuracy RP trees. APD trees use a small number […]
Jun, 25

An Adaptative Multi-GPU based Branch-and-Bound. A Case Study: the Flow-Shop Scheduling Problem

Solving exactly Combinatorial Optimization Problems (COPs) using a Branch-and-Bound (B&B) algorithm requires a huge amount of computational resources. Therefore, we recently investigated designing B&B algorithms on top of graphics processing units (GPUs) using a parallel bounding model. The proposed model assumes parallelizing the evaluation of the lower bounds on pools of sub-problems. The results demonstrated […]
Jun, 23

3rd Annual International Conference on Advances in Distributed and Parallel Computing, ADPC 2012

Topics of interest include, but are not limited to: * Parallel Computing * Cluster Computing * Volunteer Computing * Grid and Cloud Computing * Multi-core Architectures and Algorithms * GPU Programming * Web Services and Internet Computing * Cooperative and Collaborative Computing * Peer-to-peer Computing * Mobile and Ubiquitous Computing * New Parallel System Concepts […]
Jun, 23

Fast motion detection from airborne videos using graphics processing unit

In our previous work, we proposed a joint optical flow and principal component analysis (PCA) approach to improve the performance of optical flow based detection, where PCA is applied on the calculated two-dimensional optical flow image, and motion detection is accomplished by a metric derived from the two eigenvalues. To reduce the computational time when […]

* * *

* * *

HGPU group © 2010-2024 hgpu.org

All rights belong to the respective authors

Contact us: