scientific article; zbMATH DE number 1033646
From MaRDI portal
Publication:4344152
zbMATH Open0881.68050MaRDI QIDQ4344152FDOQ4344152
Authors: Paris C. Kanellakis, Alexander A. Schwarzmann 
Publication date: 15 July 1997
Title of this publication is not available (Why is that?)
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (35)
- Title not available (Why is that?)
- Solving the at-most-once problem with nearly optimal effectiveness
- Optimal fault-tolerant computing on multiprocessor systems
- Parallel computing, failure recovery, and extreme values
- Online parallel scheduling of non-uniform tasks: trading failures for energy
- Title not available (Why is that?)
- 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
- Hundreds of impossibility results for distributed computing
- The Do-All problem with Byzantine processor failures
- 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
- Title not available (Why is that?)
- Performing work in broadcast networks
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Fault tolerance recovery techniques in large distributed parallel computing systems
- Cooperative computing with fragmentable and mergeable groups
- Title not available (Why is that?)
- Performing tasks on synchronous restartable message-passing processors
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems
- 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)
