1 De: HPCC 2014 <hpcc2014@easychair.org>
2 Objet: HPCC 2014 notification for paper 121
3 Date: 26 juin 2014 15:24:40 UTC+2
4 À: David Laiymani <david.laiymani@univ-fcomte.fr>
8 On behalf of the Program Committee of HPCC 2014, we would like to
9 inform you that the paper titled:Simulation of Asynchronous Iterative
10 Algorithms Using SimGrid(paper ID number 121) has not been accepted
11 for presentation at the main track of the conference but due to its
12 quality, your paper is accepted in the associated Workshops of the
13 HPCC2014 conference, and will be published in the same proceedings by
14 IEEE CPS and indexed in IEEE Xplorer.
16 Please modify your paper according to the instructions and comments
17 provided by the reviewers.
19 Please prepare and submit your final camera ready paper and follow all
20 STEPs to ensure the submission process is completed
21 successfully. Please note Camera ready submission deadline is 15 July
24 Authors must follow the IEEE formatting instruction.
26 For further information please check:
28 www.computational-science.org/HPCC2014
30 We are looking forward to meeting you at the HPCC 2014 conference.
32 S. Khaddaj, Program Chair of HPCC 2014
33 J. Bourgeois, General Chair of HPCC2014
34 F. Magoules, General Chair of HPCC2014
37 ----------------------- REVIEW 1 ---------------------
39 TITLE: Simulation of Asynchronous Iterative Algorithms Using SimGrid
40 AUTHORS: Charles Emile Ramamonjisoa, David Laiymani, Arnaud Giersch,
41 Lilia Ziane Khodja and Raphaël Couturier
44 ----------- REVIEW -----------
46 | The contribution of the paper could be better described.
48 | The authors state that:
50 | "we show that SimGrid is an efficient simulation
51 | tool that has enabled .."
53 | If this is one of the goals of the paper to present the
54 | capabilities/strength of SimGrid, then they should compare it with
55 | other tools for the comparison of the two methods.
58 [RCE] L’objectif du papier n’est pas de comparer des outils de
59 simulation et d’arriver à une conclusion sur la performance de
60 Simgrid. Ce dernier a été choisi parmi d’autres pour effectuer
61 la comparaison entre les 2 algorithmes en mode async sur un
62 environnement de grille distribuée.
64 On peut modifier la phrase comme suit : "we show that SimGrid is
65 one of efficient simulation tool that has enabled .."
69 | Regarding the comparison of the two methods, the possible scalability
70 | expected in the case of larger platforms might also be commended /
74 [RCE] Je pense que ça a été commenté / discuté tout au long du papier
75 cette montée en charge possible sur des plateformes plus
76 larges. Même dans la conclusion, on a avancé que l’objectif est
77 de réussir à faire tourner le programme sur une plateforme plus
78 large (en terme de nombre de cœurs et de nombre de clusters)
79 mais aussi de pouvoir résoudre des problèmes de plus grande
83 ----------------------- REVIEW 2 ---------------------
85 TITLE: Simulation of Asynchronous Iterative Algorithms Using SimGrid
86 AUTHORS: Charles Emile Ramamonjisoa, David Laiymani, Arnaud Giersch,
87 Lilia Ziane Khodja and Raphaël Couturier
90 ----------- REVIEW -----------
92 | This paper describes the simulation of an adapted (authors say
93 | slightly changed) GMRES solver on the SimGrid simulation framework;
94 | the GMRES solver is changed from synchronous iterative solution to a
95 | asynchronous iteration scheme in order to overcome latencies when
96 | interconnecting computers in a Grid environment.
99 [RCE] Non, ce n’est pas tout à fait ça : on veut comparer l’algo GMRES
100 qui est executé en mode SYNC avec l’algo de multisplitting qui
101 lui sera executé en mode ASYNC.
104 | The prejudice of the paper is that the GMRES algorithm is not using
105 | non-blocking communication to begin with.
108 [RCE] Comme dit juste plus haut, effectivement GMRES est resté SYNC
109 donc en mode de communication bloquant.
113 | You mention that for running with SimGrid using SMPI, "little" or no
114 | modification need to be done to the original code: what kind of
115 | modifications are necessary -- and did You have to apply any
116 | modification to run with SMPI? (in a later section of the paper,
117 | changing / deleting global variables were mentioned -- due to the
118 | threaded execution of simulated MPI processes...)
121 [RCE] Les changements “mineurs” apportés sur le code lors de
122 l’exécution dans Simgrid/SMPI par rapport à un lancement sur un
123 environnement réel (MPI) se résument aux deux points suivants :
124 - Toutes les variables globales ont été ramenées dans un scope
125 local aux fonctions. Cette modification a entraîné le
126 changement des définitions synoptiques des fonctions pour
127 prendre en compte les passages de variables.
128 - La sequence MPI_ISend, MPI_Irecv and MPI_Waitall a pose aussi
129 un problème en mode Async. Elle a été remplacée par une
130 sequence de 6 Isend/Irecv/Wait à la place.
132 On peut donc faire un renvoi à la Section III pour clarifier :
133 « The SMPI interface implements about 80% of the MPI 2.0
134 standard [?] and supports applications written in C or
135 Fortran, with little or no modifications. »
137 « The SMPI interface implements about 80% of the MPI 2.0
138 standard [?] and supports applications written in C or
139 Fortran, with little or no modifications. (cf Section IV
144 | SimGrid uses a "fluid model" -- what does that mean?
147 [RCE] Arnaud peut-il aider ici ?
151 | The local convergence criterion (k<=MaxIter) seams wrong and should
152 | rather read: k == MaxIter?
155 [RCE] Je pense que le reviewer a raison. Lilia ?
158 | As far as the reviewer can tell, SMPI removes heavy computation by
159 | making assumptions on the CPU performance of the simulated code --
160 | which however is not true with most Grid environments where You do
161 | have mixed architectures and mixed performance characteristics. How
165 [RCE] Simgrid/SMPI prévoit cette hétérogénéité des composants des
166 clusters dans une grille par la définition plus ou moins fine
167 des caractéristiques des nœuds composant les clusters (puissance
168 CPU, mémoire RAM, …) d’une part mais aussi par la description
169 plus ou moins détaillée aussi du réseau de communication entre
170 les clusters de la grille.
173 | However, the main gripe about this paper is the rather unrealistic
174 | assumption on bandwidth (5 Mbps!) and latency (20ms): the internal
175 | network of a cluster may be Infiniband, with bw of Gigabytes/sec and
176 | micro-second latency, while a second cluster may be reachable over
177 | Gigabit-Ethernet with 100-200x the latency... This would be a setup,
178 | where a (even slight) gain would provide more convincing results.
181 [RCE] Il faut qu’on précise que ces caractéristiques de réseau “non
182 réalistes” concernent le réseau INTER cluster. Le réseau INTRA
183 cluster sont bien dans l’ordre de grandeur donnée (Gbps de bw et
184 ms de latence). Toutefois, le reviewer a bien vu qu’on a poussé
185 trop fort sur le réseau inter-cluster ☺ Mais ce n’est qu’à ce
186 prix qu’on a commencé à avoir un gain appréciable.
191 | Some knitpicks include:
192 | - Abstract: "Behaviours", please no plural
193 | - Sec II (and others): "As exposed" --> "As described"
194 | - Sec II: "And important idle times" --> better "useless idle times
195 | used for synchronization"
196 | - Sec III: "by the mean of an XML file" --> "by means of an XML file".
197 | - SEC IV.B: did not encouter ... unless some code debugging" -->
198 | please rewrite the unless part...
199 | - SEC V: "Hosts processors power" --> "Host processor power"
202 [RCE] On va prendre en compte ces remarques.
203 [AG] J'ai commencé pour les plus faciles.
206 ----------------------- REVIEW 3 ---------------------
208 TITLE: Simulation of Asynchronous Iterative Algorithms Using SimGrid
209 AUTHORS: Charles Emile Ramamonjisoa, David Laiymani, Arnaud Giersch,
210 Lilia Ziane Khodja and Raphaël Couturier
213 ----------- REVIEW -----------
215 | The submitted paper purports to be the first simulation of
216 | asynchronous iterative algorithms and predicts that, for a particular
217 | cluster configurations with very high latency (20ms) and very low
218 | bandwidths (5/50 Mbit/s), an unpreconditioned asynchronous
219 | multisplitting algorithm will be faster than an unpreconditioned GMRES
220 | algorithm for solving a 3D Poisson equation.
222 | Several issues with respect to the relevance of these results deserve
225 | 1) There is no substantial discussion of the fundamental additions to
226 | SimGrid that were required in order to support the simulation of
227 | asynchronous iterative algorithms. If no extensions were required,
228 | then I am unsure as to how this aspect of the work is a contribution.
231 [RCE] Il n’y avait pas d’extensions apportées à SIMGRID pour résoudre
232 le type d’algorithme choisi.
235 | 2) The model problem of a 3D Poisson equation with no preconditioner
236 | is regrettable due to the large number of fast solvers available that
237 | have been available for many decades. For this reason, as is, the
238 | results are not relevant to the solution of PDEs. However, a similar
239 | computational structure appears within the context of gradient descent
240 | methods for the solution of convex optimization problems, and
241 | asynchronous algorithms are quite common. I would humbly suggest such
242 | a model problem in the future unless either a more challenging PDE is
243 | tackled or a non-trivial preconditioner is incorporated.
249 | 3) This is somewhat of a minor point, but I did not see an explicit
250 | discussion of the link between a global relative residual norm,
251 | || A x - b|| / || b ||, and the local convergence criterion used in
252 | the asynchronous algorithm, which tested for the infinity norm of the
253 | local computation. When "precision" is reported in Table I, is it
254 | referring to a consistent global convergence criterion? And, if so,
255 | what is it precisely referring to?
258 [RCE] Selon ma comprehension, la “precision” de la table I est la
259 “tolerance threshold” (epsilon) mentionnée dans la Section
260 IV. Il permet effectivement de determiner le critère ou la
261 condition de convergence globale. Lilia peut confirmer ?
264 | 4) Typical latencies within clusters are on the order of a
265 | microsecond, and the latency used to produce Table I is more than
266 | three orders of magnitude higher (20ms). It would be helpful if more
267 | justification was given for why such a high latency is
268 | relevant. Furthermore, the chosen bandwidths (5 Mbit/s and 50 Mbit/s)
269 | are closer to a non-commercial home internet connection than a
270 | commercial ethernet connection.
273 [RCE] Voir remarques plus haut.
276 | Overall, I feel that a significant number of issues should be
277 | addressed before publication would be warranted.
281 ----------------------- REVIEW 4 ---------------------
283 TITLE: Simulation of Asynchronous Iterative Algorithms Using SimGrid
284 AUTHORS: Charles Emile Ramamonjisoa, David Laiymani, Arnaud Giersch,
285 Lilia Ziane Khodja and Raphaël Couturier
288 ----------- REVIEW -----------
290 | This is a very interesting paper devoted to the implementation in a
291 | grid environment of some asynchronous algorithm. These algorithms are
292 | indeed very powerfull, and the more latency, the more efficient are
293 | these algorithms. A comparison of a synchronous GMRES and an
294 | asynchronous multi-splitting is presented. The obtained results are
295 | interesting and confirm the efficiency of these methods.
301 ----------------------- REVIEW 5 ---------------------
303 TITLE: Simulation of Asynchronous Iterative Algorithms Using SimGrid
304 AUTHORS: Charles Emile Ramamonjisoa, David Laiymani, Arnaud Giersch,
305 Lilia Ziane Khodja and Raphaël Couturier
308 ----------- REVIEW -----------
310 | This paper is a mix between a short and a long paper, it presents
311 | preliminary works on simulation of asynchronous iterative algorithms
312 | using SimGrid. I recommend to accept it as a short paper.