Dynamic load balancing with group communication

DOI10.1016/J.TCS.2006.09.020MaRDI QIDQ861278zbMATH OpenOpenAlexFDO

Authors Shlomi Dolev, Roberto Segala, Alexander A. Schwarzmann

Publication date 9 January 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.09.020

zbMATH Keywords

dynamic networksgroup communicationsload balancingscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15) Communication networks in operations research (90B18)

Recommendations

• Automata, Languages and Programming
• Dynamic load balancing by random matchings
• On the stability of dynamic diffusion load balancing
• Synchronous distributed load balancing on dynamic networks
• Work-competitive scheduling for cooperative computing with dynamic groups

Cites work

• Bounded Concurrent Time-Stamping
• Cooperative computing with fragmentable and mergeable groups
• Distributed scheduling for disconnected cooperation
• Dynamic voting for consistent primary components
• scientific article; zbMATH DE number 1696670 (Why is no real title available?)
• scientific article; zbMATH DE number 432838 (Why is no real title available?)
• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• scientific article; zbMATH DE number 1306905 (Why is no real title available?)
• scientific article; zbMATH DE number 1033646 (Why is no real title available?)
• scientific article; zbMATH DE number 2006650 (Why is no real title available?)
• scientific article; zbMATH DE number 2156277 (Why is no real title available?)
• Performing tasks on synchronous restartable message-passing processors
• Performing Work Efficiently in the Presence of Faults
• The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
• Time-optimal message-efficient work performance in the presence of faults
• Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups

Cited in

(11)

• Application-based dynamic primary views in asynchronous distributed systems.
• Cooperative computing with fragmentable and mergeable groups
• Distributed scheduling for disconnected cooperation
• scientific article; zbMATH DE number 1196818 (Why is no real title available?)
• Dealing with undependable workers in decentralized network supercomputing
• The complexity of synchronous iterative do-all with crashes
• Local deal-agreement algorithms for load balancing in dynamic general graphs
• Redundant movements in autonomous mobility: experimental and theoretical analysis
• Maintaining a dynamic set of processors in a distributed system
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• A group-based load balance scheme for software distributed shared memory systems

Describes a project that uses

Uses Software

• Horus

This page was built for publication: Dynamic load balancing with group communication

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