I am noticing what looks like the same drop-off in performance when introducing TupleN subclasses as expressed in "Understanding the JIT and tuning the implementation" [1].
I start my single-node cluster, run an algorithm which relies purely on Tuples, and measure the runtime. I execute a separate jar which executes essentially the same algorithm but using Gelly's Edge (which subclasses Tuple3 but does not add any extra fields) and now both the Tuple and Edge algorithms take twice as long. Has this been previously discussed? If not I can work up a demonstration. [1] https://flink.apache.org/news/2015/09/16/off-heap-memory.html Greg
