-* faire un autre thread pour les envois d'infos
- -> c'est stupide d'attendre la fin des calcules s'il y en a beaucoup
- surtout en bookkeeping...
+* Change simulator to use discrete tasks.
+ Each task must then be iterated a minimum of times.
+ At least two strategies to balance the tasks:
+ (i) send the tasks that have the most count of iterations;
+ (ii) send the tasks that have the least count of iterations.
-* check if communications can fail !
- (restart them)
+* Support heterogeneous platforms?
+ Not sure yet.
+ Should be doable if each process also sends its speed to its neighbors.
-* review receive with timeout.
+* Add options -j/-J: minimum number of iterations?
-* verify bookkeeping version.
+* Add options -f/-F: termination based on flops achieved?
-* add several metrics
- - message exchanges : number/volume of sent/received data/ctrl messages
+* Choose a license before making the code public.
+ CeCILL-B?
-* add options -j/-J : minimum number of iterations?
+* Translate french parts in english (README, QUESTIONS, ALGORITHMS, ...)
+ Not urgent.
-* add a variant to (not) change neighbor load information at send?
+* Add synchronized mode?
+ No.
-* implement loba_* algorithms (start with some trivial one)
-
-* for automatic process topology,
- -> implement some random initial distribution of load
-
-* add synchronized mode
-
-* translate README file?
+* Add a variant to (not) change neighbor load information at send?
+ No.
