Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Ocaml efficiency
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-02-18 (21:25)
From: Hans Ole Rafaelsen <hans@s...>
Subject: Re: [Caml-list] Ocaml efficiency

are you using some data-structures which you hold references to?  I
had a similar problem some time back.  Used a list, which I kept a
"global" reference to, I order to hold some of my data-structures.
Forgot to clear this reference between each run, and thus the list
kept growing between each run, thus making operations on it taking
longer and longer.

Just a guess.  If the problem is related to the GC and other memory
management issues, then I really don't know.

Kindest regards,

Hans Ole Rafaelsen

Vincent Barichard <> writes:

> Hi,
> I've made a caml algorithm for solving some combinatorial problems.
> I've made a little user interface with camltk in order to launch many
> times the solving procedure.
> I ran it, and I clicked on the start button one time, the computing
> time was about 30s. When I clicked a second time, the computing time
> exceeded 60s !!
> The programm doesn't store in any data structure the results of the run,
> and all the variables values remain the same as before the run.
> The outputs of the two runs are identical, just the running time is
> different.
> I guessed that it was a problem about memory management, garbage
> collector, so I tried Gc.full_major and Gc.compact, but it didn't work.
> Is anyone has any ideas or suggestions to help me ?
> Thanks,
> Vincent
> Vincent Barichard
> Métaheuristiques et Optimisation Combinatoire
> Faculté des Sciences d'Angers
> Tel : 02 41 73 52 06
> -------------------
> To unsubscribe, mail Archives:
> Bug reports: FAQ:
> Beginner's list:
To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: