The Do-All problem in broadcast networks

B. S. Chlebus, D. R. Kowalski, A. Lingas

Research output: Contribution to conferencePaper

Abstract

The problem of performing t tasks in a distributed system on p failure-prone processors is one of the fundamental problems in distributed computing. If the tasks are similar and independent and the processors communicate by sending messages then the problem is called Do-All. In our work the communication is over a multiple-access channel, and the attached stations may fail by crashing. The measure of performance is work, defined as the number of the available processor steps. Algorithms are required to be reliable in that they perform all the tasks as long as at least one station remains operational. We show that each reliable algorithm always needs to perform at least the minimum amount Ω(t+p√t) of work. We develop an optimal deterministic algorithm for the channel with collision detection performing only the minimum work Θ(t+p√t). Another algorithm is given for the channel without collision detection, it performs work O(t+p√t+p · min{f,t}), where f < p is the number of failures. It is proved to be optimal if the number of faults is the only restriction on the adversary. Finally we consider the question if randomization helps for the channel without collision detection against weaker adversaries. We develop a randomized algorithm which needs to perform only the expected minimum work if the adversary may fail a constant fraction of stations, but it has to select the failure-prone stations prior to the start of an algorithm.

Original languageEnglish (US)
Pages117-126
Number of pages10
StatePublished - Jan 1 2001
Externally publishedYes
Event20th Annual ACM Symposium on Principles of Distributed Computing - Newport, Rhode Island, United States
Duration: Aug 26 2001Aug 29 2001

Conference

Conference20th Annual ACM Symposium on Principles of Distributed Computing
CountryUnited States
CityNewport, Rhode Island
Period8/26/018/29/01

Fingerprint

Distributed computer systems
Communication

Keywords

  • Adversary
  • Distributed algorithm
  • Fail-stop failures
  • Independent tasks
  • Lower bound
  • Multiple-access channel

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Chlebus, B. S., Kowalski, D. R., & Lingas, A. (2001). The Do-All problem in broadcast networks. 117-126. Paper presented at 20th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, United States.

The Do-All problem in broadcast networks. / Chlebus, B. S.; Kowalski, D. R.; Lingas, A.

2001. 117-126 Paper presented at 20th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, United States.

Research output: Contribution to conferencePaper

Chlebus, BS, Kowalski, DR & Lingas, A 2001, 'The Do-All problem in broadcast networks', Paper presented at 20th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, United States, 8/26/01 - 8/29/01 pp. 117-126.
Chlebus BS, Kowalski DR, Lingas A. The Do-All problem in broadcast networks. 2001. Paper presented at 20th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, United States.
Chlebus, B. S. ; Kowalski, D. R. ; Lingas, A. / The Do-All problem in broadcast networks. Paper presented at 20th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, United States.10 p.
@conference{9f997626ad0c4c0aa0187bc21e6b9a2c,
title = "The Do-All problem in broadcast networks",
abstract = "The problem of performing t tasks in a distributed system on p failure-prone processors is one of the fundamental problems in distributed computing. If the tasks are similar and independent and the processors communicate by sending messages then the problem is called Do-All. In our work the communication is over a multiple-access channel, and the attached stations may fail by crashing. The measure of performance is work, defined as the number of the available processor steps. Algorithms are required to be reliable in that they perform all the tasks as long as at least one station remains operational. We show that each reliable algorithm always needs to perform at least the minimum amount Ω(t+p√t) of work. We develop an optimal deterministic algorithm for the channel with collision detection performing only the minimum work Θ(t+p√t). Another algorithm is given for the channel without collision detection, it performs work O(t+p√t+p · min{f,t}), where f < p is the number of failures. It is proved to be optimal if the number of faults is the only restriction on the adversary. Finally we consider the question if randomization helps for the channel without collision detection against weaker adversaries. We develop a randomized algorithm which needs to perform only the expected minimum work if the adversary may fail a constant fraction of stations, but it has to select the failure-prone stations prior to the start of an algorithm.",
keywords = "Adversary, Distributed algorithm, Fail-stop failures, Independent tasks, Lower bound, Multiple-access channel",
author = "Chlebus, {B. S.} and Kowalski, {D. R.} and A. Lingas",
year = "2001",
month = "1",
day = "1",
language = "English (US)",
pages = "117--126",
note = "20th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 26-08-2001 Through 29-08-2001",

}

TY - CONF

T1 - The Do-All problem in broadcast networks

AU - Chlebus, B. S.

AU - Kowalski, D. R.

AU - Lingas, A.

PY - 2001/1/1

Y1 - 2001/1/1

N2 - The problem of performing t tasks in a distributed system on p failure-prone processors is one of the fundamental problems in distributed computing. If the tasks are similar and independent and the processors communicate by sending messages then the problem is called Do-All. In our work the communication is over a multiple-access channel, and the attached stations may fail by crashing. The measure of performance is work, defined as the number of the available processor steps. Algorithms are required to be reliable in that they perform all the tasks as long as at least one station remains operational. We show that each reliable algorithm always needs to perform at least the minimum amount Ω(t+p√t) of work. We develop an optimal deterministic algorithm for the channel with collision detection performing only the minimum work Θ(t+p√t). Another algorithm is given for the channel without collision detection, it performs work O(t+p√t+p · min{f,t}), where f < p is the number of failures. It is proved to be optimal if the number of faults is the only restriction on the adversary. Finally we consider the question if randomization helps for the channel without collision detection against weaker adversaries. We develop a randomized algorithm which needs to perform only the expected minimum work if the adversary may fail a constant fraction of stations, but it has to select the failure-prone stations prior to the start of an algorithm.

AB - The problem of performing t tasks in a distributed system on p failure-prone processors is one of the fundamental problems in distributed computing. If the tasks are similar and independent and the processors communicate by sending messages then the problem is called Do-All. In our work the communication is over a multiple-access channel, and the attached stations may fail by crashing. The measure of performance is work, defined as the number of the available processor steps. Algorithms are required to be reliable in that they perform all the tasks as long as at least one station remains operational. We show that each reliable algorithm always needs to perform at least the minimum amount Ω(t+p√t) of work. We develop an optimal deterministic algorithm for the channel with collision detection performing only the minimum work Θ(t+p√t). Another algorithm is given for the channel without collision detection, it performs work O(t+p√t+p · min{f,t}), where f < p is the number of failures. It is proved to be optimal if the number of faults is the only restriction on the adversary. Finally we consider the question if randomization helps for the channel without collision detection against weaker adversaries. We develop a randomized algorithm which needs to perform only the expected minimum work if the adversary may fail a constant fraction of stations, but it has to select the failure-prone stations prior to the start of an algorithm.

KW - Adversary

KW - Distributed algorithm

KW - Fail-stop failures

KW - Independent tasks

KW - Lower bound

KW - Multiple-access channel

UR - http://www.scopus.com/inward/record.url?scp=0034782203&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034782203&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0034782203

SP - 117

EP - 126

ER -