scientific article; zbMATH DE number 1033646
From MaRDI portal
Publication:4344152
zbMath0881.68050MaRDI QIDQ4344152
Paris C. Kanellakis, Alexander A. Schwarzmann
Publication date: 15 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Performing work in broadcast networks ⋮ Dynamic load balancing with group communication ⋮ Solving the at-most-once problem with nearly optimal effectiveness ⋮ Lock-free dynamic hash tables with open addressing ⋮ Performing tasks on synchronous restartable message-passing processors ⋮ An algorithm for the asynchronous Write-All problem based on process collision ⋮ Hundreds of impossibility results for distributed computing ⋮ The complexity of synchronous iterative Do-All with crashes ⋮ Dealing with undependable workers in decentralized network supercomputing ⋮ 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 ⋮ The Do-All problem with Byzantine processor failures ⋮ Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts ⋮ Cooperative computing with fragmentable and mergeable groups ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds ⋮ Online parallel scheduling of non-uniform tasks: trading failures for energy
