Exploració per autor "Rodríguez Herrera, Germán"

Ara es mostren els items 1-4 de 4

    • A scalable synthetic traffic model of Graph500 for computer networks analysis 

      Fuentes Sáez, Pablo; Benito, Mariano; Vallejo, Enrique; Bosque Orero, José Luis; Beivide Palacio, Ramon; Anghel, Andreea; Rodríguez Herrera, Germán; Gusat, Mitch; Minkenberg, Cyriel; Valero Cortés, Mateo (2017-12-25)
      Article
      Accés obert
      The Graph500 benchmark attempts to steer the design of High-Performance Computing systems to maximize the performance under memory-constricted application workloads. A realistic simulation of such benchmarks for architectural ...

    • Generation of simple analytical models for message passing applications 

      Rodríguez Herrera, Germán; Badia Sala, Rosa Maria; Labarta Mancho, Jesús José (Springer, 2004)
      Text en actes de congrés
      Accés obert
      We present a methodology which allows to derive accurate and simple models which are able to describe the performance of parallel applications without looking at the source code. A trace is obtained and linear models are ...

    • Oblivious routing schemes in extended generalized fat tree networks 

      Rodríguez Herrera, Germán; Minkenberg, Cyriel; Beivide Palacio, Ramon; Luijten, Ronald P.; Labarta Mancho, Jesús José; Valero Cortés, Mateo (IEEE Computational Intelligence Society, 2009)
      Text en actes de congrés
      Accés obert
      A family of oblivious routing schemes for fat trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S-mod-k and D-mod-k, are analyzed in detail. ...

    • On-the-fly adaptive routing for dragonfly interconnection networks 

      García, Marina; Vallejo, Enrique; Beivide Palacio, Julio Ramón; Camarero Coterillo, Cristobal; Valero Cortés, Mateo; Rodríguez Herrera, Germán; Minkenberg, Cyriel (2015-03-01)
      Article
      Accés obert
      Adaptive deadlock-free routing mechanisms are required to handle variable traffic patterns in dragonfly networks. However, distance-based deadlock avoidance mechanisms typically employed in Dragonflies increase the router ...