From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: a07f3367d7,d541063ff843658f,start
X-Google-Attributes: gida07f3367d7,public,usenet
X-Google-NewGroupId: yes
X-Google-Language: ENGLISH,ASCII-7-bit
X-Received: by 10.181.12.10 with SMTP id em10mr165971wid.7.1362103787596;
        Thu, 28 Feb 2013 18:09:47 -0800 (PST)
From: Vincent LAFAGE <lafage@ipno.in2p3.fr>
Newsgroups: comp.lang.ada
Subject: Parallel_Simulation
Date: Mon, 25 Feb 2013 11:20:10 +0100
Organization: In2p3
Message-ID: <kgfdsp$tb0$1@ccpntc8.in2p3.fr>
NNTP-Posting-Host: ipnnarval.in2p3.fr
Mime-Version: 1.0
X-Trace: ccpntc8.in2p3.fr 1361787609 30048 134.158.92.7 (25 Feb 2013 10:20:09
 GMT)
X-Complaints-To: newsmaster@cc.in2p3.fr
NNTP-Posting-Date: Mon, 25 Feb 2013 10:20:09 +0000 (UTC)
User-Agent: Mozilla/5.0 (X11; Linux i686;
 rv:10.0.12) Gecko/20130116 Icedove/10.0.12
X-Enigmail-Version: 1.4.1
Path: 
 bp2ni65242wib.1!nntp.google.com!feeder1.cambriumusenet.nl!82.197.223.108.MISMATCH!feeder2.cambriumusenet.nl!feed.tweaknews.nl!85.12.40.131.MISMATCH!xlned.com!feeder3.xlned.com!newsfeed.xs4all.nl!newsfeed2.news.xs4all.nl!xs4all!border4.nntp.ams.giganews.com!border2.nntp.ams.giganews.com!border3.nntp.ams.giganews.com!border1.nntp.ams.giganews.com!nntp.giganews.com!news.meeh.mikalv.net!aioe.org!usenet.pasdenom.info!gegeweb.org!feed.ac-versailles.fr!news.in2p3.fr!in2p3.fr!not-for-mail
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Date: 2013-02-25T11:20:10+01:00
List-Id: <comp.lang.ada>

I am interested in MonteCarlo simulation and I had translated a former
F77 code to Ada with success, with the goal of parallelizing it, but one
part in the algorithm still resists parallelization: the random number
generator. I need the different worker to rely on independant random
number generators.

Then I found a precious example in
 RM-A-5-2 59., 60., 61.
that compiles smoothly.

I will now attempt to check the independance of the sequence generated
by each thread. But this kind of check is always more subtle than expected.

I wonder whether there is a statement about the independance of such
generator, in particular in the gnat implementation?

Vincent