Parallel Algorithms with Processor Failures and Delays
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 599176
- Parallel algorithms
- Parallel algorithms
- scientific article; zbMATH DE number 3889284
- Parallel processor scheduling with delay constraints
- scientific article; zbMATH DE number 1163093
- scientific article; zbMATH DE number 4039280
- Parallel algorithms for computing and optimizing reliability with respect to gradual failures
- scientific article; zbMATH DE number 107950
Cited in
(15)- Efficient parallel algorithms can be made robust
- An efficient write-all algorithm for fail-stop PRAM without initialized memory
- Scheduling multiprocessor tasks in presence of correlated failures.
- The Do-All problem with Byzantine processor failures
- Parallel computing, failure recovery, and extreme values
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- scientific article; zbMATH DE number 599176 (Why is no real title available?)
- scientific article; zbMATH DE number 794259 (Why is no real title available?)
- Efficient parallel computing with memory faults
- An algorithm for the asynchronous \textit{Write-All} problem based on process collision
- Hundreds of impossibility results for distributed computing
- The complexity of synchronous iterative do-all with crashes
- Parallel algorithms for computing and optimizing reliability with respect to gradual failures
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
This page was built for publication: Parallel Algorithms with Processor Failures and Delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864434)
