𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Compressing cube-connected cycles and butterfly networks

✍ Scribed by Klasing, Ralf; L�ling, Reinhard; Monien, Burkhard

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
307 KB
Volume
32
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

We consider the simulation of large cube-connected cycles (CCC ) and large butterfly networks ( BFN) on smaller ones, a problem that arises when algorithms designed for an architecture of an ideal size are to be executed on an existing architecture of a fixed size. We show that large CCCs and BFNs can be embedded into smaller networks of the same type with (a) dilation 2 and optimum load, (b) dilation 1 and optimum load in most cases, and (c) dilation 1 and nearly optimum load in all cases. Our results show that large CCCs and BFNs can be simulated very efficiently on smaller ones. Additionally, we implemented our algorithm for compressing CCCs and ran several experiments on a Transputer network, which showed that our technique also behaves very well from a practical point of view. ᭧ 1998

📜 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

Hamiltonian connectivity and globally 3∗
Hamiltonian connectivity and globally 3∗-connectivity of dual-cube extensive networks
✍ Shih-Yan Chen; Shin-Shin Kao 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 784 KB

In 2000, Li et al. introduced dual-cube networks, denoted by DC n for n P 1, using the hypercube family Q n and showed the vertex symmetry and some fault-tolerant hamiltonian properties of DC n . In this article, we introduce a new family of interconnection networks called dual-cube extensive networ

Hamilton-connectivity and cycle-embeddin
Hamilton-connectivity and cycle-embedding of the Möbius cubes
✍ Jianxi Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

The recently introduced interconnection network, the Möbius cube, is an important variant of the hypercube. This network has several attractive properties compared with the hypercube. In this paper, we show that the n-dimensional Möbius cube M n is Hamilton-connected when n 3. Then, by using the Ham