Load balanced distributed directories

DOI10.1016/J.IC.2021.104700MaRDI QIDQ2139097zbMATH OpenOpenAlexFDO

Authors Shishir Rai, Gokarna Sharma, Costas Busch, 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

zbMATH Keywords

hierarchical clusteringapproximationcongestiondistributed systemsload balancingstretchdirectoriesprocessing load

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Load balanced distributed directories
• Distributed transactional memory for general networks
• Simple efficient load-balancing algorithms for peer-to-peer systems
• Low complexity variants of the arrow distributed directory
• Consistent load balancing via spread minimization

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (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?)
• A New Solution to Coherence Problems in Multicache Systems
• Accessing nearby copies of replicated objects in a distributed environment
• An analysis framework for distributed hierarchical directories
• Bypassing the embedding
• Distributed transactional memory for general networks
• Distributed transactional memory for metric-space networks
• Dynamic analysis of the Arrow distributed directory protocol in general networks
• Improved lower and upper bounds for universal TSP in planar metrics
• Improved lower bounds for the universal and a priori TSP
• Load balanced distributed directories
• Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
• Oblivious network design
• Optimal Oblivious Path Selection on the Mesh
• Optimal nearest neighbor queries in sensor networks
• Software transactional memory
• Universal approximations for TSP, Steiner tree, and set cover

Cited in

(2)

• Ordered scheduling in control-flow distributed transactional memory
• LinuxDirector: A connection director for scalable internet service

Describes a project that uses

Uses Software

• Pastry
• Chord

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)