Path: csiph.com!eternal-september.org!reader02.eternal-september.org!.POSTED!not-for-mail From: Bonita Montero Newsgroups: comp.programming.threads Subject: Re: More of my philosophy about my new inventions and more.. Date: Thu, 17 Feb 2022 21:23:16 +0100 Organization: A noiseless patient Spider Lines: 22 Message-ID: References: <90b6051a-ec4a-4e71-a34c-30e303101d9en@googlegroups.com> <709fc805-becd-4074-a827-8563ae5b9d6an@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Thu, 17 Feb 2022 20:23:19 -0000 (UTC) Injection-Info: reader02.eternal-september.org; posting-host="132da91e13bc51624626dbc68476fa73"; logging-data="23335"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/plwZtRIE2iqEa26bdfIj1QeJaNriY90o=" User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Thunderbird/91.6.1 Cancel-Lock: sha1:dAB9+vThn4MmrEdzwg6F3oJomGw= In-Reply-To: <709fc805-becd-4074-a827-8563ae5b9d6an@googlegroups.com> Content-Language: de-DE Xref: csiph.com comp.programming.threads:7387 Am 17.02.2022 um 20:41 schrieb Amine Moulay Ramdane: > On Thursday, February 17, 2022 at 2:27:30 PM UTC-5, Bonita Montero wrote: >> Am 17.02.2022 um 20:02 schrieb Amine Moulay Ramdane: >>> Hello, >>> >>> >>> More of my philosophy about my new inventions and more.. >>> >>> I am a white arab and i think i am smart since i have also invented many scalable algorithms.. >>> >>> >>> I think i am smart, and i say that x86 processor family features a fairly strict memory model that only allows the reorderings of loads before independent store operations, so i have just invented a fully Lockfree FIFO bounded queue and a fully Lockfree LIFO bounded stack that also run on x86 processor family and they are much more powerful than my following inventions: >> Lock-free queues totally suck since they have to be polled. >> The only lock-free structure that is useful is a lock-free stack >> for pooing objects and handling back items to a thread like with >> modern memory-allocators. > > > Typically, polling a lock-free queue works best when the queue nearly always has entries, a blocking queue works best when the queue is nearly always empty. Forget it - no one wants to poll a queue. Having limited polling with spinning for a while is the best of both sides.