Hi,
Im not sure if this is the righ forum for this question. Pls redirect
me to the correct forum in that case.
I have a requirement to implement a memory pool meant for storing
pointers only (which constiture an iterator over an array type data
structure). Heap allocations are to be kept to a minimum (e.g. only
while expanding the pool size). Memory for an instance of an iterator
should be contiguous ideally, but since this may not always be
possible a block based allocation could be thought of. This however
adds an overhead to maintain a linked list, free list etc. Also no
list of pointers should be created outside the pool as this
constitutes heap allocation. Is there some literature which can
address this specific problem in terms of the possible approaches?
Maybe more generically - methods for contiguous dynamic memory
allocation, given a certain usage profile?
thanks for your advice,
Vardhan
