Toward a theory of transactional contention managers

DOI10.1145/1073814.1073863zbMath1314.68088OpenAlexW2106871513MaRDI QIDQ5177247

Bastian Pochon, Maurice P. Herlihy, Rachid Guerraoui

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.7134

zbMATH Keywords

software transactional memorycontention managementtransactions

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (58)

Dynamic scheduling in distributed transactional memory ⋮ Bayesian ignorance ⋮ Model checking transactional memories ⋮ Transactional contention management as a Non-clairvoyant scheduling problem ⋮ \(\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 ⋮ Towards a universal construction for transaction-based multiprocess programs ⋮ Fast flooding over Manhattan ⋮ Flexible scheduling of transactional memory on trees ⋮ Window-based greedy contention management for transactional memory: theory and practice ⋮ A competitive analysis for balanced transactional memory workloads ⋮ Ordered scheduling in control-flow distributed transactional memory ⋮ Distributed transactional memory for metric-space networks ⋮ The weakest failure detectors to boost obstruction-freedom ⋮ Transactional scheduling for read-dominated workloads ⋮ Non-clairvoyant scheduling with conflicts for unit-size jobs ⋮ Transactional memory ⋮ Adaptive locks: combining transactions and locks for efficient concurrency ⋮ Extensible transactional memory testbed ⋮ The computational structure of progress conditions and shared objects ⋮ Contention-sensitive data structures and algorithms ⋮ Distributed transactional memory for general networks ⋮ 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 ² ) 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 ⋮ Good programming in transactional memory: game theory meets multicore architecture ⋮ Bounds on contention management algorithms ⋮ Adaptive progress: a gracefully-degrading liveness property ⋮ Fast scheduling in distributed transactional memory ⋮ Time-communication impossibility results for distributed transactional memory

This page was built for publication: Toward a theory of transactional contention managers