BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150110Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181114T083000
DTEND;TZID=America/Chicago:20181114T170000
UID:submissions.supercomputing.org_SC18_sess326_spost138@linklings.com
SUMMARY:Supercomputing for the Multi-Driver Routing
DESCRIPTION:Zeyang Ye (Stony Brook University)\n\nSupercomputing is essent
 ial for routing traffic by providing drivers the optimal routes with minim
 al traveling distances or time. The unique challenges that require superco
 mputers to overcome are of multiple folds: numerous drivers, massive simul
 taneous requests, multiple locations, and needs of instant gratifications,
  etc. We developed two parallel methods, PSAD and PSAD-M, by using domain 
 decomposition and state-mixing techniques. On the same computing platform 
 with 96 cores, for the same problem, our PSAD methods outperform all publi
 shed benchmarks by over a hundred times, while improving the solution qual
 ity. For the same routing problem on 384 cores, our PSAD-M reduced the ela
 psed time from the unbearable ten minutes to the reasonable 5 seconds, ach
 ieving a record-breaking speedup of 170. By providing instant routing solu
 tions that enable online recommendations, our methods break the bottleneck
  of the widely adopted offline approaches.\n\nRegistration Category: Tech 
 Program Reg Pass, Exhibits Reg Pass\n\n
END:VEVENT
END:VCALENDAR