Deutsch English Français Italiano |
<vrvfmg$d24n$2@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> Newsgroups: comp.arch Subject: Re: MSI interrupts Date: Tue, 25 Mar 2025 16:53:51 -0700 Organization: A noiseless patient Spider Lines: 31 Message-ID: <vrvfmg$d24n$2@dont-email.me> References: <vqto79$335c6$1@dont-email.me> <vrv483$3ekk$2@dont-email.me> <vrva8k$9ka$2@reader1.panix.com> <vrvdth$d24n$1@dont-email.me> <vrve8r$fv9$1@reader1.panix.com> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Wed, 26 Mar 2025 00:53:57 +0100 (CET) Injection-Info: dont-email.me; posting-host="a4eec8a2f4b4f841a55717fcbf2df836"; logging-data="428183"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/8Sl4E3ru5qOK+cdewdTpeeRPXdINc45Q=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:kY4JsTz1FoEwbHQivh7Lc7KLToM= Content-Language: en-US In-Reply-To: <vrve8r$fv9$1@reader1.panix.com> Bytes: 2430 On 3/25/2025 4:29 PM, Dan Cross wrote: > In article <vrvdth$d24n$1@dont-email.me>, > Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: >> On 3/25/2025 3:21 PM, Dan Cross wrote: >>> In article <vrv483$3ekk$2@dont-email.me>, >>> Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: >>>> On 3/25/2025 4:20 AM, Dan Cross wrote: >>>>> In article <vrt37r$27c13$4@dont-email.me>, >>>>> Chris M. Thomasson <chris.m.thomasson.1@gmail.com> wrote: >>>>>> On 3/24/2025 1:28 PM, Dan Cross wrote: >>>>>>> There's no guarantee that the tail is the correct place to >>>>>>> insert the element, vis the order of the elements. >>>>>> >>>>>> https://www.cs.rochester.edu/research/synchronization/pseudocode/queues.html >>>>> >>>>> If you go back and review the thread, you'd see that the problem >>>>> is to remove an element from a queue, and insert it into an >>>>> ordered list. This part of the discussion is concerning the >>>>> latter operation. >>>> >>>> There are lock-free ways to insert into an ordered list, indeed. >>> >>> How is that relevant? >> >> inserting into an ordered list is not relevant? > > The fact that you can use a lock-free algorithm to do so seems > utterly beside the point. So be it.