Rewrite macro \FIXME, and add some.

diff --git a/supercomp11/supercomp11.tex b/supercomp11/supercomp11.tex
index 8770bab936c64477f623407033285effe36c3d08..5db76a933535edd7aa737e9f8d8f8ecd23973ec2 100644 (file)
--- a/supercomp11/supercomp11.tex
+++ b/supercomp11/supercomp11.tex
@@ -14,7 +14,7 @@
   \end{tabular}}
 
 \newcommand{\FIXME}[1]{%
-  \textbf{[FIXME]}\marginpar{\flushleft\footnotesize\bfseries$\triangleright$ #1}}
+  \textbf{$\triangleright$\marginpar{\textbf{[FIXME]}}~#1}}
 
 \newcommand{\VAR}[1]{\textit{#1}}
 
@@ -128,7 +128,7 @@ execution  times. In Section~\ref{Virtual  load}, the  virtual load  mechanism i
 proposed. Simulations allowed to show that both our approaches are valid using a
 quite realistic  model detailed in  Section~\ref{Simulations}. Finally we  give a
 conclusion and some perspectives to this work.
-
+\FIXME{What about Section~\ref{Other}?}
 
 
 
@@ -185,7 +185,11 @@ $3$.   If  it  sends  load  to  processor $1$  it  will  not  satisfy  condition
 $x_3^2(t)$.  So we consider that the \emph{ping-pong} condition is probably to
 strong. Currently, we did not try to make another convergence proof without this
 condition or with a weaker condition.
-
+%
+\FIXME{Develop: We have the feeling that such a weaker condition
+  exists, because (it's not a proof, but) we have never seen any
+  scenario that is not leading to convergence, even with LB-strategies
+  that are not fulfilling these two conditions.}
 
 \section{Best effort strategy}
 \label{Best-effort}