I am working on a heuristic search project, and as soon as I got a working example, I began to compare it, finding that it was not fast enough. I started profiling it (not really an expert on how to do this for a project), and found that it spends 80% of its time collecting garbage.
I tried to find on the Internet how to reduce this time, but I could not find something in common. Can anyone recommend any literature on this topic or give some general recommendations on how garbage collection works? How should I look for a problem and what can cause it?
Change . I'm not talking about code profiling tools for which it’s true that the proposed Krom question is included point. Instead, I’m looking for general tips and tricks to make (in particular) garbage collection less time, since abstractions in this language complicate the idea of what you can do for sure. Is there something like that?
source
share