Try to describe load-balancing algorithms.

[loba.git] / TODO

diff --git a/TODO b/TODO
index 3152ad98d5d06b57c2cffa912612468d1d610318..b7ef5c5fd0d6c73bc6378b78d74ba3fa9ef84591 100644 (file)
--- a/TODO
+++ b/TODO
@@ -1,31 +1,14 @@
-* segfault with ./loba cluster1000.xml -N64 -a fairstrategy
-
-    this is a deadlock occuring when:
-    - a process is in the finalize stage;
-    - all processes  but one are blocked on receive;
-    - the process that is still running owns all the remaining load,
-      and sends it all to the finalizing process, and then goes in
-      blocking receive.
-    The finalizing process receives the load, and blocks again,
-    waiting for a close message.
-    All processes are then blocked, and non-one is able to see that
-    there is no more load in the system!
-
-* verify bookkeeping version.
+* for automatic process topology,
+   -> implement some random initial distribution of load

 
 

-* add several metrics
-  - flops (total, avg, stddev)
-  - message exchanges (number, volume)
+* implement makhoul2

 
 

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

 
 

-* add a variant to (not) change neighbor load information at send.
+* add options -f/-F : termination based on flops achieved?

 
 * implement loba_* algorithms (start with some trivial one)
 
 
 * 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 synchronized mode? NO
+* add a variant to (not) change neighbor load information at send? NO
+* translate README file? NOT URGENT