Talk:Consistency model
![]() | Computing Start‑class Low‑importance | ||||||||||||
|
Welch and Tanenbaum sources
I notice that the external link to lecture notes suggest that they are copyright Ian Welch 2004. However, the slides bear a striking resemblance to Andrew Tanenbaum's slides that accompany Chapter 6 of his Distributed Systems book[1]. I'm not sure of the policy regarding this. Any thoughts? Tim Watson 18:18, 24 January 2006 (UTC)
Programmer's rules
What are these "rules" that a programmer must follow to maintain consistency? —Preceding unsigned comment added by 128.138.64.20 (talk) 05:45, 27 February 2008 (UTC)
Confusion
The article says "To hold the contract, compilers may reorder some memory instructions". It is widely known that the reverse is true: the compiler may reorder instructions to optimize the code, but in some cases to ensure consistency this must be prevented (by usage of locking constructs or optimization barriers). I'm not sure if the author meant something else, or if this is plain confusion. --Blaisorblade (talk) 05:31, 26 December 2008 (UTC)
- I was confused by that as well. I don't think consistency is an issue in those languages, because it is assumed that there is only one copy of data that gets stored in memory. If I understand the term "consistent" correctly, the issue applies only when there are multiple copies of the same data. BTW, if that's a correct statement, some version of it should appear in this article. Danielx (talk) 09:04, 18 October 2009 (UTC)