[Update – Sep 30, 2010]
Since I studied a lot on this & related topics, I’ll write whatever tips I gathered out of my experiences and suggestions provided in answers over here-
1) Use memory profiler (try CLR Profiler, to start with) and find the routines which consume max mem and fine tune them, like reuse big arrays, try to keep references to objects to minimal.
2) If possible, allocate small objects (less than 85k for .NET 2.0) and use memory pools if you can to avoid high CPU usage by garbage collector.
3) If you increase references to objects, you’re responsible to de-reference them the same number of times. You’ll have peace of mind and code probably will work better.
4) If nothing works and you are still clueless, use elimination method (comment/skip code) to find out what is consuming most memory.
Using memory performance counters inside your code might also help you.
Hope these help!
[Original question]
Hi!
I’m working in C#, and my issue is out of memory exception.
I read an excellent article on LOH here ->
http://www.simple-talk.com/dotnet/.net-framework/the-dangers-of-the-large-object-heap/
Awesome read!
And,
http://dotnetdebug.net/2005/06/30/perfmon-your-debugging-buddy/
My issue:
I am facing out of memory issue in an enterprise level desktop application. I tried to read and understand stuff about memory profiling and performance counter (tried WinDBG also! – little bit) but am still clueless about basic stuff.
I tried CLR profiler to analyze the memory usage. It was helpful in:
-
Showing me who allocated huge chunks of memory
-
What data type used maximum memory
But, both, CLR Profiler and Performance Counters (since they share same data), failed to explain:
-
The numbers that is collected after each run of the app – how to understand if there is any improvement?!?!
-
How do I compare the performance data after each run – is lower/higher number of a particular counter good or bad?
What I need:
I am looking for the tips on:
-
How to free (yes, right) managed data type objects (like arrays, big strings) – but not by making GC.Collect calls, if possible. I have to handle arrays of bytes of length like 500KB (unavoidable size 🙁 ) every now and then.
-
If fragmentation occurs, how to compact memory – as it seems that .NET GC is not really effectively doing that and causing OOM.
-
Also, what exactly is 85KB limit for LOH? Is this the size of the object of the overall size of the array? This is not very clear to me.
-
What memory counters can tell if code changes are actually reducing the chances of OOM?
Tips I already know
-
Set managed objects to null – mark them garbage – so that garbage collector can collect them. This is strange – after setting a string[] object to null, the # bytes in all Heaps shot up!
-
Avoid creating objects/arrays > 85KB – this is not in my control. So, there could be lots of LOH.
3.
Memory Leaks Indicators: # bytes in all Heaps increasing Gen 2 Heap Size increasing # GC handles increasing # of Pinned Objects increasing # total committed Bytes increasing # total reserved Bytes increasing Large Object Heap increasing
My situation:
- I have got 4 GB, 32-bit machine with Wink 2K3 server SP2 on it.
- I understand that an application can use <= 2 GB of physical RAM
- Increasing the Virtual Memory (pagefile) size has no effect in this scenario.
As its OOM issue, I am only focusing on memory related counters only.
Please advice! I really need some help as I’m stuck because of lack of good documentation!
Nayan, here are the answers to your questions, and a couple of additional advices.
Advices:
Something that already has been proposed: pre-allocate and pool your buffers.
A different approach which can be effective if you can use any collection instead of contigous array of bytes (this is not the case if the buffers are used in IO): implement a custom collection which internally will be composed of many smaller-sized arrays. This is something similar to std::deque from C++ STL library. Since each individual array will be smaller than 85K, the whole collection won’t get in LOH. The advantage you can get with this approach is the following: LOH is only collected when a full GC happens. If the byte[] in your application are not long-lived, and (if they were smaller in size) would get in Gen0 or Gen1 before being collected, this would make memory management for GC much easier, since Gen2 collection is much more heavyweight.
An advice on the testing & monitoring approach: in my experience, the GC behavior, memory footprint and other memory-related stuff need to be monitored for quite a long time to get some valid and stable data. So each time you change something in the code, have a long enough test with monitoring the memory performance counters to see the impact of the change.
I would also recommend to take a look at % Time in GC counter, as it can be a good indicator of the effectiveness of memory management. The larger this value is, the more time your application spends on GC routines instead of processing the requests from users or doing other ‘useful’ operations. I cannot give advices for what absolute values of this counter indicate an issue, but I can share my experience for your reference: for the application I am working on, we usually treat % Time in GC higher than 20% as an issue.
Also, it would be useful if you shared some values of memory-related perf counters of your application: Private bytes and Working set of the process, BIAH, Total committed bytes, LOH size, Gen0, Gen1, Gen2 size, # of Gen0, Gen1, Gen2 collections, % Time in GC. This would help better understand your issue.