Claudio Martella commented on GIRAPH-185:

If I can add something, I'd run two tests:

(1) Pagerank with the given randomgraph generator in the current benchmark 
class. I'd create a very small graph (100 vertices) with many edges. The 
complexity of PR is O(E) for message creation. This should give us a 
"realistic" test, as often O(E) is the case.
(2) Dummy algorithm that with a small graph creates 10k (just an example) 
messages for each other vertex in the graph, per superstep. This should create 
a lot of messages per worker (again, 100 vertices in the graph should be ok). 
This one should put more pressure on the datastructure.

If want me to test it on a bigger cluster (we have 16 machines here), just 
upload the code and I'll run it for you.
> Improve concurrency of putMsg / putMsgList
> ------------------------------------------
>                 Key: GIRAPH-185
>                 URL: https://issues.apache.org/jira/browse/GIRAPH-185
>             Project: Giraph
>          Issue Type: Improvement
>          Components: graph
>    Affects Versions: 0.2.0
>            Reporter: Bo Wang
>            Assignee: Bo Wang
>             Fix For: 0.2.0
>         Attachments: GIRAPH-185.patch, GIRAPH-185.patch
>   Original Estimate: 2h
>  Remaining Estimate: 2h
> Currently in putMsg / putMsgList, a synchronized closure is used to protect 
> the whole transientInMessages when adding the new message. This lock prevents 
> other concurrent calls to putMsg/putMsgList and increases the response time. 
> We should use fine-grain locks to allow high concurrency in message 
> communication.

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: 
For more information on JIRA, see: http://www.atlassian.com/software/jira


Reply via email to