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:20210402T160049Z
LOCATION:Track 5
DTSTART;TZID=America/New_York:20201117T130000
DTEND;TZID=America/New_York:20201117T133000
UID:submissions.supercomputing.org_SC20_sess143_pap229@linklings.com
SUMMARY:TAGO: Rethinking Routing Design in High Performance Reconfigurable
  Networks
DESCRIPTION:Paper\n\nTAGO: Rethinking Routing Design in High Performance R
 econfigurable Networks\n\nTeh, Hung, Michelogiannakis, Yan, Glick...\n\nMa
 ny reconfigurable network topologies have been proposed in the past.  Effi
 cient routing on top of these flexible interconnects, however, still prese
 nts a challenge. In this work, we reevaluate how key principles that have 
 guided the designs of many routing  protocols on static networks perform o
 n reconfigurable network topologies.  Based on theoretical analysis of key
  properties that routing in a reconfigurable network should satisfy to max
 imize performance, we propose a topology-aware, globally-direct oblivious 
 (TAGO) routing protocol for reconfigurable topologies.  Our proposed routi
 ng protocol is simple in design and yet, when deployed in conjunction with
  a reconfigurable network topology, improves throughput by up to 2.2x comp
 ared to  established routing protocols, and even comes within 10% of the t
 hroughput performance of impractical adaptive routing that has  instant gl
 obal congestion information.\n\nTag: Algorithms, Networks, Reconfigurable 
 Computing, Routing\n\nRegistration Category: Tech Program Reg Pass
END:VEVENT
END:VCALENDAR