Internship Plan - 14/07/14

1. Explore path search algorithms using CUDA Dynamic Parallelism 
1. Cut down Honours Project
2. Extend Tests
3. Weighted vs Non-Weighted
2. Fine grained dynamic parallelism support for Dijkstra
1. Do more practical work
3. Examine Frontier Sets
4. Parallelise A*
5. Compare to Ortega-Arranz Implementation
6. Read Requirements of Journals
7. Plan out what the paper will look like

Possible Journals and Conferences

1. High Performance Computing & Simulation
2. Concurrency and Computation, Practice and Experience
3. GPU Gems
4. GTC