Dataflow Computers
Justin R Smith · 1993
Abstract Although these algorithms look considerably more complex than the corresponding algorithms for the Butterfly and the shuffle-exchange network, their execution-time is comparable. Consider a modification of the butterfly network, where we introduce a new edge in each column that connects the top and bottom vertex - we will call this the m-Butterfly network. It is similar, but not identical to, the form of the Butterfly that identifies the top and bottom rows. Show that the CCC network with a given value of r is isomorphic to an m-Butterfly network with 2r rows.