[
https://issues.apache.org/jira/browse/IGNITE-3905?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15529389#comment-15529389
]
Andrey Gura commented on IGNITE-3905:
-------------------------------------
One more idea for increase perfromance. In case of partitioned cache we usually
have a few backups so sorting of all nodes is redundant. We can just find a
{{backups + 1}} minimal ellements in collection if {{nodes * (backups + 1)}} <
{{nodes * log(nodes)}}.
> Optimize RendezvousAffinityFunction
> -----------------------------------
>
> Key: IGNITE-3905
> URL: https://issues.apache.org/jira/browse/IGNITE-3905
> Project: Ignite
> Issue Type: Bug
> Components: cache, community, general
> Affects Versions: 1.6
> Reporter: Alexei Scherbakov
> Priority: Critical
> Fix For: 1.8
>
>
> Currently RendezvousAffinityFunction.assignPartition generates a lot of
> garbage if called very often, on example in case of rebalancing a lot of
> caches.
> This causes excessive pressure on GC, which is not always fast enough to
> clear memory, producing long GC pauses leading to node segmentation.
> We should cache calculation of nodeHashBytes in node attribute or resort to
> more efficient node hash calculation.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
