incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Andreas Gebhardt (JIRA)" <>
Subject [jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm
Date Sun, 24 Apr 2011 14:57:05 GMT


Andreas Gebhardt commented on HAMA-359:

Very nice!

Beside Metis/Parmetis there exists another partitioning tool named Scotch --
-- this is amongst others used in SHARC algorithm (e.g.
This is a algorithm for shortest path (via Dijkstra), the incredible speed is achieved by
massive preprocessing. The research of very fast dijkstra implementation seemed to begun for
the 9th DIMACS implementation challenge ( Hopefully
the combination of both can be very interesting.

On there web-site of DIMACS the 10th challenge is for graph partitoning

While searching for the address of SCOTCH i found this link
- there are some additional links at the end of the thread.


> Development of Shortest Path Finding Algorithm
> ----------------------------------------------
>                 Key: HAMA-359
>                 URL:
>             Project: Hama
>          Issue Type: New Feature
>          Components: examples
>    Affects Versions: 0.2.0
>            Reporter: Edward J. Yoon
>            Assignee: Edward J. Yoon
>              Labels: gsoc, gsoc2011, mentor
>             Fix For: 0.3.0
>   Original Estimate: 2016h
>  Remaining Estimate: 2016h
> The goal of this project is development of parallel algorithm for finding a Shortest
Path using Hama BSP.

This message is automatically generated by JIRA.
For more information on JIRA, see:

View raw message