Filters








15,000 Hits in 7.7 sec

Transactions on Mergeable Objects [chapter]

Deepthi Devaki Akkoorath, Annette Bieniusa
2015 Lecture Notes in Computer Science  
Instead of aborting and re-executing, object versions from conflicting updates on shared objects are merged using data-type specific semantics.  ...  Destructible updates on shared objects require careful handling of concurrent accesses in multi-threaded programs.  ...  Acknowledgments This research is supported in part by the European FP7 project 609 551 SyncFree.  ... 
doi:10.1007/978-3-319-26529-2_23 fatcat:x5d62pshifhefhqwlcemjjk37u

Reusable Concurrent Data Types [chapter]

Vincent Gramoli, Rachid Guerraoui
2014 Lecture Notes in Computer Science  
We outline the commonality of the problem in various object-oriented languages and implement PT and a reusable package in Java.  ...  We do so by proposing the abstraction of Polymorphic Transactions (PT): a new programming abstraction that offers different compatible transactions that can run concurrently in the same application.  ...  The Java port of SwissTM is from Mihai Letia.  ... 
doi:10.1007/978-3-662-44202-9_8 fatcat:tvorlee2bvasbbqjpnvnpkl3wm

Transactional predication

Nathan G. Bronson, Jared Casper, Hassan Chafi, Kunle Olukotun
2010 Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10  
Concurrent collection classes are widely used in multi-threaded programming, but they provide atomicity only for a fixed set of operations.  ...  We introduce transactional predication, a method for building transactional maps and sets on top of an underlying non-composable concurrent map.  ...  This means that a system that provides semantic conflict detection must break transaction isolation to communicate between active transactions.  ... 
doi:10.1145/1835698.1835703 dblp:conf/podc/BronsonCCO10 fatcat:3xuzjr767ven5c4j6nbvzdonle

Composing locks by decomposing deadlocks

Hari K. Pyla
2011 Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion - SPLASH '11  
with lock-based programming as opposed to using transactional memory systems and addressing issues in lock based programming can benefit the large base of lock-based software artifacts in use today.  ...  The goal of this research is to achieve composability of lock based codes.  ... 
doi:10.1145/2048147.2048176 dblp:conf/oopsla/Pyla11 fatcat:ibcfudzcincpbhe3dyc6qzityi

Distributed computing column 45

Idit Keidar
2012 ACM SIGACT News  
Semantics and Models In the first talk of WTTM3, Michael Scott argued that researchers in the area of concurrent systems and transactional memory have now a rare (and possibly brief!)  ...  The objective of WTTM was to discuss new theoretical challenges and recent achievements in the area of transactional computing. The workshop took place on September 22-23, 2011, in Rome, Italy.  ... 
doi:10.1145/2160649.2160671 fatcat:jlgskapmtngbpavipzyck6x3km

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  
Transactional memory promises that programmers can use large atomic regions while achieving similar performance.  ...  Our transactional collection classes use the concept of semantic concurrency control to eliminate these unnecessary data dependencies, replacing them with conflict detection based on the operations of  ...  This means we should evaluate transactional memory systems for their ability to run long transactions scalably, not by their ability to hold their own against code with very short transactions based on  ... 
doi:10.1145/1229428.1229441 dblp:conf/ppopp/CarlstromMCKO07 fatcat:7dy2d3bksbf3xlnkci5ejiv6ey

DracoSTM

Justin E. Gottschlich, Daniel A. Connors
2007 Proceedings of the 2007 Symposium on Library-Centric Software Design - LCSD '07  
Our new software transactional memory (STM) system, DracoSTM, is a high performance lock-based C++ STM research library.  ...  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  ...  We give special thanks to Jeremy Siek who gave insightful and critical DracoSTM design suggestions, improving the overall implementation of the system as well as the structure of this work.  ... 
doi:10.1145/1512762.1512768 fatcat:a4urjmloircdbd4dgxt4qav7he

Software Transactional Memory with Interactions [article]

Marino Miculan, Marco Peressotti
2020 arXiv   pre-print
To overcome this limitation, in this paper we present Open Transactional Memory (OTM), a programming abstraction supporting safe, data-driven interactions between composable memory transactions.  ...  Software Transactional memory (STM) is an emerging abstraction for concurrent programming alternative to lock-based synchronizations.  ...  A local version of actor-based open transactions can be implemented in OTM using lock-free data structures (e.g., message queues) in shared transactional memory.  ... 
arXiv:2007.10809v1 fatcat:2wkfde5yprgqveqeowittsu3re

Safe Commits for Transactional Featherweight Java [chapter]

Thi Mai Thuong Tran, Martin Steffen
2010 Lecture Notes in Computer Science  
All analyses developed in this work are formulated as static type and effect systems resp. an open semantics based on a type and effect system.  ...  In the transaction-based model, a similar problem of misuse of non-lexical transactions can happen in the same way as the misuse of explicit locks.  ...  The components of a system can be composed in different ways wrt. the supported features of the language used to program the system.  ... 
doi:10.1007/978-3-642-16265-7_21 fatcat:juc6xoj4pbdqrokxzcr2zqr7ei

Concurrency control with data coloring

Luis Ceze, Christoph von Praun, Călin Caşcaval, Pablo Montesinos, Josep Torrellas
2008 Proceedings of the 2008 ACM SIGPLAN workshop on Memory systems performance and correctness held in conjunction with the Thirteenth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS '08) - MSPC '08  
Based on these annotations, the system dynamically infers transaction boundaries.  ...  Concurrency control is one of the main sources of error and complexity in shared memory parallel programming.  ...  Based on the specification of colors, the color steps and the dynamic memory access stream, a system can automatically infer the points in the execution when transactions should be started and committed  ... 
doi:10.1145/1353522.1353525 dblp:conf/asplos/CezePCMT08 fatcat:a32yguryz5evtc72fxyq3hk53a

HeTM: Transactional Memory for Heterogeneous Systems [article]

Daniel Castro, Paolo Romano, Aleksandar Ilic, Amin M. Khan
2019 arXiv   pre-print
We demonstrate the efficiency of the SHeTM via an extensive quantitative study based both on synthetic benchmarks and on a porting of a popular object caching system.  ...  This work takes a step towards reducing the complexity of programming heterogeneous systems by introducing the abstraction of Heterogeneous Transactional Memory (HeTM).  ...  We demonstrated the efficiency of SHeTM via an extensive quantitative study based both on synthetic benchmarks and on a popular object caching system.  ... 
arXiv:1905.00661v2 fatcat:nxiihazahrc3xnyptkqo35ke3e

Advanced data processing in KRISYS: modeling concepts, implementation techniques, and client/server issues

Stefan Deßloch, Theo Härder, Nelson Mattos, Bernhard Mitschang, Joachim Thomas
1998 The VLDB journal  
To meet their requirements, concepts for advanced data management have been investigated during the last decade, especially in the field of object-orientation.  ...  The primary objective for the first version of KRISYS was to provide semantic features, such as an expressive data model, a set-oriented query language, deductive as well as active capabilities.  ...  Efficient access to object-internal information (i.e., attributes, aspects, etc.) is supported by means of a pointer-based representation.  ... 
doi:10.1007/s007780050055 fatcat:2cccshgixfgknl5eticrpxslki

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  
Our library offers efficient and scalable transactions, which are an order of magnitude faster than state-of-theart transactional memory toolkits.  ...  We introduce transactions into libraries of concurrent data structures; such transactions can be used to ensure atomicity of sequences of data structure operations.  ...  We are grateful to the referees for their many detailed comments, and in particular, Tony Hosking for shepherding the paper.  ... 
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  
Our library offers efficient and scalable transactions, which are an order of magnitude faster than state-of-theart transactional memory toolkits.  ...  We introduce transactions into libraries of concurrent data structures; such transactions can be used to ensure atomicity of sequences of data structure operations.  ...  We are grateful to the referees for their many detailed comments, and in particular, Tony Hosking for shepherding the paper.  ... 
doi:10.1145/2980983.2908112 fatcat:pfc57phlmbcklnrbwihvdhprzy

Integrated document management system

Andreas R. Dengel, Nelson M. Mattos, Bernhard Mitschang, Mohan M. Trivedi
1990 Applications of Artificial Intelligence VIII  
This is achieved by temporarily storing needed objects in a main-memory structure, called working memory, that offers almost direct access at costs comparable to a pointerlike access.  ...  To verify the hypotheses, a statistical data base (SDB) is used. It is composed of different packages of rules for the description of different possible logical objects /5/.  ... 
doi:10.1117/12.21085 fatcat:nno3z3ztifejtkbnm4rzuqzwt4
« Previous Showing results 1 — 15 out of 15,000 results