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.) and construction of spanning trees (by depth-first- and breadth-first-traversal). TODO: A hell of a lot more.

∗∗) 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.

Christian Maurer
send email Last modified:
February 19 2017
Valid HTML 4.01 Transitional
CSS is valid!