The heap profile shows active memory, memory the runtime believes is in use by the go program (ie: hasn’t been collected by the garbage collector). When the GC does collect memory the profile shrinks, but no memory is returned to the system. Your future allocations will try to use memory from the pool of previously … Read more
At this place the myInt is stored and the myString reference value (which is the reference to the real string value) Let’s make sure you’re not going down bad paths here. First off, it’s unclear to me why you re-ordered the integer and the string in the diagram compared to the source code. It is … Read more
Here’s a list of resources I had noted down. Some of these explain how the heap/garbage collection works and some have details on how to configure everything. IBM How does garbage collection work? Detailed description of garbage collection Generational and concurrent garbage collection Sun Turbo-charging Java HotSpot Virtual Machine, v1.4.x to Improve the Performance and … Read more
If you’re using a 32-bit build of Python, you might want to try a 64-bit version. It is possible for a process to address at most 4GB of RAM using 32-bit addresses, but typically (depending on the OS), one gets much less. It sounds like your Python process may be hitting this limit. 64-bit addressing … Read more
As a sanity check, I have a button to force GC. When I push that, I quickly get 6GB back. Doesn’t that prove my 6 arrays were not being referenced and COULD have been collected had the GC knew/wanted to? You are probably better off asking When does the GC automatically collect “garbage” memory?. Off … Read more
The idea is that clear() is only called when you want to re-use the HashMap. Reusing an object should only be done for the same reason it was used before, so chances are that you’ll have roughly the same number of entries. To avoid useless shrinking and resizing of the Map the capacity is held … Read more
As iterparse iterates over the entire file a tree is built and no elements are freed. The advantage of doing this is that the elements remember who their parent is, and you can form XPaths that refer to ancestor elements. The disadvantage is that it can consume a lot of memory. In order to free … Read more
If you get an unexpected MemoryError and you think you should have plenty of RAM available, it might be because you are using a 32-bit python installation. The easy solution, if you have a 64-bit operating system, is to switch to a 64-bit installation of python. The issue is that 32-bit python only has access … Read more
I’ll try to explain in short. What is data alignment? The architecture in you computer is composed of processor and memory. Memory is organized in cells, so: 0x00 | data | 0x01 | … | 0x02 | … | Each memory cell has a specified size, amount of bits it can store. This is architecture … Read more
On x86 calling conventions, the return value for integers and pointers is on the EAX register. The following is an example of that: int func() { if(0) return 5; // otherwise error C4716: ‘func’ : must return a value } int main() { int a; a = func(); } Compiling with cl.exe /Zi, MSVC++10: push … Read more