Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs

DOI10.1007/978-3-030-64348-5_9MaRDI QIDQ6487900zbMATH OpenFDO

Authors Shlomi Dolev, Manish Kumar, Yefim Dinitz

Publication date 21 March 2023

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Locally optimal load balancing
• Tight Analyses of Two Local Load Balancing Algorithms
• scientific article; zbMATH DE number 1263231
• The convergence of realistic distributed load-balancing algorithms
• Discrete load balancing is (almost) as easy as continuous load balancing

Cited in

(2)

• A fully asynchronous and fault tolerant distributed algorithm to compute a minimum graph orientation
• Local deal-agreement algorithms for load balancing in dynamic general graphs

This page was built for publication: Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs

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