Distributed transactional memory for metric-space networks
From MaRDI portal
Publication:1954240
DOI10.1007/s00446-007-0037-xzbMath1266.68038MaRDI QIDQ1954240
Publication date: 20 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.958.7675
68M10: Network design and communication in computer systems
68M14: Distributed systems
68M12: Network protocols
Related Items
Optimal nearest neighbor queries in sensor networks, Flexible scheduling of transactional memory on trees, \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores, Fast scheduling in distributed transactional memory, Time-communication impossibility results for distributed transactional memory, Dynamic scheduling in distributed transactional memory, Load balanced distributed directories, Distributed transactional memory for general networks, An analysis framework for distributed hierarchical directories
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Congestion, dilation, and energy in radio networks
- Distributed object location in a dynamic network
- Competitive algorithms for distributed data management.
- Accessing nearby copies of replicated objects in a distributed environment
- Competitive concurrent distributed queuing
- Efficient asynchronous distributed symmetry breaking
- Finding nearest neighbors in growth-restricted metrics
- Bypassing the embedding
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Online tracking of mobile users
- Toward a theory of transactional contention managers
- Competitive distributed file allocation
- Disjoint-access-parallel implementations of strong shared memory primitives
- Software transactional memory
- Practical implementations of non-blocking synchronization primitives
- Principles of Distributed Systems
