The murus de

is a collection of reusable software components) in Google Go (really cool, since Dio perdona … io Go no!∗∗)):

) constructed while teaching at the Department of Mathematics and Computer Science of the Freie Universit├Ąt Berlin
– originally in Modula-2 by Niklaus Wirth (ancient) and Java (sucks – only foam).

Currently I am mainly working on the implementation of Distributed Algorithms (see package murus/dgra).
Done are e.g. computation of the net topology (Andrews), election of a leader in a ring (Chang-Roberts, Peterson, Dolev-Klawe-Rodeh, Hirschberg-Sinclair etc.), construction of spanning trees (by depth-first- and breadth-first-traversal using ideas of Awerbuch and Zhu-Cheung) and of directed rings. Most of the algorithms show the power of my concept far monitor (see package murus/fmon). TODO: more algorithms (i.e. termination detection).

∗∗) Why “no”?
Because the sophisticated design of the Go authors—combining static type checking at compile time with dynamic typing at run time—relentlessly discovers every error in reasoning.


Maintainer:
Christian Maurer
send email Last modified:
March 21 2017
Valid HTML 4.01 Transitional
CSS is valid!
clustrmaps