Distributed cooperation during the absence of communication

DOI10.1007/3-540-40026-5_8MaRDI QIDQ2766867zbMATH OpenFDO

Authors Grzegorz Malewicz, Alexander Russell, Alexander A. Schwarzmann

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-40026-5_8

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Distributed scheduling for disconnected cooperation
• scientific article; zbMATH DE number 1820019
• scientific article; zbMATH DE number 2156277
• Work-competitive scheduling for cooperative computing with dynamic groups
• Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups

Cited in

(11)

• The Do-All problem with Byzantine processor failures
• Cooperative computing with fragmentable and mergeable groups
• Distributed scheduling for disconnected cooperation
• Latin squares with bounded size of row prefix intersections
• Efficient gossip and robust distributed computation
• scientific article; zbMATH DE number 1820019 (Why is no real title available?)
• Optimal, distributed decision-making: The case of no communication
• The complexity of synchronous iterative do-all with crashes
• Rational coordination with no communication or conventions
• Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
• Dynamic load balancing with group communication

This page was built for publication: Distributed cooperation during the absence of communication

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