-* for automatic process topology,
- -> implement some random initial distribution of load
+* 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.
-* implement makhoul2
+* Remove usage of opt::option_x in loba_besteffort.cpp and loba_2besteffort.cpp
+ Use -k instead (done). Remove hack marked "FIXME" in opt::parse_args().
-* add options -j/-J : minimum number of iterations?
+* Support heterogeneous platforms?
+ Not sure yet.
+ Should be doable if each process also sends its speed to its neighbors.
-* add options -f/-F : termination based on flops achieved?
+* Add options -j/-J: minimum number of iterations?
-* implement loba_* algorithms (start with some trivial one)
+* Add options -f/-F: termination based on flops achieved?
-* add synchronized mode? NO
-* add a variant to (not) change neighbor load information at send? NO
-* translate README file? NOT URGENT
+* Choose a license before making the code public.
+ CeCILL-B?
+
+* Translate french parts in english (README, QUESTIONS, ALGORITHMS, ...)
+ Not urgent.
+
+* Add synchronized mode?
+ No.
+
+* Add a variant to (not) change neighbor load information at send?
+ No.
