07-12-2014 v01

diff --git a/review.txt b/review.txt
index b44622a0a55c2a8b44a2298553dfa2fc746d62f7..fc1b382afe456f39776015fd4387a3e5aa75df47 100644 (file)
--- a/review.txt
+++ b/review.txt
@@ -34,8 +34,6 @@ Reviewer #2: This work focus on an better algorithm that solves very large spars
 The following paragraph is added in the introduction:
 In this work we develop a new parallel two-stage algorithm for large-scale clusters. Our objective is to mix between Krylov based iterative methods and the multisplitting method to improve the scalability. In fact Krylov subspace methods are well-known for their good convergence compared to others iterative methods. So our main contribution is to use the multisplitting method which splits the problem to solve into different blocks in order to reduce the large amount of communications and, to implement both inner and outer iterations as Krylov subspace iterations improving the convergence of the multisplitting algorithm.
        
 The following paragraph is added in the introduction:
 In this work we develop a new parallel two-stage algorithm for large-scale clusters. Our objective is to mix between Krylov based iterative methods and the multisplitting method to improve the scalability. In fact Krylov subspace methods are well-known for their good convergence compared to others iterative methods. So our main contribution is to use the multisplitting method which splits the problem to solve into different blocks in order to reduce the large amount of communications and, to implement both inner and outer iterations as Krylov subspace iterations improving the convergence of the multisplitting algorithm.
        

-
-

 ,----
 2. Given that the focus of the paper is to provide a better solution on a well known problem with several well studied approaches. It is essential for the author to provide extensive comparison studies with those approaches. In Section 4 the paper provides some experiments with very limited scope (solving one simple problem and comparing with one well known problems). This seems not enough. Another way is to provide a qualitative comparison against other proposed approaches and explain why the proposed approach is better. But this is also not found.
 `----
 ,----
 2. Given that the focus of the paper is to provide a better solution on a well known problem with several well studied approaches. It is essential for the author to provide extensive comparison studies with those approaches. In Section 4 the paper provides some experiments with very limited scope (solving one simple problem and comparing with one well known problems). This seems not enough. Another way is to provide a qualitative comparison against other proposed approaches and explain why the proposed approach is better. But this is also not found.
 `----


@@ -69,7 +67,7 @@ A paragraph is added in the introduction to show our main contribution of this w
 ,----
 ii) The authors supposed a good scalability of the new algorithm, but the experiment's proof seems not enough, as it just gave the weak scalability comparison, which just could lead to a conclusion of improved execution time, while a strong scalability curve might be more persuasive. 
 `----
 ,----
 ii) The authors supposed a good scalability of the new algorithm, but the experiment's proof seems not enough, as it just gave the weak scalability comparison, which just could lead to a conclusion of improved execution time, while a strong scalability curve might be more persuasive. 
 `----

-Some figures showing the strong scalability of the two tested algorithms are added in Section 4.
+

 
 ,----
 iii) In the last line on the page 7, there is apparent error "multi-saplitting".
 
 ,----
 iii) In the last line on the page 7, there is apparent error "multi-saplitting".