A robust randomized algorithm to perform independent tasks
type: Item
instance of: scholarly article
title: A robust randomized algorithm to perform independent tasks
zbMATH Open document ID: 1154.90429
author: Bogdan S. Chlebus
author: Leszek Gaşsieniec
author: Dariusz R. Kowalski
author: Alexander A. Schwarzmann
published in: Journal of Discrete Algorithms
publication date: 2009-02-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5509894
zbMATH Keywords: randomization
zbMATH Keywords: distributed algorithm
zbMATH Keywords: message passing
zbMATH Keywords: crash failure
zbMATH Keywords: scheduling tasks
zbMATH Keywords: Ramanujan graphs
MaRDI profile type: Publication
full work available at URL: j.jda.2008.03.001
OpenAlex ID: W2025553694
cites work: Performing tasks on synchronous restartable message-passing processors
cites work: Randomization helps to perform independent tasks reliably
cites work: Performing work in broadcast networks
cites work: Q4427854
cites work: Time-optimal message-efficient work performance in the presence of faults
cites work: Performing Work Efficiently in the Presence of Faults
cites work: The Do-All problem with Byzantine processor failures
cites work: Q4252758
cites work: Efficient gossip and robust distributed computation
cites work: The complexity of synchronous iterative Do-All with crashes
cites work: Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
cites work: Performing work with asynchronous processors: Message-delay-sensitive bounds
cites work: Ramanujan graphs
cites work: Probability and Computing
cites work: Tolerating a linear number of faults in networks of bounded degree
DOI: 10.1016/J.JDA.2008.03.001
description: scientific article; zbMATH DE number 5509894