We need to parallelize a set of an already implemented graph analysis package (in C). We are interested in 4 groups of these algorithms, i.e. less than 30% of the whole package.
These algorithms will be:
1. Shortest Path Related Functions, such as: graph_diameter
2. Centrality measures, such as graph_betweenness and degree
3. Transitivity and Clustering Coefficient
4. Community Structure Detection, such as graph_modularity
Note: The complete list of the needed functions to be paralleled will be provided later.
Besides this, we also are interested in having a GPGPUs parallelization of simply three functions of the whole list of the needed functions. Please note that the functionality of these implemented algorithms are similar, as such, when you parallel the shortest path length function for example, this will do half of the work towards parallelizing betweenness centrality functions.
An important issue also is the graph data structure, as such, we need to make the "library" to build a graph of a compact data structure, as the weighted and unweighted adjacency list, considering as an option a compressed data structure for sparse graphs.
Needed skills are: C language, OpenMP, Data structure, Multi-core parallel programming, Cuda or Open Cl, graph theory
14 freelancers are bidding on average €1343 for this job
Hello, sir. I have enough experience in C++ programming and algorithm. And I'm also interested in your job. I want to work with you. Thanks. Regards.
hi from spain, its easy for us doing your Project, we are accustomed to make physics & Engineering projects, Our work is Quickly and with high quality, Best regards, Mike, www. ninosoftware. com
We are a company having 30+ engineers working. We will complete this project. It may take less time. but completion with perfection is the main matter.