Pages that link to "Item:Q4864434"
From MaRDI portal
The following pages link to Parallel Algorithms with Processor Failures and Delays (Q4864434):
Displaying 14 items.
- Parallel algorithms for computing and optimizing reliability with respect to gradual failures (Q612124) (← links)
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160) (← links)
- Reliable computations on faulty EREW PRAM (Q671425) (← links)
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- Efficient parallel algorithms can be made robust (Q1189859) (← links)
- An efficient write-all algorithm for fail-stop PRAM without initialized memory (Q1208446) (← links)
- Scheduling multiprocessor tasks in presence of correlated failures. (Q1412110) (← links)
- The Do-All problem with Byzantine processor failures (Q1770376) (← links)
- Parallel computing, failure recovery, and extreme values (Q2324083) (← links)
- Performing work with asynchronous processors: Message-delay-sensitive bounds (Q2581537) (← links)
- Efficient parallel computing with memory faults (Q5055934) (← 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)