Simulation Frameworks for the Teaching and Learning of Distributed Algorithms
Fionnuala O'Donnell · Trinity's Access to Research Output (TARA) (Trinity College Dublin) · 2006
Teaching and learning about distributed algorithms is difficult. This is because distributed algorithms are made up of multiple independent elements, each with their own state and control, who interact through the exchange of messages. Such a configuration results in a large amount of data which describes not only the local state information of each element within the distributed algorithm but also, their complex interactions. Thus, the use of traditional teaching methodologies, for example pseudo code descriptions, execution traces, chalk and talk do not lend themselves well to the easy disclosure of material which is highly concurrent in nature and which may suffer from partial failure that is, the loss or failure of one or more of its elements.