Reaching Agreement Among k out of n Processes

Gadi Taubenfeld

doi:10.1007/978-3-031-60603-8_24

Reaching Agreement Among k out of n Processes

Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In agreement problems, each process has an input value and must choose a decision (output) value. Given n≥2 processes and m≥2 possible different input values, we want to design an agreement algorithm that enables as many processes as possible to decide on the (same) input value of one of the processes in the presence of t crash failures. Without communication, when each process simply decides on its input value, at least ⌈(n-t)/m⌉ of the processes are guaranteed to always decide on the same value. Can we do better with communication? For some cases, for example, when m=2, even in the presence of a single crash failure, the answer is negative in a deterministic asynchronous system where communication is either by using atomic read/write registers or by sending and receiving messages. The answer is positive in other cases.

Original language	English
Title of host publication	Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings
Editors	Yuval Emek
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	438-455
Number of pages	18
ISBN (Print)	9783031606021
DOIs	https://doi.org/10.1007/978-3-031-60603-8_24
State	Published - 2024
Externally published	Yes
Event	31st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024 - Vietri sul Mare, Italy Duration: 27 May 2024 → 29 May 2024

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	14662 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	31st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024
Country/Territory	Italy
City	Vietri sul Mare
Period	27/05/24 → 29/05/24

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

Keywords

Message passing
Partial agreement
Shared Memory

Access to Document

10.1007/978-3-031-60603-8_24

Cite this

Taubenfeld, G. (2024). Reaching Agreement Among k out of n Processes. In Y. Emek (Ed.), Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings (pp. 438-455). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14662 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-60603-8_24

Taubenfeld, Gadi. / Reaching Agreement Among k out of n Processes. Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings. editor / Yuval Emek. Springer Science and Business Media Deutschland GmbH, 2024. pp. 438-455 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a04786b42d0b46f18a7fe5833af08501,

title = "Reaching Agreement Among k out of n Processes",

abstract = "In agreement problems, each process has an input value and must choose a decision (output) value. Given n≥2 processes and m≥2 possible different input values, we want to design an agreement algorithm that enables as many processes as possible to decide on the (same) input value of one of the processes in the presence of t crash failures. Without communication, when each process simply decides on its input value, at least ⌈(n-t)/m⌉ of the processes are guaranteed to always decide on the same value. Can we do better with communication? For some cases, for example, when m=2, even in the presence of a single crash failure, the answer is negative in a deterministic asynchronous system where communication is either by using atomic read/write registers or by sending and receiving messages. The answer is positive in other cases.",

keywords = "Message passing, Partial agreement, Shared Memory",

author = "Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.; 31st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024 ; Conference date: 27-05-2024 Through 29-05-2024",

year = "2024",

doi = "10.1007/978-3-031-60603-8_24",

language = "אנגלית",

isbn = "9783031606021",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "438--455",

editor = "Yuval Emek",

booktitle = "Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings",

address = "גרמניה",

}

Taubenfeld, G 2024, Reaching Agreement Among k out of n Processes. in Y Emek (ed.), Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14662 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 438-455, 31st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024, Vietri sul Mare, Italy, 27/05/24. https://doi.org/10.1007/978-3-031-60603-8_24

Reaching Agreement Among k out of n Processes. / Taubenfeld, Gadi.
Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings. ed. / Yuval Emek. Springer Science and Business Media Deutschland GmbH, 2024. p. 438-455 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14662 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Reaching Agreement Among k out of n Processes

AU - Taubenfeld, Gadi

N1 - Publisher Copyright: © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

PY - 2024

Y1 - 2024

N2 - In agreement problems, each process has an input value and must choose a decision (output) value. Given n≥2 processes and m≥2 possible different input values, we want to design an agreement algorithm that enables as many processes as possible to decide on the (same) input value of one of the processes in the presence of t crash failures. Without communication, when each process simply decides on its input value, at least ⌈(n-t)/m⌉ of the processes are guaranteed to always decide on the same value. Can we do better with communication? For some cases, for example, when m=2, even in the presence of a single crash failure, the answer is negative in a deterministic asynchronous system where communication is either by using atomic read/write registers or by sending and receiving messages. The answer is positive in other cases.

AB - In agreement problems, each process has an input value and must choose a decision (output) value. Given n≥2 processes and m≥2 possible different input values, we want to design an agreement algorithm that enables as many processes as possible to decide on the (same) input value of one of the processes in the presence of t crash failures. Without communication, when each process simply decides on its input value, at least ⌈(n-t)/m⌉ of the processes are guaranteed to always decide on the same value. Can we do better with communication? For some cases, for example, when m=2, even in the presence of a single crash failure, the answer is negative in a deterministic asynchronous system where communication is either by using atomic read/write registers or by sending and receiving messages. The answer is positive in other cases.

KW - Message passing

KW - Partial agreement

KW - Shared Memory

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

U2 - 10.1007/978-3-031-60603-8_24

DO - 10.1007/978-3-031-60603-8_24

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85195493963

SN - 9783031606021

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 438

EP - 455

BT - Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings

A2 - Emek, Yuval

PB - Springer Science and Business Media Deutschland GmbH

T2 - 31st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2024

Y2 - 27 May 2024 through 29 May 2024

ER -

Taubenfeld G. Reaching Agreement Among k out of n Processes. In Emek Y, editor, Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Proceedings. Springer Science and Business Media Deutschland GmbH. 2024. p. 438-455. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-60603-8_24