12983
David D. Prentiss
This work introduces a bilevel, stochastic optimization problem aimed at robust, regional evacuation network design and shelter location under uncertain hazards. A regional planner, acting as a Stackelberg leader, chooses among evacuation-route contraflow operation and shelter location to minimize the expected risk exposure to evacuees. Evacuees then seek an equilibrium with respect to risk exposure […]
View View   Download Download (PDF)   
Ugur Cekmez, Mustafa Ozsiginan, Musa Aydin, Ozgur Koray Sahingoz
In recent years, Unmanned Aerial Vehicles (UAVs) are emerged as an attractive technology for different types of military and civil applications which have gained importance in academic researches. In these emerging research areas, UAV autonomy gets a great part and mainly it refers the ability for automatic take-off, landing and path planning of UAVs. In […]
View View   Download Download (PDF)   
Gaurav Hajela, Manish Pandey
In this paper, different parallel implementations of Bellman-Ford algorithm on GPU using OpenCL are presented. These variants include Bellman-Ford for solving single source shortest path (SSSP) having two variants and Bellman-Ford for all pair shortest path (APSP) problems. Also, a comparative analysis of their performances on CPU and GPU is discussed in this paper.Write-write consistency […]
View View   Download Download (PDF)   
Guillaume Chapuis
The exponential growth in bioinformatics data generation and the stagnation of processor frequencies in modern processors stress the need for efficient implementations that fully exploit the parallel capabilities offered by modern computers. This thesis focuses on parallel algorithms and implementations for bioinformatics problems. Various types of parallelism are described and exploited. This thesis presents applications […]
View View   Download Download (PDF)   
Daniel Delling, Moritz Kobitzsch, Renato F. Werneck
Computing driving directions interactively on continental road networks requires preprocessing. This step can be costly, limiting our ability to incorporate new optimization functions, including traffic information or personal preferences. We show how the performance of the state-of-the-art customizable route planning (CRP) framework is boosted by GPUs, even though it has highly irregular structure. Our experimental […]
View View   Download Download (PDF)   
M. Matuszak
We introduce an algorithm for determining optimal transition paths between given configurations. The solution is obtained by solving variational equations for Freidlin–Wentzell action functionals. One of the applications of the method presented is a system controlling motion and redeployment between unit’s formations. The efficiency of the algorithm has been evaluated in a simple sandbox environment […]
View View   Download Download (PDF)   
Ugur Cekmez, Mustafa Ozsiginan, Ozgur Koray Sahingoz
The vehicle routing problem (VRP) is one of the most challenging combinatorial optimization problems, which has been studied for several decades. The number of solutions for VRP increases exponentially while the number of points, which must be visited increases. There are 3.0×10^64 different solutions for 50 visiting points in a direct solution, and it is […]
View View   Download Download (PDF)   
Guillaume Chapuis
The exponential growth in bioinformatics data generation and the stagnation of processor frequencies in modern processors stress the need for efficient implementations that fully exploit the parallel capabilities offered by modern computers. This thesis focuses on parallel algorithms and implementations for bioinformatics problems. Various types of parallelism are described and exploited. This thesis presents applications […]
View View   Download Download (PDF)   
Wu Qingshuang, Tong Chunya, Wang Qiang, Cheng Xiangfu
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 […]
View View   Download Download (PDF)   
Guillaume Chapuis, Hristo Djidjev, Rumen Andonov, Sunil Thulasidasan, Dominique Lavenier
The shortest-path problem is a fundamental computer science problem with applications in diverse areas such as transportation, robotics, network routing, and VLSI design. The problem is to find paths of minimum weight between pairs of nodes in edge-weighted graphs, where the weight of a path p is defined as the sum of the weights of […]
View View   Download Download (PDF)   
Alexander Dooms
Current pathplanning algorithms are not efficient enough to provide optimal pathplanning in dynamic environments for a large number of agents in real time. Furthermore, there are no real-time algorithms that fully use the potential of parallelism. The goal of this thesis is to find a basis for such an algorithm. Based on the literature study, […]
View View   Download Download (PDF)   
R. Bonfiglioli
This work investigates the approximated construction of Explicit Corridor Maps (ECMs). An ECM is a type of Navigation Mesh: a geometrical structure describing the walkable space of an environment that is used to speed-up the path-finding and crowd simulation operations occurring in the environment. Additional geometrical routines that take advantage of the GPGPU model are […]
Page 1 of 3123

* * *

* * *

Like us on Facebook

HGPU group

184 people like HGPU on Facebook

Follow us on Twitter

HGPU group

1313 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: