Cooperative computing with fragmentable and mergeable groups

DOI10.1016/S1570-8667(03)00026-1zbMath1073.68096OpenAlexW1995704309MaRDI QIDQ1827289

Chryssis Georgiou, Alexander A. Schwarzmann

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00026-1

zbMATH Keywords

Distributed algorithmsGroup communicationCommunication complexity

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (5)

Dynamic load balancing with group communication ⋮ Dealing with undependable workers in decentralized network supercomputing ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems ⋮ The Do-All problem with Byzantine processor failures ⋮ Cooperative computing with fragmentable and mergeable groups

Uses Software

• Horus

Cites Work

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

This page was built for publication: Cooperative computing with fragmentable and mergeable groups