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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,a0224dc3d1e52f3d
X-Google-Attributes: gid103376,public
From: "Kevin Rigotti" <rigotti@atc.dera.gov.uk>
Subject: Bulk synchronous model for IO (was Re: Streams and Concurrency)
Date: 1999/01/11
Message-ID: <77damm$av7$1@trog.dra.hmg.gb>#1/1
X-Deja-AN: 431292789
References: <76c3tv$acs@bgtnsc02.worldnet.att.net>
 <76dgdl$qle$1@nnrp1.dejanews.com>
X-MimeOLE: Produced By Microsoft MimeOLE V4.71.1712.3
Organization: Defence Evaluation & Research Agency
Newsgroups: comp.lang.ada
Date: 1999-01-11T00:00:00+00:00
List-Id: <comp.lang.ada>

Interesting thread ...

In the more general case of lots of parallel activity requiring IO to happen
in a controlled way then it might be interesting to use Streams as the basis
for doing 'BSP'-like things in Ada, where IO is initially buffered locally
and only completed between tasks at the end of the next 'superstep'

The BSP home page has links to details of a C library (BSPlib) that provides
primitives for doing this, but it might be fun to see how the same thing
might be done in Ada.

Just a thought, maybe a nice little project for a student :-)

Kevin Rigotti
Senior Scientist, ATC Systems Group


begin 666 BSP Worldwide Home Page.url
M6TEN=&5R;F5T4VAO<G1C=71=#0I54DP]:'1T<#HO+W=W=RYB<W M=V]R;&1W
G:61E+F]R9R\-"DUO9&EF:65D/44P030P1C5".#$S1$)%,#$V0@T*
`
end