The following pages link to (Q4344152):
Displaying 16 items.
- Solving the at-most-once problem with nearly optimal effectiveness (Q391254) (← links)
- Dealing with undependable workers in decentralized network supercomputing (Q477093) (← links)
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160) (← links)
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- Dynamic load balancing with group communication (Q861278) (← links)
- The Do-All problem with Byzantine processor failures (Q1770376) (← links)
- Cooperative computing with fragmentable and mergeable groups (Q1827289) (← links)
- Lock-free dynamic hash tables with open addressing (Q1953636) (← links)
- Online parallel scheduling of non-uniform tasks: trading failures for energy (Q2348044) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Performing work with asynchronous processors: Message-delay-sensitive bounds (Q2581537) (← links)
- Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts (Q3095325) (← links)
- Performing tasks on synchronous restartable message-passing processors (Q5138349) (← links)
- An algorithm for the asynchronous Write-All problem based on process collision (Q5138352) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- The complexity of synchronous iterative Do-All with crashes (Q5138503) (← links)
