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:20211207T055359Z
LOCATION:Second Floor Atrium
DTSTART;TZID=America/Chicago:20211117T083000
DTEND;TZID=America/Chicago:20211117T170000
UID:submissions.supercomputing.org_SC21_sess279_rpost120@linklings.com
SUMMARY:Similarity Measurement for Proxy Application Fidelity
DESCRIPTION:Posters, Research Posters\n\nSimilarity Measurement for Proxy 
 Application Fidelity\n\nChen, Aaziz, Cook, Wildani\n\nProxy applications, 
 designed to represent similar but much larger and more complex parent appl
 ications, are widely used for system co-design and procurement. Quantitati
 ve validation, however, to prove that proxies are faithful representations
  of their parents, is missing. In this work, we apply several machine lear
 ning-based methods to quantitatively demonstrate the correspondence of pro
 xy to parent in their underlying node and memory hardware behavior. We sho
 w that different similarity measurements have similar results while evalua
 ting the proxy application fidelity, and most proxies are good representat
 ions of their parents.\n\nRegistration Category: Tech Program Reg Pass, Ex
 hibit Hall Only
END:VEVENT
END:VCALENDAR