Distributed Cooperation and Adversity: Complexity Trade-Offs

Chryssis Georgiou, Alexander Russell, Alex A. Shvartsman

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such perturbations can be caused by processor failures, unpredictable delays, and communication breakdowns. To develop efficient distributed solutions for computation problems ranging from distributed search such as SETI to parallel simulation and multi-agent collaboration, it is important to understand efficiency trade-offs characterizing the ability of p processors to cooperate on t-tasks in the presence of adversity. This paper surveys recent results grouped by the following topics: (i) failure-sensitive bounds for distributed cooperation problems for synchronous processors subject to crash failures, (ii) bounds on redundant work for distributed cooperation when individual asynchronous processors may experience prolonged absence of communication, and (in) competitive analysis of cooperative work performed by groups of asynchronous processors, when the groups may be fragmented and merged during the computation. These research results are motivated by the earlier work of the third author with Paris C. Kanellakis at Brown University.

Original languageEnglish (US)
Title of host publicationPrinciples of Computing and Knowledge
Subtitle of host publicationParis C. Kanellakis Memorial Workshop
Pages60-71
Number of pages12
StatePublished - 2003
Externally publishedYes
EventPCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop - San Diego, CA, United States
Duration: Jun 8 2003Jun 8 2003

Publication series

NamePrinciples of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop

Conference

ConferencePCK50: Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop
Country/TerritoryUnited States
CitySan Diego, CA
Period6/8/036/8/03

Keywords

  • Competitive analysis
  • Distributed algorithms
  • Fault-tolerance
  • Partitionable networks
  • Performing tasks
  • Scheduling
  • Work complexity

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Distributed Cooperation and Adversity: Complexity Trade-Offs'. Together they form a unique fingerprint.

Cite this