Compressing cube-connected cycles and butterfly networks
UNSPECIFIED. (1998) Compressing cube-connected cycles and butterfly networks. NETWORKS, 32 (1). pp. 47-65. ISSN 0028-3045Full text not available from this repository.
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. (C) 1998 John Wiley & Sons, Inc. Networks 32: 47-65, 1998.
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
|Journal or Publication Title:||NETWORKS|
|Publisher:||JOHN WILEY & SONS INC|
|Official Date:||August 1998|
|Number of Pages:||19|
|Page Range:||pp. 47-65|
Actions (login required)
Downloads per month over past year