BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210402T160544Z
LOCATION:Poster Module
DTSTART;TZID=America/New_York:20201119T083000
DTEND;TZID=America/New_York:20201119T170000
UID:submissions.supercomputing.org_SC20_sess337_rpost121@linklings.com
SUMMARY:Evaluating Adaptive Routing Performance on Large-Scale Mega&#64258
 ;y Topology
DESCRIPTION:Posters, Research Posters\n\nEvaluating Adaptive Routing Perfo
 rmance on Large-Scale Megafly Topology\n\nNewaz, Mollah, Faizian, To
 ng\n\nThe Megafly topology has recently been proposed as an e&#64259
 ;cient, hierarchical way to interconnect large-scale high-performance comp
 uting systems. Megafly networks may be constructed in various group 
 sizes and configurations, but it is challenging to maintain high thr
 oughput performance on all such variants. A robust topology-specific
  adaptive routing scheme, therefore, is needed to utilize the topological 
 advantages of Megafly. Currently, Progressive Adaptive Routing (PAR)
  is the best known routing scheme for Megafly networks, but its perf
 ormance is not fully known across all scales and configurations. In 
 this research poster, with the use of trace-driven simulation experiments,
  we show that the current PAR scheme performs sub-optimally on Mega&#64258
 ;y networks with a large number of groups. As better alternatives, we prop
 ose two new practical adaptive routing schemes, KAPR and KU-GCN, that can 
 improve the communication performance of Megafly at any scale and co
 nfiguration.\n\nRegistration Category: Tech Program Reg Pass, Exhibi
 ts Reg Pass
END:VEVENT
END:VCALENDAR