Elastic Transactions
From MaRDI portal
Publication:3646218
DOI10.1007/978-3-642-04355-0_12zbMath1261.68024OpenAlexW2914061328MaRDI QIDQ3646218
Vincent Gramoli, Pascal Felber, Rachid Guerraoui
Publication date: 19 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04355-0_12
Related Items (41)
Bayesian ignorance ⋮ Last-use opacity: a strong safety property for transactional memory with prerelease support ⋮ Über Integrale auf konvexen Körpern. I, II ⋮ \(\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 ⋮ Fast flooding over Manhattan ⋮ Using Abstract Interpretation to Correct Synchronization Faults ⋮ Proving opacity of transactional memory with early release ⋮ Transactional memory ⋮ Extensible transactional memory testbed ⋮ 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
This page was built for publication: Elastic Transactions
