Virtual trees for the Byzantine Generals algorithm

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

Virtual trees for the Byzantine Generals algorithm

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › 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
Title of host publication	Proceedings of the Thirty-Fifth SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004
Publisher	Association for Computing Machinery (ACM)
Pages	392-396
Number of pages	5
ISBN (Print)	1581137982, 9781581137989
State	Published - 3 Mar 2004
Externally published	Yes
Event	35th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004 - Norfolk, VA, United States Duration: 3 Mar 2004 → 7 Mar 2004

Publication series

Name	Proceedings of the SIGCSE Technical Symposium on Computer Science Education

Conference

Conference	35th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004
Country/Territory	United States
City	Norfolk, VA
Period	3/03/04 → 7/03/04

Keywords

Byzantine Generals
Distributed algorithms
Visualization of algorithms

Cite this

@inproceedings{45b4d22984a9442f9733fa76e0a2625c,

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,

day = "3",

language = "אנגלית",

isbn = "1581137982",

series = "Proceedings of the SIGCSE Technical Symposium on Computer Science Education",

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

pages = "392--396",

booktitle = "Proceedings of the Thirty-Fifth SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004",

address = "ארצות הברית",

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

}

Tikvati, A, Ben-Ari, M & Kolikant, YBD 2004, Virtual trees for the Byzantine Generals algorithm. in Proceedings of the Thirty-Fifth SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004. Proceedings of the SIGCSE Technical Symposium on Computer Science Education, Association for Computing Machinery (ACM), pp. 392-396, 35th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004, Norfolk, VA, United States, 3/03/04.

Virtual trees for the Byzantine Generals algorithm. / Tikvati, Ahuva; Ben-Ari, Mordechai; Kolikant, Yifat Ben David.
Proceedings of the Thirty-Fifth SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004. Association for Computing Machinery (ACM), 2004. p. 392-396 (Proceedings of the SIGCSE Technical Symposium on Computer Science Education).

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

TY - GEN

T1 - Virtual trees for the Byzantine Generals algorithm

AU - Tikvati, Ahuva

AU - Ben-Ari, Mordechai

AU - Kolikant, Yifat Ben David

PY - 2004/3/3

Y1 - 2004/3/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 - https://www.scopus.com/pages/publications/2642516516

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

AN - SCOPUS:2642516516

SN - 1581137982

SN - 9781581137989

T3 - Proceedings of the SIGCSE Technical Symposium on Computer Science Education

SP - 392

EP - 396

BT - Proceedings of the Thirty-Fifth SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004

PB - Association for Computing Machinery (ACM)

T2 - 35th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2004

Y2 - 3 March 2004 through 7 March 2004

ER -

Virtual trees for the Byzantine Generals algorithm

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this