Sciweavers

39 search results - page 1 / 8
» Committing conflicting transactions in an STM
Sort
View
PPOPP
2009
ACM
14 years 5 months ago
Committing conflicting transactions in an STM
Dependence-aware transactional memory (DATM) is a recently proposed model for increasing concurrency of memory transactions without complicating their interface. DATM manages depe...
Hany E. Ramadan, Indrajit Roy, Maurice Herlihy, Em...
IPPS
2010
IEEE
13 years 2 months ago
Consistency in hindsight: A fully decentralized STM algorithm
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
Annette Bieniusa, Thomas Fuhrmann
PODC
2010
ACM
13 years 6 months ago
Brief announcement: single-version permissive STM
We present a single-version STM that satisfies a practical notion of permissiveness: it never aborts read-only transactions, and it only aborts an update transaction due to anothe...
Hagit Attiya, Eshcar Hillel
CGO
2010
IEEE
13 years 9 months ago
An efficient software transactional memory using commit-time invalidation
To improve the performance of transactional memory (TM), researchers have found many eager and lazy optimizations for conflict detection, the process of determining if transaction...
Justin Emile Gottschlich, Manish Vachharajani, Jer...
CAV
2009
Springer
177views Hardware» more  CAV 2009»
14 years 5 months ago
Software Transactional Memory on Relaxed Memory Models
Abstract. Pseudo-code descriptions of STMs assume sequentially consistent program execution and atomicity of high-level STM operations like read, write, and commit. These assumptio...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh