72 search results - page 9 / 15 » Verifying Local Transformations on Relaxed Memory Models |
DRM
2007
Springer
14 years 2 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
ASPLOS
1992
ACM
14 years 20 days ago
1992
ACM
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
ACTA
2006
13 years 8 months ago
2006
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
PATMOS
2000
Springer
14 years 4 days ago
2000
Springer
Exploitation of data re-use in combination with the use of custom memory hierarchy that exploits the temporal locality of data accesses may introduce significant power savings, esp...