Efficient parallel algorithms can be made robust
type: Item
instance of: scholarly article
title: Efficient parallel algorithms can be made robust
zbMATH Open document ID: 0744.68060
DOI: 10.1007/BF02277667
published in: Distributed Computing
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 58223
zbMATH Keywords: lower bounds
zbMATH Keywords: robust algorithms
zbMATH Keywords: fault tolerance
zbMATH Keywords: CRCW PRAM
author: Paris C. Kanellakis
author: Alexander A. Schwarzmann
MaRDI profile type: Publication
cites work: Local management of a global resource in a communication network
cites work: Optimal bounds for decision problems on the CRCW PRAM
cites work: Constructing two-writer atomic registers
cites work: The expected advantage of asynchrony
cites work: On the minimal synchronism needed for distributed consensus
cites work: A lower bound for the time to assure interactive consistency
cites work: Impossibility of distributed consensus with one faulty process
cites work: Parallelism in random access machines
cites work: Q4040797
cites work: Efficient parallel algorithms on restartable fail-stop processors
cites work: Probabilistic analysis of a network resource allocation algorithm
cites work: Reaching Agreement in the Presence of Faults
cites work: How to emulate shared memory
cites work: A Robust Sorting Network
cites work: Achieving optimal CRCW PRAM fault-tolerance
cites work: Q4385523
description: scientific article; zbMATH DE number 58223