Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

57.066 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • CAP - Grup de Computació d'Altes Prestacions
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • CAP - Grup de Computació d'Altes Prestacions
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Oblivious routing schemes in extended generalized fat tree networks

Thumbnail
View/Open
05289145.pdf (448,0Kb)
Share:
 
 
10.1109/CLUSTR.2009.5289145
 
  View Usage Statistics
Cita com:
hdl:2117/114019

Show full item record
Rodríguez Herrera, Germán
Minkenberg, Cyriel
Beivide Palacio, Ramon
Luijten, Ronald P.
Labarta Mancho, Jesús JoséMés informacióMés informacióMés informació
Valero Cortés, MateoMés informacióMés informacióMés informació
Document typeConference report
Defense date2009
PublisherIEEE Computational Intelligence Society
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
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. S-mod-k is the default routing algorithm given as an example in the first works formally describing fat tree networks. D-mod-k has been independently proposed and investigated by several authors, who conclude in their evaluations that it achieves better performance than a random or adaptive routing approach. First, we identify the reasons why these algorithms perform well. Using this insight we extend these algorithms, originally intended for full bisection networks, to slimmed networks. Based on the lessons learned we propose a new generalized family of algorithms that provides a better oblivious solution than the existing ones for this class of networks. Moreover, this family extends the previous work from k-ary n-trees to the more general class of extended generalized fat trees.
CitationRodríguez, G., Minkenberg, C., Beivide, R., Luijten, R., Labarta, J., Valero, M. Oblivious routing schemes in extended generalized fat tree networks. A: Workshop on High Performance Interconnects for Distributed Computing. "2009 IEEE International Conference on Cluster Computing and Workshops". New Orleans, Louisiana: IEEE Computational Intelligence Society, 2009, p. 1-8. 
URIhttp://hdl.handle.net/2117/114019
DOI10.1109/CLUSTR.2009.5289145
ISBN978-1-4244-5012-1
Publisher versionhttp://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5289145&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5289145
Collections
  • CAP - Grup de Computació d'Altes Prestacions - Ponències/Comunicacions de congressos [762]
  • Departament d'Arquitectura de Computadors - Ponències/Comunicacions de congressos [1.773]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
05289145.pdf448,0KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina