Mostra el registre d'ítem simple
A discrete optimization problem in local networks and data alignment
dc.contributor.author | Fiol Mora, Miquel Àngel |
dc.contributor.author | Andrés Yebra, José Luis |
dc.contributor.author | Alegre de Miguel, Ignacio |
dc.contributor.author | Valero Cortés, Mateo |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.contributor.other | Facultat d'Informàtica de Barcelona |
dc.contributor.other | Facultat d'Informàtica de Barcelona |
dc.date.accessioned | 2011-05-26T11:53:16Z |
dc.date.available | 2011-05-26T11:53:16Z |
dc.date.created | 1987-06 |
dc.date.issued | 1987-06 |
dc.identifier.citation | Fiol, 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.issn | 0018-9340 |
dc.identifier.uri | http://hdl.handle.net/2117/12659 |
dc.description.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. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.rights.uri | http://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.lcsh | Algorithms |
dc.title | A discrete optimization problem in local networks and data alignment |
dc.type | Article |
dc.subject.lemac | Matemàtica aplicada |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.contributor.group | Universitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions |
dc.identifier.doi | 10.1109/TC.1987.1676963 |
dc.subject.ams | Classificació AMS::68 Computer science::68W Algorithms |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 5762867 |
dc.description.version | Postprint (published version) |
local.citation.author | Fiol, M. A.; Andrés, J.; Alegre, I.; Valero, M. |
local.citation.publicationName | IEEE transactions on computers |
local.citation.volume | C-36 |
local.citation.number | 6 |
local.citation.startingPage | 702 |
local.citation.endingPage | 713 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.049]
-
Articles de revista [3.262]
-
Articles de revista [290]
-
Articles de revista [382]