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:20181221T160904Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181113T083000
DTEND;TZID=America/Chicago:20181113T170000
UID:submissions.supercomputing.org_SC18_sess325_spost138@linklings.com
SUMMARY:Supercomputing for the Multi-Driver Routing
DESCRIPTION:ACM Student Research Competition, Poster\nTech Program Reg Pas
 s, Exhibits Reg Pass\n\nSupercomputing for the Multi-Driver Routing\n\nYe\
 n\nSupercomputing is essential for routing traffic by providing drivers th
 e optimal routes with minimal traveling distances or time. The unique chal
 lenges that require supercomputers to overcome are of multiple folds: nume
 rous drivers, massive simultaneous requests, multiple locations, and needs
  of instant gratifications, etc. We developed two parallel methods, PSAD a
 nd PSAD-M, by using domain decomposition and state-mixing techniques. On t
 he same computing platform with 96 cores, for the same problem, our PSAD m
 ethods outperform all published benchmarks by over a hundred times, while 
 improving the solution quality. For the same routing problem on 384 cores,
  our PSAD-M reduced the elapsed time from the unbearable ten minutes to th
 e reasonable 5 seconds, achieving a record-breaking speedup of 170. By pro
 viding instant routing solutions that enable online recommendations, our m
 ethods break the bottleneck of the widely adopted offline approaches.
URL:https://sc18.supercomputing.org/presentation/?id=spost138&sess=sess325
END:VEVENT
END:VCALENDAR