Sciweavers

122 search results - page 3 / 25
» Memory models for open-nested transactions
Sort
View
IPPS
2010
IEEE
13 years 3 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik
SIGOPS
2010
108views more  SIGOPS 2010»
13 years 4 months ago
Cloud-TM: harnessing the cloud with distributed transactional memories
One of the main challenges to harness the potential of Cloud computing is the design of programming models that simplify the development of large-scale parallel applications and t...
Paolo Romano, Luís Rodrigues, Nuno Carvalho...
PPOPP
2010
ACM
14 years 3 months ago
Modeling transactional memory workload performance
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
Donald E. Porter, Emmett Witchel
IPPS
2010
IEEE
13 years 3 months ago
Evaluating database-oriented replication schemes in Software Transactional Memory systems
Software Transactional Memories (STMs) are emerging as a highly attractive programming model, thanks to their ability to mask concurrency management issues to the overlying applic...
Roberto Palmieri, Francesco Quaglia, Paolo Romano,...
ICDCN
2012
Springer
12 years 1 months ago
Lifting the Barriers - Reducing Latencies with Transparent Transactional Memory
Synchronization in distributed systems is expensive because, in general, threads must stall to obtain a lock or to operate on volatile data. Transactional memory, on the other hand...
Annette Bieniusa, Thomas Fuhrmann