25 search results - page 4 / 5 » Adaptive Locks: Combining Transactions and Locks for Efficie... |
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
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....
WMCSA
1999
IEEE
14 years 24 days ago
1999
IEEE
In this paper, we study the inconsistency problem in data broadcast. While data items in a mobile computing system are being broadcast, update transactions may install new values ...
EUROSYS
2009
ACM
14 years 5 months ago
2009
ACM
Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolate...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
Online collaboration and sharing is the central theme of many webbased services that create the so-called Web 2.0 phenomena. Using the Internet as a computing platform, many Web 2...
HPCA
2007
IEEE
14 years 9 months ago
2007
IEEE
Transactional Memory (TM) provides mechanisms that promise to simplify parallel programming by eliminating the need for locks and their associated problems (deadlock, livelock, pr...