BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20131121T183000Z
DTEND:20131121T190000Z
LOCATION:201/203
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: The jellyfish topology where switches are connected using a random graph=0Ahas recently been proposed for large scale data-center networks. It has been=0Ashown to offer higher bisection bandwidth and better permutation throughput =0Athan the corresponding fat-tree topology with a similar cost. In this work, we propose a new routing scheme for jellyfish that out-performs existing schemes by more effectively exploiting the path diversity, and comprehensively=0Acompare the performance of jellyfish and fat-tree topologies with HPC workloads. The results indicate that both jellyfish and fat-tree topologies offer comparable high performance for HPC workloads on systems that can be realized by 3-level fat-trees using the current technology and the =0Acorresponding jellyfish topologies with similar costs. Fat-trees are more =0Aeffective for smaller systems while jellyfish is more scalable.
SUMMARY:A New Routing Scheme for Jellyfish and its Performance with HPC Workloads
PRIORITY:3
END:VEVENT
END:VCALENDAR