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
  • Departaments
  • Departament d'Arquitectura de Computadors
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament d'Arquitectura de Computadors
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A discrete optimization problem in local networks and data alignment

Thumbnail
View/Open
Article principal (2,893Mb) (Restricted access)   Request copy 

Què és aquest botó?

Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:

  • Disposem del correu electrònic de l'autor
  • El document té una mida inferior a 20 Mb
  • Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Share:
 
 
10.1109/TC.1987.1676963
 
  View Usage Statistics
Cita com:
hdl:2117/12659

Show full item record
Fiol Mora, Miquel ÀngelMés informacióMés informacióMés informació
Andrés Yebra, José LuisMés informació
Alegre de Miguel, Ignacio
Valero Cortés, MateoMés informacióMés informacióMés informació
Document typeArticle
Defense date1987-06
Rights accessRestricted access - publisher's policy
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
This paper presents the solution of the following optimization problem that appears in the design of double-loop structures for local networks and also in data memory, allocation and data alignment in SIMD processors. Consider the digraph on N vertices, labeled from 0 to N - 1, where every vertex i is adjacent to the vertices (i + a) mod Nand (i + b) mod N. How should a and b be chosen in order to minimize the diameter and/or the average distance between vertices of the digraph? The study shows that for every N there are several different solutions (a, b) that produce the minimum values of the diameter and average distance between vertices. These values are of the order of V3 and (5/9 )3N_, respectively. For most values of N there exists a solution with a = 1 that facilitates the implementation of a double-loop structure from a single-loop one. The geometrical approach used to characterize the optimal solutions greatly facilitates the study of routing, throughput, and reliability questions.
CitationFiol, M. A. [et al.]. A discrete optimization problem in local networks and data alignment. "IEEE transactions on computers", Juny 1987, vol. C-36, núm. 6, p. 702-713. 
URIhttp://hdl.handle.net/2117/12659
DOI10.1109/TC.1987.1676963
ISSN0018-9340
Collections
  • Departament d'Arquitectura de Computadors - Articles de revista [910]
  • Departament de Matemàtiques - Articles de revista [2.895]
  • COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions - Articles de revista [252]
  • CAP - Grup de Computació d'Altes Prestacions - Articles de revista [370]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
IEEE(double-loop-1987).pdfBlockedArticle principal2,893MbPDFRestricted access

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