150 search results - page 21 / 30 » A Calculus for Relaxed Memory |
TLCA
2005
Springer
15 years 4 months ago
2005
Springer
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
ENTCS
2006
14 years 10 months ago
2006
In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can p...
SPAA
2010
ACM
15 years 3 months ago
2010
ACM
Transactional memory (TM) has shown potential to simplify the task of writing concurrent programs. Inspired by classical work on databases, formal definitions of the semantics of...
PPOPP
2010
ACM
15 years 8 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
HPCC
2007
Springer
15 years 4 months ago
2007
Springer
This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iter...