Sciweavers

143 search results - page 2 / 29
» Optimizing transactions for captured memory
Sort
View
SSS
2010
Springer
128views Control Systems» more  SSS 2010»
13 years 3 months ago
On Transactional Scheduling in Distributed Transactional Memory Systems
We present a distributed transactional memory (TM) scheduler called Bi-interval that optimizes the execution order of transactional operations to minimize conflicts. Bi-interval c...
Junwhan Kim, Binoy Ravindran
FMCAD
2007
Springer
13 years 11 months ago
Verifying Correctness of Transactional Memories
—We show how to verify the correctness of transactional memory implementations with a model checker. We show how to specify transactional memory in terms of the admissible interc...
Ariel Cohen 0002, John W. O'Leary, Amir Pnueli, Ma...
MICRO
2010
IEEE
202views Hardware» more  MICRO 2010»
12 years 11 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
HIPC
2009
Springer
13 years 2 months ago
Integrating and optimizing transactional memory in a data mining middleware
As the size of available datasets in various domains is growing rapidly, there is an increasing need for scaling data mining implementations. Coupled with the current trends in co...
Vignesh T. Ravi, Gagan Agrawal
PLDI
2006
ACM
13 years 11 months ago
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
Timothy L. Harris, Mark Plesko, Avraham Shinnar, D...