Distributed transactional memory for general networks

DOI10.1007/S00446-014-0214-7MaRDI QIDQ2256963zbMATH OpenOpenAlexFDO

Authors 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

cache-coherencecompetitive ratiodistributed transactional memorygeneral networkshierarchical clusteringsparse covers

Mathematics Subject Classification ID

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

Recommendations

• Distributed transactional memory for metric-space networks
• Distributed Computing
• Fast scheduling in distributed transactional memory
• Flexible scheduling of transactional memory on trees
• Load balanced distributed directories

Cites work

• A competitive analysis for balanced transactional memory workloads
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A tight bound on approximating arbitrary metrics by tree metrics
• Accessing nearby copies of replicated objects in a distributed environment
• Approximation algorithms for data management in networks
• Bypassing the embedding
• Competitive concurrent distributed queuing
• Distributed transactional memory for metric-space networks
• Dynamic analysis of the arrow distributed protocol
• Finding nearest neighbors in growth-restricted metrics
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• scientific article; zbMATH DE number 1445331 (Why is no real title available?)
• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• scientific article; zbMATH DE number 6469222 (Why is no real title available?)
• Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
• Oblivious network design
• On the power of randomization in on-line algorithms
• Self-stabilizing systems in spite of distributed control
• Software transactional memory
• Steiner points in tree metrics don't (really) help
• The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
• Toward a theory of transactional contention managers
• Window-based greedy contention management for transactional memory: theory and practice

Cited in

(16)

• Distributed transactional memory for metric-space networks
• Fast scheduling in distributed transactional memory
• Time-communication impossibility results for distributed transactional memory
• Dynamic scheduling in distributed transactional memory
• Load balanced distributed directories
• HiperTM: high performance, fault-tolerant transactional memory
• Distributed transactions for ODMG federated databases
• scientific article; zbMATH DE number 1225032 (Why is no real title available?)
• Distributed Computing
• Optimal nearest neighbor queries in sensor networks
• Stable scheduling in transactional memory
• Flexible scheduling of transactional memory on trees
• Flexible scheduling of transactional memory on trees
• Load balanced distributed directories
• Ordered scheduling in control-flow distributed transactional memory
• A poly-log approximation for transaction scheduling in fog-cloud computing and beyond

Describes a project that uses

Uses Software

• DiSTM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256963)