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,251afb8f1c322bf0 X-Google-Attributes: gid103376,public From: Robert Dewar Subject: Re: Caching & Annex C.6 Date: 1999/09/05 Message-ID: <7qss9f$a19$1@nnrp1.deja.com>#1/1 X-Deja-AN: 521206584 References: X-Http-Proxy: 1.0 x33.deja.com:80 (Squid/1.1.22) for client 166.72.70.239 Organization: Deja.com - Share what you know. Learn what you don't. X-Article-Creation-Date: Sun Sep 05 04:41:20 1999 GMT X-MyDeja-Info: XMYDJUIDrobert_dewar Newsgroups: comp.lang.ada X-Http-User-Agent: Mozilla/4.04 [en] (OS/2; I) Date: 1999-09-05T00:00:00+00:00 List-Id: In article , Simon Wright wrote: > Are there (multi-processor, presumably) systems where you would have > to force a write-through to get the proper effect? yes Do Ada > implementations on such systems have to do that? yes The point is that for non-volatile objects, which you know cannot be shared variables in the Ada sense, it is safe to put them in cache, even if the cache is non-coherent, but the point is that Volatile prevents this "optimization". Machines with non-coherent caches always have a way of signalling selected data as being non-cachable, forcing access to a shared memory (well let's say, that's true of shared memory machines). Sent via Deja.com http://www.deja.com/ Share what you know. Learn what you don't.