Skip to search formSkip to main contentSkip to account menu

Sequential consistency

Sequential consistency is one of the consistency models used in the domain of concurrent computing (e.g. in distributed shared memory, distributed… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
  • 2017
  • Corpus ID: 31688907
Modern program logics have made it feasible to verify the most complex concurrent algorithms. However, many such logics are… 
2014
2014
While team communication during collaborative activities may appear chaotic and unstructured, past research suggests that it may… 
2013
2013
Applications in increasingly important domains such as data mining and graph analysis operate on very large, dynamically… 
2005
2005
This article presents the process followed and the results of three pieces of research centred on the work integration of people… 
2005
2005
c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for… 
Review
2004
Review
2004
This paper presents a new protocol for ensuring sequential consistency in a distributed objects system. The protocol is efficient… 
1999
1999
Sequential consistency is a well known consistency requirement for distributed shared memory. However, most of the algorithms… 
1998
1998
This paper is about exploring the power of retiming and resynthesis. We show that there exists a pair of \sequentially equivalent… 
Highly Cited
1990
Highly Cited
1990
A model for shared-memory systems commonly (and often implicitly) assumed by programmers is that of sequential consistency. For…