Load balanced distributed directories
From MaRDI portal
Publication:2139097
DOI10.1016/J.IC.2021.104700OpenAlexW2897241442MaRDI QIDQ2139097FDOQ2139097
Gokarna Sharma, Costas Busch, Shishir Rai, Maurice Herlihy
Publication date: 17 May 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2021.104700
hierarchical clusteringapproximationcongestiondistributed systemsload balancingstretchdirectoriesprocessing load
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universal approximations for TSP, Steiner tree, and set cover
- Improved lower and upper bounds for universal TSP in planar metrics
- Software transactional memory
- Accessing nearby copies of replicated objects in a distributed environment
- Oblivious network design
- Bypassing the embedding
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
- A New Solution to Coherence Problems in Multicache Systems
- Improved Lower Bounds for the Universal and a priori TSP
- Dynamic analysis of the Arrow distributed directory protocol in general networks
- Distributed transactional memory for metric-space networks
- Distributed transactional memory for general networks
- An analysis framework for distributed hierarchical directories
- Optimal Oblivious Path Selection on the Mesh
- Optimal nearest neighbor queries in sensor networks
- Load balanced distributed directories
Cited In (2)
Uses Software
This page was built for publication: Load balanced distributed directories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139097)