BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T000712Z
LOCATION:710
DTSTART;TZID=America/Denver:20231112T161500
DTEND;TZID=America/Denver:20231112T164000
UID:submissions.supercomputing.org_SC23_sess427_ws_scsc104@linklings.com
SUMMARY:Asynchronous Multi-Level Checkpointing: An Enabler of Reproducibil
 ity using Checkpoint History Analytics
DESCRIPTION:Kevin Assogba (Rochester Institute of Technology), Bogdan Nico
 lae (Argonne National Laboratory (ANL)), Huub Van Dam (Brookhaven National
  Laboratory), and M. Mustafa Rafique (Rochester Institute of Technology)\n
 \nHigh-performance computing applications are increasingly integrating che
 ckpointing libraries for reproducibility analytics. However, capturing an 
 entire checkpoint history for reproducibility study faces the challenges o
 f high-frequency checkpointing across thousands of processes. As a result,
  the runtime overhead affects application performance and intermediate res
 ults when interleaving is introduced during floating-point calculations. I
 n this paper, we extend asynchronous multi-level checkpoint/restart to stu
 dy the intermediate results generated from scientific workflows. We presen
 t an initial prototype of a framework that captures, caches and compares c
 heckpoint histories from different runs of a scientific application execut
 ed using identical input files. We also study the impact of our proposed a
 pproach by evaluating the reproducibility of classical molecular dynamics 
 simulations executed using the NWChem software. Experiment results show th
 at our proposed solution improves the checkpoint write bandwidth when capt
 uring checkpoints for reproducibility analysis by a minimum of 30x and up 
 to 211x compared to the default NWChem checkpointing approach.\n\nTag: Fau
 lt Handling and Tolerance\n\nRegistration Category: Workshop Reg Pass\n\nS
 ession Chairs: Gene Cooperman (Northeastern University); Donglai Dai (Adva
 nced Micro Devices (AMD)); Rebecca Hartman-Baker (National Energy Research
  Scientific Computing Center (NERSC), Lawrence Berkeley National Laborator
 y (LBNL)); and Bogdan Nicolae (Argonne National Laboratory (ANL), Illinois
  Institute of Technology)\n\n
END:VEVENT
END:VCALENDAR
