scientific article; zbMATH DE number 2006650

zbMATH Open1024.68512MaRDI QIDQ4436048FDOQ4436048

Authors: Chryssis Georgiou, Alexander Russell, Alexander A. Schwarzmann 

Publication date: 23 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2180/21800151.htm

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of synchronous iterative do-all with crashes
• Doing-it-all with bounded work and communication
• A robust randomized algorithm to perform independent tasks
• The Do-All problem with Byzantine processor failures
• scientific article; zbMATH DE number 2013838

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (9)

• A robust randomized algorithm to perform independent tasks
• Performing dynamically injected tasks on processes prone to crashes and restarts
• The complexity of synchronous iterative do-all with crashes
• Performing work in broadcast networks
• Title not available (Why is that?)
• Dynamic load balancing with group communication
• Fully-adaptive algorithms for long-lived renaming
• Performing tasks on synchronous restartable message-passing processors
• Doing-it-all with bounded work and communication

This page was built for publication:

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