Path: ...!weretis.net!feeder9.news.weretis.net!panix!.POSTED.spitfire.i.gajendra.net!not-for-mail From: cross@spitfire.i.gajendra.net (Dan Cross) Newsgroups: comp.arch Subject: Re: MSI interrupts Date: Tue, 25 Mar 2025 23:29:31 -0000 (UTC) Organization: PANIX Public Access Internet and UNIX, NYC Message-ID: References: Injection-Date: Tue, 25 Mar 2025 23:29:31 -0000 (UTC) Injection-Info: reader1.panix.com; posting-host="spitfire.i.gajendra.net:166.84.136.80"; logging-data="16361"; mail-complaints-to="abuse@panix.com" X-Newsreader: trn 4.0-test77 (Sep 1, 2010) Originator: cross@spitfire.i.gajendra.net (Dan Cross) Bytes: 2008 Lines: 29 In article , Chris M. Thomasson wrote: >On 3/25/2025 3:21 PM, Dan Cross wrote: >> In article , >> Chris M. Thomasson wrote: >>> On 3/25/2025 4:20 AM, Dan Cross wrote: >>>> In article , >>>> Chris M. Thomasson 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. - Dan C.