Filters








7,415 Hits in 4.5 sec

Partial aborts for transactions via first-class continuations

Matthew Le, Matthew Fluet
2015 SIGPLAN notices  
In this paper, we present a novel approach that uses first-class continuations to restart a conflicting transaction at the point of a conflict, avoiding the re-execution of any work from the beginning  ...  Crucially, we rely on constant-time continuation capturing via a continuation-passingstyle (CPS) transformation and heap-allocated continuations.  ...  In this work we make use of first-class continuations to restore execution of invalid transactions at the point of the first conflict, rather than always resuming execution at the beginning of the transaction  ... 
doi:10.1145/2858949.2784736 fatcat:xewokwcg3je3dm7qncyuksap7q

Partial aborts for transactions via first-class continuations

Matthew Le, Matthew Fluet
2015 Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming - ICFP 2015  
In this paper, we present a novel approach that uses first-class continuations to restart a conflicting transaction at the point of a conflict, avoiding the re-execution of any work from the beginning  ...  Crucially, we rely on constant-time continuation capturing via a continuation-passingstyle (CPS) transformation and heap-allocated continuations.  ...  In this work we make use of first-class continuations to restore execution of invalid transactions at the point of the first conflict, rather than always resuming execution at the beginning of the transaction  ... 
doi:10.1145/2784731.2784736 dblp:conf/icfp/LeF15 fatcat:cngz2e7mmbcfdn7lee6x34iwy4

Checkpoints and continuations instead of nested transactions

Eric Koskinen, Maurice Herlihy
2008 Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08  
We present a mechanism for partially aborting transactions through the use of data structure checkpoints and controlflow continuations.  ...  We demonstrate syntactic advantages and we quantify the overhead of checkpoints and explore several examples, illustrating the utility of partially aborting transactions.  ...  We would like to thank Yossi Lev and the anonymous reviewers for their feedback.  ... 
doi:10.1145/1378533.1378563 dblp:conf/spaa/KoskinenH08 fatcat:5w2fc4x3vnex5iygufolp7lal4

SPECULA: Speculative Replication of Software Transactional Memory

Sebastiano Peluso, Joao Fernandes, Paolo Romano, Francesco Quaglia, Luis Rodrigues
2012 2012 IEEE 31st Symposium on Reliable Distributed Systems  
This paper introduces SPECULA, a novel replication protocol for Software Transactional Memory (STM) systems that seeks maximum overlap between transaction execution and replica synchronization phases via  ...  By removing the replica synchronization phase from the critical path of execution of transactions, SPEC-ULA allows threads to speculatively pipeline the execution of both transactional and/or non-transactional  ...  To ensure total transparency for the applications, SPECULA relies on a customized class loader that instruments the application code (at the bytecode level) in order to automatically capture continuations  ... 
doi:10.1109/srds.2012.67 dblp:conf/srds/PelusoFRQR12 fatcat:erph5e7nmfge5kskengxummtoq

DracoSTM

Justin E. Gottschlich, Daniel A. Connors
2007 Proceedings of the 2007 Symposium on Library-Centric Software Design - LCSD '07  
DracoSTM uses only native object-oriented language semantics, increasing its intuitiveness for developers while maintaining high programmability via automatic handling of composition, locks and transaction  ...  DracoSTM is the STM first solution to (1) implement both direct and deferred updating and (2) enable run-time alternation between these updating policies.  ...  We also give our thanks to Lori Peek-Gottschlich, Sue Lewis and Dwight Winkler for their numerous edits and valuable feedback.  ... 
doi:10.1145/1512762.1512768 fatcat:a4urjmloircdbd4dgxt4qav7he

Transaction Layers

Toni Mattis, Patrick Rein, Robert Hirschfeld
2016 Proceedings of the 8th International Workshop on Context-Oriented Programming - COP'16  
Squeak/Smalltalk prototype consisting of a code editor, which provides control over when and where such a group of changes is active, and an extension of Squeak's COP implementation ContextS/2 required for  ...  Methods continue to use the old class and so do live instances.  ...  Transaction Layers For the scope of this paper, we focus on class-based singleinheritance OOP.  ... 
doi:10.1145/2951965.2951969 dblp:conf/ecoop/MattisRH16 fatcat:ln3lcjgpirbtzcoajvxiujsehy

Transactional data structure libraries

Alexander Spiegelman, Guy Golan-Gueta, Idit Keidar
2016 Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2016  
Moreover, our approach treats stand-alone data structure operations (like put and enqueue) as first class citizens, and allows them to execute with virtually no overhead, at the speed of the original data  ...  We introduce transactions into libraries of concurrent data structures; such transactions can be used to ensure atomicity of sequences of data structure operations.  ...  Acknowledgments We thank Edward Bortnikov for many helpful discussions and Tomer Morad for assistance with running the experiments.  ... 
doi:10.1145/2908080.2908112 dblp:conf/pldi/SpiegelmanGK16 fatcat:26eevyqarve6lanx2santupcci

Transactional data structure libraries

Alexander Spiegelman, Guy Golan-Gueta, Idit Keidar
2016 SIGPLAN notices  
Moreover, our approach treats stand-alone data structure operations (like put and enqueue) as first class citizens, and allows them to execute with virtually no overhead, at the speed of the original data  ...  We introduce transactions into libraries of concurrent data structures; such transactions can be used to ensure atomicity of sequences of data structure operations.  ...  Acknowledgments We thank Edward Bortnikov for many helpful discussions and Tomer Morad for assistance with running the experiments.  ... 
doi:10.1145/2980983.2908112 fatcat:pfc57phlmbcklnrbwihvdhprzy

Transactional collection classes

Brian D. Carlstrom, Austen McDonald, Michael Carbin, Christos Kozyrakis, Kunle Olukotun
2007 Proceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '07  
The required transactional semantics needed for implementing transactional collection are enumerated, including open-nested transactions and commit and abort handlers.  ...  Transactional collection classes wrap existing data structures, without the need for custom implementations or knowledge of data structure internals.  ...  Section 2 discusses semantic concurrency control in databases and its application to transactional memory via transactional collection classes.  ... 
doi:10.1145/1229428.1229441 dblp:conf/ppopp/CarlstromMCKO07 fatcat:7dy2d3bksbf3xlnkci5ejiv6ey

Opacity proof for CaPR+ algorithm

Anshu S. Anand, R. K. Shyamasundar, Sathya Peri
2016 Proceedings of the 17th International Conference on Distributed Computing and Networking - ICDCN '16  
The results obtained demonstrate the effectiveness of the Partial Rollback mechanism over abort mechanism, particularly in applications consisting of large transaction lengths.  ...  The algorithm provides a natural way to realize a hybrid system of pure aborts and partial rollbacks.  ...  Towards this, we give an integrated abort-partial rollback framework, that provides support for the user to designate some of the transactions(typically with small transactional length), to run with partial  ... 
doi:10.1145/2833312.2833445 dblp:conf/icdcn/AnandSP16 fatcat:bqv4ivi2wvhfdom2yxartao5ei

On the analytical modeling of concurrency control algorithms for Software Transactional Memories: The case of Commit-Time-Locking

Pierangelo Di Sanzo, Bruno Ciciani, Roberto Palmieri, Francesco Quaglia, Paolo Romano
2012 Performance evaluation (Print)  
We present an analytical performance modeling approach for concurrency control algorithms in the context of Software Transactional Memories (STMs).  ...  We rely on a detailed approach explicitly capturing key parameters, such as the execution cost of transactional and non-transactional operations, as well as the cost of begin, commit and abort operations  ...  Acknowledgements This work has been partially supported by the "Cloud-TM" project (cofinanced by the European Commission through the contract no. 257784), COST Action IC1001 EuroTM, the FCT project ARISTOS  ... 
doi:10.1016/j.peva.2011.05.002 fatcat:gg3nmctwf5etnjgik6j2u3zbp4

Abstraction in recovery management

J. Eliot B Moss, Nancy D. Griffeth, Marc H. Graham
1986 Proceedings of the 1986 ACM SIGMOD international conference on Management of data - SIGMOD '86  
oriented synchromzatron and roll back Our model may make rt easier to provide the high data mtegrrty of reliable database transaction processmg m a broader class of mformatron systems We concentrate on  ...  nonserralizable and nonrecoverable schedules of reads and writes We examme a model of multiple layers of abstraction that explains this phenomenon and suggests an approach to burldmg layered systems with transaction  ...  The idea rs that If we take transaction dependencies mto account m aborting, then we can find a consistent set of actions to abort "via omission", and thus achieve a simple abort We first estabhsh a notion  ... 
doi:10.1145/16894.16862 dblp:conf/sigmod/MossGG86 fatcat:j2pi7h5xvzhvvdurydjtdgrr7u

Abstraction in recovery management

J. Eliot B Moss, Nancy D. Griffeth, Marc H. Graham
1986 SIGMOD record  
oriented synchromzatron and roll back Our model may make rt easier to provide the high data mtegrrty of reliable database transaction processmg m a broader class of mformatron systems We concentrate on  ...  nonserralizable and nonrecoverable schedules of reads and writes We examme a model of multiple layers of abstraction that explains this phenomenon and suggests an approach to burldmg layered systems with transaction  ...  The idea rs that If we take transaction dependencies mto account m aborting, then we can find a consistent set of actions to abort "via omission", and thus achieve a simple abort We first estabhsh a notion  ... 
doi:10.1145/16856.16862 fatcat:hwttpwxaabdwzm6aex6po434rq

Supporting nested transactional memory in logTM

Michelle J. Moravan, Jayaram Bobba, Kevin E. Moore, Luke Yen, Mark D. Hill, Ben Liblit, Michael M. Swift, David A. Wood
2006 ACM SIGOPS Operating Systems Review  
Implementations may flatten nested transactions into the top-level one, resulting in a complete abort on conflict, or allow partial abort of inner transactions.  ...  Flat LogTM saves pre-transaction values in a log, detects conflicts with read (R) and write (W) bits per cache block, and, on abort, invokes a software handler to unroll the log.  ...  Acknowledgements We thank Virtutech AB, the Wisconsin Condor group, and the Wisconsin Computer Systems Lab for their help and support. We thank Daniel Gibson for the flash-Or circuit.  ... 
doi:10.1145/1168917.1168902 fatcat:5y55bvod5zdijnz4tjmxhal7ue

Supporting nested transactional memory in logTM

Michelle J. Moravan, Jayaram Bobba, Kevin E. Moore, Luke Yen, Mark D. Hill, Ben Liblit, Michael M. Swift, David A. Wood
2006 SIGARCH Computer Architecture News  
Implementations may flatten nested transactions into the top-level one, resulting in a complete abort on conflict, or allow partial abort of inner transactions.  ...  Flat LogTM saves pre-transaction values in a log, detects conflicts with read (R) and write (W) bits per cache block, and, on abort, invokes a software handler to unroll the log.  ...  Acknowledgements We thank Virtutech AB, the Wisconsin Condor group, and the Wisconsin Computer Systems Lab for their help and support. We thank Daniel Gibson for the flash-Or circuit.  ... 
doi:10.1145/1168919.1168902 fatcat:7bwvmmfavzbuxi2qvrowxtap74
« Previous Showing results 1 — 15 out of 7,415 results