[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <YwwhG8bzsKlJ2eEY@anparri>
Date: Mon, 29 Aug 2022 04:15:42 +0200
From: Andrea Parri <parri.andrea@...il.com>
To: Boqun Feng <boqun.feng@...il.com>
Cc: Alan Stern <stern@...land.harvard.edu>,
Peter Zijlstra <peterz@...radead.org>,
"Paul E. McKenney" <paulmck@...nel.org>, will@...nel.org,
npiggin@...il.com, dhowells@...hat.com, j.alglave@....ac.uk,
luc.maranget@...ia.fr, akiyks@...il.com, dlustig@...dia.com,
joel@...lfernandes.org, linux-kernel@...r.kernel.org,
linux-arch@...r.kernel.org
Subject: Re: "Verifying and Optimizing Compact NUMA-Aware Locks on Weak
Memory Models"
> FWIW, C++ defines this as (in https://eel.is/c++draft/atomics#order-11):
>
> Implementations should make atomic stores visible to atomic
> loads within a reasonable amount of time.
>
> in other words:
>
> if one thread does an atomic store, then all other threads must see that
> store eventually.
>
> (from: https://rust-lang.zulipchat.com/#narrow/stream/136281-t-lang.2Fwg-unsafe-code-guidelines/topic/Rust.20forward.20progress.20guarantees/near/294702950)
>
> Should we add something somewhere in our model, maybe in the
> explanation.txt?
FYI, that's briefly mentioned in Section 11, "CACHE COHERENCE AND THE
COHERENCE ORDER RELATION: co, coi, and coe":
"sequential consistency per variable and cache coherence mean the
same thing except that cache coherence includes an extra requirement
that every store eventually becomes visible to every CPU"
Andrea
> Plus, I think we cannot express this in Herd because Herd uses
> graph-based model (axiomatic model) instead of an operational model to
> describe the model: axiomatic model cannot describe "something will
> eventually happen". There was also some discussion in the zulip steam
> of Rust unsafe-code-guidelines.
Powered by blists - more mailing lists