Flattened Butterfly : A Cost-Efficient Topology for High-Radix Networks. John Kim, William J. Dally & Dennis Abts Presented by Ajithkumar Thamarakuzhi. Outline. Introduction Flattened Butterfly Topology Routing algorithms and performance comparison Topology cost comparison conclusion.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Flattened Butterfly : A Cost-Efficient Topology for High-Radix Networks
John Kim, William J. Dally & Dennis Abts
4-ary 2-fly butterfly
2-ary 4-fly butterfly
for m from 0 to k-1, where the connection from I to itself is omitted.
A) Reduced cost by a factor of k
B) Improved scalability
C) more suitable for high-radix routers
uniform random traffic worst case traffic pattern
VAL = Valiant’s non-minimal oblivious algorithm
MIN = minimal adaptive , UGAL = non-minimal adaptive algorithm
UGAL-S = UGAL using sequential allocation
CLOS AD = non-minimal adaptive routing in a flattened Clos
uniform random traffic worst case traffic
Technology and packaging assumptions used in the topology comparison is shown below