Talk:Read–modify–write

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Computing

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
???	This article has not yet received a rating on the project's importance scale.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

It would be moderately nontrivial, but attainable, to demonstrate a credible bridge between "consensus number" (pre-emptive multitasking) and CAP theorem; which in the real world often plays out in the classic tension between (availability, asynchronicity (eventual consistency), risk and performance) versus (consistency, synchronicity (blocking until consistency verified), safety and certainty). Also, Paxos is worth evaluation a mention as a potential core algorithm. AnonymousRageQuit (User talk:AnonymousRageQuit) 16:26, 29 February (UTC)

This article completely misses the point so I am rewriting it. Quanticles (talk) 16:20, 1 February 2008 (UTC)[reply]