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=unavailable autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: "J-P. Rosen" Newsgroups: comp.lang.ada Subject: Re: Portable memory barrier? Date: Wed, 10 May 2017 07:25:56 +0200 Organization: A noiseless patient Spider Message-ID: References: <0fc56bf7-1cfa-4776-9c47-a573db315c5f@googlegroups.com> <7b0c08eb-be62-4d14-ae99-cad038ad0a62@googlegroups.com> <077e7f6a-5a7b-4b88-a16f-7672aec18a17@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 8bit Injection-Date: Wed, 10 May 2017 05:22:41 -0000 (UTC) Injection-Info: mx02.eternal-september.org; posting-host="7324a82a07635868a67ad9d4141db085"; logging-data="22537"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19IZuT+mKGWV9futDzSwSJf" User-Agent: Mozilla/5.0 (Windows NT 10.0; WOW64; rv:45.0) Gecko/20100101 Thunderbird/45.8.0 In-Reply-To: Cancel-Lock: sha1:hZzI4bZB+0TnELpGIVF+zO7HUWU= Xref: news.eternal-september.org comp.lang.ada:46743 Date: 2017-05-10T07:25:56+02:00 List-Id: Le 10/05/2017 à 02:51, Jere a écrit : > Is there a method besides Atomic? If I am implementing a generic FIFO (lock > free) and the FIFO elements are complex data types that may not be able to be > atomic, do I have any other options or are protected objects my only way out? Protected objects, or for a lower level, Synchronous_Task_Control. I know that you want lock free algorithms, but out of curiosity, did you measure the cost of locking algorithms? IOW, is all of this worth the trouble? -- J-P. Rosen Adalog 2 rue du Docteur Lombard, 92441 Issy-les-Moulineaux CEDEX Tel: +33 1 45 29 21 52, Fax: +33 1 45 29 25 00 http://www.adalog.fr