X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/loba.git/blobdiff_plain/014983949544db9a324cece29a0ccc46b1e3e1f3..b4d90a50ce65a5efb75c0a28b269120ea51d57cf:/TODO?ds=inline

diff --git a/TODO b/TODO
index 39591ca..77dbb42 100644
--- a/TODO
+++ b/TODO
@@ -1,10 +1,25 @@
-* 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 ???
+* Support heterogeneous platforms?
+   Not sure yet.
+   Should be doable if each process also sends its speed to its neighbors.
 
-* for automatic process topology,
-   -> implement some random initial distribution of load
+* Add options -j/-J: minimum number of iterations?
 
-* add synchronized mode
+* 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.