X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/interreg4.git/blobdiff_plain/be397f722f83b7fe92dbc82d6355705fc8e79eb5..cd0b55aa907b2bf1ceff8fdea29a78d2cecbdd69:/pdsec2010/pdsec2010.tex?ds=inline diff --git a/pdsec2010/pdsec2010.tex b/pdsec2010/pdsec2010.tex index dc4527d..6f76693 100644 --- a/pdsec2010/pdsec2010.tex +++ b/pdsec2010/pdsec2010.tex @@ -27,7 +27,7 @@ \usepackage[pdftex,final]{graphicx} % Extension pour les liens intra-documents (tagged PDF) % et l'affichage correct des URL (commande \url{http://example.com}) -\usepackage{hyperref} +%\usepackage{hyperref} % Extension pour que plus de titres apparaissent dans la table des matieres % (table des matieres, bibliographie, index). %\usepackage{tocbibind} @@ -825,7 +825,7 @@ environment is fault tolerant and tasks save checkpoints on their neighbors, it is more efficient to save on near nodes than on far ones. In the synchronous model, both heterogeneity and locality must be taken into account in a balanced way. In the asynchronous model, -since no synchronizations occurs, the heterogeneity issue is less +since no synchronization occurs, the heterogeneity issue is less important. @@ -1424,7 +1424,7 @@ in comparison to the version without mapping. \caption{Gains in time of the execution of the class E of the CG application on Arc1.1 using 64 nodes} \label{tab:exph1E} - \vspace*{-0.3cm} + \vspace*{-0.4cm} \end{table} %\vspace{-0.5cm} @@ -1447,7 +1447,7 @@ in comparison to the version without mapping. \caption{Gains in time of the execution of the class F of the CG application on Arc1.2 using 128 nodes} \label{tab:exph1F} - \vspace*{-0.3cm} + \vspace*{-0.4cm} \end{table} At first, we can see that the Simple Mapping algorithm, though it is @@ -1512,7 +1512,7 @@ mapping. \caption{Gains in time of the execution of the class E of the CG application on Arc2.1 using 64 nodes} \label{tab:exph2E} - \vspace*{-0.3cm} + \vspace*{-0.4cm} \end{table} \renewcommand{\arraystretch}{1.5} @@ -1533,7 +1533,7 @@ mapping. \caption{Gains in time of the execution of the class F of the CG application on Arc2.2 using 128 nodes} \label{tab:exph2F} - \vspace*{-0.3cm} + \vspace*{-0.4cm} \end{table} To begin with, these experiments confirm that a mapping algorithm is @@ -1746,7 +1746,7 @@ a whole cluster fails, as we save on neighbors (which are in general on the same cluster for communication efficiency reasons), an important part of the application is lost and we cannot restart this part; so the whole application fails. A trade-off should be done -by having some saving nodes in external clusters. +by having some saving nodes in external clusters.\\ % \subsubsection*{Acknowledgements}