9408

In-Place Recursive Approach for All-Pairs Shortest Paths Problem Using OpenCL

Manish Pandey, Himanshu Pandey, Sanjay Sharma
Department of CSE, Maulana Azad National Institute of Technology, Bhopal, India
The 6th International Conference on Information Technology (ICIT 2013), 2013
@article{pandey2013place,

   title={IN-PLACE RECURSIVE APPROACH FOR ALL-PAIRS SHORTEST PATHS PROBLEM USING OPENCL},

   author={Pandey, Manish and Pandey, Himanshu and Sharma, Sanjay},

   year={2013}

}

Download Download (PDF)   View View   Source Source   

617

views

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 recursively partitions dense adjacency matrix into sub-matrices and computes the shortest path. Graphics Processing Units (GPUs) are massively parallel in nature and provide high computational speedup at very low cost in comparison to other very costly High Performance Computing (HPC) systems. Most common technique for Graph representation is to store it in the form of adjacency matrix and GPUs are highly suitable for performing matrix computations in parallel. OpenCL is a framework which provides unified development environment for executing programs in heterogeneous platforms. Using OpenCL, we can execute program on GPUs and/or CPUs. Our implementation is mainly targeted towards executing OpenCL kernels on GPU. In designing effective OpenCL programs, data transfers between host and device memory should be minimized. Our approach is in-place in nature, so it does not require additional memory space while performing computation and entire data movement takes place in a bulk between host and device memory.
VN:F [1.9.22_1171]
Rating: 4.7/5 (3 votes cast)
In-Place Recursive Approach for All-Pairs Shortest Paths Problem Using OpenCL, 4.7 out of 5 based on 3 ratings

* * *

* * *

Like us on Facebook

HGPU group

122 people like HGPU on Facebook

Follow us on Twitter

HGPU group

1179 peoples are following HGPU @twitter

* * *

Free GPU computing nodes at hgpu.org

Registered users can now run their OpenCL application at hgpu.org. We provide 1 minute of computer time per each run on two nodes with two AMD and one nVidia graphics processing units, correspondingly. There are no restrictions on the number of starts.

The platforms are

Node 1
  • GPU device 0: AMD/ATI Radeon HD 5870 2GB, 850MHz
  • GPU device 1: AMD/ATI Radeon HD 6970 2GB, 880MHz
  • CPU: AMD Phenom II X6 @ 2.8GHz 1055T
  • RAM: 12GB
  • OS: OpenSUSE 13.1
  • SDK: AMD APP SDK 2.9
Node 2
  • GPU device 0: AMD/ATI Radeon HD 7970 3GB, 1000MHz
  • GPU device 1: nVidia GeForce GTX 560 Ti 2GB, 822MHz
  • CPU: Intel Core i7-2600 @ 3.4GHz
  • RAM: 16GB
  • OS: OpenSUSE 12.2
  • SDK: nVidia CUDA Toolkit 6.0.1, AMD APP SDK 2.9

Completed OpenCL project should be uploaded via User dashboard (see instructions and example there), compilation and execution terminal output logs will be provided to the user.

The information send to hgpu.org will be treated according to our Privacy Policy

HGPU group © 2010-2014 hgpu.org

All rights belong to the respective authors

Contact us: