Mathematics for Computer Science

(Frankie) #1

10.9. Bene ̆s Network 297


Homework Problems


Problem 10.7.
Louis Reasoner figures that, wonderful as the Beneˇs network may be, the butterfly
network has a few advantages, namely: fewer switches, smaller diameter, and an
easy way to route packets through it. So Louis designs anN-input/output network
he modestly calls aReasoner-netwith the aim of combining the best features of
both the butterfly and Beneˇs nets:


Theith input switch in a Reasoner-net connects to two switches,aiand
bi, and likewise, thejth output switch has two switches,yjandzj,
connected to it. Then the Reasoner-net has anN-input Beneˇs network
connected using theaiswitches as input switches and theyjswitches
as its output switches. The Reasoner-net also has anN-input butterfly
net connected using thebiswitches as inputs and¡ thezjswitches as
outputs.
In the Reasoner-net a minimum latency routing does not have minimum conges-
tion. Thelatency for min-congestion(LMC) of a net is the best bound on latency
achievable using routings that minimize congestion. Likewise, thecongestion for
min-latency(CML) is the best bound on congestion achievable using routings that
minimize latency.
Fill in the following chart for the Reasoner-net and briefly explain your answers.


diameter switch size(s) # switches congestion LMC CML

Problem 10.8.
Show that the congestion of the butterfly net,Fn, is exactly


p
Nwhennis even.
Hint:
 There is a unique path from each input to each output, so the congestion is
the maximum number of messages passing through a vertex for any routing
problem.
 Ifvis a vertex in columniof the butterfly network, there is a path from ex-
actly 2 iinput vertices tovand a path fromvto exactly 2 nioutput vertices.

 At which column of the butterfly network must the congestion be worst?
What is the congestion of the topmost switch in that column of the network?
Free download pdf