In: Mavronicolas, M.; Tsigas, Ph.: Lecture Notes in Computer Science, Vol. 1320: Distributed Algorithms, Proc. of 11th International Workshop, WDAG'97, Saarbrücken, Germany. Springer, September 1997.
Abstract: This paper presents a general framework for understanding precedence-based memory models, which are generalizations of standard multiprocessor models. Precedence-based models need not mention processes explicitly, and can express any conditions that rely only on some operations being required to precede other operations. We define a generalized notion of sequential consistency and per-location sequential consistency in this framework, and we analyze the Backer algorithm used in the Cilk system, showing that it implements per-location sequential consistency. We also give conditions under which client processes cannot distinguish a per-location sequentially consistent memory from a sequentially consistent one.