Sciweavers

39 search results - page 5 / 8
» Committing conflicting transactions in an STM
Sort
View
BNCOD
2006
69views Database» more  BNCOD 2006»
15 years 7 months ago
Reducing Sub-transaction Aborts and Blocking Time Within Atomic Commit Protocols
Composed Web service transactions executed in distributed networks often require an atomic execution. Guaranteeing atomicity in mobile networks involves a lot more challenges than ...
Stefan Böttcher, Le Gruenwald, Sebastian Ober...
IPPS
2008
IEEE
16 years 13 days ago
Intermediate checkpointing with conflicting access prediction in transactional memory systems
Transactional memory systems promise to reduce the burden of exposing thread-level parallelism in programs by relieving programmers from analyzing complex inter-thread dependences...
M. M. Waliullah, Per Stenström
MICRO
2010
IEEE
189views Hardware» more  MICRO 2010»
15 years 3 months ago
A Dynamically Adaptable Hardware Transactional Memory
Most Hardware Transactional Memory (HTM) implementations choose fixed version and conflict management policies at design time. While eager HTM systems store transactional state in-...
Marc Lupon, Grigorios Magklis, Antonio Gonzá...
EUROMICRO
1998
IEEE
15 years 10 months ago
Approaches for Scheduling of Triggered Transactions in Real-Time Active Database Systems
A real-time active database system (RTADBS) has to provide capabilities for timely trigger of timeconstrained transactions and at the same time to process them, concurrently with ...
Kam-yiu Lam, Tony S. H. Lee
MICRO
2010
IEEE
202views Hardware» more  MICRO 2010»
15 years 24 days 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