<This question is not specific to OCaml, but rather to garbage
collection.>

I have a program (in Fortran90) that uses many (> 100.000) small lists
of integers ( about 100 elements per list ). Each list is built
incrementally => I allocate many small blocks. It appears that this
leads to memory fragmentation. For instance, even though I deallocate
all the lists, the memory used by the program does not seem to really
decrease.
My question is : does a garbage collector (for instance the one in
OCaml) deal with this kind of issues ( defragmentation of the memory )
in a situation similar to mine : many small lists of elements ?

I apologize if this question is too much off-topic from the list.

--
****************************************************
*   François BÉREUX
*
*   Departement Antennes & Radomes
*   THALES Systemes Aeroportes
*   Centre René Mouchotte
*   La Clef de Saint-Pierre
*   1, Boulevard Jean Moulin
*   F-78852 Élancourt Cedex
*   FRANCE
*
*   tél : +33-1-34.59.73.12
*   fax : +33-1-34.59.70.54
*   mél : francois.bereux@fr.thalesgroup.com
****************************************************


-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners