Filters








2,593 Hits in 6.9 sec

Proust: A Design Space for Highly-Concurrent Transactional Data Structures [article]

Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy, Eric Koskinen
2017 arXiv   pre-print
This paper introduces Proust, a framework for the design and implementation of transactional data structures.  ...  One reason is that they typically detect conflicts by tracking transactions' read sets and write sets, an approach that often leads to false conflicts.  ...  The challenge is how to integrate conflict abstractions (Section 3), shadow copy objects (Section 4), eager-vs-lazy/optimistic-vs-pessimistic variants, and differing assumptions about the guarantees of  ... 
arXiv:1702.04866v2 fatcat:mp27zngblvhgxiys3llazkey4q

Adapting Persistent Data Structures for Concurrency and Speculation [article]

Thomas Dickerson
2020 arXiv   pre-print
with low contention and an efficient snapshot operation to support speculative execution models.  ...  It also exploits commutativity to characterize a design space for integrating traditional high-performance concurrent data structures into Software Transactional Memory (STM) runtimes, and extends this  ...  Conclusions We introduced two new concepts-conflict abstractions and shadow copies-for transactional object systems.  ... 
arXiv:2003.07395v1 fatcat:aad7ireyebbhrec77vafywhm6q

HeTM: Transactional Memory for Heterogeneous Systems [article]

Daniel Castro, Paolo Romano, Aleksandar Ilic, Amin M. Khan
2019 arXiv   pre-print
Besides introducing the abstract semantics and programming model of HeTM, we present the design and evaluation of a concrete implementation of the proposed abstraction, which we named Speculative HeTM  ...  HeTM provides programmers with the illusion of a single memory region, shared among the CPUs and the (discrete) GPU(s) of a heterogeneous system, with support for atomic transactions.  ...  In particular, optimistic simulation systems [16] , [44] , where the state of local simulation objects is allowed to advance in a speculative fashion, i.e., skipping synchronization with remote objects  ... 
arXiv:1905.00661v2 fatcat:nxiihazahrc3xnyptkqo35ke3e

Operating systems transactions

Donald E. Porter, Owen S. Hofmann, Christopher J. Rossbach, Alexander Benn, Emmett Witchel
2009 Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles - SOSP '09  
By making transactions a central OS abstraction, TxOS enables new transactional services. For example, one developer prototyped a transactional ext3 file system in less than one month.  ...  For instance, a transactional installation of OpenSSH incurs only 10% overhead, and a non-transactional compilation of Linux incurs negligible overhead on TxOS.  ...  TxOS's isolation mechanisms are optimistic, allowing concurrent transactions on the assumption that conflicts are rare.  ... 
doi:10.1145/1629575.1629591 dblp:conf/sosp/PorterHRBW09 fatcat:vwkhrgvvuna5tbx2mowbmo3dde

Where does transactional memory research stand and what challenges lie ahead?

Maria Couceiro, Paolo Romano
2012 ACM SIGOPS Operating Systems Review  
Serdar presented a method for modelling and verifying programs using TM with relaxed conflict detection that allows the programmer to reason sequentially on an abstracted version of the transaction.  ...  without aborting, thus with minimal instrumentation and management costs, while other threads (the speculative helpers) can commit transactions only when they do not conflict.  ...  instrumentation and management costs, while other threads (the speculative helpers) can commit transactions only when they do not conflict.  ... 
doi:10.1145/2331576.2331589 fatcat:o3gq3y7tpnfgngdf2dj4ykx3ge

A survey on optimizations towards best-effort hardware transactional memory

Zhenwei Wu, Kai Lu, Ruibo Wang, Wenzhe Zhang
2020 CCF Transactions on High Performance Computing  
Transactional memory has been attracting increasing attention in recent years, and it provides optimistic concurrency control schemes for shared-memory parallel programs.  ...  The rapid development and wide adoption of transactional memory make this programming paradigm promising for achieving breakthroughs in massively parallel computing.  ...  Acknowledgements The authors would like to thank the anonymous reviewers for their valuable comments and suggestions to improve the quality of the paper.  ... 
doi:10.1007/s42514-020-00049-2 fatcat:lf5s3agulfhpzgxcjgjk2msqfy

Profile-guided proactive garbage collection for locality optimization

Wen-ke Chen, Sanjay Bhansali, Trishul Chilimbi, Xiaofeng Gao, Weihaw Chuang
2006 Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation - PLDI '06  
We combine transaction bookkeeping with the virtual memory system to support fast transaction conflict detection, commit, abort, and to maintain transactions' speculative data. xiv  ...  Bounds checking protects pointer and array accesses. It is the process of keeping track of the address boundaries for objects, and checking that the loads and stores do not stray outside bounds.  ...  We use the same in-cache hardware transactional memory model for both PTM and VTM. This is a more optimistic model for VTM than that featured in [73] .  ... 
doi:10.1145/1133981.1134021 dblp:conf/pldi/ChenBCGC06 fatcat:bnv6i26dnfaj3fel6vudd2ut3u

Profile-guided proactive garbage collection for locality optimization

Wen-ke Chen, Sanjay Bhansali, Trishul Chilimbi, Xiaofeng Gao, Weihaw Chuang
2006 SIGPLAN notices  
We combine transaction bookkeeping with the virtual memory system to support fast transaction conflict detection, commit, abort, and to maintain transactions' speculative data. xiv  ...  Bounds checking protects pointer and array accesses. It is the process of keeping track of the address boundaries for objects, and checking that the loads and stores do not stray outside bounds.  ...  We use the same in-cache hardware transactional memory model for both PTM and VTM. This is a more optimistic model for VTM than that featured in [73] .  ... 
doi:10.1145/1133255.1134021 fatcat:rdddng3bj5fdfprxfg6ut3dg3y

A runtime system for software lock elision

Amitabha Roy, Steven Hand, Tim Harris
2009 Proceedings of the fourth ACM european conference on Computer systems - EuroSys '09  
Execution proceeds optimistically, dynamically detecting conflicts between accesses by concurrent threads.  ...  Furthermore, we never require a thread holding a lock to wait for a thread that has speculatively acquired it.  ...  Acknowledgements We would like to thank the reviewers for their constructive comments, and our shepherd George Candea for his focused efforts in helping us towards a better paper.  ... 
doi:10.1145/1519065.1519094 dblp:conf/eurosys/RoyHH09 fatcat:xpr7yjrgrbg63b5dgkekvsqglm

A pattern language for parallelizing irregular algorithms

Pedro Monteiro, Miguel P. Monteiro
2010 Proceedings of the 2010 Workshop on Parallel Programming Patterns - ParaPLoP '10  
Four patterns are proposed: Amorphous Data-Parallelism, Data-Parallel Graph, Optimistic Iteration and In-Order Iteration.  ...  This paper presents the first part of a pattern language for creating parallel implementations of irregular algorithms and applications.  ...  for both the conflicted and re-executed iteration.  ... 
doi:10.1145/1953611.1953624 fatcat:oi5g6iro6bckjjn5w7fky5xdri

Transactional Memory, 2nd edition

Tim Harris, James Larus, Ravi Rajwar
2010 Synthesis Lectures on Computer Architecture  
A simpler Copy-PTM variant ensures that, for each physical page, the shadow page holds a snapshot of the current non-speculative data, while speculative updates are made eagerly to the original copy of  ...  SPECULATION OVER TM Futures provide an abstraction for adding concurrency to a sequential program [130] .  ...  He has worked on concurrent algorithms and transactional memory for over ten years, most recently, focusing on the implementation of STM for multi-core computers and the design of programming language  ... 
doi:10.2200/s00272ed1v01y201006cac011 fatcat:25d3gvp5zrfqlgpzdzknqouofi

Exploiting abstraction relationships' semantics for transaction synchronization in KBMSs

Fernando de Ferreira Rezende, Theo Härder
1997 Data & Knowledge Engineering  
By this way, we capture the abstraction relationships' semantics contained in a KB graph for transaction synchronization purposes and enable the exploitation of the inherent parallelism in a knowledge  ...  We propose an approach for transaction synchronization in KBMSs -LARS (Locks using Abstraction Relationships' Semantics).  ...  Thomas for supporting us understanding the upper layers of KBMSs, and the anonymous referees for suggestions to improve the presentation.  ... 
doi:10.1016/s0169-023x(96)00049-3 fatcat:qqaevnubovgjfnce4h7smwfbve

Mjölnir

Jelle van den Hooff, David Lazar, James Mickens
2015 Proceedings of the 6th Asia-Pacific Workshop on Systems - APSys '15  
We then propose new programming abstractions and a new deployment model that reduce the overhead of building and running web services.  ...  Conventional wisdom suggests that rich, large-scale web applications are difficult to build and maintain.  ...  For example, Crom [30] forces a speculative event handler to update shadow JavaScript state that is only committed if the speculated event is actually generated.  ... 
doi:10.1145/2797022.2797025 dblp:conf/apsys/HooffLM15 fatcat:24bkukotz5b5xee56y5dkczqtq

In-Memory Big Data Management and Processing: A Survey

Hao Zhang, Gang Chen, Beng Chin Ooi, Kian-Lee Tan, Meihui Zhang
2015 IEEE Transactions on Knowledge and Data Engineering  
In this survey, we aim to provide a thorough review of a wide range of in-memory data management and processing proposals and systems, including both data storage systems and data processing frameworks  ...  Many of these researches have focused along several dimensions: modern CPU and memory hierarchy utilization, time/space efficiency, parallelism and concurrency control.  ...  We would like to thank the anonymous reviewers, and also Bingsheng He, Eric Lo and Bogdan Marius Tudor, for their insightful comments and suggestions.  ... 
doi:10.1109/tkde.2015.2427795 fatcat:u7r3rtvhxbainfeazfduxcdwrm

Passive network forensics

John McHugh, Ron McLeod, Vagishwari Nagaonkar
2008 ACM SIGOPS Operating Systems Review  
It makes extensive use of object versioning and application-assisted conflict resolution in a manner that provides a novel interface for developers to use.  ...  How well would it work with persistent state transactions. How does it compare with speculative systems?  ...  SVA aims to enforce fine-grain (object level) memory safety, control-flow integrity, type safety for a subset of objects, and sound analysis.  ... 
doi:10.1145/1368506.1368520 fatcat:mux57vw23naevdz4qqxrkz52aq
« Previous Showing results 1 — 15 out of 2,593 results