𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing optimal subnetworks for the crossed cube network

✍ Scribed by Dajin Wang

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
384 KB
Volume
60
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Construction of Fault-Tolerant Cu
On the Construction of Fault-Tolerant Cube-Connected Cycles Networks
✍ J. Bruck; R. Cypher; C.T. Ho πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 772 KB

This paper presents a new approach to tolerating edge faults and node faults in (CCC) networks of Cube-Connected Cycles in a worst-case scenario. Our constructions of fault-tolerant CCC networks are obtained by adding extra edges to the CCC. The main objective is to reduce the cost of the fault-tole

Bounds for the crossing number of the N-
Bounds for the crossing number of the N-cube
✍ Tom Madej πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 658 KB

## Abstract Let __Q__~__n__~ denote the n‐dimensional hypercube. In this paper we derive upper and lower bounds for the crossing number __v__(__Q__~__n__~), i.e., the minimum number of edge‐crossings in any planar drawing of __Q__~__n__~. The upper bound is close to a result conjectured by Eggleton

The psi-cube: a bus-based cube-type clus
The psi-cube: a bus-based cube-type clustering network for high-performance on-chip systems
✍ Masaru Takesue πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 401 KB

This paper proposes a bus-based cube-type network, called psi-cube, that alleviates the two problems, long wires and a limited number of I/O pins, against the on-chip systems through a small diameter and dynamic clusters, respectively. The 2 n -node psi-cube is organized on the sets of node-partitio