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,59003dcff2152233 X-Google-Attributes: gid103376,public From: Dale Stanbrough Subject: Re: More on Distributed Systems Annex Date: 1996/09/13 Message-ID: <51aj7o$kgs@goanna.cs.rmit.edu.au>#1/1 X-Deja-AN: 180289013 distribution: world references: <3238706F.96B@joy.ericsson.se> content-type: text/plain; charset=ISO-8859-1 x-xxmessage-id: organization: RMIT, Melbourne, Australia mime-version: 1.0 newsgroups: comp.lang.ada Date: 1996-09-13T00:00:00+00:00 List-Id: Jonas Nygren writes: "I had some questions on Annex E, Distributed Systems, DSA, to which I have got good answers. When rereading Annnex E in the RM my inter- pretation is that it is describing ONE program that may be split in partitions that can be distributed over several nodes. Can I use the DSA features to write a client-server solution the same way as I could with e.g. RPC. When I look at the examples in the Rational it seems as if I need a unique executable for each client (partition). This would mean I could not invoke two instances of the same client executable because I would then have two partitions with the same ID executing at the same time. Is this a property of the partitioning utility or does Annex E prohibit such constructs. Perhaps I have misunderstood the RM once again. /jonas" The book Concurrency In Ada by Burns and Wellings includes a chapter on this and concludes... "The most severe limitation of the Ada partition model is that partitions are not first class language objects. Partition types cannot be created and therefore instances of partitions... cannot be expressed" (this is an excellent book and well worth while buying) Dale