Difference between revisions of "GvSIG GSoC 2015 Ideas"

From OSGeo
Jump to navigation Jump to search
(Created page with "Use this page to jot down and develop any good idea for the Google Summer of Code 2015 program with gvSIG project. Please, use the gvSIG mailing lists for discussion and chec...")
 
Line 8: Line 8:
 
* '''Product''': gvSIG Desktop
 
* '''Product''': gvSIG Desktop
 
* '''Possible mentor''':  
 
* '''Possible mentor''':  
* '''Possible student''':
+
* '''Possible student''':  
 +
 
 +
[https://code.google.com/p/aparapi/ Aparapi] is a library which allows Java developers to take advantage of the compute power of GPU and APU devices by executing data parallel code fragments on the GPU rather than being confined to the local CPU. It does this by converting Java bytecode to OpenCL at runtime and executing on the GPU, if for any reason Aparapi can't execute on the GPU it will execute in a Java thread pool.
 +
 
 +
Large amounts of geographic data-processing might be involved in the execution of a geoprocess. And many geoprocessing algorithms are suitable to be converted to parallel code, allowing for much better execution performance and capacity.
 +
 
 +
The objective would be to integrate the Aparapi library in gvSIG, so it might be used in the development of new parallel geoprocessing algorithms which take advantage of current GPUs. Also some geoprocesses would have to be developed or converted to use the Aparapi library to check the benefits and the proper operation of the idea.
 +
 
 +
== Port Network Analysis Extension to gvSIG 2.x branch ==
 +
 
 +
* '''Product''': gvSIG Desktop
 +
* '''Possible mentor''':
 +
* '''Possible students''':
 +
 
 +
Port gvSIG Network Analysis Extension from 1.12 release to the new 2.x branch.
 +
 
 +
Network Analysis extension allows to calculate routes, service areas, origin - destination matrices, connectivity analysis... It supports speeds for several vehicles, barriers, turn costs, etc.
 +
 
 +
Improvement: Use GraphHopper [http://graphhopper.com/] library to use new algorithm Contraction Hierarchies (much faster) when calculating routes.
 +
 
 +
Skills needed: Java, Eclipse development. Some notions about Maven would be interesting.

Revision as of 02:24, 19 February 2015

Use this page to jot down and develop any good idea for the Google Summer of Code 2015 program with gvSIG project. Please, use the gvSIG mailing lists for discussion and check Google Summer of Code 2014 2013, 2012, 2011, 2010, 2009 ideas pages for examples or reference.


Add OpenCL support with Aparapi for Geoprocessing in gvSIG desktop

  • Product: gvSIG Desktop
  • Possible mentor:
  • Possible student:

Aparapi is a library which allows Java developers to take advantage of the compute power of GPU and APU devices by executing data parallel code fragments on the GPU rather than being confined to the local CPU. It does this by converting Java bytecode to OpenCL at runtime and executing on the GPU, if for any reason Aparapi can't execute on the GPU it will execute in a Java thread pool.

Large amounts of geographic data-processing might be involved in the execution of a geoprocess. And many geoprocessing algorithms are suitable to be converted to parallel code, allowing for much better execution performance and capacity.

The objective would be to integrate the Aparapi library in gvSIG, so it might be used in the development of new parallel geoprocessing algorithms which take advantage of current GPUs. Also some geoprocesses would have to be developed or converted to use the Aparapi library to check the benefits and the proper operation of the idea.

Port Network Analysis Extension to gvSIG 2.x branch

  • Product: gvSIG Desktop
  • Possible mentor:
  • Possible students:

Port gvSIG Network Analysis Extension from 1.12 release to the new 2.x branch.

Network Analysis extension allows to calculate routes, service areas, origin - destination matrices, connectivity analysis... It supports speeds for several vehicles, barriers, turn costs, etc.

Improvement: Use GraphHopper [1] library to use new algorithm Contraction Hierarchies (much faster) when calculating routes.

Skills needed: Java, Eclipse development. Some notions about Maven would be interesting.