Sciweavers

150 search results - page 3 / 30
» A Calculus for Relaxed Memory
Sort
View
CGO
2009
IEEE
14 years 1 months ago
Reducing Memory Ordering Overheads in Software Transactional Memory
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
Michael F. Spear, Maged M. Michael, Michael L. Sco...
HPCA
1999
IEEE
13 years 10 months ago
Using Lamport Clocks to Reason about Relaxed Memory Models
Cache coherence protocols of current shared-memory multiprocessors are difficult to verify. Our previous work proposed an extension of Lamport's logical clocks for showing th...
Anne Condon, Mark D. Hill, Manoj Plakal, Daniel J....
ESOP
2010
Springer
14 years 3 months ago
Generative Operational Semantics for Relaxed Memory Models
The specification of the Java Memory Model (JMM) is phrased in terms of acceptors of execution sequences rather than the standard generative view of operational semantics. This cre...
Radha Jagadeesan, Corin Pitcher and James Riely
PLDI
2011
ACM
12 years 9 months ago
Partial-coherence abstractions for relaxed memory models
Michael Kuperstein, Martin T. Vechev, Eran Yahav
PODC
2010
ACM
13 years 10 months ago
Brief announcement: view transactions: transactional model with relaxed consistency checks
We present view transactions, a model for relaxed consistency checks in software transactional memory (STM). View transactions always operate on a consistent snapshot of memory bu...
Yehuda Afek, Adam Morrison, Moran Tzafrir