Por favor utiliza este link para citar o compartir este documento: http://repositoriodigital.academica.mx/jspui/handle/987654321/8848
Título: A Class of Parametric Regular Networks for Multicomputer Architectures
Palabras clave: ;REGULAR INTERCONNECTION NETWORKS; PARALEL SYSTEMS; CIRCULANT NETWORKS; HYPERCUBE TOPOLOGIES
Fecha de publicación: 10-Sep-2011
Editorial: Computación y Sistemas
Descripción: A NEW CLASS OF MULTICOMPUTER INTERCONNECTION NETWORKS IS PROPOSED AND ANALYZED: PARAMETRICALLY DESCRIBED, REGULAR, AND BASED ON SEMIGROUPS (PRS) NETWORKS (OR R, (N, V,G) GRAPHS WITH THE ORDER N, THE DEGREE V, THE GIRTH, G, AND THE NUMBER OF EQUIVALENCE CLASSES OF KNOWN NETWORKS ( HYPERCUBES, CIRCULANT NETWORKS, CUBE-CONNECTED CYCLES, ETC) AS SPECIAL CASES. WE EXPLORE THE BASIC TOPOLOGICAL PROPERTIES ( CONECTIVITY, ISOMORPHISM, LOWER BOUNDS ON THE DIAMETER AND THE AVERAGE DISTANCE, ETC) OF THE PROPOSED GRAPHS AND SHYNTHESIZE THE OPTIMAL PRS NETWORKS HAVING THE MINIMAL DIAMETER FOR THE GIVEN PARAMETERS OF THE GRAPH. THE PRS NETWORKS AND THEIR SUBCLASS-MULTIDIMENSIONAL CIRCULANTS-ARE COMPARED TO HYPERCUBES: THE OPTIMAL PRS GRAPHS DIAMETER IS =O.21 LOG2 N ( FOR G=6) AND THE CIRCULANTS DIAMETER IS = 0.32 LOG2 N WHEREAS THE HYPERCUBES DIAMETER IS LOG2 N, PROVIDED THEY HAVE THE SAME VERTEZ AND EDGE COMPLEXITY
A NEW CLASS OF MULTICOMPUTER INTERCONNECTION NETWORKS IS PROPOSED AND ANALYZED: PARAMETRICALLY DESCRIBED, REGULAR, AND BASED ON SEMIGROUPS (PRS) NETWORKS (OR R, (N, V,G) GRAPHS WITH THE ORDER N, THE DEGREE V, THE GIRTH, G, AND THE NUMBER OF EQUIVALENCE CLASSES OF KNOWN NETWORKS ( HYPERCUBES, CIRCULANT NETWORKS, CUBE-CONNECTED CYCLES, ETC) AS SPECIAL CASES. WE EXPLORE THE BASIC TOPOLOGICAL PROPERTIES ( CONECTIVITY, ISOMORPHISM, LOWER BOUNDS ON THE DIAMETER AND THE AVERAGE DISTANCE, ETC) OF THE PROPOSED GRAPHS AND SHYNTHESIZE THE OPTIMAL PRS NETWORKS HAVING THE MINIMAL DIAMETER FOR THE GIVEN PARAMETERS OF THE GRAPH. THE PRS NETWORKS AND THEIR SUBCLASS-MULTIDIMENSIONAL CIRCULANTS-ARE COMPARED TO HYPERCUBES: THE OPTIMAL PRS GRAPHS DIAMETER IS =O.21 LOG2 N ( FOR G=6) AND THE CIRCULANTS DIAMETER IS = 0.32 LOG2 N WHEREAS THE HYPERCUBES DIAMETER IS LOG2 N, PROVIDED THEY HAVE THE SAME VERTEZ AND EDGE COMPLEXITY
Other Identifiers: http://revistas.unam.mx/index.php/cys/article/view/2507
Aparece en las Colecciones:Computación y Sistemas

Archivos de este documento:
No hay archivos asociados a este documento.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.