Virtual trees for the byzantine generals algorithm

Ahuva Tikvati; Mordechai Ben-Ari; Yifat Ben David Kolikant

doi:10.1145/1028174.971435

Virtual trees for the byzantine generals algorithm

Ahuva Tikvati^*, Mordechai Ben-Ari, Yifat Ben David Kolikant

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

3 Scopus citations

Abstract

The Byzantine Generals algorithm for achieving reliability in the presence of faults is a classic topic in distributed computation and operating systems, not the least because of its colorful story. We describe a concept called virtual data structures, which are concrete representations of global data structures that is not actually maintained by the nodes of a distributed system, but are required in order to understand the correctness of algorithms. We show that the use of virtual trees for the Byzantine Generals algorithm can improve the understanding of this algorithm, and we describe a visualization of the trees.

Original language	English
Pages (from-to)	392-396
Number of pages	5
Journal	SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)
Volume	36
Issue number	1
DOIs	https://doi.org/10.1145/1028174.971435
State	Published - Mar 2004
Externally published	Yes
Event	35th SIGCSE Technical Symposium on Computer Science Education - Norfolk, VA, United States Duration: 3 Mar 2004 → 7 Mar 2004

Keywords

Byzantine Generals
Distributed algorithms
Visualization of algorithms

Access to Document

10.1145/1028174.971435

Cite this

@article{bf19c75136dd4c45be62309e5dc2c61d,

title = "Virtual trees for the byzantine generals algorithm",

abstract = "The Byzantine Generals algorithm for achieving reliability in the presence of faults is a classic topic in distributed computation and operating systems, not the least because of its colorful story. We describe a concept called virtual data structures, which are concrete representations of global data structures that is not actually maintained by the nodes of a distributed system, but are required in order to understand the correctness of algorithms. We show that the use of virtual trees for the Byzantine Generals algorithm can improve the understanding of this algorithm, and we describe a visualization of the trees.",

keywords = "Byzantine Generals, Distributed algorithms, Visualization of algorithms",

author = "Ahuva Tikvati and Mordechai Ben-Ari and Kolikant, {Yifat Ben David}",

year = "2004",

month = mar,

doi = "10.1145/1028174.971435",

language = "אנגלית",

volume = "36",

pages = "392--396",

journal = "SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)",

issn = "0097-8418",

publisher = "Association for Computing Machinery (ACM)",

number = "1",

note = "35th SIGCSE Technical Symposium on Computer Science Education ; Conference date: 03-03-2004 Through 07-03-2004",

}

TY - JOUR

T1 - Virtual trees for the byzantine generals algorithm

AU - Tikvati, Ahuva

AU - Ben-Ari, Mordechai

AU - Kolikant, Yifat Ben David

PY - 2004/3

Y1 - 2004/3

N2 - The Byzantine Generals algorithm for achieving reliability in the presence of faults is a classic topic in distributed computation and operating systems, not the least because of its colorful story. We describe a concept called virtual data structures, which are concrete representations of global data structures that is not actually maintained by the nodes of a distributed system, but are required in order to understand the correctness of algorithms. We show that the use of virtual trees for the Byzantine Generals algorithm can improve the understanding of this algorithm, and we describe a visualization of the trees.

AB - The Byzantine Generals algorithm for achieving reliability in the presence of faults is a classic topic in distributed computation and operating systems, not the least because of its colorful story. We describe a concept called virtual data structures, which are concrete representations of global data structures that is not actually maintained by the nodes of a distributed system, but are required in order to understand the correctness of algorithms. We show that the use of virtual trees for the Byzantine Generals algorithm can improve the understanding of this algorithm, and we describe a visualization of the trees.

KW - Byzantine Generals

KW - Distributed algorithms

KW - Visualization of algorithms

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

U2 - 10.1145/1028174.971435

DO - 10.1145/1028174.971435

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:33646843059

SN - 0097-8418

VL - 36

SP - 392

EP - 396

JO - SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)

JF - SIGCSE Bulletin (Association for Computing Machinery, Special Interest Group on Computer Science Education)

IS - 1

T2 - 35th SIGCSE Technical Symposium on Computer Science Education

Y2 - 3 March 2004 through 7 March 2004

ER -

Virtual trees for the byzantine generals algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this