Distributed transactional memory for general networks

DOI10.1007/s00446-014-0214-7zbMath1320.68050OpenAlexW2135352683MaRDI QIDQ2256963

Gokarna Sharma, Costas Busch

Publication date: 23 February 2015

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-014-0214-7

zbMATH Keywords

hierarchical clusteringcompetitive ratiosparse coversgeneral networksdistributed transactional memorycache-coherence

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Related Items (9)

Dynamic scheduling in distributed transactional memory ⋮ Load balanced distributed directories ⋮ Stable scheduling in transactional memory ⋮ Flexible scheduling of transactional memory on trees ⋮ Flexible scheduling of transactional memory on trees ⋮ Ordered scheduling in control-flow distributed transactional memory ⋮ Optimal nearest neighbor queries in sensor networks ⋮ Fast scheduling in distributed transactional memory ⋮ Time-communication impossibility results for distributed transactional memory

Uses Software

• DiSTM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic analysis of the arrow distributed protocol
• Accessing nearby copies of replicated objects in a distributed environment
• On the power of randomization in on-line algorithms
• Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
• Approximation algorithms for data management in networks
• Window-based greedy contention management for transactional memory: theory and practice
• Distributed transactional memory for metric-space networks
• A competitive analysis for balanced transactional memory workloads
• Competitive concurrent distributed queuing
• Finding nearest neighbors in growth-restricted metrics
• Bypassing the embedding
• Oblivious network design
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Self-stabilizing systems in spite of distributed control
• The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
• Software transactional memory
• Toward a theory of transactional contention managers
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Distributed transactional memory for general networks