- May 11, 2022
-
-
erwan authored
-
- Oct 20, 2021
-
-
erwan authored
-
- Oct 11, 2021
- Oct 05, 2021
- Aug 31, 2021
-
-
erwan authored
-
- Aug 27, 2021
-
-
erwan authored
-
- May 26, 2021
-
-
- Apr 09, 2021
-
- Nov 04, 2020
-
-
erwan authored
-
- Oct 13, 2020
-
-
erwan authored
and attach the pid to the list of neighbors of returned by the get function. Indeed, this is needed in some anomymous (or semi-anonymous) algorithms, such as the k-clustering.
-
- Sep 16, 2020
-
-
erwan authored
-
- Sep 02, 2020
-
-
erwan authored
-
erwan authored
The previous scheme was to define everything that is common to all user nodes in a file named state.ml. This file was supposed to define the algo state type, as well as optional functions such as fault, legitimate, or potential. But in order to be able to define, say, a legitimate function that uses user nodes (which is the case for dijkstra token ring) without introducing any dependency loop, it is necessary to split state.ml in two modules. The new module is called Config (config.ml). nb: I had to modify the GenSessions module in rdbg to reflect this change !
-
- Aug 24, 2020
- Jul 08, 2020
- Jul 07, 2020
- Jul 06, 2020
- Jul 01, 2020
-
-
erwan authored
nb: I needed to split Main to avoid a Module self-loop (as I need to use do_step in Daemon).
-
- Jun 23, 2020
-
- Mar 06, 2020
-
-
erwan authored
The rationale is that the Algo.spid that gave processes access to their pid via their neighbors was a bit weird. Also, it makes the anonymity of the algorithm more explicit: an access to the pid could appear anywhere in the program, while now, the pid must be in state.t! Now, if the user needs the pid, he must store it explicitly in the state via the initialization function.
-
- Mar 05, 2020
-
-
erwan authored
-
- Feb 19, 2020
-
- Feb 06, 2020
-
-
erwan authored
-
- Jan 22, 2020
-
- Oct 23, 2019
-
-
Karine Altisen authored
-
erwan authored
-
- Oct 17, 2019
-
-
erwan authored
-
- Oct 07, 2019
-
- Sep 30, 2019
-
-
erwan authored
-
- Sep 25, 2019
- Jul 03, 2019