giraph-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Claudio Martella (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (GIRAPH-874) Specialized byte array partitions
Date Wed, 09 Apr 2014 13:00:20 GMT

    [ https://issues.apache.org/jira/browse/GIRAPH-874?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13964117#comment-13964117
] 

Claudio Martella commented on GIRAPH-874:
-----------------------------------------

This one looks good to me. reducing deduplication would do the job, and I'd commit this one.

> Specialized byte array partitions
> ---------------------------------
>
>                 Key: GIRAPH-874
>                 URL: https://issues.apache.org/jira/browse/GIRAPH-874
>             Project: Giraph
>          Issue Type: Improvement
>          Components: graph
>    Affects Versions: 1.1.0
>            Reporter: Craig Muchinsky
>             Fix For: 1.1.0
>
>         Attachments: GIRAPH-874-2.patch, GIRAPH-874.patch
>
>
> While doing some performance tuning I discovered that loading byte array partitions was
performing slower than expected. I found that the extra time was being spent allocating a
new vertex object for each distinct vertexId encountered (because vertexId object is the map
key). Similar to GIRAPH-704, the use of primitive maps can provide significant performance
benefit in this situation. By using a primitive map, the vertex object on the VertexIterator
can be reused perpetually because the vertexId object isn't used as the map key.
> When processing a large graph with 4B vertices the worker vertices requests were taking
~15 seconds each, but after implementing the above suggestion that number dropped down sub-second.



--
This message was sent by Atlassian JIRA
(v6.2#6252)

Mime
View raw message