The following pages link to Software transactional memory (Q5361456):
Displaying 50 items.
- Correctness of concurrent executions of closed nested transactions in transactional memory systems (Q391262) (← links)
- Dependence analysis for safe futures (Q436391) (← links)
- Verification of STM on relaxed memory models (Q453508) (← links)
- On avoiding spare aborts in transactional memory (Q493661) (← links)
- Contention-sensitive data structures and algorithms (Q526873) (← links)
- Adaptive locks: combining transactions and locks for efficient concurrency (Q666229) (← links)
- Lightweight transactional memory systems for NoCs based architectures: design, implementation and comparison of two policies (Q666232) (← links)
- Dynamic state restoration using versioning exceptions (Q853735) (← links)
- Proving opacity of transactional memory with early release (Q902713) (← links)
- Designing a software transactional memory for peer-to-peer systems (Q902725) (← links)
- Nebelung: Execution environment for transactional openmp (Q934951) (← links)
- \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores (Q1656883) (← links)
- A formal semantics of nested atomic sections with thread escape (Q1749114) (← links)
- The power of multiobjects. (Q1854306) (← links)
- Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
- A framework for automated distributed implementation of component-based models (Q1938379) (← links)
- Distributed transactional memory for metric-space networks (Q1954240) (← links)
- A model of dynamic separation for transactional memory (Q1959477) (← links)
- Time-communication impossibility results for distributed transactional memory (Q2075626) (← links)
- Last-use opacity: a strong safety property for transactional memory with prerelease support (Q2146873) (← links)
- The RedBlue family of universal constructions (Q2220397) (← links)
- HiperTM: high performance, fault-tolerant transactional memory (Q2357152) (← links)
- Model checking transactional memories (Q2377134) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- In the Search for Optimal Concurrency (Q2835023) (← links)
- Programming Languages For Interactive Computing (Q2864508) (← links)
- SMV: Selective Multi-Versioning STM (Q3095323) (← links)
- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition (Q3408177) (← links)
- Completeness and Nondeterminism in Model Checking Transactional Memories (Q3541009) (← links)
- The Complexity of Predicting Atomicity Violations (Q3617757) (← links)
- Lock-free reference counting (Q5138383) (← links)
- Randomized protocols for asynchronous consensus (Q5138489) (← links)
- The multiplicative power of consensus numbers (Q5176187) (← links)
- The <i>k</i> -bakery (Q5176188) (← links)
- On asymmetric progress conditions (Q5176189) (← links)
- Verifying linearizability with hindsight (Q5176190) (← links)
- Eventually linearizable shared objects (Q5176192) (← links)
- The topology of shared-memory adversaries (Q5176193) (← links)
- Adaptive randomized mutual exclusion in sub-logarithmic expected time (Q5176194) (← links)
- Distributed data classification in sensor networks (Q5176195) (← links)
- Partial information spreading with application to distributed maximum coverage (Q5176196) (← links)
- Efficient threshold detection in a distributed environment (Q5176197) (← links)
- Forbidden-set distance labels for graphs of bounded doubling dimension (Q5176198) (← links)
- Efficient distributed random walks with applications (Q5176199) (← links)
- On the theoretical gap between synchronous and asynchronous MPC protocols (Q5176200) (← links)
- Hybrid-secure MPC (Q5176201) (← links)
- Meeting the deadline (Q5176203) (← links)
- A new technique for distributed symmetry breaking (Q5176204) (← links)
- On the computational power of oblivious robots (Q5176205) (← links)
- Finding mobile data under delay constraints with searching costs (Q5176206) (← links)
