Dynamic load balancing with group communication

DOI10.1016/j.tcs.2006.09.020zbMath1140.68070OpenAlexW2153320919MaRDI QIDQ861278

Roberto Segala, Shlomi Dolev, 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

schedulingload balancingdynamic networksgroup communications

Mathematics Subject Classification ID

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

Related Items

Distributed scheduling for disconnected cooperation ⋮ Local deal-agreement algorithms for load balancing in dynamic general graphs ⋮ The complexity of synchronous iterative Do-All with crashes ⋮ Dealing with undependable workers in decentralized network supercomputing ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems

Uses Software

• Horus

Cites Work

• Cooperative computing with fragmentable and mergeable groups
• The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
• Distributed scheduling for disconnected cooperation
• Performing Work Efficiently in the Presence of Faults
• Bounded Concurrent Time-Stamping
• Performing tasks on synchronous restartable message-passing processors
• Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
• Time-optimal message-efficient work performance in the presence of faults
• Dynamic voting for consistent primary components
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item