caml-list - the Caml user's mailing list
 help / color / mirror / Atom feed
From: Hans Ole Rafaelsen <hans@simula.no>
To: Vincent Barichard <barichar@info.univ-angers.fr>
Cc: CAML-LIST <caml-list@pauillac.inria.fr>
Subject: Re: [Caml-list] Ocaml efficiency
Date: 18 Feb 2003 22:25:03 +0100	[thread overview]
Message-ID: <3azvfzhs2mo.fsf@itherther.simula.no> (raw)
In-Reply-To: <Pine.GSO.4.53.0302171848100.2793@helios.info-ua>

Hello,

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 <barichar@info.univ-angers.fr> 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 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
-------------------
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


  reply	other threads:[~2003-02-18 21:25 UTC|newest]

Thread overview: 12+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2003-02-17 18:03 Vincent Barichard
2003-02-18 21:25 ` Hans Ole Rafaelsen [this message]
2003-02-18 21:32 ` Matt Gushee
2003-02-19  0:57   ` Matt Gushee
  -- strict thread matches above, loose matches on Subject: below --
2002-04-20 10:03 Jérôme Marant
2002-04-20 14:51 ` Vitaly Lugovsky
2002-04-20 15:38   ` Jérôme Marant
2002-04-22 19:48     ` Warp
2002-04-23 17:29       ` Jérôme Marant
2002-04-24 12:05 ` Xavier Leroy
2002-04-24 16:25   ` Jérôme Marant
2002-04-25 16:17   ` Vitaly Lugovsky

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=3azvfzhs2mo.fsf@itherther.simula.no \
    --to=hans@simula.no \
    --cc=barichar@info.univ-angers.fr \
    --cc=caml-list@pauillac.inria.fr \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).