Home

On Aug 20, 9:49 pm, "Scott McPhillips [MVP]" <org-dot-mvps-at-
scottmcp> wrote:
> <contactmayankj...@gmail.com> wrote in message
>
> news:1187626911.559829.298860@i38g2000prf.googlegroups.com...
>
> > Hi,
>
> > Its said that one should avoid dynamic allocation of memory, as it de-
> > fragment the memory into small chunks and allocation of memory is a
> > costly process in terms of efficiency. So what is the best solution to
> > handle to situation in which we need to allocate memory at run time.
>
> Dynamic allocation is the ONLY solution to allocating memory at run time
> (unless you use a language that provides garbage collection). If you have
> problems with fragmentation then the only thing you can do is smarter
> dynamic allocation, which requires knowledge of the allocation requirements
> of your application.

What are the smarter way of allocating memory. I know the time and all
details about the memory requirement of my application. So how can it
help me in improving the efficiency of my code. Can you write a sample
code for this.
What is pool allocator?
Regards
Mayank Jain(Nawal)
contactmayankjain@gmail.com
9818390836

previous
next

Re: Dependency Loop seems unavoidable
Re: vector has segfault null dereference
Re: Visual C++ Express Edition or lcc-win32?
Xah's Edu Corner: Under the spell of Leibniz's dream
Re: Conversion from binary
Dzieci Niczyje
Fundacja Iskierka
Fundacja Sloneczko
Krwinka
Nasze Dzieci