14404
Nasser Alqudami, Shin-Dug Kim
Color space conversion and downsampling are among the major computationally intensive steps in typical image and video codec standards, and accelerating these steps will improve the performances of these applications significantly. In this paper, we describe the parallel implementation of the color space conversion and downsampling as pre-processing steps for the JPEG encoder in a […]
View View   Download Download (PDF)   
Manish Pandey, Sanjay Sharma
All-pairs shortest path problem(APSP) finds a large number of practical applications in real world. We owe to present a highly parallel and recursive solution for solving APSP problem based on Kleene’s algorithm. The proposed parallel approach for APSP is implemented using an open standard framework OpenCL which provides a development environment for utilizing massive parallel […]
View View   Download Download (PDF)   
Wanglong Yan, Xiaohua Shi, Xin Yan, Lina Wang
Speeded-Up Robust Feature (SURF) algorithm is widely used for image feature detecting and matching in computer vision area. Open Computing Language (OpenCL) is a framework for writing programs that execute across heterogeneous platforms consisting of CPUs, GPUs, and other processors. This paper introduces how to implement an open-sourced SURF program, namely OpenSURF, on general purpose […]
View View   Download Download (PDF)   
Leonardo Jero
In recent years the need to solve complex problems that require large computing resources in shorter time has especially arisen. Some of these in the scientific field are: weather forecast, seismic simulations, chemical reactions simulation and studies on the human genoma [1]. All of them belong to the "Grand Challenge Problems" set. As can be […]
View View   Download Download (PDF)   
Manish Pandey, Himanshu Pandey, Sanjay Sharma
The all-pairs shortest paths (APSP) problem finds the shortest path distances between all pairs of vertices,and is one of the most fundamental graph problems. In this paper, a parallel recursive partitioning approach to APSP problem using Open Computing Language (OpenCL) for directed and dense graphs with no negative cyclesbased on R-Kleene algorithm, is presented, which […]
View View   Download Download (PDF)   
Jan Krekan, Lubomir Dobos, Matus Pleva
The main goal of this paper is to discuss new & faster methods for testing the strength of security used in today’s wireless networks. This paper discusses probabilistic password generation methodsfor testing the real security of networks protected by WPA/WPA2 PSK (Pre-shared key) standard (also known as Personal mode). The main advantage of using those […]
View View   Download Download (PDF)   
Orion Lawlor
We present a high performance GPU programming language, based on OpenCL, that is embedded in C++. Our embedding provides shared data structures, typesafe kernel invocation, and the ability to more naturally interleave CPU and GPU functions, similar to CUDA but with the portability of OpenCL. For expressivity, our language provides an abstraction that releases control […]

* * *

* * *

Follow us on Twitter

HGPU group

1731 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

365 people like HGPU on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: