Also print average and deviation for times of convergence.

[loba.git] / TODO

diff --git a/TODO b/TODO
index 1b4de1373cfb989d14e005532013a1d06944b581..a337bc4fc53de1c99b51bc28917889a8ab86adf4 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,11 +1,28 @@
-* implement loba_* algorithms (start with some trivial one)
+* 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.

 
 

-* fix process::run when load is 0
-   -> wait for a message...
-   -> how does it work with opt::bookkeeping ???
+* 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().

 
 

-* implement automatic process topology 
-   (line, ring, star, btree, clique, hypercube, etc..)
+* Support heterogeneous platforms?
+   Not sure yet.
+   Should be doable if each process also sends its speed to its neighbors.

 
 

-* add synchronized mode
+* Add options -j/-J: minimum number of iterations?

 
 

+* Add options -f/-F: termination based on flops achieved?
+
+* 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.