Sciweavers

82 search results - page 5 / 17
» A Concurrent Calculus with Atomic Transactions
Sort
View
ECRTS
2004
IEEE
14 years 1 months ago
Pessimistic Concurrency Control and Versioning to Support Database Pointers in Real-Time Databases
In this paper we present a concurrency control algorithm that allows co-existence of soft real-time, relational database transactions, and hard real-time database pointer transact...
Dag Nyström, Mikael Nolin, Aleksandra Tesanov...
SIGPLAN
2008
13 years 9 months ago
Single global lock semantics in a weakly atomic STM
As memory transactions have been proposed as a language-level replacement for locks, there is growing need for well-defined semantics. In contrast to database transactions, transa...
Vijay Menon, Steven Balensiefer, Tatiana Shpeisman...
ASPLOS
2012
ACM
12 years 5 months ago
Applying transactional memory to concurrency bugs
Multithreaded programs often suffer from synchronization bugs such as atomicity violations and deadlocks. These bugs arise from complicated locking strategies and ad hoc synchroni...
Haris Volos, Andres Jaan Tack, Michael M. Swift, S...
ENTCS
2007
113views more  ENTCS 2007»
13 years 9 months ago
Modular Checkpointing for Atomicity
Transient faults that arise in large-scale software systems can often be repaired by re-executing the code in which they occur. Ascribing a meaningful semantics for safe re-execut...
Lukasz Ziarek, Philip Schatz, Suresh Jagannathan
WRLA
2010
13 years 8 months ago
Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding
Abstract. We revise multiset rewriting with name binding, by combining the two main existing approaches to the study of concurrency by means of multiset rewriting, multiset rewriti...
Fernando Rosa Velardo