You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@ignite.apache.org by "Vladimir Ozerov (JIRA)" <ji...@apache.org> on 2016/03/31 13:41:25 UTC

[jira] [Updated] (IGNITE-2579) Investigate HashMap.Node[] allocations from GridCacheMvccManager$3

     [ https://issues.apache.org/jira/browse/IGNITE-2579?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Vladimir Ozerov updated IGNITE-2579:
------------------------------------
    Issue Type: Task  (was: Sub-task)
        Parent:     (was: IGNITE-2232)

> Investigate HashMap.Node[] allocations from GridCacheMvccManager$3
> ------------------------------------------------------------------
>
>                 Key: IGNITE-2579
>                 URL: https://issues.apache.org/jira/browse/IGNITE-2579
>             Project: Ignite
>          Issue Type: Task
>          Components: cache
>    Affects Versions: 1.5.0.final
>            Reporter: Vladimir Ozerov
>            Assignee: Vladimir Ozerov
>              Labels: performance
>             Fix For: 1.6
>
>
> *Problem* 
> See GridCacheMvccManager.addFuture() method. We create a weird HashSet there with internal table size == 5. Can we have something more efficient here?
> *Proposed solution*
> Need to run single get-put benchmarks and check usual size of this collection. If it is often equal to 1, then instead of allocating the whole collection, we'd better to have a singleton first and expand to collection if there are more elements. 
> Please pay attention that collection usually used as monitor in some synchronized blocks.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)