Placement d'applications parallèles en fonction de l'affinité et de la topologie

Abstract : Computer simulation is one of the pillars of Sciences and industry. Climate simulation,cosmology, or heart modeling are all areas in which computing power needs are constantlygrowing. Thus, how to scale these applications ? Parallelization and massively parallel supercomputersare the only ways to do achieve. Nevertheless, there is a price to pay consideringthe hardware topologies incessantly complex, both in terms of network and memoryhierarchy. The issue of data locality becomes central : how to reduce the distance betweena processing entity and data to which it needs to access ? Application placement is one ofthe levers to address this problem. In this thesis, we present the TreeMatch algorithmand its application for static mapping, that is to say at the lauchtime of the application,and the dynamic placement. For this second approach, we propose the awareness of datalocality within a load balancing algorithm. The different approaches discussed are validatedby experiments both on benchmarking codes and on real applications.
Complete list of metadatas

Cited literature [91 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01174693
Contributor : Abes Star <>
Submitted on : Thursday, November 19, 2015 - 9:43:15 AM
Last modification on : Thursday, January 11, 2018 - 6:20:17 AM
Long-term archiving on : Friday, April 28, 2017 - 9:14:50 PM

File

TESSIER_FRANCOIS_2015.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01174693, version 2

Collections

Citation

Francois Tessier. Placement d'applications parallèles en fonction de l'affinité et de la topologie. Calcul parallèle, distribué et partagé [cs.DC]. Université de Bordeaux, 2015. Français. ⟨NNT : 2015BORD0027⟩. ⟨tel-01174693v2⟩

Share

Metrics

Record views

377

Files downloads

412