Pages that link to "Item:Q5177247"

The following pages link to Toward a theory of transactional contention managers (Q5177247):

Displaying 50 items.

• Towards a universal construction for transaction-based multiprocess programs (Q391265) (← links)
• Transactional scheduling for read-dominated workloads (Q456006) (← links)
• Contention-sensitive data structures and algorithms (Q526873) (← links)
• Good programming in transactional memory: game theory meets multicore architecture (Q553350) (← links)
• Bounds on contention management algorithms (Q553351) (← links)
• Transactional memory (Q666225) (← links)
• Adaptive locks: combining transactions and locks for efficient concurrency (Q666229) (← links)
• Extensible transactional memory testbed (Q666242) (← links)
• Transactional contention management as a Non-clairvoyant scheduling problem (Q848634) (← links)
• Adaptive progress: a gracefully-degrading liveness property (Q992505) (← links)
• \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores (Q1656883) (← links)
• Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
• Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
• Distributed transactional memory for metric-space networks (Q1954240) (← links)
• The weakest failure detectors to boost obstruction-freedom (Q1954262) (← links)
• The computational structure of progress conditions and shared objects (Q1988520) (← links)
• Fast scheduling in distributed transactional memory (Q2035479) (← links)
• Time-communication impossibility results for distributed transactional memory (Q2075626) (← links)
• Dynamic scheduling in distributed transactional memory (Q2121056) (← links)
• Distributed transactional memory for general networks (Q2256963) (← links)
• Model checking transactional memories (Q2377134) (← links)
• A competitive analysis for balanced transactional memory workloads (Q2429336) (← 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)
• On utilizing speed in networks of mobile agents (Q5176207) (← links)
• Expansion and the cover time of parallel random walks (Q5176208) (← links)
• Rapid randomized pruning for fast greedy distributed algorithms (Q5176209) (← links)
• Broadcasting in unreliable radio networks (Q5176210) (← links)
• Discrete load balancing is (almost) as easy as continuous load balancing (Q5176211) (← links)
• Locating a target with an agent guided by unreliable local advice (Q5176212) (← links)
• Distributed algorithms for edge dominating sets (Q5176213) (← links)
• Fast flooding over Manhattan (Q5176214) (← links)
• Bayesian ignorance (Q5176215) (← links)
• Deterministic distributed vertex coloring in polylogarithmic time (Q5176216) (← links)