Sciweavers

95 search results - page 6 / 19
» Atomicity and isolation for transactional processes
Sort
View
ACMMSP
2006
ACM
250views Hardware» more  ACMMSP 2006»
14 years 1 months ago
What do high-level memory models mean for transactions?
Many people have proposed adding transactions, or atomic blocks, to type-safe high-level programming languages. However, researchers have not considered the semantics of transacti...
Dan Grossman, Jeremy Manson, William Pugh
IPPS
2010
IEEE
13 years 5 months ago
Consistency in hindsight: A fully decentralized STM algorithm
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...
Annette Bieniusa, Thomas Fuhrmann
ENTCS
2007
113views more  ENTCS 2007»
13 years 7 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
AC
1999
Springer
13 years 12 months ago
Integrating Group Communication with Transactions for Implementing Persistent Replicated Objects
A widely used computational model for constructing fault-tolerant distributed applications employs atomic transactions for controlling operations on persistent objects. There has ...
Mark C. Little, Santosh K. Shrivastava
BIRTHDAY
2004
Springer
14 years 1 months ago
A Trace Semantics for Long-Running Transactions
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
Michael J. Butler, C. A. R. Hoare, Carla Ferreira