Word on the street is that for loops in scala are slower than while loops.
Slow:
for (i <- 0 until 10000) {
f(i)
}
Fast:
var i = 0
while (i < 10000) {
f(i)
i += 1
}
How do I use hprof to tell whether the for loops are the bottleneck in my code? I'm profiling my code using -agentlib:hprof=cpu=samples
, what would the method be in the "CPU SAMPLES" section?
I'd like to know where to focus my optimization efforts. Are for loops the bottleneck?
I think you may have more luck with tools specialized with profiling such as yourkit or visualvm.
They usually have interface to capture CPU sample and then drill down to see what calls consumed most CPU cycles.
Bottlenecks of any kind would show up (like taking 95% of the CPU time) and then you could drill down until you see what methods of yours (or the library) is on the call stack for those hot spots. Then you can see if for loops are involved.
Put each loop in its own method, then compare the time taken by the methods. And use enough iterations to actually take some time (or wrap those in another loop). 10000 iterations should take microseconds; that's hard for a profiler to measure. Try a billion (or 100k iteratons of 10k iterations).
Also, if f(i)
is expensive, that will take far more time than the loop will. Also, if f(i)
doesn't actually do anything, it might get optimized away entirely. So make sure it does (e.g. update a counter somewhere, compute a sum, or something).
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With