35,630 Hits in 3.1 sec

Solving path problems on the GPU

Aydın Buluç, John R. Gilbert, Ceren Budak
2010 Parallel Computing  
We consider the computation of shortest paths on Graphic Processing Units (GPUs).  ...  Using the all-pairs shortest-paths problem as an example, we uncover potential gains over this class of algorithms.  ...  Thanks to Fenglin Liao and Arda Atali for their help during the initial implementation on Cuda.  ... 
doi:10.1016/j.parco.2009.12.002 fatcat:gpdffk6s4fa4tifrawtmq5x22a

Parallel Implementation of the Max_Min Ant System for the Travelling Salesman Problem on GPU

Gaurav Bhardwaj, Manish Pandey
2014 International Journal of Computer Applications  
In this paper, we have proposed an approach to implement Ant colony optimization algorithm especially Max-Min Ant System for solving Travelling Salesman problem on GPU.  ...  ACO is a nature based inspired algorithm based on heuristics to find the solution for combinatorial optimization problems such as TSP.  ...  At a given point where there are more than one path to reach to their food then ants distribute themselves on different paths and the path and lay pheromone trace on that path and return with same path  ... 
doi:10.5120/17455-7406 fatcat:iimclv7hyfalvine66fv7rwdka

Parallelizing Combinatorial Optimization Heuristics with GPUs

Mohammad Harun Rashid, Lixin Tao
2018 Advances in Science, Technology and Engineering Systems  
Our proposed work aims to design an efficient GPU framework for parallelizing optimization heuristics by focusing on the followings: distribution of data processing efficiently between GPU and CPU, efficient  ...  Our proposed GPU accelerated parallel models can be very efficient to parallelize heuristic methods for solving large scale combinatorial optimization problems.  ...  Repeated explorations of the problem space could be one of the methods for solving this problem.  ... 
doi:10.25046/aj030635 fatcat:566v2rey2bgyhfrjqqjvdnpihq

High-dimensional planning on the GPU

Joseph T Kider, Mark Henderson, Maxim Likhachev, Alla Safonova
2010 2010 IEEE International Conference on Robotics and Automation  
On the theoretical side, the GPU version of R*, called R*GPU, preserves all the theoretical properties of R* including its probabilistic bounds on suboptimality.  ...  In particular, we demonstrate how R* can be implemented on the GPU.  ...  The authors would also like to thank NVIDIA for providing graphics hardware to help test our implementation. The authors would like to thank Norm Badler and Amy Calhoun for all their insightful help.  ... 
doi:10.1109/robot.2010.5509470 dblp:conf/icra/KiderHLS10 fatcat:ltfuupnhxbfnfozn62rhsf2vfm

An Exact Dynamic Programming Based Method to Solve Optimisation Problems Using GPUs

Jonathan F. O'Connell, Christine L. Mumford
2014 2014 Second International Symposium on Computing and Networking  
The primary feature of this model is to efficiently use the computational and memory resources of the GPU, whilst still remaining abstract enough to allow implementation on a variety of problems.  ...  To demonstrate the effectiveness of the proposed model we test it against three problems; the 0-1 knapsack problem, the longest common subsequence problem, and the travelling salesman problem.  ...  The travelling salesman problem has no exact solving methodologies on the GPU that we are aware of, and this is most likely due to the memory constraints posed by GPU programming.  ... 
doi:10.1109/candar.2014.27 dblp:conf/ic-nc/OConnellM14 fatcat:c4sxc4qdevhbhlnao7gsioapr4

Parallel Approach for Optimized Travelling Salesman Problem using GPU

Mita A., K. Rajeswari
2016 International Journal of Computer Applications  
The Travelling Salesman Problem (TSP) is the most widely studied optimization problem used in many practical and real time applications.  ...  An Optimization algorithm to solve Graphic TSP instance with parallel approach using GPU is proposed.  ...  The architecture shows the flow of problem solving instance using parallel optimization algorithms on GPU.  ... 
doi:10.5120/ijca2016908151 fatcat:czvkrzeu2jfqdo37mvsbuhexe4

Blocked United Algorithm for the All-Pairs Shortest Paths Problem on Hybrid CPU-GPU Systems

2012 IEICE transactions on information and systems  
The first part is to solve the APSP sub-problem for a block of sub-matrices, and the other part is a matrix-matrix "multiplication" for the APSP problem.  ...  computation on the GPU.  ...  Acknowledgment The authors wish to thank the anonymous reviewers for their insightful comments and helpful suggestions which have improved this paper.  ... 
doi:10.1587/transinf.e95.d.2759 fatcat:ihxaqy25xranvdcaw6b55fwibq

Rapid Indirect Trajectory Optimization on Highly Parallel Computing Architectures

Thomas Antony, Michael J. Grant
2017 Journal of Spacecraft and Rockets  
to solve the problem.  ...  There may be numerical methods for solving boundary value problems, other than the multiple shooting method that are more suited for implementation on the GPU.  ... 
doi:10.2514/1.a33755 fatcat:uvr7qq7btzewtnle3myo6igiza

A Fine Tuned Hybrid Implementation for Solving Shortest Path Problems using Bellman Ford

Gaurav Hajela, Manish Pandey
2014 International Journal of Computer Applications  
In this paper a hybrid implementation for Bellman-Ford to solve shortest path problems is proposed using OpenCL.  ...  Here first parallel implementation for Bellman-Ford for single source shortest path (SSSP) problem and all pair shortest path (APSP) are analyzed on CPU and GPU and based on this analysis work is divided  ...  GPU are well suited for applications which involve the use of matrices due to its architecture. One of the applications is shortest path problems on graph which deals with matrices.  ... 
doi:10.5120/17347-7360 fatcat:c2qk7g4p2nfklkg2d56t3kesda

Performance Analysis of Single Source Shortest Path Algorithm over Multiple GPUs in a Network of Workstations using OpenCL and MPI

Krishnahari Thouti, S. R. Sathe
2013 International Journal of Computer Applications  
The two GPU devices are connected by SLI Bridge. Overall, on average we achieved performance improvement up to an order of 10-15x.  ...  In this paper, we present performance analysis of Dijkstra's single source shortest path algorithm over multiple GPU devices in a single machine as well as over a network of workstations using OpenCL and  ...  ARCHITECTURE OF GPU DEVICE General Purpose Computing on Graphics Processing Units (GPGPU) is the technique of using a GPU to solve computational problems which are traditionally handled by CPU.  ... 
doi:10.5120/13424-1104 fatcat:tcs7rlbwrbfejaoruwy4rfrmiq

Linear Assignment Problems Solved by Greedy 2-Opt Heuristics on GPU

Roberto M. Poveda Chaves et al., Roberto M. Poveda Chaves et al.,, TJPRC
2020 International Journal of Mechanical and Production Engineering Research and Development  
Our proposed method uses the Greedy 2-opt Local Search Heuristics proper to QAP and is fully implemented on Graphical Processing Units (GPUs).  ...  We solve Linear Assignment Problems (LAP) through a Parallel Local Search Heuristics.  ...  2-Opt Heuristics on GPU 2.3.Quadratic Assignment Problem (QAP).  ... 
doi:10.24247/ijmperdoct202028 fatcat:t7q7ultlzrcpte67pnq2itnjom

Architecture of a specialized back-end high performance computing-based PCE for flexgrid networks

Lluis Gifre, Luis Velasco, Nacho Navarro
2013 2013 15th International Conference on Transparent Optical Networks (ICTON)  
To deal with this problem, a High Performance Computing (HPC) Graphics Process Unit (GPU)-based cluster architecture is proposed in this paper.  ...  The objective of such re-optimizations is to compute network reconfigurations to be done based on the current state of network resources to achieve near-optimal resources utilization.  ...  ACKNOWLEDGMENTS This work has been partially funded by the European Community's Seventh Framework Programme FP7/2007-2013 under grant agreement n° 317999 IDEALIST project, from the Spanish Science Ministry  ... 
doi:10.1109/icton.2013.6602716 fatcat:qcumljrfqbgrpaipkqzve2mp5q

All-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model

Qingshuang Wu, Chunya Tong, Qiang Wang, Xiangfu Cheng
2013 Journal of Networks  
In view of the problem that computing shortest paths in a graph is a complex and time-consuming process, and the traditional algorithm that rely on the CPU as computing unit solely can't meet the demand  ...  of real-time processing, in this paper, we present an all-pairs shortest paths algorithm using MPI+CUDA hybrid programming model, which can take use of the overwhelming computing power of the GPU cluster  ...  However, With the problem of solving the shortest path constantly expanding, the amount of data needed to be deal with has a steady increase.  ... 
doi:10.4304/jnw.8.12.2797-2803 fatcat:det4bxhfqrbnlcelefbqb4i34y

Tracking Many Solution Paths of a Polynomial Homotopy on a Graphics Processing Unit [article]

Jan Verschelde, Xiangcheng Yu
2015 arXiv   pre-print
The data parallelism that provides the speedups stems from the evaluation and differentiation of the monomials in the same polynomial system at different data points, which are the points on the solution  ...  paths.  ...  We extended this in [26] to track one single path of a polynomial homotopy on a GPU. The focus in this paper is on the tracking of many paths.  ... 
arXiv:1505.00383v1 fatcat:uqjaxl62p5ftjh4cw7d25wl54q

CUDA Solutions for the SSSP Problem [chapter]

Pedro J. Martín, Roberto Torres, Antonio Gavilanes
2009 Lecture Notes in Computer Science  
We present several algorithms that solve the single-source shortestpath problem using CUDA.  ...  We have run them on a database, composed of hundreds of large graphs represented by adjacency lists and adjacency matrices, achieving high speedups regarding a CPU implementation based on Fibonacci heaps  ...  With this new technology available, the natural challenge is: "how can GPUs be used to solve the SSSP problem?".  ... 
doi:10.1007/978-3-642-01970-8_91 fatcat:ihigitf24rbnjejd6753iijrv4
« Previous Showing results 1 — 15 out of 35,630 results