incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Thomas Jungblut (JIRA)" <>
Subject [jira] [Commented] (HAMA-359) Development of Shortest Path Finding Algorithm
Date Thu, 19 May 2011 09:23:47 GMT


Thomas Jungblut commented on HAMA-359:

This could be one option. 
My approach would be to use an iterator during the message sending phase.  (In BSPPeer)
Currently we are just bundling the messages in the MessageBundle class. This gets cleaned
up (completely) after the method end, same with outgoing queue which gets cleared afterwards.

We can use iterator.remove to smoothly release references to the objects. This should cause
more minor collections instead of one or two larger ones.

> 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: Thomas Jungblut
>              Labels: gsoc, gsoc2011, mentor
>             Fix For: 0.3.0
>         Attachments: HAMA-359-v2.patch, HAMA-359-v3.patch, HAMA-359-v4.patch, HAMA-359.patch,
>   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