Now showing items 1-3 of 3

    • Network unfairness in dragonfly topologies 

      Fuentes, Pablo; Vallejo, Enrique; Camarero, Cristóbal; Beivide Palacio, Ramon; Valero Cortés, Mateo (2016-12)
      Article
      Open Access
      Dragonfly networks arrange network routers in a two-level hierarchy, providing a competitive cost-performance solution for large systems. Non-minimal adaptive routing (adaptive misrouting) is employed to fully exploit the ...
    • Symmetric L-graphs 

      Camarero, Cristóbal; Martínez, Carmen; Beivide Palacio, Julio Ramón (Iniciativa Digital Politècnica, 2011)
      Conference report
      Open Access
      In this paper we characterize symmetric L-graphs, which are either Kronecker products of two cycles or Gaussian graphs. Vertex symmetric networks have the property that the communication load is uniformly distributed on ...
    • Throughput unfairness in Dragonfly networks under realistic traffic patterns 

      Fuentes, Pablo; Vallejo, Enrique; Camarero, Cristóbal; Beivide Palacio, Ramon; Valero Cortés, Mateo (Institute of Electrical and Electronics Engineers (IEEE), 2015)
      Conference report
      Open Access
      Dragonfly networks have a two-level hierarchical arrangement of the network routers, and allow for a competitive cost-performance solution in large systems. Non-minimal adaptive routing is employed to fully exploit the ...