Pages that link to "Item:Q5361406"

The following pages link to Time-optimal message-efficient work performance in the presence of faults (Q5361406):

Displaying 15 items.

• Dealing with undependable workers in decentralized network supercomputing (Q477093) (← links)
• Doing-it-all with bounded work and communication (Q529041) (← links)
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160) (← links)
• Dynamic load balancing with group communication (Q861278) (← links)
• A robust randomized algorithm to perform independent tasks (Q1002110) (← links)
• The Do-All problem with Byzantine processor failures (Q1770376) (← links)
• Cooperative computing with fragmentable and mergeable groups (Q1827289) (← links)
• Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← links)
• Parallel computing, failure recovery, and extreme values (Q2324083) (← links)
• Performing work in broadcast networks (Q2375307) (← links)
• Efficient gossip and robust distributed computation (Q2576871) (← links)
• Performing work with asynchronous processors: Message-delay-sensitive bounds (Q2581537) (← links)
• Randomization helps to perform independent tasks reliably (Q4446875) (← links)
• Performing tasks on synchronous restartable message-passing processors (Q5138349) (← links)
• The complexity of synchronous iterative Do-All with crashes (Q5138503) (← links)