Sciweavers

186 search results - page 22 / 38
» Transactional Mutex Locks
Sort
View
DEXAW
1996
IEEE
100views Database» more  DEXAW 1996»
15 years 1 months ago
An Incremental Update Propagation Scheme for a Cooperative Transaction Model
Engineeringdesign applications require the support of long transactions in cooperative environments, The problem of the existing copy/update/merge approaches is that thepartial ef...
Am-suk Oh, Jin-oh Choi, Bonghee Hong
COMPUTE
2010
ACM
15 years 2 months ago
Performance evaluation of speculation-based protocol for read-only transactions
In the literature, speculation-based protocols have been proposed to improve the performance of read-only transactions (ROTs) over the existing two-phase locking (2PL) and snapsho...
Thirumalaisamy Ragunathan, P. Krishna Reddy
POPL
2006
ACM
15 years 10 months ago
Autolocker: synchronization inference for atomic sections
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
Bill McCloskey, Feng Zhou, David Gay, Eric A. Brew...
71
Voted
IPPS
2009
IEEE
15 years 4 months ago
Early experiences on accelerating Dijkstra's algorithm using transactional memory
In this paper we use Dijkstra’s algorithm as a challenging, hard to parallelize paradigm to test the efficacy of several parallelization techniques in a multicore architecture....
Nikos Anastopoulos, Konstantinos Nikas, Georgios I...
HPCC
2005
Springer
15 years 3 months ago
Transactional Cluster Computing
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional...
Stefan Frenz, Michael Schöttner, Ralph Gö...