SWH, application "Small-world" à la génération des réseaux d'interconnexion pour les architectures massivement parallèles
Auteur / Autrice : | Samer Damaj |
Direction : | Bernard Pottier |
Type : | Thèse de doctorat |
Discipline(s) : | Informatique |
Date : | Soutenance en 2011 |
Etablissement(s) : | Brest |
Mots clés
Mots clés contrôlés
Résumé
Graphs with a minimum diameter have applications in the design of building-block switching systems, communication networks, and distributed computer systems. Several methods of constructing directed graphs with a small diameter are proposed. First, the dissertation presents as background several (delta, D) graphs including the Hypercube and de Bruijn. It shows the major disadvantages when implementing these topologies in practice for large scale. To achieve our goal, we propose a regular graph called Small World Heuristic (SWH) suitable for large parallel computers. This graph has a maximum degree ! and a small diameter D, while maintaining an acceptable level of connectivity. We show that this heuristic can connect on short distance thousands of nodes as little as 4 links per node. ̕Finally, we present a new integrated placement and routing algorithm to implement this heuristic on 2D VLSI.