D. Mosberger. Memory consistency models. ACM Operating Systems Review, 27(1):18--26, January 1993. 8 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Critical Sections and Producer/Consumer Queues in Weak Memory.. - Higham, Kawash (1997) (1 citation) (Correct)
....24] seems to have launched investigations into relaxations of sequential consistency. Since then there has been substantial research on a large selection of memory consistency models. Most closely related to our research are several papers presenting formal descriptions of specific memory models [22, 2, 1, 4, 5, 8, 14, 13, 16, 20, 27, 30] and papers that present various formalisms for describing memories and reasoning about them [3, 6, 7, 4, 11, 15, 25, 26, 17, 29, 33] Our work has benefited from all of these papers. For an extensive bibliography on memory consistency models see the online listing at the University of Alberta ....
D. Mosberger. Memory consistency models. ACM Operating Systems Review, 27(1):18--26, January 1993.
Reliable Support for a Persistent Distributed Shared Memory - Knaff, Déchamboux (1997) (1 citation) (Correct)
.... Dyade is a joint research centre between the Bull company and INRIA is non scalable as shown by the overhead needed to maintain cache consistency in SMP machines and in software DSM implementations [14] This leads to relax this consistency and to adapt it to the real requirements of applications [3, 17]. Segments have to be made permanent (stored on disk) in order to survive a system crash. Information systems often require the ability to perform atomic updates to their permanent data. Again, as for memory consistency, not all applications require the same level of guarantee with respect to ....
D. Mosberger. Memory Consistency Models. ACM Operating Systems Review, 27(1):18--26, January 1993.
Directions in Parallel Programming: HPF, Shared.. - Bodin, Priol.. (Correct)
....to the runtime system. 2.6 Runtime Optimization for SVM In some case, support for optimizations may come from system capabilities: Weak Coherence Several weak cache coherence protocols have been studied in the past. Each of them has some properties that can be exploited in a specific context [50, 57]. A modified version of the strong coherence protocol can be considered as a weak cache coherence protocol. If data accesses are made in different memory locations, it allows processors to modify their own copy of a page, without invalidating copies in other processors. When restoring the strong ....
D. Mosberger. Memory consistency models. ACM Operating Systems Review, February 1993.
From Causal Consistency to Sequential Consistency in Shared.. - Raynal, Schiper (4 citations) (Correct)
....As for abstract data types, such a classical approach distinguishes clearly the semantics offered to users from its particular implementations. Several authors have correctly claimed that a memory consistency criterion is a contract between the memory system and application programs [11]. Three main consistency criteria have been proposed in the literature: atomic consistency [9] also called linearizability [7] sequential consistency [8] and causal consistency [3] In all three cases a read operation returns the last value assigned to the variable (or written into the object) ....
D. Mosberger. Memory consitency models. ACM Operating Systems Review, 27(1):18--26, 1993.
Evaluation of Numerical Applications Running With Shared.. - Berrendorf, al. (1993) (Correct)
....page, the strong cache coherence protocol will move the page between processors. Avoiding this falsesharing effect requires a weaker cache coherence protocol. Such protocols have been studied in the past; however, each of them has some properties that can be exploited in a specific context [18, 21]. We designed a modified version of the strong coherence protocol that can be considered as a weak cache coherence protocol. If data accesses are made in different memory locations, it allows processors to modify their own copy of a page, without invalidating other s processor copies. When ....
D. Mosberger. Memory consistency models. ACM Operating Systems Review, February 1993.
From Causal Consistency To Sequential Consistency In Shared.. - Raynal, Schiper (4 citations) (Correct)
....As for abstract data types, such a classical approach distinguishes clearly the semantics offered to users from its particular implementations. Several authors have correctly claimed that a memory consistency criterion is a contract between the memory system and application programs [21]. Three main consistency criteria have been proposed in the literature: atomic consistency [19] also called linearizability [14] sequential consistency [17] and causal consistency [3] In all three cases a read operation returns the last value assigned to the variable (or written into the ....
D. Mosberger. Memory consitency models. ACM Operating Systems Review, 27(1):18-- 26, 1993.
CS555 Syllabus---Spring 1997 - Ted Faber (1997) (Correct)
....and messages [7, 8, 9] for next class: Text Chapter 10 (Time and coordination) Class 3 (Jan. 21) Faber: Time and RPC [10, 11] Text Chapter 5 (RPC) Class 4 (Jan. 23) Heidemann: Threads (Memory consistency intro) carry over: 12] 13, 14] Class 5 (Jan. 28) Heidemann: DSM carry over: [15], 16, 17] Text Chapter 17 (DSM) Homework 1 given out. Photographs. 3 Distributed State Class 6 (Jan. 30) Heidemann: CATOCS [19] Text Chapter 11 (Replication) carry over from DSM: 18] Moved from next class: 22] Class 7 (Feb. 4) Faber: Byzantine Agreement, Virtual Synchrony [21, 20] for ....
D. Mosberger. Memory consistency models. ACM Operating Systems Review, 27(1):18--26, January 1993.
Defining and Comparing Memory Consistency Models - Higham, Kawash, Verwaal (1997) (5 citations) Self-citation (Models) (Correct)
....calls linearizability dynamic atomic 2 The definitions of the various memory consistency models are given assuming that the multiprocess system terminates. They can be extended so that they apply to long lived systems by using ideas similar to those of Herlihy and Wing [10, 17] consistency [16]. An execution is linearizable if there is an assignment of each action to one distinct point after the action invocation, and before the action response on the time line such that the resulting sequential view of this execution is valid for each object. p: q: time w(x)1 w(x)2 r(x)3 r(x)2 ....
....a weaker model of correctness than linearizability because the real time ordering of events does not have to be maintained. However, it must be possible to list all actions by all processes in the system in one linear order (a linearization) that agrees with 3 program order. Several other papers [4, 10, 9, 16] describe the same consistency condition possibly under a different name or using different definitions. Definition 3.2 Let O be the set of actions that results from the execution E of the multiprocess system (P; J) Then E is sequentially consistent if there is a linearization (O; L ) such that ....
[Article contains additional citation context not shown here]
D. Mosberger. Memory consistency models. ACM Operating Systems Review, 27(1):18--26, January 1993. 8
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC