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,
	MSGID_RANDY autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,88f3c5aa253954a7
X-Google-Attributes: gid103376,public
From: Robert Dewar <robert_dewar@my-deja.com>
Subject: Re: Ada parraler programming
Date: 2000/05/28
Message-ID: <8gs8c2$b33$1@nnrp1.deja.com>#1/1
X-Deja-AN: 628395630
References: <8gro1m$1fv$1@news.onet.pl>
X-Http-Proxy: 1.0 x58.deja.com:80 (Squid/1.1.22) for client 205.232.38.14
Organization: Deja.com - Before you buy.
X-Article-Creation-Date: Sun May 28 22:59:20 2000 GMT
X-MyDeja-Info: XMYDJUIDrobert_dewar
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.61 [en] (OS/2; I)
Date: 2000-05-28T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <8gro1m$1fv$1@news.onet.pl>,
  "Piotr" <pierrek_@priv4.onet.pl> wrote:
> Hi!
>
> In Ada 95 the standard mechanism to program parralel
application
> is to use partitions. Do you know any other possibilities?

Tasking is the normal method for parallel semantics in
Ada. Partitions are used for *distributed* applications.


Sent via Deja.com http://www.deja.com/
Before you buy.