Yes, I've already profiled it, and found a couple of issues that led to some improvements, but now I can't see any major bottleneck. It might be general math lib implementation issues, or memory inefficiencies that cause too many cache misses. For example, anything allocated on the heap is allocated via new, maybe I might try with some pool.
For loop breaking performances?
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement