Thanks Alexei for your inputs. 1. How does the EntryProcessor detect which node does the data reside given the key? I question it because I have configured I have PARTITIONED cache for which I haven't set any affinity function. It is partitioning the cache based on the hash function of the cached object. I didn't not follow how does ignite detect the partition just given the cache key?
2. I doubt that the EntryProcessor code is failing because memory is insufficient. I pulled out the node statistics before starting the test and verified that there is sufficient heap space available. Please find the statistics as below. visor> node Select node from: +=======================================================================================+ | # | Node ID8(@), IP | Node Type | Up Time | CPUs | CPU Load | Free Heap | +=======================================================================================+ | 0 | 9B989E4C(@n0), <ip1> | Server | 01:59:48 | 2 | 0.33 % | 89.00 % | | 1 | 1ED58F00(@n2), <ip2> | Server | 01:59:12 | 4 | 0.17 % | 77.00 % | | 2 | 56214422(@n3), <ip3> | Server | 01:57:42 | 2 | 0.33 % | 92.00 % | | 3 | A57219B6(@n1), <ip4> | Server | 01:57:25 | 4 | 0.50 % | 87.00 % | Could you detail on how do EntryProcessor's work? If it was suppose to execute on the node where the data resides why does crash or take exponentially more time than it would take with executing any affinity code? Thanks. -- View this message in context: http://apache-ignite-users.70518.x6.nabble.com/Simulating-Graph-Dependencies-With-Ignite-tp5282p5572.html Sent from the Apache Ignite Users mailing list archive at Nabble.com.
