Software transactional memory
From MaRDI portal
Publication:5361456
DOI10.1145/224964.224987zbMath1373.68178OpenAlexW2092911542MaRDI QIDQ5361456
Publication date: 29 September 2017
Published in: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/224964.224987
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Distributed systems (68M14)
Related Items (69)
Bayesian ignorance ⋮ Model checking transactional memories ⋮ Last-use opacity: a strong safety property for transactional memory with prerelease support ⋮ Dynamic state restoration using versioning exceptions ⋮ \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores ⋮ A modular approach to shared-memory consensus, with applications to the probabilistic-write model ⋮ Correctness of concurrent executions of closed nested transactions in transactional memory systems ⋮ Fast flooding over Manhattan ⋮ Universal constructions for large objects ⋮ Window-based greedy contention management for transactional memory: theory and practice ⋮ A framework for automated distributed implementation of component-based models ⋮ Proving opacity of transactional memory with early release ⋮ Designing a software transactional memory for peer-to-peer systems ⋮ A competitive analysis for balanced transactional memory workloads ⋮ Dependence analysis for safe futures ⋮ Distributed transactional memory for metric-space networks ⋮ Verification of STM on relaxed memory models ⋮ A model of dynamic separation for transactional memory ⋮ Universal constructions that ensure disjoint-access parallelism and wait-freedom ⋮ The RedBlue family of universal constructions ⋮ Completeness and Nondeterminism in Model Checking Transactional Memories ⋮ Lock-free reference counting ⋮ Randomized protocols for asynchronous consensus ⋮ Nebelung: Execution environment for transactional openmp ⋮ Adaptive locks: combining transactions and locks for efficient concurrency ⋮ Lightweight transactional memory systems for NoCs based architectures: design, implementation and comparison of two policies ⋮ On avoiding spare aborts in transactional memory ⋮ A formal semantics of nested atomic sections with thread escape ⋮ Contention-sensitive data structures and algorithms ⋮ The multiplicative power of consensus numbers ⋮ The k -bakery ⋮ On asymmetric progress conditions ⋮ Verifying linearizability with hindsight ⋮ Eventually linearizable shared objects ⋮ The topology of shared-memory adversaries ⋮ Adaptive randomized mutual exclusion in sub-logarithmic expected time ⋮ Distributed data classification in sensor networks ⋮ Partial information spreading with application to distributed maximum coverage ⋮ Efficient threshold detection in a distributed environment ⋮ Forbidden-set distance labels for graphs of bounded doubling dimension ⋮ Efficient distributed random walks with applications ⋮ On the theoretical gap between synchronous and asynchronous MPC protocols ⋮ Hybrid-secure MPC ⋮ Meeting the deadline ⋮ A new technique for distributed symmetry breaking ⋮ On the computational power of oblivious robots ⋮ Finding mobile data under delay constraints with searching costs ⋮ On utilizing speed in networks of mobile agents ⋮ Expansion and the cover time of parallel random walks ⋮ Rapid randomized pruning for fast greedy distributed algorithms ⋮ Broadcasting in unreliable radio networks ⋮ Discrete load balancing is (almost) as easy as continuous load balancing ⋮ Locating a target with an agent guided by unreliable local advice ⋮ Distributed algorithms for edge dominating sets ⋮ Deterministic distributed vertex coloring in polylogarithmic time ⋮ Breaking the O ( n 2 ) bit barrier ⋮ Optimal gradient clock synchronization in dynamic networks ⋮ Online set packing and competitive scheduling of multi-part tasks ⋮ How to meet when you forget ⋮ Constant RMR solutions to reader writer synchronization ⋮ Finite-state concurrent programs can be expressed in pairwise normal form ⋮ The Complexity of Predicting Atomicity Violations ⋮ SMV: Selective Multi-Versioning STM ⋮ In the Search for Optimal Concurrency ⋮ A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition ⋮ Time-communication impossibility results for distributed transactional memory ⋮ The power of multiobjects. ⋮ Programming Languages For Interactive Computing ⋮ HiperTM: high performance, fault-tolerant transactional memory
This page was built for publication: Software transactional memory
