BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211208T164413Z
LOCATION:Level 2 - Lobby
DTSTART;TZID=America/Los_Angeles:20211208T180000
DTEND;TZID=America/Los_Angeles:20211208T190000
UID:dac_DAC 2021_sess244_LBR110@linklings.com
SUMMARY:Late Breaking Results: Novel Discrete Dynamic Filled Function Algo
 rithm for Acyclic Graph Partitioning
DESCRIPTION:Late Breaking Results Poster, Networking Reception\n\nLate Bre
 aking Results: Novel Discrete Dynamic Filled Function Algorithm for Acycli
 c Graph Partitioning\n\nChen\n\nThese paper models a circuit as a directed
  graph and considers acyclic graph partitioning to minimize edge cuts. Thi
 s problem differs from the traditional problem because of the acyclicity c
 onstraint. Unlike traditional heuristics that tend to be trapped in local 
 minima, we present a novel discrete dynamic filled function algorithm for 
 the acyclic graph problem. Our algorithm guarantees convergence and effect
 ively moves from one local minimizer to another better one. Based on the m
 ulti-level framework, we further extend our algorithm to partition large-s
 cale acyclic graphs efficiently. Experimental results show that our algori
 thm achieves 8% cutsize reduction over the state-of-the-art work.\n\nVirtu
 al Program: Presented In-Person
END:VEVENT
END:VCALENDAR