scientific article; zbMATH DE number 1033646

MaRDI QIDQ4344152zbMATH OpenFDO

Authors Paris C. Kanellakis, Alexander A. Schwarzmann

Publication date 15 July 1997

zbMATH Keywords

robustnessfault-toleranceparallelism

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 794259
• scientific article; zbMATH DE number 426330
• On word-level parallelism in fault-tolerant computing

Cited in

(35)

• Solving the at-most-once problem with nearly optimal effectiveness
• Optimal fault-tolerant computing on multiprocessor systems
• Parallel computing, failure recovery, and extreme values
• scientific article; zbMATH DE number 802438 (Why is no real title available?)
• Online parallel scheduling of non-uniform tasks: trading failures for energy
• scientific article; zbMATH DE number 1446094 (Why is no real title available?)
• A parallel fault identification algorithm
• Efficient parallel algorithms can be made robust
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
• Parallel defect control
• The Do-All problem with Byzantine processor failures
• Hundreds of impossibility results for distributed computing
• Performing dynamically injected tasks on processes prone to crashes and restarts
• Parallel fault simulation on a multiprocessor
• The complexity of synchronous iterative do-all with crashes
• Transparent fault tolerance for scalable functional computation
• An algorithm for the asynchronous \textit{Write-All} problem based on process collision
• scientific article; zbMATH DE number 719724 (Why is no real title available?)
• Performing work in broadcast networks
• Performing work with asynchronous processors: Message-delay-sensitive bounds
• scientific article; zbMATH DE number 426330 (Why is no real title available?)
• Organization of fault- and failure-tolerant computations in completely connected multicomputer systems
• Reliability of fault-tolerant systems with parallel task processing
• Dealing with undependable workers in decentralized network supercomputing
• Fault-tolerance and complexity (extended abstract)
• Fast deterministic simulation of computations on faulty parallel machines
• Fault-tolerance mechanisms for a parallel programming system -- a responsiveness perspective
• Dynamic load balancing with group communication
• scientific article; zbMATH DE number 1569121 (Why is no real title available?)
• Cooperative computing with fragmentable and mergeable groups
• Fault tolerance recovery techniques in large distributed parallel computing systems
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• scientific article; zbMATH DE number 4113967 (Why is no real title available?)
• Performing tasks on synchronous restartable message-passing processors
• Lock-free dynamic hash tables with open addressing

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 Q4344152)