Show simple item record

dc.contributor.authorFiol Mora, Miquel Àngel
dc.contributor.authorAndrés Yebra, José Luis
dc.contributor.authorAlegre de Miguel, Ignacio
dc.contributor.authorValero Cortés, Mateo
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.contributor.otherFacultat d'Informàtica de Barcelona
dc.contributor.otherFacultat d'Informàtica de Barcelona
dc.date.accessioned2011-05-26T11:53:16Z
dc.date.available2011-05-26T11:53:16Z
dc.date.created1987-06
dc.date.issued1987-06
dc.identifier.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.
dc.identifier.issn0018-9340
dc.identifier.urihttp://hdl.handle.net/2117/12659
dc.description.abstractThis 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.
dc.format.extent12 p.
dc.language.isoeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica aplicada a les ciències
dc.subject.lcshAlgorithms
dc.titleA discrete optimization problem in local networks and data alignment
dc.typeArticle
dc.subject.lemacMatemàtica aplicada
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.identifier.doi10.1109/TC.1987.1676963
dc.subject.amsClassificació AMS::68 Computer science::68W Algorithms
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac5762867
dc.description.versionPostprint (published version)
local.citation.authorFiol, M. A.; Andrés, J.; Alegre, I.; Valero, M.
local.citation.publicationNameIEEE transactions on computers
local.citation.volumeC-36
local.citation.number6
local.citation.startingPage702
local.citation.endingPage713


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

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