We use the Abstract State Machine methodology to give formal operational semantics for the Location Consistency memory model and cache protocol. With these formal models, we prove that the cache protocol satisfies the memory model, but in a way that is strictly stronger than necessary, disallowing certain behavior allowed by the memory model
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
Abstract. In shared-memory multiprocessors sequential consistency o ers a natural tradeo between the...
Computer architects are now studying a new generation of chip architectures that may integrate hundr...
We use the Abstract State Machine methodology to give formal operational semantics for the Location ...
The most commonly assumed memory consistency model for shared-memory multiprocessors is Sequential C...
A model for shared-memory systems commonly (and often implicitly) assumed by programmers is that of ...
A model for shared-memory systems commonly (and often implicitly) assumed by programmers is that of ...
Abstract. The contribution of the paper is two-fold. We give a set of properties expressible as temp...
Recently distributed shared memory (DSM) systems have received much attention because such an abstra...
All methods of multi-processing need some form of processor to processor communication. In shared me...
We view shared memories as structures which define relations over the set of programs and their exec...
During the last few years many different memory consistency protocols have been proposed. These rang...
The protocols of invalidation-based cache coherence have been extensively studied in the context o...
In distributed shared memory architectures, memory usually obeys weaker constraints than that of ord...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
Abstract. In shared-memory multiprocessors sequential consistency o ers a natural tradeo between the...
Computer architects are now studying a new generation of chip architectures that may integrate hundr...
We use the Abstract State Machine methodology to give formal operational semantics for the Location ...
The most commonly assumed memory consistency model for shared-memory multiprocessors is Sequential C...
A model for shared-memory systems commonly (and often implicitly) assumed by programmers is that of ...
A model for shared-memory systems commonly (and often implicitly) assumed by programmers is that of ...
Abstract. The contribution of the paper is two-fold. We give a set of properties expressible as temp...
Recently distributed shared memory (DSM) systems have received much attention because such an abstra...
All methods of multi-processing need some form of processor to processor communication. In shared me...
We view shared memories as structures which define relations over the set of programs and their exec...
During the last few years many different memory consistency protocols have been proposed. These rang...
The protocols of invalidation-based cache coherence have been extensively studied in the context o...
In distributed shared memory architectures, memory usually obeys weaker constraints than that of ord...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
Abstract. In shared-memory multiprocessors sequential consistency o ers a natural tradeo between the...
Computer architects are now studying a new generation of chip architectures that may integrate hundr...