On May 26, 2010, at 1:27 PM, Dmitri Tchikine wrote:
Now, if there is a system that does the same from several threads,
what would
differ? I'd imagine that each thread would choose a random seed to
use in that
thread, and store it for post-factum investigation.
Ordinarily, I would think that you would want to re-run the entire
multi-threaded program from the same random seed if you want to
reproduce some interesting circumstance, or if you want deterministic
behavior for debugging. It's hard for me to think of a case where
you'd need per-thread seeds, although I acknowledge that it is
theoretically possible.
Pity I have no time to help with such review. But it could be
helpful if the
documentation could state which algorithms are re-enterant and
thread-safe. Most
people use specific algorithms, and might be a helpful information.
The same goes for other exceptions like random seeding: if next
release does not
support per-thread seeding, just document it. Maybe the effort of
implementation
is not worth it: see what are the responses.
Thanks for the suggestion, I'll keep that in mind.
Steven
_______________________________________________
NLopt-discuss mailing list
[email protected]
http://ab-initio.mit.edu/cgi-bin/mailman/listinfo/nlopt-discuss
