f0dder,
i just downloaded the mem manager and am going throught its source.
I will go through with implementing my algo. If it does give some speed gains then its good. As its in a library the good thing is that only the source code needs to be recompiled and it can be used only in specific places where you want it to be.
Same here, but then again, extra speed never hurts ;)
So well, i will post the source when i am done in the algorithms forum.
The bad part - I have to read (yet another) 2000 lines of code, thanks to Paul Nettle.
i just downloaded the mem manager and am going throught its source.
I will go through with implementing my algo. If it does give some speed gains then its good. As its in a library the good thing is that only the source code needs to be recompiled and it can be used only in specific places where you want it to be.
memory allocation hasn't really been a problem for me yet
Same here, but then again, extra speed never hurts ;)
So well, i will post the source when i am done in the algorithms forum.
The bad part - I have to read (yet another) 2000 lines of code, thanks to Paul Nettle.
Same here, but then again, extra speed never hurts
If it has higher memory overhead, it might :)
f0dder,
I saw the mmngr source code but it too uses malloc internally and maintains a hash table to keep track of the memory allocations.
So my algo cant really be applied in windows cause as far as I know heap allocation is the os?s responsibility and there?s no way to override it. Or is there?
I saw the mmngr source code but it too uses malloc internally and maintains a hash table to keep track of the memory allocations.
So my algo cant really be applied in windows cause as far as I know heap allocation is the os?s responsibility and there?s no way to override it. Or is there?
You can alloc big chunks with HeapAlloc or VirtualAlloc.