Hypercube-Like Topologies
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
Hypercube-Like Topologies
|
| Id. |
41866349 |
| Idioma |
inglés
|
| Titulo |
Hypercube-Like Topologies |
| Autor(es) |
Darcy Quesnel
|
| Localización |
http://citeseer.ist.psu.edu/430921.html
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
The Hypercube is a popular interconnection topology for multicomputers for a
variety of reasons. Graphs that are related to the Hypercube have many of the same
properties, as well as other additional desirable properties.
In particular, we will look at the properties of the Fibonacci Cube, the Hyper
Petersen Graph, and the Pancake and Star Graphs. We will explore routing on all
these topologies. And, we will compare all these topologies to that of the Hypercube.
1 Introduction
1.1 Some Graph Theoretic Terms
Graph We define a graph G = (V G ; EG ), where VG is the vertex set and EG is the edge set.
We say (i; j) 2 EG , where i; j 2 VG .
Network The terms graph, network, and topology are used here interchangeably.
Node The terms vertex, node, and processor are used here interchangeably.
Interconnection The terms edge, link, connection and interconnection are used here interchangeably.
Degree The degree of a node i in a graph G, denoted dG (i), is the number of edges in G
that are...
|
| Tipo |
ps
|
| Palabras clave |
Darcy Quesnel Hypercube-Like Topologies
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
unrestricted |
| Formatos |
ps
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://www.scs.carleton.ca/~dquesnel/papers/topologies/paper.ps
|
| Fecha de contribución |
31-mar-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
