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:20260202T201805Z
LOCATION:Second Floor Atrium
DTSTART;TZID=America/Chicago:20251118T080000
DTEND;TZID=America/Chicago:20251118T170000
UID:submissions.supercomputing.org_SC25_sess527_post269@linklings.com
SUMMARY:Novel Graph Alignment Algorithms for Identifying Non-Determinism i
 n Large-Scale Simulations
DESCRIPTION:Dhroov Pandey (University of North Texas)\n\nThe increasing co
 mplexity of HPC simulations poses several challenges to their reproducibil
 ity and reliability. One critical issue is the non-determinism (ND) induce
 d by asynchronous MPI communication. Locating the sources of ND in large c
 odes is difficult. This problem can be addressed by comparing event graphs
  (graphs mapping MPI communication) across multiple runs of the applicatio
 n by using tools like ANACIN-X[2] (to trace the event graphs) and network 
 alignment (to locate areas of ND). We expand ANACIN-X's point-to-point tra
 cing capabilities by adding collective communication tracing, and propose 
 a novel network alignment algorithm to effectively compare event graphs.\n
 \nTag: Research & ACM SRC Posters\n\nRegistration Category: Technical Prog
 ram Reg Pass\n\nSession Chairs: Kento Sato (RIKEN Center for Computational
  Science (R-CCS)); Chris Schlipalius (Pawsey Supercomputing Research Centr
 e; Commonwealth Scientific and Industrial Research Organisation (CSIRO), A
 ustralia); and Anja Gerbes (Georg-August-Universität Göttingen)\n\n
END:VEVENT
END:VCALENDAR