Skip to Main content Skip to Navigation

Schemas de communications globales dans les reseaux de processeurs : application a la grille torique

Abstract : The aim of this thesis is the study of the most useful communication schemes, specially thebroadcast, in order to design efficient algorithms. In the first part, we present the most imprortant parallel machines and the different communication models used on such machines. This part shows how difficult is the choice of the appropiate interconnection network to link processors in massively parallel computers. The second part establishes global communication schemes in torus with store and forward communication model. We present first a new family of arc-disjoint spanning trees of minimal depth, that lead to a pipelined broadcast in minimal time. Then, we giveother tools, like hamiltonnien paths for the total exchange. This last scheme is extended to the wormhole model. Experimental results on MegaNode computer with 128 Transputers, valid our theoretical study. In the third part, we present an algorithm which permits to overlap communications bycomputations. The basic idea is to anticipe the communications by pipelining small messages. But the optimal size of messages is very difficult to compute. We illustrate this problem on the matrice-vector product.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download
Contributor : Thèses Imag <>
Submitted on : Wednesday, February 25, 2004 - 2:17:39 PM
Last modification on : Friday, November 6, 2020 - 4:09:59 AM
Long-term archiving on: : Wednesday, September 12, 2012 - 3:50:46 PM


  • HAL Id : tel-00005105, version 1




Philippe Michallon. Schemas de communications globales dans les reseaux de processeurs : application a la grille torique. Réseaux et télécommunications [cs.NI]. Institut National Polytechnique de Grenoble - INPG, 1994. Français. ⟨tel-00005105⟩



Record views


Files downloads