Sciweavers

744 search results - page 13 / 149
» Software Transactional Memory on Relaxed Memory Models
Sort
View
100
Voted
ISPASS
2010
IEEE
15 years 6 months ago
StatStack: Efficient modeling of LRU caches
The identification of the memory gap in terms of the relatively slow memory accesses put a focus on cache
David Eklov, Erik Hagersten
VMCAI
2009
Springer
15 years 8 months ago
An Abort-Aware Model of Transactional Programming
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
Kousha Etessami, Patrice Godefroid
ASPLOS
1996
ACM
15 years 6 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
ISCA
1993
IEEE
117views Hardware» more  ISCA 1993»
15 years 6 months ago
Evaluation of Release Consistent Software Distributed Shared Memory on Emerging Network Technology
We evaluate the e ect of processor speed, network bandwidth, and software overhead on the performance of release-consistent software distributed shared memory. We examine ve di er...
Sandhya Dwarkadas, Peter J. Keleher, Alan L. Cox, ...
103
Voted
PLDI
2010
ACM
15 years 5 months ago
Parameterized Verification of Transactional Memories
We describe an automatic verification method to check whether transactional memories ensure strict serializability--a key property assumed of the transactional interface. Our main...
Michael Emmi, Rupak Majumdar, Roman Manevich