Pasar al contenido principal

ESCALANDO EL RENDIMIENTO DE LAS APLICACIONES EN LOS COMPUTADORES CON POTENCIA EXASCALE

RYC-2009-03989

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Contratación e Incorporación de RRHH
Subprograma Subprograma Ramón y Cajal (RYC)
Convocatoria Ramón y Cajal
Año convocatoria 2009
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Formación e Incorporación de Investigadores
Centro beneficiario BARCELONA SUPERCOMPUTING CENTER CENTRO NACIONAL DE SUPERCOMPUTACION
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 1
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A survey and evaluation of topology-agnostic deterministic routing algorithms

  • Flich Cardo, José
  • López Rodríguez, Pedro Juan|||0000-0003-4544-955X
  • Skeie, . Tor
  • Mejia, Andres
  • Lysne, . Olav
  • Robles Martínez, Antonio
  • Duato Marín, José Francisco
  • Koibuchi, . Michihiro
  • Rokicki, . Tomas
  • Sancho, . Jose Carlos
Most standard cluster interconnect technologies are flexible with respect to network topology. This has spawned a substantial amount of research on topology-agnostic routing algorithms, which make no assumption about the network structure, thus providing the flexibility needed to route on irregular networks. Actually, such an irregularity should be often interpreted as minor modifications of some regular interconnection pattern, such as those induced by faults. In fact, topology-agnostic routing algorithms are also becoming increasingly useful for networks on chip (NoCs), where faults may make the preferred 2D mesh topology irregular. Existing topology-agnostic routing algorithms were developed for varying purposes, giving them different and not always comparable properties. Details are scattered among many papers, each with distinct conditions, making comparison difficult. This paper presents a comprehensive overview of the known topology-agnostic routing algorithms. We classify these algorithms by their most important properties, and evaluate them consistently. This provides significant insight into the algorithms and their appropriateness for different on- and off-chip environments., This work was supported by the Spanish MEC and MICINN, as well as by the European Commission FEDER funds, under Grants CSD2006-00046, TIN2009-14475-C04, and RYC2009-03989.