Sciweavers

39 search results - page 1 / 8
» Completeness and Nondeterminism in Model Checking Transactio...
Sort
View
103
Voted
CONCUR
2008
Springer
15 years 18 days ago
Completeness and Nondeterminism in Model Checking Transactional Memories
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
POPL
2011
ACM
14 years 1 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
PODC
2010
ACM
15 years 2 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
IEEEPACT
2006
IEEE
15 years 4 months ago
Testing implementations of transactional memory
Transactional memory is an attractive design concept for scalable multiprocessors because it offers efficient lock-free synchronization and greatly simplifies parallel software....
Chaiyasit Manovit, Sudheendra Hangal, Hassan Chafi...
MASCOTS
2010
15 years 8 days ago
Modeling the Run-time Behavior of Transactional Memory
In this paper, we develop a queuing theory based analytical model to evaluate the performance of transactional memory. Based on the statistical characteristics observed on actual e...
Zhengyu He, Bo Hong