commit de david

[hpcc2014.git] / hpcc.tex

diff --git a/hpcc.tex b/hpcc.tex
index cbd1e9ca4f74e58b240b1ea250c9a756d69671c7..d1ce8c8580c0ede5a7b47809038b6b48a14520e0 100644 (file)
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -187,8 +187,8 @@ generated.  It is possible to use asynchronous communications, in this case, the
 model can be compared to the previous one except that data required on another
 processor are sent asynchronously i.e.  without stopping current computations.
 This technique allows communications to be partially overlapped by computations
 model can be compared to the previous one except that data required on another
 processor are sent asynchronously i.e.  without stopping current computations.
 This technique allows communications to be partially overlapped by computations

-but unfortunately, the overlapping is only partial and important idle times
-remain.  It is clear that, in a grid computing context, where the number of
+but unfortunately, the overlapping is only partial and useless idle times used for synchronization remain.  
+It is clear that, in a grid computing context, where the number of

 computational nodes is large, heterogeneous and widely distributed, the idle
 times generated by synchronizations are very penalizing. One way to overcome
 this problem is to use the asynchronous iterations model.  Here, local
 computational nodes is large, heterogeneous and widely distributed, the idle
 times generated by synchronizations are very penalizing. One way to overcome
 this problem is to use the asynchronous iterations model.  Here, local