Sciweavers

64 search results - page 4 / 13
» Fences in Weak Memory Models
Sort
View
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
14 years 3 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
CONCUR
2009
Springer
14 years 2 months ago
Weak Time Petri Nets Strike Back!
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are...
Pierre-Alain Reynier, Arnaud Sangnier
HICSS
1999
IEEE
112views Biometrics» more  HICSS 1999»
14 years 3 months ago
Defining Uniform and Hybrid Memory Consistency Models on a Unified Framework
The behavior of Distributed Shared Memory Systems is dictated by the Memory Consistency Model. Several Memory Consistency Models have been proposed in the literature and they fit ...
Alba Cristina Magalhaes Alves de Melo
ESOP
2012
Springer
12 years 6 months ago
Concurrent Library Correctness on the TSO Memory Model
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...
Sebastian Burckhardt, Alexey Gotsman, Madanlal Mus...
ICDCS
1996
IEEE
14 years 3 months ago
The Relative Importance of Concurrent Writers and Weak Consistency Models
This paper presents a detailed comparison of the relative importance of allowing concurrent writers versus the choice of the underlying consistency model. Our comparison is based ...
Peter J. Keleher