Filters








93,789 Hits in 3.3 sec

Composable memory transactions

Tim Harris, Simon Marlow, Simon Peyton Jones, Maurice Herlihy
2008 Communications of the ACM  
In this paper we present a new concurrency model, based on transactional memory, that offers far richer composition.  ...  All the usual benefits of transactional memory are present (e.g. freedom from deadlock), but in addition we describe new modular forms of blocking and choice that have been inaccessible in earlier work  ...  Applications and examples In this section we provide some examples of how composable memory transactions can be used to build higher level concurrency abstractions.  ... 
doi:10.1145/1378704.1378725 fatcat:6pey7pbslnclvdgpnynu34jrtm

Composable memory transactions

Tim Harris, Simon Marlow, Simon Peyton-Jones, Maurice Herlihy
2005 Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '05  
In this paper we present a new concurrency model, based on transactional memory, that offers far richer composition.  ...  All the usual benefits of transactional memory are present (e.g. freedom from deadlock), but in addition we describe new modular forms of blocking and choice that have been inaccessible in earlier work  ...  Applications and examples In this section we provide some examples of how composable memory transactions can be used to build higher level concurrency abstractions.  ... 
doi:10.1145/1065944.1065952 dblp:conf/ppopp/HarrisMPH05 fatcat:fe4xetpowvfyfcanh3dbh3zoie

A Domain Specific Language for Composable Memory Transactions in Java [chapter]

André Rauber Du Bois, Marcos Echevarria
2009 Lecture Notes in Computer Science  
In this paper we present CMTJava, a domain specific language for composable memory transactions [7] in Java. CMTJava provides the abstraction of transactional objects.  ...  Transactional actions are first class values in Java and they are composable: transactions can be combined to generate new transactions.  ...  In [12] , an implementation of composable memory transactions using pure Haskell is given.  ... 
doi:10.1007/978-3-642-03034-5_9 fatcat:pts2lalspjfi3lc7vkitcvsbue

Efficient means of Achieving Composability using Object based Conflicts on Transactional Memory [article]

Sathya Peri, Ajay Singh, Archit Somani
2018 arXiv   pre-print
In this context composition provided by transactions in software transaction memory (STM) can be handy. However, most of the STMs offer read/write primitives to access shared cds.  ...  Composing together the individual atomic methods of concurrent data-structures (cds) pose multiple design and consistency challenges.  ...  choice for achieving composability [6] .  ... 
arXiv:1709.00681v5 fatcat:td4gkelg3vafrnzy2gxhy6th2y

Composing Multi-Ported Memories on FPGAs

Charles Eric Laforest, Zimo Li, Tristan O'rourke, Ming G. Liu, J. Gregory Steffan
2014 ACM Transactions on Reconfigurable Technology and Systems  
Multi-ported memories are challenging to implement on FPGAs since the block RAMs included in the fabric typically have only two ports.  ...  Hence we must construct memories requiring more than two ports either out of logic elements or by combining multiple block RAMs.  ...  Sumner Memorial Fellowship for financial support.  ... 
doi:10.1145/2629629 fatcat:aadxrbyd2fe2lln6ahdvymog6y

Compact Superconducting Lookup Table Composed of 2-Dimensional Memory Cell Array Reconfigured by External Dc Control Currents

Takuya Hosoya, Yuki Yamanashi, Nobuyuki Yoshikawa
2021 IEEE transactions on applied superconductivity  
The memory cell is composed of a nondestructive read-out (NDRO) flip-flop with input circuits that convert the input dc current to an SFQ pulse signal.  ...  Index Terms-Cryogenic memory, lookup table (LUT), memory cell, single flux quantum (SFQ) circuit.  ...  We report the design and test results of the new compact memory cell and the LUT composed of the memory cells.  ... 
doi:10.1109/tasc.2021.3049771 fatcat:5wrzyliagbfnljomhpe7lial3i

Leveraging transactional memory for a predictable execution of applications composed of hard real-time and best-effort tasks

Stefan Metzlaff, Sebastian Weis, Theo Ungerer
2013 Proceedings of the 21st International conference on Real-Time Networks and Systems - RTNS '13  
FIFO transaction commit queue Registering transactions on transaction begin Core 1 Core 2 Memory Bus I/O Device HTM Mgmt.  ...  detection → Bounded maximum transaction delay Core 1 Core 2 Memory Bus I/O Device HTM Mgmt.  ... 
doi:10.1145/2516821.2516832 dblp:conf/rtns/MetzlaffWU13 fatcat:jbztq4l5tbh4zhj4bc6t45rvqe

Composable Transactional Objects: A Position Paper [chapter]

Maurice Herlihy, Eric Koskinen
2014 Lecture Notes in Computer Science  
We suggest that a model based on persistent data structures could permit a variety of transactional algorithms to coexist in a library of composable transactional objects.  ...  In this statement, we advocate a transactional model of programming without a heavyweight software transactional memory, and describe some related, open research challenges.  ...  In a nonuniform memory access (NUMA) architecture, threads can access local memory quickly, and remote memory more slowly.  ... 
doi:10.1007/978-3-642-54833-8_1 fatcat:bxjldtbsy5arno47ikngjqayba

Subtleties of transactional memory atomicity semantics

C. Blundell, E.C. Lewis, M.M.K. Martin
2006 IEEE computer architecture letters  
always composable.  ...  Transactional memory implementations then optimistically execute these transactions concurrently to obtain high performance.  ...  and composing transactions)?  ... 
doi:10.1109/l-ca.2006.18 fatcat:iuuh4gseurafto22upludnui3i

Composing Relaxed Transactions

Vincent Gramoli, Rachid Guerraoui, Mihai Letia
2013 2013 IEEE 27th International Symposium on Parallel and Distributed Processing  
the art software transactional memory implementations (TL2, LSA, SwissTM) by almost a factor of 3.  ...  We present outheritance, a necessary and sufficient condition for a (potentially relaxed) transactional memory to support composition.  ...  A memory transaction is an appealing concurrent programming abstraction for it makes programs easily composable [4] , [9] - [11] .  ... 
doi:10.1109/ipdps.2013.42 dblp:conf/ipps/GramoliGL13 fatcat:efjmgqsjubdnfod7onbwpkdpfy

DracoSTM

Justin E. Gottschlich, Daniel A. Connors
2007 Proceedings of the 2007 Symposium on Library-Centric Software Design - LCSD '07  
Transactional memory (TM) is a recent parallel programming concept which reduces challenges found in parallel programming.  ...  Our new software transactional memory (STM) system, DracoSTM, is a high performance lock-based C++ STM research library.  ...  Composed External The above move example demonstrates how two independent transactions can be composed together forming a single, larger transaction.  ... 
doi:10.1145/1512762.1512768 fatcat:a4urjmloircdbd4dgxt4qav7he

Correctness of Concurrent Executions of Closed Nested Transactions in Transactional Memory Systems [chapter]

Sathya Peri, Krishnamurthy Vidyasankar
2011 Lecture Notes in Computer Science  
Importantly, transactions provide a very promising approach for composing software components.  ...  If the values in the buffers form a consistent view of the memory then the transaction is committed and the values are merged into the memory.  ...  transaction.  ... 
doi:10.1007/978-3-642-17679-1_9 fatcat:ntgkgyzqifhfvogbmjg74wabky

Correctness of concurrent executions of closed nested transactions in transactional memory systems

Sathya Peri, K. Vidyasankar
2013 Theoretical Computer Science  
Importantly, transactions provide a very promising approach for composing software components.  ...  If the values in the buffers form a consistent view of the memory then the transaction is committed and the values are merged into the memory.  ...  transaction.  ... 
doi:10.1016/j.tcs.2013.01.024 fatcat:ao4ktewl5vfd7m72k5btf6h5zu

Towards Composable Concurrency Abstractions

Janwillem Swalens, Stefan Marr, Joeri De Koster, Tom Van Cutsem
2014 Electronic Proceedings in Theoretical Computer Science  
Memory.  ...  We study all pairwise combinations of the abstractions, noting which ones compose without issues, and which do not.  ...  access of concurrent activities to shared memory using transactions.  ... 
doi:10.4204/eptcs.155.8 fatcat:jvsiv3vxb5adjkoucucxbgiosu

Unlocking concurrency

Ali-Reza Adl-Tabatabai, Christos Kozyrakis, Bratin Saha
2006 Queue  
Transactional memory avoids many of these pitfalls and allows the programmer to compose applications safely and in a manner that scales.  ...  SOFTWARE TRANSACTIONAL MEMORY STM (software transactional memory) implements transactional memory entirely in software so that it runs on stock hardware.  ...  He is working on transactional memory techniques that can greatly simplify parallel programming for the average developer.  ... 
doi:10.1145/1189276.1189288 fatcat:v5fhpagghffwfiw5c3gfc2ygfa
« Previous Showing results 1 — 15 out of 93,789 results