1097-0037/asset/NET_centre.gif?v=1&s=3b4a007baeb0bb143afbd4cdc905958e631876aa)
Compressing cube-connected cycles and butterfly networks
Article first published online: 7 DEC 1998
DOI: 10.1002/(SICI)1097-0037(199808)32:1<47::AID-NET4>3.0.CO;2-J
Copyright © 1998 John Wiley & Sons, Inc.
1097-0037/asset/cover.gif?v=1&s=ecd753a2b50d85eda1392633ee6b4b9b5040a7ed "Networks")
Additional Information
How to Cite
Klasing, R., Lüling, R. and Monien, B. (1998), Compressing cube-connected cycles and butterfly networks. Networks, 32: 47–65. doi: 10.1002/(SICI)1097-0037(199808)32:1<47::AID-NET4>3.0.CO;2-J
Publication History
- Issue published online: 7 DEC 1998
- Article first published online: 7 DEC 1998
- Manuscript Accepted: 16 JUN 1997
- Manuscript Received: 10 APR 1995
Funded by
- German Research Association (DFG). Grant Numbers: Mo 285/9-1, Me 872/6-1
- ESPRIT Basic Research Action. Grant Numbers: 7141 (ALCOM II), 20244 (ALCOM IT)
- Abstract
- References
- Cited By
Abstract
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 John Wiley & Sons, Inc. Networks 32: 47–65, 1998