Using knowledge to optimally achieve coordination in distributed systems

Gil Neiger, Rida Bazzi

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

A distributed computing system consists of a set of individual processors that communicate through some medium. Coordinating the actions of such processors is essential in distributed computing. Researchers have long endeavored to find efficient solutions to a variety of coordination problems. Recently, processor knowledge has been used to characterize such solutions and to derive more efficient ones. Most of this work has concentrated on the relationship between common knowledge and simultaneous coordination. This paper considers non-simultaneous coordination problems. The results of this paper add to our understanding of the relationship between knowledge and the different requirements of coordination problems. This paper considers the ideas of optimal and optimum solutions to a coordination problem and precisely characterizes the problems for which optimum solutions exist. This characterization is based on combinations of eventual common knowledge and continual common knowledge. The paper then considers more general problems, for which optimal, but no optimum, solutions exist. It defines a new form of knowledge, called extended knowledge, which combines eventual and continual knowledge, and shows how extended knowledge can be used to both characterize and construct optimal protocols for coordination.

Original languageEnglish (US)
Pages (from-to)31-65
Number of pages35
JournalTheoretical Computer Science
Volume220
Issue number1
StatePublished - Jun 6 1999

Fingerprint

Distributed Systems
Distributed computer systems
Common Knowledge
Distributed Computing
Efficient Solution
Knowledge
Requirements
Relationships

Keywords

  • Common knowledge
  • Distributed coordination
  • Knowledge
  • Optimal algorithms
  • Optimum algorithms

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Using knowledge to optimally achieve coordination in distributed systems. / Neiger, Gil; Bazzi, Rida.

In: Theoretical Computer Science, Vol. 220, No. 1, 06.06.1999, p. 31-65.

Research output: Contribution to journalArticle

@article{d6361b08d7244c3d951ab4577ac4a8eb,
title = "Using knowledge to optimally achieve coordination in distributed systems",
abstract = "A distributed computing system consists of a set of individual processors that communicate through some medium. Coordinating the actions of such processors is essential in distributed computing. Researchers have long endeavored to find efficient solutions to a variety of coordination problems. Recently, processor knowledge has been used to characterize such solutions and to derive more efficient ones. Most of this work has concentrated on the relationship between common knowledge and simultaneous coordination. This paper considers non-simultaneous coordination problems. The results of this paper add to our understanding of the relationship between knowledge and the different requirements of coordination problems. This paper considers the ideas of optimal and optimum solutions to a coordination problem and precisely characterizes the problems for which optimum solutions exist. This characterization is based on combinations of eventual common knowledge and continual common knowledge. The paper then considers more general problems, for which optimal, but no optimum, solutions exist. It defines a new form of knowledge, called extended knowledge, which combines eventual and continual knowledge, and shows how extended knowledge can be used to both characterize and construct optimal protocols for coordination.",
keywords = "Common knowledge, Distributed coordination, Knowledge, Optimal algorithms, Optimum algorithms",
author = "Gil Neiger and Rida Bazzi",
year = "1999",
month = "6",
day = "6",
language = "English (US)",
volume = "220",
pages = "31--65",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Using knowledge to optimally achieve coordination in distributed systems

AU - Neiger, Gil

AU - Bazzi, Rida

PY - 1999/6/6

Y1 - 1999/6/6

N2 - A distributed computing system consists of a set of individual processors that communicate through some medium. Coordinating the actions of such processors is essential in distributed computing. Researchers have long endeavored to find efficient solutions to a variety of coordination problems. Recently, processor knowledge has been used to characterize such solutions and to derive more efficient ones. Most of this work has concentrated on the relationship between common knowledge and simultaneous coordination. This paper considers non-simultaneous coordination problems. The results of this paper add to our understanding of the relationship between knowledge and the different requirements of coordination problems. This paper considers the ideas of optimal and optimum solutions to a coordination problem and precisely characterizes the problems for which optimum solutions exist. This characterization is based on combinations of eventual common knowledge and continual common knowledge. The paper then considers more general problems, for which optimal, but no optimum, solutions exist. It defines a new form of knowledge, called extended knowledge, which combines eventual and continual knowledge, and shows how extended knowledge can be used to both characterize and construct optimal protocols for coordination.

AB - A distributed computing system consists of a set of individual processors that communicate through some medium. Coordinating the actions of such processors is essential in distributed computing. Researchers have long endeavored to find efficient solutions to a variety of coordination problems. Recently, processor knowledge has been used to characterize such solutions and to derive more efficient ones. Most of this work has concentrated on the relationship between common knowledge and simultaneous coordination. This paper considers non-simultaneous coordination problems. The results of this paper add to our understanding of the relationship between knowledge and the different requirements of coordination problems. This paper considers the ideas of optimal and optimum solutions to a coordination problem and precisely characterizes the problems for which optimum solutions exist. This characterization is based on combinations of eventual common knowledge and continual common knowledge. The paper then considers more general problems, for which optimal, but no optimum, solutions exist. It defines a new form of knowledge, called extended knowledge, which combines eventual and continual knowledge, and shows how extended knowledge can be used to both characterize and construct optimal protocols for coordination.

KW - Common knowledge

KW - Distributed coordination

KW - Knowledge

KW - Optimal algorithms

KW - Optimum algorithms

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

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

M3 - Article

VL - 220

SP - 31

EP - 65

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -