scientific article; zbMATH DE number 2006650

MaRDI QIDQ4436048zbMATH OpenFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(9)

• A robust randomized algorithm to perform independent tasks
• Performing work in broadcast networks
• Performing dynamically injected tasks on processes prone to crashes and restarts
• scientific article; zbMATH DE number 2013838 (Why is no real title available?)
• Performing tasks on synchronous restartable message-passing processors
• The complexity of synchronous iterative do-all with crashes
• Doing-it-all with bounded work and communication
• Fully-adaptive algorithms for long-lived renaming
• Dynamic load balancing with group 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)