Sciweavers

488 search results - page 13 / 98
» Unbounded Transactional Memory
Sort
View
HOTOS
2009
IEEE
14 years 17 days ago
Operating Systems Should Provide Transactions
Operating systems can efficiently provide system transactions to user applications, in which user-level processes can execute a series of system calls atomically and in isolation ...
Donald E. Porter, Emmett Witchel
CONCUR
2008
Springer
13 years 10 months ago
A Model of Dynamic Separation for Transactional Memory
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
Martín Abadi, Tim Harris, Katherine F. Moor...
MICRO
2010
IEEE
202views Hardware» more  MICRO 2010»
13 years 3 months ago
Hardware Support for Relaxed Concurrency Control in Transactional Memory
Today's transactional memory systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict happens. 2PL is a simple algorithm that pr...
Utku Aydonat, Tarek S. Abdelrahman
PODC
2011
ACM
12 years 11 months ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
SOSP
1997
ACM
13 years 10 months ago
Free Transactions With Rio Vista
Abstract: Transactions and recoverable memories are powerful mechanisms for handling failures and manipulating persistent data. Unfortunately, standard recoverable memories incur a...
David E. Lowell, Peter M. Chen