Virtual trees for the byzantine generals algorithm

Authors:
Ahuva Tikvati;Mordechai Ben-Ari;Yifat Ben-David Kolikant
Affiliations:
Weizmann Institute of Science, Rehovot, Israel;Weizmann Institute of Science, Rehovot, Israel;Weizmann Institute of Science, Rehovot, Israel
Venue:
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Year:
2004

Citing 9
Cited 4

Principles of concurrent and distributed programming

Principles of concurrent and distributed programming
Exploring the Byzantine generals problem with beginning computer science students

ACM SIGCSE Bulletin
Distributed algorithms visualisation for educational purposes

ITiCSE '99 Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Interactive execution of distributed algorithms

Journal on Educational Resources in Computing (JERIC)
Distributed Algorithms

Distributed Algorithms
A java toolkit for teaching distributed algorithms

Proceedings of the 7th annual conference on Innovation and technology in computer science education
Operating System Concepts, 4th Ed.

Operating System Concepts, 4th Ed.

A suite of tools for teaching concurrency

Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education
Virtualized games for teaching about distributed systems

Proceedings of the 40th ACM technical symposium on Computer science education
Byzantine generals' problem driven dynamic trust replication method for cognitive mobile ad hoc networks (MANETs)

DNCOCO'09 Proceedings of the 8th WSEAS international conference on Data networks, communications, computers
Towards a hierarchical temporal memory based self-managed dynamic trust replication mechanism in cognitive mobile ad-hoc networks

AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases

Quantified Score

Hi-index	0.00

Visualization

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.