Results 1  10
of
23,696
Regular Layouts of Butterfly Networks
 INTEGRATION
, 1994
"... Physical arrangements of butterfly networks impose severe problems because of wire length. The problem gets even harder if standard technology like printed circuit boards, racks, and cabinets, must be used. We investigate regular arrangements of butterfly networks. We construct xustage butterfly ne ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Physical arrangements of butterfly networks impose severe problems because of wire length. The problem gets even harder if standard technology like printed circuit boards, racks, and cabinets, must be used. We investigate regular arrangements of butterfly networks. We construct xustage butterfly
Wide diameters of butterfly networks
 Taiwanese J. Math
, 1999
"... Abstract. Reliability and efficiency are important criteria in the design of interconnection networks. Recently, the wwide diameter dw(G), the (w − 1)fault diameter Dw(G), and the wRabin number rw(G) have been used to measure network reliability and efficiency. In this paper, we study wide diamet ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
diameters for an important class of parallel networks— butterfly networks. The main result of this paper is to determine their wide diameters. 1.
Improved Bounds on the Crossing Number of Butterfly Network
, 2013
"... We draw the r dimensional butterfly network with 1 ..."
Extended Butterfly Networks
"... This paper defines a new network called the Extended Butterfly. The extended butterfly of degree n (XBn) has n 2 2 n nodes, diameter equal to ⌊3n/2 ⌋ and a constant node degree of 8. XBn is symmetric and contains n distinct copies of Bn. We also show that XBn supports all cycle subgraphs except thos ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper defines a new network called the Extended Butterfly. The extended butterfly of degree n (XBn) has n 2 2 n nodes, diameter equal to ⌊3n/2 ⌋ and a constant node degree of 8. XBn is symmetric and contains n distinct copies of Bn. We also show that XBn supports all cycle subgraphs except
VLSI Layout and Packaging of Butterfly Networks
 in Proc. of the 12th ACM Symp. on Parallel Algorithms and Architectures (SPAA
, 2000
"... Wepresentascheme for optimal VLSI layout and packaging of butterfly networks under the Thompson model, the multilayer grid model, and the hierarchical layout model. WeshowthatwhenL layers of wires are available, an N  node butterfly network can be laid out with area L 2 log 2 2 N + , maxi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Wepresentascheme for optimal VLSI layout and packaging of butterfly networks under the Thompson model, the multilayer grid model, and the hierarchical layout model. WeshowthatwhenL layers of wires are available, an N  node butterfly network can be laid out with area L 2 log 2 2 N
Regular Layouts of Butterfly Networks in Three Dimensions
, 1993
"... Physical arrangements of butterfly networks impose severe problems because of wire length. The problem gets even harder if standard technology like printed circuit boards, racks, and cabinets, must be used. We investigate threedimensional arrangements of butterfly networks. We construct xustage bu ..."
Abstract
 Add to MetaCart
Physical arrangements of butterfly networks impose severe problems because of wire length. The problem gets even harder if standard technology like printed circuit boards, racks, and cabinets, must be used. We investigate threedimensional arrangements of butterfly networks. We construct xu
Network computing capacity for the reverse butterfly network
"... Abstract—We study the computation of the arithmetic sum of the qary source messages in the reverse butterfly network. Specifically, we characterize the maximum rate at which the message sum can be computed at the receiver and demonstrate that linear coding is suboptimal. I. ..."
Abstract
 Add to MetaCart
Abstract—We study the computation of the arithmetic sum of the qary source messages in the reverse butterfly network. Specifically, we characterize the maximum rate at which the message sum can be computed at the receiver and demonstrate that linear coding is suboptimal. I.
Improved Bounds on the Crossing Number of Butterfly Network
, 2013
"... We draw the r dimensional butterfly network with 1 4 4r +O(r2 r) crossings which improves the previous estimate given by Cimikowski (1996). We also give a lower bound which matches the upper bound obtained in this paper. ..."
Abstract
 Add to MetaCart
We draw the r dimensional butterfly network with 1 4 4r +O(r2 r) crossings which improves the previous estimate given by Cimikowski (1996). We also give a lower bound which matches the upper bound obtained in this paper.
Hamilton cycle decomposition of the Butterfly network
, 1996
"... In this paper, we prove that the wrapped Butterfly graph WBF(d;n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d = 2. ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
In this paper, we prove that the wrapped Butterfly graph WBF(d;n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d = 2.
Results 1  10
of
23,696